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
The weak-heap data structure: variants and applications
Stefan Edelkamp, Amr Ahmed Abd Elmoneim Elmasry,
Jyrki Katajainen
Department of Computer Science
9
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'The weak-heap data structure: variants and applications'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Heap
100%
Data Structures
74%
Priority Queue
59%
Buffer
24%
Decrease
18%
Form
17%
Shortest Path Algorithm
15%
Sorting algorithm
15%
Golden ratio
13%
Violate
12%
Adaptive Algorithm
12%
Margin
11%
Sorting
11%
Disorder
11%
Insertion
11%
Experimental Results
10%
Higher Order
7%
Vertex of a graph
5%
Term
5%