MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Jeff Erickson" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

56 documents found, showing 1 through 10. Next 10 →

ATOM

Space-Time Tradeoffs for Emptiness Queries (Extended Abstract)
by Jeff Erickson — 2000 — SIAM J. Comput
…Space-Time Tradeoffs for Emptiness Queries (Extended abstract) Jeff Erickson Center…
Add To MetaCart

Arbitrarily large neighborly families of congruent symmetric convex 3-polytopes
by Jeff Erickson — 2001 — In Honor of W. Kuperberg’s 60th Birthday (András Bezdek, editor), Marcel-Dekker, 2003
…Arbitrarily Large Neighborly Families of Congruent Symmetric Convex 3-Polytopes Je Erickson…
Cited by 1 (1 self) – Add To MetaCart

Space-Time Tradeoffs for Emptiness Queries
by Jeff Erickson — 1997
…########## ######### ### ######### ####### # JEFF ERICKSON # ######### We develop the rst…
Cited by 10 (1 self) – Add To MetaCart

New Toads and Frogs results
by Jeff Erickson — 1996 — Games of No Chance
…Games of No Chance MSRI Publications Volume 29, 1996 New Toads and Frogs Results JEFF ERICKSON…
Cited by 1 (0 self) – Add To MetaCart

Local polyhedra and geometric graphs
by Jeff Erickson — 2003 — In Proc. 14th ACM-SIAM Sympos. on Discrete Algorithms
…Local Polyhedra and Geometric Graphs # Je# Erickson + University of Illinois at Urbana…
Cited by 6 (0 self) – Add To MetaCart

New Lower Bounds for Halfspace Emptiness
by Jeff Erickson — 1996 — Proc. 37th Annu. IEEE Sympos. Found. Comput. Sci
…New Lower Bounds for Halfspace Emptiness Jeff Erickson Computer Science Division University…
Cited by 3 (2 self) – Add To MetaCart

On the Relative Complexities of Some Geometric Problems
by Jeff Erickson — 1995 — In Proc. 7th Canad. Conf. Comput. Geom
…On the Relative Complexities of Some Geometric Problems Jeff Erickson Computer Science Division…
Cited by 15 (7 self) – Add To MetaCart

New Lower Bounds for Convex Hull Problems in Odd Dimensions
by Jeff Erickson — 1996 — SIAM J. Comput
…NEW LOWER BOUNDS FOR CONVEX HULL PROBLEMS IN ODD DIMENSIONS JEFF ERICKSON y Abstract. We show…
Cited by 25 (7 self) – Add To MetaCart

Nice Point Sets Can Have Nasty Delaunay Triangulations
by Jeff Erickson — 2001 — In Proc. 17th Annu. ACM Sympos. Comput. Geom
…Nice Point Sets Can Have Nasty Delaunay Triangulations* Jeff Erickson University of Illinois…
Cited by 36 (5 self) – Add To MetaCart

Dense Point Sets Have Sparse Delaunay Triangulations or ". . . But Not Too Nasty"
by Jeff Erickson — 2002 — In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms
…Dense Point Sets Have Sparse Delaunay Triangulations or \. . . But Not Too Nasty" Je Erickson…
Cited by 19 (2 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB