Small-bias probability spaces: efficient constructions and applications
SIAM Journal on Computing
Software reliability via run-time result-checking
Journal of the ACM (JACM)
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Stack and Queue Integrity on Hostile Platforms
IEEE Transactions on Software Engineering
Models and issues in data stream systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Introduction to Algorithms
Certification of Computational Results
IEEE Transactions on Computers
Certifying algorithms for recognizing interval graphs and permutation graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Data Structures and Algorithms in Java
Data Structures and Algorithms in Java
Checking the Integrity of Trees
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
On-Line Error Monitoring for Several Data Structures
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
| Hi-index | 0.00 |
Checking value-sensitive data structures in sublinear space has been an open problem for over a decade. In this paper, we suggest a novel approach to solving it. We show that, in combination with other techniques, a previous method for checking value-insensitive data structures in log space can be extended for checking the more complicated value-sensitive data structures, using log space as well. We present the theoretical model of checking data structures and discuss the types of invasions a checker might bring to the data structure server. We also provide our idea of designing sublinear space checkers for value-sensitive data structures and give a concrete example - a log space checker for the search data structures (SDS).