Dynamic word problems

Journal of the ACM

Volumn 44, Issue 2, 1997, Pages 257-271

  Frandsen, Gudmund Skovbjerg ^a   Miltersen, Peter Bro ^a   Skyum, Sven ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

Algorithms; Cell probe model; Dynamic algorithms; Krohn Rhodes decomposition; Sunflower lemma; Theory; Word problems

Indexed keywords

ALGORITHMS; COMPUTATIONAL GRAMMARS; DYNAMIC PROGRAMMING; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; SET THEORY; THEOREM PROVING; TREES (MATHEMATICS);

DYNAMIC ALGORITHMS;

COMPUTATIONAL LINGUISTICS;

EID: 0031096498     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/256303.256309     Document Type: Article

References (16)

1. ANGLUIN, D., AND VALIANT, L. G. 1979. Fast probabilistic algorithms for Hamiltonian circuits and matchings. J. Comput. Syst. Sci. 18, 155-193.
2. 1. J. Comput. Syst. Sci. 38, 150-164.
3. 1. J. Comput. Syst. Sci. 44, 4 (Oct.), 478-499.
4. 1. J. ACM 35, 941-952.
5. BOPPANA, R. B., AND SIPSER, M. 1990. The complexity of finite functions. In Handbook of Theoretical Computer Science, Vol. A, J. van Leeuwen, ed. Elsevier, Amsterdam, The Netherlands, pp. 757-804.
6. CHANDRA, A. K., FORTUNE, S., AND LIPTON, R. 1985. Unbounded fan-in circuits and associative functions. J. Comput. Syst. Sci. 30, 222-234.
7. COHEN, R. F., AND TAMASSIA, R. 1995. Dynamic expression trees and their applications. Algorithmica 13, 245-265.
8. FREDMAN, M. L. 1978. Observations on the complexity of generating quasi-Gray codes. SIAM J. Comput. 7, 134-146.
9. FREDMAN, M. L. 1982. The complexity of maintaining an array and computing its partial sums. J. ACM 29, 1 (Jan.), 250-260.
10. FREDMAN, M. L., AND SAKS, M. 1989. The cell probe complexity of dynamic data structures. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing (Seattle, Wash., May 15-17). ACM, New York, pp. 345-354.
11. FURST, M., SAXE, J., AND SIPSER, M. 1984. Parity, circuits and the polynomial time hierarchy. Math. Syst. Theory 17, 13-27.
12. HASTAD, J. 1986. Computational Limitations for Small Depth Circuits. MIT Press, Cambridge, Mass.
13. KROHN, K., AND RHODES, J. 1965. Algebraic theory of machines. I. Prime decomposition theorem for finite semigroups and machines. Trans. Am. Math. Soc. 116, 450-464.
14. MILTERSEN, P. B., SUBRAMANIUM, S., VITTER, J. S., AND TAMASSIA, R. 1994. A complexity theoretic approach to incremental computation. Theoret. Comput. Sci. 130, 203-236.
15. VAN EMDE BOAS, P., KAAS, R., AND ZIJLSTRA, E. 1977. Design and implementation of an efficient priority queue. Math. Syst. Theory 10, 99-127.
16. YAO, A. C. 1985. Separating the polynomial-time hierarchy by oracles. In Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 1-10.