de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

The randomized complexity of maintaining the minimum

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44187

Brodal,  Gerth Stølting
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44233

Chaudhuri,  Shiva
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

Brodal, G. S., Chaudhuri, S., & Radhakrishnan, J. (1996). The randomized complexity of maintaining the minimum. In R. Karlsson, & A. Lingas (Eds.), Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory (pp. 4-15). Berlin: Springer.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-ABAD-7
Abstract
There is no abstract available