Showing 1–20 of 45 results
/ Date/ Name
May 31, 2011Computing all maps into a sphereJul 6, 2011Unit Distances in Three DimensionsJul 7, 2010The number of unit distances is almost linear for most normsFeb 26, 2013Near-optimal separators in string graphsJun 10, 2014Intersection graphs of segments and $\exists\mathbb{R}$Sep 4, 2013Curves in R^d intersecting every hyperplane at most d+1 timesJan 30, 2012Polynomial-time homology for simplicial Eilenberg-MacLane spacesJan 4, 2011The determinant bound for discrepancy is almost tightNov 13, 2012Polynomial-time computation of homotopy groups and Postnikov systems in fixed dimensionApr 24, 2019Deep Packet Inspection in FPGAs via Approximate Nondeterministic AutomataNov 20, 2013String graphs and separatorsJul 3, 2012Erdos-Szekeres-type statements: Ramsey function and decidability in dimension 1Jun 11, 2014Multilevel polynomial partitions and simplified range searchingApr 29, 2013Computing higher homotopy groups is W[1]-hardDec 21, 2009Distance k-Sectors ExistAug 31, 2010A geometric proof of the colored Tverberg theoremFeb 17, 2011On Gromov's Method of Selecting Heavily Covered PointsApr 1, 2011A Doubly Exponentially Crumbled CakeFeb 26, 2011Simple Proofs of Classical Theorems in Discrete Geometry via the Guth--Katz Polynomial Partitioning TechniqueDec 30, 2008Lower bounds for weak epsilon-nets and stair-convexity