scientific article; zbMATH DE number 2011834

zbMATH Open1032.68953MaRDI QIDQ4437486FDOQ4437486

Jayme L. Szwarcfiter

Publication date: 2 December 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2653/26530002.htm

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Data structures (68P05) Searching and sorting (68P10)

Cited In (7)

• Title not available (Why is that?)
• Optimal binary search trees
• Optimal Search Trees with 2-Way Comparisons
• Cost-error relationships in A* tree-searching
• The node visit cost of brother trees
• On the Matter of Dynamic Optimality in an Extended Model for Tree Access Operations
• The cost of offline binary search tree algorithms and the complexity of the request sequence

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4437486)