Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Richard
    Last name: Pollack
    DBLP: 39/3009
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 25 of 57  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Saugata Basu, Richard Pollack, Marie-Françoise Roy.
    An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions.
    Combinatorica 2009, Volume 29 (0) 2009
    Conference paper
    Jacob E. Goodman, Richard Pollack.
    The combinatorial encoding of disjoint convex sets in the plane.
    Combinatorica 2008, Volume 28 (0) 2008
    Conference paper
    Jacob E. Goodman, János Pach, Richard Pollack.
    Foreword.
    Discrete Computational Geometry 2008, Volume 39 (0) 2008
    Conference paper
    Saugata Basu, Richard Pollack, Marie-Françoise Roy.
    Computing the First Betti Number of a Semi-Algebraic Set.
    Foundations of Computational Mathematics 2008, Volume 8 (0) 2008
    Conference paper
    Raghavan Dhandapani, Jacob E. Goodman, Andreas Holmsen, Richard Pollack, Shakhar Smorodinsky.
    Convexity in Topological Affine Planes.
    Discrete Computational Geometry 2007, Volume 38 (0) 2007
    Conference paper
    Saugata Basu, Richard Pollack, Marie-Françoise Roy.
    Computing the First Betti Numberand Describing the Connected Components of Semi-algebraic Sets
    CoRR 2006, Volume 0 (0) 2006
    Conference paper
    Saugata Basu, Richard Pollack, Marie-Françoise Roy.
    An asymptotically tight bound on the number of connected components of realizable sign conditions
    CoRR 2006, Volume 0 (0) 2006
    Conference paper
    Saugata Basu, Richard Pollack, Marie-Françoise Roy.
    Computing the first Betti number and the connected components of semi-algebraic sets.
    Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005 2005 (0) 2005
    Conference paper
    Saugata Basu, Richard Pollack, Marie-Françoise Roy.
    Computing the euler-poincaré characteristics of sign conditions.
    Computational Complexity 2005, Volume 14 (0) 2005
    Conference paper
    Jacob E. Goodman, Richard Pollack.
    Editorial Note.
    Discrete Computational Geometry 2005, Volume 33 (0) 2005
    Conference paper
    Saugata Basu, Raghavan Dhandapani, Richard Pollack.
    On the Realizable Weaving Patterns of Polynomial Curves in R
    Graph Drawing, 12th International Symposium, GD 2004, New York, NY, USA, September 29 - October 2, 2004, Revised Selected Papers 2004 (0) 2004
    Conference paper
    Boris Aronov, Jacob E. Goodman, Richard Pollack.
    A Helly-type theorem for higher-dimensional transversals.
    Comput. Geom. 2002, Volume 21 (0) 2002
    Conference paper
    Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger.
    A Helly-Type Theorem for Hyperplane Transversals to Well-Separated Convex Sets.
    Discrete Computational Geometry 2001, Volume 25 (0) 2001
    Conference paper
    Pankaj K. Agarwal, Dan Halperin, Richard Pollack.
    Guest Editors' Foreword.
    Discrete Computational Geometry 2001, Volume 25 (0) 2001
    Conference paper
    Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger.
    A Helly-type theorem for hyperplane transversals to well-separated convex sets.
    Symposium on Computational Geometry 2000 (0) 2000
    Conference paper
    Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger.
    On the Helly Number for Hyperplane Transversals to Unit Balls.
    Discrete Computational Geometry 2000, Volume 24 (0) 2000
    Conference paper
    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 (0) 1998
    Conference paper
    Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir.
    Quasi-Planar Graphs Have a Linear Number of Edges.
    Combinatorica 1997, Volume 17 (0) 1997
    Conference paper
    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. Complexity 1997, Volume 13 (0) 1997
    Conference paper
    Saugata Basu, Richard Pollack, Marie-Françoise Roy.
    Computing Roadmaps of Semi-Algebraic Sets (Extended Abstract).
    STOC 1996 (0) 1996
    Conference paper
    Saugata Basu, Richard Pollack, Marie-Françoise Roy.
    On the Combinatorial and Algebraic Complexity of Quantifier Elimination.
    J. ACM 1996, Volume 43 (0) 1996
    Conference paper
    Jacob E. Goodman, Richard Pollack, Rephael Wenger.
    Bounding the Number of Geometric Permutations Induced byk-Transversals.
    J. Comb. Theory, Ser. A 1996, Volume 75 (0) 1996
    Conference paper
    Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir.
    Quasi-Planar Graphs Have a Linear Number of Edges.
    Graph Drawing, Symposium on Graph Drawing, GD '95, Passau, Germany, September 20-22, 1995, Proceedings 1996 (0) 1995
    Conference paper
    Jacob E. Goodman, Richard Pollack, Rephael Wenger.
    On the Connected Components of the Space of Line Transersals t a Family of Convex Sets.
    Discrete Computational Geometry 1995, Volume 13 (0) 1995
    Conference paper
    Jacob E. Goodman, Richard Pollack, Rephael Wenger.
    Bounding the Number of Geometric Permutations Induced by
    Symposium on Computational Geometry 1994 (0) 1994
    Show item 1 to 25 of 57  

    Your query returned 57 matches in the database.