Skip to main navigation
Skip to search
Skip to main content
University of Copenhagen Research Portal Home
Help & FAQ
Dansk
English
Home
Profiles
Research output
Research units
Press/Media
Activities
Prizes
???studenttheses???
Datasets
Search by expertise, name or affiliation
Dynamic ordered sets with approximate queries, approximate heaps and soft heaps
Mikkel Thorup
, Or Zamir, Uri Zwick
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Dynamic ordered sets with approximate queries, approximate heaps and soft heaps'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Approximate Query
100%
Cell-probe Lower Bounds
50%
Approximate Rank
25%
Static Partitioning
25%
RAM Algorithms
25%
Unexpected Consequences
25%
Static Problem
25%
Deterministic Bounds
25%
Partition Problem
25%
Approximate Results
25%
Mathematics
Ordered Set
100%
Computer Science
Static Partitioning
33%
Identical Operation
33%