The randomized complexity of maintaining the minimum

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1097, Issue , 1996, Pages 4-15

  Brodal, Gerth Stølting ^a   Chaudhuri, Shiva ^b   Radhakrishnan, Jaikumar ^c  

^a AARHUS UNIVERSITY   (Denmark)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^c TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

COMPARISON MODELING; DETERMINISTIC ALGORITHMS; EXPECTED COSTS; RANDOMIZED ALGORITHMS;

ARTIFICIAL INTELLIGENCE;

EID: 84947912648     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61422-2_116     Document Type: Conference Paper

References (9)

1. Mikhall J. Atallah and S. Rao Kosaraju. An adversary-based lower bound for sorting. Information Processing Letters, 13:55-57, 1981.
2. Gerth Str Brodal. Fast meldable priority queues. In Proc. 4th Workshop on Algorithms and Data Structures (WADS), volume 955 of Lecture Notes in Computer Science, pages 282-290. Springer Verlag, Berlin, 1995.
3. Svante Carlsson, Patricio V. Poblete, and J. Inn Munro. An implicit binomial queue with constant insertion time. In Proc. 1st Scandinavian Workshop on Algorithm Theory (SWAT), volume 318 of Lecture Notes in Computer Science, pages: 1-13. Springer Verlag, Berlin, 1988.
4. James R. Driscoll, Harold N. Gabow, Ruth Shrairman, and Robert E. Tarjan. Relaxed heaps: An alternative to fibonacci heaps with applications to parallel computation. Communications of the ACM, 31(11):1343-1354, 1988
5. Rudoff Fleiscber. A simple balanced search tree with O(1) worst-case update time. In Algorithms and Computation: 4th International Symposium, ISAAC '93, volume 762 of Lecture Notes in Computer Science, pages 138-146. Springer Verlag, Berlin, 1993.
6. G. H. Hardy, J. E. Littlewood, and G. Polya. Inequalities. Cambridge University Press, Cambridge, 1952.
7. Christos Levcopoulos and Mark H. Overmars. A balanced search tree with O(1) worst-case update time. ACTA Informatica, 26:269-277, 1988.
8. J. W. J. Williams. Algorithm 232: Heapsort. Communications of the ACM, 7(6):347-348, 1964.
9. A. C-C. Yao. Probabilistic computations: Towards a unified measure of complexity. In Proc. of the 17th Symp. on Found. of Comp. Sci., 222-227, 1977.