Small-bias probability spaces: efficient constructions and applications
SIAM Journal on Computing
Designing programs that check their work
Journal of the ACM (JACM)
Communication complexity
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
The space complexity of approximating the frequency moments
Journal of Computer and System Sciences
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
An Approximate L1-Difference Algorithm for Massive Data Streams
SIAM Journal on Computing
A near-optimal algorithm for computing the entropy of a stream
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Recognizing well-parenthesized expressions in the streaming model
Proceedings of the forty-second ACM symposium on Theory of computing
| Hi-index | 0.00 |
We revisit the problem of memory checking considered by Blum et al. [3]. In this model, a checker monitors the behavior of a data structure residing in unreliable memory given an arbitrary sequence of user defined operations. The checker is permitted a small amount of separate reliable memory and must fail a data structure if it is not behaving as specified and pass it otherwise. How much additional reliable memory is required by the checker? First, we present a checker for an implementation of a priority queue. The checker uses O(√n log n) space where n is the number of operations performed. We then present a spotchecker using only O(ε-1 log δ-1 log n) space, that, with probability at least 1-δ, will fail the priority queue if it is ε-far (defined appropriately) from operating like a priority queue and pass the priority queue if it operates correctly. Finally, we then prove a range of lower bounds that complement our checkers.