English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  The complexity of implicit and space-efficient priority queues

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.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-27EA-8 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-27EC-4
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Mortensen, Christian W, Author
Pettie, Seth1, Author           
Dehne, Frank2, Editor
López-Ortiz, Alejandro2, Editor
Sack, Jörg-Rüdiger1, Editor           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2Max Planck Society, ou_persistent13              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2006-04-202005
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 279139
Other: Local-ID: C1256428004B93B8-54FFA69FAB44A7CCC1257133005A581B-MortensenPettie2005
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Waterloo, Canada
Start-/End Date: 2005-08-15

Legal Case

show

Project information

show

Source 1

show
hide
Title: Algorithms and data structures : 9th International Workshop, WADS 2005
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 49 - 60 Identifier: ISBN: 3-540-28101-0

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 3608 Sequence Number: - Start / End Page: - Identifier: -