L. J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proceedings of the Nineteenth Annual Symposium on Foundations of Computer Science, pages 8--21, 1978.

Digital Library

Google Scholar

[6]

P. L. Karlton, S. H. Fuller, R. E. Scroggs, and E. B. Kaehler. Performance of height-balanced trees. Communications of the ACM, 19(1):23--28, 1976.

Digital Library

Google Scholar

[7]

D. E. Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming, section 6.2.2, pages 430--31. Addison-Wesley, Reading, Massachusetts, second edition, 1997.

Digital Library

Google Scholar

[8]

J. Postel. RFC 791: Internet Protocol, Sept. 1981. Status: STANDARD.

Google Scholar

[9]

D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32(3):652--686, July 1985.

Digital Library

Google Scholar

[10]

W. E. Wright. An empirical evaluation of algorithms for dynamically maintaining binary search trees. In Proceedings of the ACM 1980 annual conference, pages 505--515, 1980.

Digital Library

Google Scholar

Cited By

View all

Štrbac-Savić STomašević MMaček NMinchev Z(2022)Comparative performance evaluation of suboptimal binary search treesJournal of Computer and Forensic Sciences10.5937/1-427091:1(29-45)Online publication date: 2022
https://doi.org/10.5937/1-42709
Horzyk ABulanda DStarzyk J(2020)ASA-graphs for efficient data representation and processingInternational Journal of Applied Mathematics and Computer Science10.34768/amcs-2020-005330:4(717-731)Online publication date: 1-Dec-2020
https://dl.acm.org/doi/10.34768/amcs-2020-0053
Zuepke AKaiser R(2019)Deterministic Futexes: Addressing WCET and Bounded Interference Concerns2019 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS)10.1109/RTAS.2019.00014(65-76)Online publication date: Apr-2019
https://doi.org/10.1109/RTAS.2019.00014
Show More Cited By

Index Terms

Performance analysis of BSTs in system software

Recommendations

Performance analysis of BSTs in system software
SIGMETRICS '04/Performance '04: Proceedings of the joint international conference on Measurement and modeling of computer systems
The suffix binary search tree and suffix AVL tree

Suffix trees and suffix arrays are classical data structures that are used to represent the set of suffixes of a given string, and thereby facilitate the efficient solution of various string processing problems--in particular on-line string searching. ...
Revisiting priority queues for image analysis

Many algorithms in image analysis require a priority queue, a data structure that holds pointers to pixels in the image, and which allows efficiently finding the pixel in the queue with the highest priority. However, very few articles describing such ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGMETRICS Performance Evaluation Review

ACM SIGMETRICS Performance Evaluation Review Volume 32, Issue 1

June 2004

432 pages

ISSN:0163-5999

DOI:10.1145/1012888

Issue’s Table of Contents

SIGMETRICS '04/Performance '04: Proceedings of the joint international conference on Measurement and modeling of computer systems
June 2004
450 pages
ISBN:1581138733
DOI:10.1145/1005686
General Chair:
E. G. Coffman
Columbia University
,
Program Chairs:
Zhen Liu
IBM Research
,
Arif Merchant
HP Labs

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 2004

Published in SIGMETRICS Volume 32, Issue 1

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

23
Total Citations
View Citations
886
Total Downloads

Downloads (Last 12 months)26
Downloads (Last 6 weeks)3

Reflects downloads up to 07 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Štrbac-Savić STomašević MMaček NMinchev Z(2022)Comparative performance evaluation of suboptimal binary search treesJournal of Computer and Forensic Sciences10.5937/1-427091:1(29-45)Online publication date: 2022
https://doi.org/10.5937/1-42709
Horzyk ABulanda DStarzyk J(2020)ASA-graphs for efficient data representation and processingInternational Journal of Applied Mathematics and Computer Science10.34768/amcs-2020-005330:4(717-731)Online publication date: 1-Dec-2020
https://dl.acm.org/doi/10.34768/amcs-2020-0053
Zuepke AKaiser R(2019)Deterministic Futexes: Addressing WCET and Bounded Interference Concerns2019 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS)10.1109/RTAS.2019.00014(65-76)Online publication date: Apr-2019
https://doi.org/10.1109/RTAS.2019.00014
Erkan ABarr JClear TIzu Cdel Alamo CMohammed HNadimpalli MSheard JKorhonen A(2018)Developing a Holistic Understanding of Systems and Algorithms through Research PapersProceedings of the 2017 ITiCSE Conference on Working Group Reports10.1145/3174781.3174786(86-104)Online publication date: 30-Jan-2018
https://dl.acm.org/doi/10.1145/3174781.3174786
Fray KMorgan KWirth AZobel J(2017)Practical adaptive search trees with performance boundsProceedings of the Australasian Computer Science Week Multiconference10.1145/3014812.3014836(1-8)Online publication date: 30-Jan-2017
https://dl.acm.org/doi/10.1145/3014812.3014836
Thabit KAldaini HAl-Anesi I(2017)From imagining to the making of a novel and fast search methodology: Thabit's algorithm2017 Learning and Technology Conference (L&T) - The MakerSpace: from Imagining to Making!10.1109/LT.2017.8088122(23-30)Online publication date: Feb-2017
https://doi.org/10.1109/LT.2017.8088122
Finta IFarkas LSzénási SSergyán S(2017)Interval Merging Binary TreeAlgorithms and Architectures for Parallel Processing10.1007/978-3-319-65482-9_32(452-464)Online publication date: 11-Aug-2017
https://doi.org/10.1007/978-3-319-65482-9_32
Scrimieri DAfazov SRatchev S(2015)An in-core grid index for transferring finite element data across dissimilar meshesAdvances in Engineering Software10.1016/j.advengsoft.2015.06.00188:C(53-62)Online publication date: 1-Oct-2015
https://dl.acm.org/doi/10.1016/j.advengsoft.2015.06.001
Aceto GBotta APescape AWestphal C(2013)Efficient Storage and Processing of High-Volume Network Monitoring DataIEEE Transactions on Network and Service Management10.1109/TNSM.2013.011713.11021510:2(162-175)Online publication date: Jun-2013
https://doi.org/10.1109/TNSM.2013.011713.110215
Štrbac-Savić STomašević MIvanović MBudimac Z(2012)Comparative performance evaluation of the AVL and red-black treesProceedings of the Fifth Balkan Conference in Informatics10.1145/2371316.2371320(14-19)Online publication date: 16-Sep-2012
https://dl.acm.org/doi/10.1145/2371316.2371320
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Performance analysis of BSTs in system software

The suffix binary search tree and suffix AVL tree

Revisiting priority queues for image analysis