Author:
Sairam S.,Vitter Jeffrey Scott,Tamassia Roberto
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. D. Barrington, “Bounded Width Polynomial Size Programs Recognize Exactly Those Languages in NC 1,” Proc. 18th Symposium on Theory of Computing (1986), 1–5.
2. A. M. Berman, M. C. Paul, and B. G. Ryder, “Proving Relative Lower Bounds for Incremental Algorithms,” Acta Informatica 27(1990), 665–683.
3. A. Delcher and S. Kasif, “Complexity Issues in Parallel Logic Programming,” Johns Hopkins University, Ph.D Thesis, 1989.
4. R. Greenlaw, H. J. Hoover, and W. L. Ruzzo, “A Compendium of Problems Complete for P,” Department of Computer Science and Engineering, University of Washington, Technical Report TR-91-05-01, 1991.
5. L.J. Guibas and R. Sedgewick, “A Dichromatic Framework for Balanced Trees,” Proc. 19th IEEE Symposium on Foundations of Computer Science (1978), 8–21.