Search results for "inverse Ackermann function"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Boris Bukh, Jirí Matousek, Gabriel Nivasch	Lower bounds for weak epsilon-nets and stair-convexity.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	inverse ackermann function, selection lemma, stair-convexity, weak epsilon-net
2	Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky	Weak &epsis;-nets and interval chains.	J. ACM	2008	DBLP DOI BibTeX RDF	Interval chain, inverse Ackermann function, moment curve, weak epsilon-net
1	William B. Johnson, Assaf Naor	The Johnson-Lindenstrauss lemma almost characterizes Hilbert space, but not quite.	SODA	2009	DBLP DOI BibTeX RDF
1	Gabriel Nivasch	Improved bounds and new techniques for Davenport--Schinzel sequences and their generalizations.	SODA	2009	DBLP DOI BibTeX RDF
1	Adrian Dumitrescu, Micha Sharir, Csaba D. Tóth	Extremal problems on triangle areas in two and three dimensions.	Symposium on Computational Geometry	2008	DBLP DOI BibTeX RDF	distinct triangle areas, extremal combinatorics, maximum triangle areas, minimum triangle areas, unit triangle areas, discrete geometry, point configurations
1	Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky	Weak ε-nets and interval chains.	SODA	2008	DBLP DOI BibTeX RDF
1	Seth Pettie	Splay trees, Davenport-Schinzel sequences, and the deque conjecture.	SODA	2008	DBLP DOI BibTeX RDF
1	Stephane Durocher, Christophe Paul	Kinetic Maintenance of Mobile k-Centres on Trees.	ISAAC	2007	DBLP DOI BibTeX RDF
1	Fredrik Bengtsson, Jingsen Chen	Computing Maximum-Scoring Segments in Almost Linear Time.	COCOON	2006	DBLP DOI BibTeX RDF
1	Seth Pettie	An Inverse-Ackermann Type Lower Bound For Online Minimum Spanning Tree Verification.	Combinatorica	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C38, 68W01, 68R10
1	Eduard Oks, Micha Sharir	Minkowski Sums of Monotone and General Simple Polygons.	Discrete & Computational Geometry	2006	DBLP DOI BibTeX RDF
1	Seth Pettie	Sensitivity Analysis of Minimum Spanning Trees in Sub-inverse-Ackermann Time.	ISAAC	2005	DBLP DOI BibTeX RDF
1	Boris Aronov, Vladlen Koltun, Micha Sharir	Incidences between Points and Circles in Three and Higher Dimensions.	Discrete & Computational Geometry	2005	DBLP DOI BibTeX RDF
1	Ran Mendelson, Mikkel Thorup, Uri Zwick	Meldable RAM priority queues and minimum directed spanning trees.	SODA	2004	DBLP DOI BibTeX RDF
1	Pankaj K. Agarwal, Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky	Lenses in arrangements of pseudo-circles and their applications.	J. ACM	2004	DBLP DOI BibTeX RDF	incidence problems, pseudo-circles, Arrangements
1	Vladlen Koltun	Sharp Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensions.	Discrete & Computational Geometry	2004	DBLP DOI BibTeX RDF
1	Julien Basch, Leonidas J. Guibas, G. D. Ramkumar	Reporting Red - Blue Intersections between Two Sets of Connected Line Segments.	Algorithmica	2003	DBLP DOI BibTeX RDF
1	Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky	Lenses in arrangements of pseudo-circles and their applications.	Symposium on Computational Geometry	2002	DBLP DOI BibTeX RDF	distinct distances, pseudo-circles, arrangements, lenses, incidences, levels
1	Micha Sharir, Emo Welzl	Point-line incidences in space.	Symposium on Computational Geometry	2002	DBLP DOI BibTeX RDF	lines, three dimensions, incidences, circles
1	Seth Pettie, Vijaya Ramachandran	Computing shortest paths with comparisons and additions.	SODA	2002	DBLP DOI BibTeX RDF
1	Seth Pettie	On the Comparison-Addition Complexity of All-Pairs Shortest Paths.	ISAAC	2002	DBLP DOI BibTeX RDF
1	Julien Basch, Leonidas J. Guibas, G. D. Ramkumar	Reporting Red-Blue Intersections between Two Sets of Connected Line Segments.	ESA	1996	DBLP DOI BibTeX RDF
1	Leszek Gasieniec, Kunsoo Park	Work-Time Optimal Parallel Prefix Matching (Extended Abstract).	ESA	1994	DBLP DOI BibTeX RDF
1	Dan Halperin, Chee-Keng Yap	Combinatorial Complexity of Translating a Box in Polyhedral 3-Space.	Symposium on Computational Geometry	1993	DBLP DOI BibTeX RDF
1	Tsan-sheng Hsu	On Four-Connecting a Triconnected Graph (Extended Abstract)	FOCS	1992	DBLP DOI BibTeX RDF	inverse Ackermann function, four-connecting, triconnected graph, graph-theoretic problem, reliable networks
1	Naoki Katoh, Takeshi Tokuyama, Kazuo Iwano	On Minimum and Maximum Spanning Trees of Linearly Moving Points	FOCS	1992	DBLP DOI BibTeX RDF	inverse Ackermann function, linearly moving points, real parameter, trivial upper bounds, computational geometry, spanning trees, distance metrics, straight lines
1	M. McKenna, Joseph O'Rourke	Arrangements of Lines in 3-Space: A Data Structure with Applications.	Symposium on Computational Geometry	1988	DBLP DOI BibTeX RDF