Home News About Us Contact Contributors Disclaimer Privacy Policy Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Institute: MPI für Informatik     Collection: Algorithms and Complexity Group     Display Documents



ID: 279139.0, MPI für Informatik / Algorithms and Complexity Group
The complexity of implicit and space-efficient priority queues
Authors:Mortensen, Christian W; Pettie, Seth
Editors:Dehne, Frank; López-Ortiz, Alejandro; Sack, Jörg-Rüdiger
Language:English
Publisher:Springer
Place of Publication:Berlin, Germany
Date of Publication (YYYY-MM-DD):2005
Title of Proceedings:Algorithms and data structures : 9th International Workshop, WADS 2005
Start Page:49
End Page:60
Title of Series:Lecture Notes in Computer Science
Place of Conference/Meeting:Waterloo, Canada
(Start) Date of Conference/Meeting
 (YYYY-MM-DD):
2005-08-15
Audience:Experts Only
Intended Educational Use:No
Last Change of the Resource (YYYY-MM-DD):2006-04-20
External Publication Status:published
Document Type:Conference-Paper
Communicated by:Kurt Mehlhorn
Affiliations:MPI für Informatik/Algorithms and Complexity Group
Identifiers:LOCALID:C1256428004B93B8-54FFA69FAB44A7CCC1257133005A581B-...
ISBN:3-540-28101-0
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.