( en | de | ru )

 

Disambiguation of "Rosenkrantz, Daniel J."

Author of the publication

copydeleteadd this publication to your clipboard
Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze.

, and . SIAM J. Comput., 15 (3): 831-850 (1986)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Daniel J Schad

Daniel J Guhr

Daniel J Alfsmann

Daniel J Schmidt

Daniel J Egger

 

Other publications of authors with the same name

Inferring Probabilistic Contagion Models Over Networks Using Active Queries., , , , , , and . CIKM, page 377-386. ACM, (2018)I/O Automata Based Verification of Finite State Distributed Systems: Complexity Issues (Abstract)., , , , and . PODC, page 122. ACM, (1996)Representability of Design Objects by Ancestor-Controlled Hierarchical Specifications., and . Fundamental Problems in Computing, page 163-208. Springer, (2013)Programmed Grammars and Classes of Formal Languages.. J. ACM, 16 (1): 107-131 (1969)JACM 1986-1990.. J. ACM, 50 (1): 18 (2003)Predecessor and Permutation Existence Problems for Sequential Dynamical Systems., , , , , and . DMCS, volume AB of DMTCS Proceedings, page 69-80. DMTCS, (2003)Computational Parallels Between the Regular and Context-Free Languages., and . SIAM J. Comput., 7 (1): 99-114 (1978)Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze., and . SIAM J. Comput., 15 (3): 831-850 (1986)Validating Agent-Based Models of Large Networked Systems., , , , , , , , , and 1 other author(s). WSC, page 2807-2818. IEEE, (2019)Table Machine Simulation, and . SWAT, page 118-128. IEEE Computer Society, (1969)