( en | de | ru )

 

Disambiguation of "Sudborough, Ivan Hal"

Author of the publication

copydeleteadd this publication to your clipboard
On the Tape Complexity of Deterministic Context-Free Languages.

. J. ACM, 25 (3): 405-414 (1978)

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.

Roy Hal

Wilhelm Hal

Svilen Ivanov

Elizaveta Ivanova

Sarah Ivanovas

 

Other publications of authors with the same name

A Note on Weak Operator Precedence Grammars.. Inf. Process. Lett., 7 (5): 213-218 (1978)Improved Dynamic Programming Algorithms for Bandwidth Minimization and the MinCut Linear Arrangement Problem., and . J. Algorithms, 5 (4): 531-546 (1984)On Families of Languages Defined by Time-Bounded Random Access Machines., and . MFCS, page 333-338. Mathematical Institute of the Slovak Academy of Sciences, (1973)Separating Tape Bounded Auxiliary Pushdown Automata Classes. STOC, page 208-217. ACM, (1977)Pancake problems with restricted prefix reversals and some corresponding Cayley networks., and . J. Parallel Distributed Comput., 63 (3): 327-336 (2003)On the Complexity of Single Row Routing Problems., and . WADS, volume 382 of Lecture Notes in Computer Science, page 529-540. Springer, (1989)Min Cut is NP-Complete for Edge Weigthed Trees., and . ICALP, volume 226 of Lecture Notes in Computer Science, page 265-274. Springer, (1986)Extending permutation arrays: improving MOLS bounds., , and . Des. Codes Cryptogr., 83 (3): 661-683 (2017)Simulation Permutation Networks on Hypercubes., , , and . LATIN, volume 583 of Lecture Notes in Computer Science, page 61-70. Springer, (1992)Comparing Interconnection Networks., and . MFCS, volume 324 of Lecture Notes in Computer Science, page 138-153. Springer, (1988)