Hsien-Kuei Hwang  Home/Search
Context
Related
| sinica.edu.tw/counter.asp?pape...hj.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: sinica.edu.tw/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Two algorithms for inserting a random element into a random heap are shown to be optimal (in the sense that they use the least number of comparisons on the average among all comparison-based algorithms) for di#erent values of n under a uniform model. Key words. Heaps, Hu#man coding scheme, expectedly optimal algorithms. The author is with the Institute of Statistical Science, Academia Sinica, 11529 Taipei, Taiwan. e-mail address: hkhwang@stat.sinica.edu.tw. 1 (Update)
Similar documents (at the sentence level):
51.3%: Optimal Algorithms for Inserting a Random Element Into a Random Heap - Hwang (1996) (Correct)
Active bibliography (related documents): More All
0.4: Existence of Optimal Prefix Codes for Infinite Source Alphabets - Linder, al. (Correct)
0.3: Efficient Maintenance of Materialized Top-k Views - Yi, Yu, Yang, Xia, Chen (2003) (Correct)
0.3: An Asymptotically Optimal Multiversion B-Tree - Widmayer, Becker, al. (Correct)
Similar documents based on text: More All
0.5: On the Number of Heaps and the Cost of Heap Construction - Hwang, Steyaert (2001) (Correct)
0.3: Presorting Algorithms: An Average-Case Point of View - Hwang, Yang, Yeh (Correct)
0.3: Presorting Algorithms: - An Average-Case Point (Correct)
BibTeX entry: (Update)
@article{ hwang97optimal,
author = "Hwang",
title = "Optimal Algorithms for Inserting a Random Element into a Random Heap",
journal = "IEEETIT: IEEE Transactions on Information Theory",
volume = "43",
year = "1997",
url = "citeseer.ist.psu.edu/hwang96optimal.html" }
Citations (may not include all citations):2003 The Art of Computer Programming (context) - Knuth - 1973
1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
130 Evolution of random search trees (context) - Mahmoud - 1992
43 Optimal source codes for geometrically distributed alphabets (context) - Gallager, van Voorhis - 1975
27 III: Sorting and Searching (context) - Knuth, of et al. - 1973
21 Interscience Publisher (context) - Ash, Theory - 1965
19 Generating a canonical prefix encoding (context) - Schwartz, Kallick - 1964
13 Algorithm 232: Heapsort (context) - Williams
6 Random insertion into a priority queue structure (context) - Porter, Simon - 1975
5 Optimal source coding for a class of integer alphabets (context) - Humblet - 1978
5 Inserting a new element into a heap (context) - Doberkat - 1981
5 Heaps on heaps (context) - Gonnet, Munro - 1986
4 the redundancy of optimal binary prefix-condition codes for .. (context) - Montgomery, Abrahams - 1987
3 Handbook of Theoretical Computer Science (context) - Mehlhorn, Tsakalidis et al. - 1990
2 Dynamic partial orders and generalized heaps (context) - Noltemeier - 1990
1 Hu#man coding with an infinite alphabet (context) - Kato, Han et al. - 1996
1 Hu#man-type codes for infinite source distributions (context) - Abrahams - 1994
1 Fixed prefix encoding of the integers can be Hu#man-optimal (context) - Gutman - 1990
1 Hu#man coding in bit-vector compression (context) - Jakobsson - 1978
Documents on the same site (http://algo.stat.sinica.edu.tw/): More
Asymptotic Behaviour of Some Infinite Products Involving Prime.. - Hwang (1996) (Correct)
A Constant Arising From the Analysis of Algorithms for Determining .. - Hwang (1996) (Correct)
On the Number of Heaps and the Cost of Heap Construction - Hwang, Steyaert (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC