English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

The randomized complexity of maintaining the minimum

MPS-Authors
/persons/resource/persons44187

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

/persons/resource/persons44233

Chaudhuri,  Shiva
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
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: https://hdl.handle.net/11858/00-001M-0000-0014-ABAD-7
Abstract
There is no abstract available