Author:
Krebs Andreas,Limaye Nutan,Srinivasan Srikanth
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Alon, N., Krivelevich, M., Newman, I., Szegedy, M.: Regular languages are testable with a constant number of queries. SIAM Journal on Computing, 645–655 (1999)
2. Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, STOC 1996, pp. 20–29. ACM, New York (1996), http://doi.acm.org/10.1145/237814.237823
3. Babu, A., Limaye, N., Radhakrishnan, J., Varma, G.: Streaming algorithms for language recognition problems. Tech. Rep. arXiv:1104.0848, Arxiv (2011)
4. Lecture Notes in Computer Science;A. Babu,2010
5. Barrington, D.A.M., Corbett, J.: On the relative complexity of some languages in NC 1. Information Processing Letters 32(5), 251 (1989)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献