A Nearly Memory-Optimal Data Structure for Sets and Mappings
Authors:
- 15 April 2003
- book chapter
- Published by Springer Nature
- p. 136-150
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A minimized automaton representation of reachable statesInternational Journal on Software Tools for Technology Transfer, 1999
- Runtime Efficient State Compaction in SpinLecture Notes in Computer Science, 1999
- Improved probabilistic verification by hash compaction1995
- Reliable hashing without collision detection1993
- Coverage Preserving Reduction Strategies for Reachability Analysis1992
- A Probability System1973