Author: Michael H. Goldwasser,Catherine C. McGeoch
Publisher: Amer Mathematical Society (December 1, 2002)
Category: Computer Science
Size Fb2: 1628 kb
Size ePub: 1967 kb
Size Djvu: 1141 kb
Other formats: rtf azw txt lit
We describe a data structure for representing a set of n items from a universe of m items, which uses space n+o(n) and accommodates membership queries in constant time.
Article in ACM SIGACT News 36(4):5-8 · December 2005 with 8 Reads. How we measure 'reads'. We describe a data structure for representing a set of n items from a universe of m items, which uses space n+o(n) and accommodates membership queries in constant time. Both the data structure and the query algorithm are easy to implement.
DIMACS - Series in Discrete Mathematics and Theoretical Computer Science .
Explore Further: Topics Discussed in This Paper.
The DIMACS Implementation Challenges were initiated in 1991 to promote top-quality .
Each Challenge focuses on a particular algorithmic problem area. The third section contains papers from participants in a special "Methodology Day" that was held as part of the Fifth Challenge workshop. Foreword v. Preface vii.
These workshops, held approximately annually, aim at encouraging high-quality work in experimental analysis of data structures and algorithms. Three papers address the performance evaluation of implementations for two fundamental data structures, dictionaries and priority queues, as used in the context of real applications.
Providence, RI : American Mathematical Society, 2002. SERIES: DIMACS series in discrete mathematics and theoretical computer science ; v. 59. Call number: QA 7.
Kleppe A, Warmer J, Bast W (2003) MDA explained: the model driven architecture: practice and promise. DIMACS series in discrete mathematics and theoretical computer science, vol 59.