Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRicky Pollack
Person information
- affiliation: New York University, Courant Institute of Mathematical Sciences, NY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j40]Jacob E. Goodman, Ricky Pollack:
Valedictory Editorial. Discret. Comput. Geom. 44(4): 725-726 (2010)
2000 – 2009
- 2009
- [j39]Saugata Basu, Richard Pollack, Marie-Françoise Roy:
An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions. Comb. 29(5): 523-546 (2009) - 2008
- [j38]Jacob E. Goodman, Richard Pollack:
The combinatorial encoding of disjoint convex sets in the plane. Comb. 28(1): 69-81 (2008) - [j37]Jacob E. Goodman, János Pach, Richard Pollack:
Foreword. Discret. Comput. Geom. 39(1-3): 1-2 (2008) - [j36]Ricky Pollack:
Allowable double-permutation sequences and double pseudoline arrangements. Electron. Notes Discret. Math. 31: 167-168 (2008) - [j35]Saugata Basu, Richard Pollack, Marie-Françoise Roy:
Computing the First Betti Number of a Semi-Algebraic Set. Found. Comput. Math. 8(1): 97-136 (2008) - 2007
- [j34]Raghavan Dhandapani, Jacob E. Goodman, Andreas F. Holmsen, Richard Pollack, Shakhar Smorodinsky
:
Convexity in Topological Affine Planes. Discret. Comput. Geom. 38(2): 243-257 (2007) - 2006
- [i2]Saugata Basu, Richard Pollack, Marie-Françoise Roy:
Computing the First Betti Numberand Describing the Connected Components of Semi-algebraic Sets. CoRR abs/math/0603248 (2006) - [i1]Saugata Basu, Richard Pollack, Marie-Françoise Roy:
An asymptotically tight bound on the number of connected components of realizable sign conditions. CoRR abs/math/0603256 (2006) - 2005
- [j33]Saugata Basu, Richard Pollack, Marie-Françoise Roy:
Computing the euler-poincaré characteristics of sign conditions. Comput. Complex. 14(1): 53-71 (2005) - [j32]Jacob E. Goodman, Richard Pollack:
Editorial Note. Discret. Comput. Geom. 33(1): 1 (2005) - [c21]Saugata Basu, Richard Pollack, Marie-Françoise Roy:
Computing the first Betti number and the connected components of semi-algebraic sets. STOC 2005: 304-312 - 2004
- [c20]Saugata Basu, Raghavan Dhandapani, Richard Pollack:
On the Realizable Weaving Patterns of Polynomial Curves in R3. GD 2004: 36-42 - 2002
- [j31]Boris Aronov, Jacob E. Goodman, Richard Pollack:
A Helly-type theorem for higher-dimensional transversals. Comput. Geom. 21(3): 177-183 (2002) - 2001
- [j30]Pankaj K. Agarwal, Dan Halperin, Richard Pollack:
Guest Editors' Foreword. Discret. Comput. Geom. 25(4): 505-506 (2001) - [j29]Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger:
A Helly-Type Theorem for Hyperplane Transversals to Well-Separated Convex Sets. Discret. Comput. Geom. 25(4): 507-517 (2001) - 2000
- [j28]Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger:
On the Helly Number for Hyperplane Transversals to Unit Balls. Discret. Comput. Geom. 24(2-3): 171-176 (2000) - [c19]Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger:
A Helly-type theorem for hyperplane transversals to well-separated convex sets. SCG 2000: 57-63
1990 – 1999
- 1998
- [c18]Saugata Basu, Richard Pollack, Marie-Françoise Roy:
Complexity of Computing Semi-Algebraic Descriptions of the Connected Components of a Semi-Algebraic Set. ISSAC 1998: 25-29 - 1997
- [j27]Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir:
Quasi-Planar Graphs Have a Linear Number of Edges. Comb. 17(1): 1-9 (1997) - [j26]Saugata Basu, Richard Pollack, Marie-Françoise Roy:
On Computing a Set of Points Meeting Every Cell Defined by a Family of Polynomials on a Variety. J. Complex. 13(1): 28-37 (1997) - 1996
- [j25]Saugata Basu, Richard Pollack, Marie-Françoise Roy:
On the Combinatorial and Algebraic Complexity of Quantifier Elimination. J. ACM 43(6): 1002-1045 (1996) - [j24]Jacob E. Goodman, Richard Pollack, Rephael Wenger:
Bounding the Number of Geometric Permutations Induced byk-Transversals. J. Comb. Theory, Ser. A 75(2): 187-197 (1996) - [c17]Saugata Basu, Richard Pollack, Marie-Françoise Roy:
Computing Roadmaps of Semi-Algebraic Sets (Extended Abstract). STOC 1996: 168-173 - 1995
- [j23]Jacob E. Goodman, Richard Pollack, Rephael Wenger:
On the Connected Components of the Space of Line Transersals t a Family of Convex Sets. Discret. Comput. Geom. 13: 469-476 (1995) - [c16]Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir:
Quasi-Planar Graphs Have a Linear Number of Edges. GD 1995: 1-7 - 1994
- [j22]Jacob E. Goodman, Richard Pollack, Rephael Wenger, Tudor Zamfirescu:
Every Arrangement Extends to a Spread. Comb. 14(3): 301-306 (1994) - [c15]Jacob E. Goodman, Richard Pollack, Rephael Wenger:
Bounding the Number of Geometric Permutations Induced by k-Transversals. SCG 1994: 192-197 - [c14]Saugata Basu, Richard Pollack, Marie-Françoise Roy:
On the Combinatorial and Algebraic Complexity of Quantifier Elimination. FOCS 1994: 632-641 - 1993
- [j21]János Pach, Richard Pollack, Emo Welzl:
Weaving Patterns of Lines and Line Segments in Space. Algorithmica 9(6): 561-571 (1993) - 1992
- [j20]Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir:
Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms. Theor. Comput. Sci. 92(2): 319-336 (1992) - [c13]Jacob E. Goodman, Richard Pollack, Rephael Wenger, Tudor Zamfirescu:
There is a Universal Topological Plane. SCG 1992: 171-176 - 1991
- [j19]Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink:
Counting and Cutting Cycles of Lines and Rods in Space. Comput. Geom. 1: 305-323 (1991) - [j18]Jacob E. Goodman, Richard Pollack:
The complexity of point configurations. Discret. Appl. Math. 31(2): 167-180 (1991) - [e1]Jacob E. Goodman, Richard Pollack, William Steiger:
Discrete and Computational Geometry: Papers from the DIMACS Special Year. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 6, DIMACS/AMS 1991, ISBN 978-0-8218-6595-8 [contents] - 1990
- [j17]Hubert de Fraysseix, János Pach, Richard Pollack:
How to draw a planar graph on a grid. Comb. 10(1): 41-51 (1990) - [j16]Richard Pollack, Rephael Wenger:
Necessary and sufficient conditions for hyperplane transversals. Comb. 10(3): 307-311 (1990) - [c12]Sylvain E. Cappell, Jacob E. Goodman, János Pach, Richard Pollack, Micha Sharir, Rephael Wenger:
The Combinatorial Complexity of Hyperplane Transversals. SCG 1990: 83-91 - [c11]Imre Bárány, Jacob E. Goodman, Richard Pollack:
Do Projections Go to Infinity? Applied Geometry And Discrete Mathematics 1990: 51-62 - [c10]Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink:
Counting and Cutting Cycles of Lines and Rods in Space. FOCS 1990: 242-251 - [c9]János Pach, Richard Pollack, Emo Welzl:
Weaving Patterns of Lines and Segments in Space. SIGAL International Symposium on Algorithms 1990: 439-446
1980 – 1989
- 1989
- [j15]Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink:
On Arrangement of Jordan Arcs with Three Intersection per Pair. Discret. Comput. Geom. 4: 523-539 (1989) - [j14]Richard Pollack, Micha Sharir, Günter Rote:
Computing the Geodesic Center of a Simple Polygon. Discret. Comput. Geom. 4: 611-626 (1989) - [j13]Paul Erdös, János Pach, Richard Pollack, Zsolt Tuza:
Radius, diameter, and minimum degree. J. Comb. Theory, Ser. B 47(1): 73-79 (1989) - [c8]Richard Pollack, Rephael Wenger:
Necessary and Sufficient Conditions for Hyperplane Transversals. SCG 1989: 152-155 - [c7]Jacob E. Goodman, Richard Pollack, Bernd Sturmfels:
Coordinate Representation of Order Types Requires Exponential Storage. STOC 1989: 405-410 - 1988
- [j12]Ricky Pollack, Micha Sharir, Shmuel Sifrony:
Separating Two Simple Polygons by a Sequence of Translations. Discret. Comput. Geom. 3: 123-136 (1988) - [j11]William J. Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap:
Computing the Link Center of a Simple Polygon. Discret. Comput. Geom. 3: 281-293 (1988) - [c6]Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink:
On Arrangements of Jordan Arcs with Three Intersections per Pair. SCG 1988: 258-265 - [c5]Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir:
Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms. ICALP 1988: 214-229 - [c4]Hubert de Fraysseix, János Pach, Richard Pollack:
Small Sets Supporting Fáry Embeddings of Planar Graphs. STOC 1988: 426-433 - 1987
- [c3]William J. Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap:
Computing the Link Center of a Simple Polygon. SCG 1987: 1-10 - 1986
- [j10]Jacob E. Goodman, Richard Pollack:
Upper Bounds for Configurations and Polytopes in Rd. Discret. Comput. Geom. 1: 219-227 (1986) - [j9]Jacob E. Goodman, Richard Pollack:
Preface. Discret. Math. 60: 1 (1986) - [c2]Micha Sharir, Richard Cole, Klara Kedem, Daniel Leven, Richard Pollack, Shmuel Sifrony:
Geometric Applications of Davenport-Schinzel Sequences. FOCS 1986: 77-86 - 1985
- [j8]Richard Pollack:
Increasing the Minimum Distance of a Set of Points. J. Comb. Theory, Ser. A 40(2): 450 (1985) - [c1]Jacob E. Goodman, Richard Pollack:
Modeling planar configurations. SCG 1985: 121-124 - 1984
- [j7]Jacob E. Goodman, Richard Pollack:
On the Number of k-Subsets of a Set of n Points in the Plane. J. Comb. Theory, Ser. A 36(1): 101-104 (1984) - [j6]Jacob E. Goodman, Richard Pollack:
Semispaces of Configurations, Cell Complexes of Arrangements. J. Comb. Theory, Ser. A 37(3): 257-293 (1984) - 1983
- [j5]Jacob E. Goodman, Richard Pollack:
Multidimensional Sorting. SIAM J. Comput. 12(3): 484-507 (1983) - 1982
- [j4]Jacob E. Goodman, Richard Pollack:
Helly-Type Theorems for Pseudoline Arrangements in P2. J. Comb. Theory, Ser. A 32(1): 1-19 (1982) - 1981
- [j3]Jacob E. Goodman, Richard Pollack:
Three Points Do Not Determine a (Pseudo-) Plane. J. Comb. Theory, Ser. A 31(2): 215-218 (1981) - 1980
- [j2]Jacob E. Goodman, Richard Pollack:
On the Combinatorial Classification of Nondegenerate Configurations in the Plane. J. Comb. Theory, Ser. A 29(2): 220-235 (1980) - [j1]Jacob E. Goodman, Richard Pollack:
Proof of Grünbaum's Conjecture on the Stretchability of Certain Arrangements of Pseudolines. J. Comb. Theory, Ser. A 29(3): 385-390 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-09-27 22:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
