Input-driven languages are in log n depth
Information Processing Letters
Some subclasses of context-free languages in NC1
Information Processing Letters
ACM Computing Surveys (CSUR)
The space complexity of approximating the frequency moments
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Introduction to Circuit Complexity: A Uniform Approach
Introduction to Circuit Complexity: A Uniform Approach
Data streams: algorithms and applications
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Pebbling Moutain Ranges and its Application of DCFL-Recognition
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Input-Driven Languages are Recognized in log n Space
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
On the Complexities of Linear LL(1) and LR(1) Grammars
FCT '93 Proceedings of the 9th International Symposium on Fundamentals of Computation Theory
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Adding nesting structure to words
Journal of the ACM (JACM)
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Recognizing well-parenthesized expressions in the streaming model
Proceedings of the forty-second ACM symposium on Theory of computing
Streaming algorithms for recognizing nearly well-parenthesized expressions
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Streaming algorithms for language recognition problems
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded If the input data is massive, the conventional deterministic log-space algorithms may not run efficiently We study the complexity of the problems when the number of passes is bounded. The first problem we consider is the membership testing problem for deterministic linear languages, DLIN Extending the recent work of Magniez et al.[11](to appear in STOC 2010), we study the use of fingerprinting technique for this problem We give the following streaming algorithms for the membership testing of DLIN s: a randomized one pass algorithm that uses O(logn) space (one-sided error, inverse polynomial error probability), and also a p-pass O(n/p)-space deterministic algorithm We also prove that there exists a language in DLIN, for which any p-pass deterministic algorithm for membership testing, requires Ω(n/p) space We also study the application of fingerprinting technique to visibly pushdown languages, VPL s. The other problem we consider is, given a degree sequence and a graph, checking whether the graph has the given degree sequence, Deg-Seq We prove that, any p-pass deterministic algorithm that takes as its input a degree sequence, followed by an adjacency list of a graph, requires Ω(n/p) space to decide Deg-Seq However, using randomness, for a more general input format: degree sequence, followed by a list of edges in any arbitrary order, Deg-Seq can be decided in O(logn) space We also give a p-pass, O(n/p)-space deterministic algorithm for Deg-Seq.