MPI-I-96-1-014

The randomized complexity of maintaining the minimum

Brodal, Gerth Stølting and Chaudhuri, Shiva and Radhakrishnan, Jaikumar

MPI-I-96-1-014. May 1996, 12 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
The complexity of maintaining a set under the operations {\sf Insert}, {\sf Delete} and {\sf FindMin} is considered. In the comparison model it is shown that any randomized algorithm with expected amortized cost $t$ comparisons per {\sf Insert} and {\sf Delete} has expected cost at least $n/(e2^{2t})-1$ comparisons for {\sf FindMin}. If {\sf FindMin} 474 is replaced by a weaker operation, {\sf FindAny}, then it is shown that a randomized algorithm with constant expected cost per operation exists, but no deterministic algorithm. Finally, a deterministic algorithm with constant amortized cost per operation for an offline version of the problem is given.
Acknowledgement:
References to related material:

To download this research report, please select the type of document that fits best your needs.	Attachement Size(s):
	140 KBytes; 212 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView

URL to this document: http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1996-1-014

BibTeX
@TECHREPORT{BrodalChaudhuriRadhakrishnan96, AUTHOR = {Brodal, Gerth Stølting and Chaudhuri, Shiva and Radhakrishnan, Jaikumar}, TITLE = {The randomized complexity of maintaining the minimum}, TYPE = {Research Report}, INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik}, ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany}, NUMBER = {MPI-I-96-1-014}, MONTH = {May}, YEAR = {1996}, ISSN = {0946-011X},}