International Conference on Foundations of Software Technology and Theoretical Computer Science

FSTTCS 1996: Foundations of Software Technology and Theoretical Computer Science pp 37-42

Tables

  • J. Ian Munro
Invited Papers

DOI: 10.1007/3-540-62034-6_35

Volume 1180 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Munro J.I. (1996) Tables. In: Chandru V., Vinay V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1996. Lecture Notes in Computer Science, vol 1180. Springer, Berlin, Heidelberg

Abstract

In representing a subset of a large finite set, or an index for text search, one is faced with the need for both time and space efficiency. In this paper, we look at some approaches that have been applied to these problems to represent objects in near minimum space and still permit queries to be performed in constant time. It is hoped that this paper will draw attention to techniques for representing large (mostly static) structures.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1996

Authors and Affiliations

  • J. Ian Munro
    • 1
  1. 1.Department of Computer ScienceUniversity of WaterlooWaterlooCanada