Travelled to:
1 × Austria
1 × Finland
1 × France
1 × Spain
3 × USA
Collaborated with:
B.Monien ∅ F.Makedon
Talks about:
auxiliari (2) pushdown (2) automata (2) languag (2) complet (2) tape (2) nondetermin (1) development (1) determinist (1) multihead (1)
Person: Ivan Hal Sudborough
DBLP: Sudborough:Ivan_Hal
Contributed to:
Wrote 7 papers:
- ICALP-1986-MonienS
- Min Cut is NP-Complete for Edge Weighted Trees (BM, IHS), pp. 265–274.
- ICALP-1983-MakedonS #linear
- Minimizing Width in Linear Layouts (FM, IHS), pp. 478–490.
- STOC-1981-MonienS #problem
- Bandwidth Constrained NP-Complete Problems (BM, IHS), pp. 207–217.
- ICALP-1979-MonienS #nondeterminism #on the #turing machine
- On Eliminating Nondeterminism From Turing Machines Which Use Less Than Logarithmic Worktape Space (BM, IHS), pp. 431–445.
- ICALP-1977-Sudborough #complexity
- The Time and Tape Complexity of Developmental Languages (IHS), pp. 509–523.
- STOC-1977-Sudborough #automaton #bound
- Separating Tape Bounded Auxiliary Pushdown Automata Classes (IHS), pp. 208–217.
- STOC-1976-Sudborough #automaton #context-free grammar #multi #on the #power of
- On Deterministic Context-Free Languages, Multihead Automata, and the Power of an Auxiliary Pushdown Store (IHS), pp. 141–148.