Travelled to:1 × Austria
1 × France
7 × USA
Collaborated with:∅ M.Tompa M.A.Harrison G.Barnes P.W.Dymond A.Borodin J.Simon M.Paterson L.Snyder S.L.Graham J.D.Ullman A.K.Chandra P.Raghavan R.Smolensky P.Tiwari
Talks about:bound (4) recognit (3) languag (3) context (3) time (3) free (3) determinist (2) length (2) space (2) tree (2)
Person: Walter L. Ruzzo
DBLP: Ruzzo:Walter_L=
Facilitated 1 volumes:
EdContributed to:
19911989
198619821981197919791976
1975Wrote 10 papers:
- STOC-1991-BarnesR #algorithm #polynomial #sublinear #using
- Deterministic Algorithms for Undirected s-t Connectivity Using Polynomial Time and Sublinear Space (GB, WLR), pp. 43–53.
- STOC-1989-BorodinRT #bound #sequence #traversal
- Lower Bounds on the Length of Universal Traversal Sequences (AB, WLR, MT), pp. 562–573.
- STOC-1989-ChandraRRST #graph
- The Electrical Resistance of a Graph Captures its Commute and Cover Times (AKC, PR, WLR, RS, PT), pp. 574–586.
- ICALP-1986-DymondR #context-free grammar #memory management #parallel #recognition
- Parallel RAMs with Owned Global Memory and Deterministic Context-Free Language Recognition (PWD, WLR), pp. 95–104.
- STOC-1982-RuzzoST #bound #probability
- Space-Bounded Hierarchies and Probabilistic Computations (WLR, JS, MT), pp. 215–223.
- STOC-1981-PatersonRS #bound
- Bounds on Minimax Edge Length for Complete Binary Trees (MP, WLR, LS), pp. 293–299.
- ICALP-1979-Ruzzo #complexity #context-free grammar #on the #parsing #recognition
- On the Complexity of General Context-Free Language Parsing and Recognition (WLR), pp. 489–497.
- STOC-1979-Ruzzo #bound
- Tree-Size Bounded Alternation (WLR), pp. 352–359.
- STOC-1976-GrahamHR #context-free grammar #on the #polynomial #recognition
- On Line Context Free Language Recognition in Less than Cubic Time (SLG, MAH, WLR), pp. 112–120.
- SOSP-1975-HarrisonRU #on the #operating system
- On Protection in Operating System (MAH, WLR, JDU), pp. 14–24.