ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
An optimal search tree: modified complete binary search tree
Full text PdfPdf (344 KB)
Source ACM Southeast Regional Conference archive
Proceedings of the 36th annual Southeast regional conference table of contents
Pages: 173 - 177  
Year of Publication: 1998
ISBN:1-58113-030-9
Authors
Joseph F. Malerba  Department of Computer Science, Pace University, Pleasantville, NY
Narayan Murthy  Department of Computer Science, Pace University, Pleasantville, NY
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 24,   Citation Count: 0
Additional Information:

references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/275295.275354
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Thomas T. Cormen , Charles E. Leiserson , Ronald L. Rivest, Introduction to algorithms, MIT Press, Cambridge, MA, 1990
 
2
Paul Helman , Robert Veroff, Intermediate problem solving and data structures: walls and mirrors, Benjamin-Cummings Publishing Co., Inc., Redwood City, CA, 1986
 
3
Robert L. Kruse , Clovis L. Tondo , Bruce P. Leung, Data structures and program design in C (2nd ed.), Prentice-Hall, Inc., Upper Saddle River, NJ, 1996
4
Narayan Murthy, An optimal search tree: complete binary search tree, Proceedings of the 17th conference on ACM Annual Computer Science Conference, February 21-23, 1989, Louisville, Kentucky  [doi>10.1145/75427.1030225]
 
5
Niklaus Wirth, Algorithms + Data Structures = Programs, Prentice Hall PTR, Upper Saddle River, NJ, 1978

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS
      G.2.2 Graph Theory
          Subjects: Trees

Additional Classification:
  E. Data
  E.1 DATA STRUCTURES
      Subjects: Trees

  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Computations on discrete structures


General Terms:
Algorithms, Theory

Collaborative Colleagues:
Joseph F. Malerba: colleagues
Narayan Murthy: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player