English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

The complexity of implicit and space-efficient priority queues

MPS-Authors
/persons/resource/persons45187

Pettie,  Seth
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Dehne,  Frank
Max Planck Society;

López-Ortiz,  Alejandro
Max Planck Society;

/persons/resource/persons45331

Sack,  Jörg-Rüdiger
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Mortensen, C. W., & Pettie, S. (2005). The complexity of implicit and space-efficient priority queues. In Algorithms and data structures: 9th International Workshop, WADS 2005 (pp. 49-60). Berlin, Germany: Springer.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-27EA-8
Abstract
There is no abstract available