Skip to main navigation
Skip to search
Skip to main content
Tel Aviv University Home
Update Request & User Guide (TAU staff only)
Home
Experts
Research units
Research output
Datasets
Prizes
Activities
Press/Media
Search by expertise, name or affiliation
Almost tight upper bounds for lower envelopes in higher dimensions
M. Sharir
*
*
Corresponding author for this work
School of Computer Science
New York University
Research output
:
Contribution to journal
›
Article
›
peer-review
116
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Almost tight upper bounds for lower envelopes in higher dimensions'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
High Dimension
100%
Lower Envelope
100%
Surface Patch
100%
Tight Upper Bound
100%
Constant Degree
66%
Tuple
33%
Expected Running Time
33%
Randomized Algorithms
33%
DSPACE
33%
Combinatorial Complexity
33%
Algebraic Surfaces
33%
Davenport-Schinzel Sequence
33%
Maximum Length
33%
Mathematics
Upper Bound
100%
Higher Dimensions
100%
Surface Patch
100%
Running Time
33%
Three-Dimension
33%
Algebraic Surface
33%
Davenport-Schinzel Sequence
33%
Computer Science
Randomized Algorithm
100%
Proportionality
100%