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
Mathematics
Heap
100%
Ordered Set
80%
Query
72%
Sorting
13%
Data Structures
12%
Probe
9%
Nearest Neighbor
8%
Equivalence
8%
Partitioning
8%
Cell
6%
Priority Queue
5%
Lower bound
5%
Speedup
4%
Approximation
4%
Optimality
3%
Integer
2%
Model
1%