Work

Pairing heaps with O(log log n) decrease cost

Year: 2009

Type: article

DOI: 10.5555/1496770.1496822

Author: Amr Elmasry

Institution: Max Planck Institute for Informatics

Language: English

Topic: Algorithms and Data Compression

Subfield: Theoretical Computer Science

Field: Mathematics

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W1593562291

FWCI: 2.579

Cites: 10

Cited by: 18

Related to: 10