English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Tail Estimates for the Space Complexity of Randomised Incremental Algorithms

Mehlhorn, K., Sharir, M., & Welzl, E. (1992). Tail Estimates for the Space Complexity of Randomised Incremental Algorithms. In Discrete algorithms (SODA-92): 3rd annual ACM-SIAM symposium (pp. 89-93). Philadelphia, USA: SIAM.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Mehlhorn, Kurt1, Author           
Sharir, Micha2, Author
Welzl, Emo2, Author
Frederickson, Greg2, Editor
Graham, Ron, Editor
Hochbaum, Dorit S., Editor
Johnson, Ellis, Editor
Kosaraju, S. Rao, Editor
Luby, Michae, Editor
Megiddo, Nimrod, Editor
Schieber, Baruch, Editor
Vaidya, Pravin, Editor
Yao, Frances, 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: 2005-09-161992
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 344531
Other: Local-ID: C1256428004B93B8-BDA1F134D6477840C125707E002D7ADD-Mehlhorn92gz
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Orlando, FL, USA
Start-/End Date: 1992-01-27

Legal Case

show

Project information

show

Source 1

show
hide
Title: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Philadelphia, USA : SIAM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 89 - 93 Identifier: ISBN: 0-89871-293-9