The SCEAS System
| |||||||

## Search the dblp DataBase
Walter L. Ruzzo:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Walter L. Ruzzo
**Tree-Size Bounded Alternation.**[Citation Graph (3, 0)][DBLP] J. Comput. Syst. Sci., 1980, v:21, n:2, pp:218-235 [Journal] - Walter L. Ruzzo
**On Uniform Circuit Complexity.**[Citation Graph (3, 0)][DBLP] J. Comput. Syst. Sci., 1981, v:22, n:3, pp:365-383 [Journal] - Michael A. Harrison, Walter L. Ruzzo, Jeffrey D. Ullman
**Protection in Operating Systems.**[Citation Graph (1, 0)][DBLP] Commun. ACM, 1976, v:19, n:8, pp:461-471 [Journal] - Joshua Redstone, Walter L. Ruzzo
**Algorithms for a Simple Point Placement Problem.**[Citation Graph (0, 0)][DBLP] CIAC, 2000, pp:32-43 [Conf] - Greg Barnes, Jonathan F. Buss, Walter L. Ruzzo, Baruch Schieber
**A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity**[Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1992, pp:27-33 [Conf] - Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo
**Pointers versus Arithmetic in PRAMs.**[Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1993, pp:239-252 [Conf] - Tak Wah Lam, Walter L. Ruzzo
**Results on Communication Complexity Classes.**[Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1989, pp:148-157 [Conf] - Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa
**Time-Space Tradeoffs for Undirected Graph Traversal**[Citation Graph (0, 0)][DBLP] FOCS, 1990, pp:429-438 [Conf] - Walter L. Ruzzo
**On Uniform Circuit Complexity (Extended Abstract)**[Citation Graph (0, 0)][DBLP] FOCS, 1979, pp:312-318 [Conf] - Patrick W. Dymond, Walter L. Ruzzo
**Parallel RAMs with Owned Global Memory and Deterministic Context-Free Language Recognition (Extended Abstract).**[Citation Graph (0, 0)][DBLP] ICALP, 1986, pp:95-104 [Conf] - Walter L. Ruzzo
**On the Complexity of General Context-Free Language Parsing and Recognition (Extended Abstract).**[Citation Graph (0, 0)][DBLP] ICALP, 1979, pp:489-497 [Conf] - Walter L. Ruzzo, Martin Tompa
**A Linear Time Algorithm for Finding All Maximal Scoring Subsequences.**[Citation Graph (0, 0)][DBLP] ISMB, 1999, pp:234-241 [Conf] - Zasha Weinberg, Walter L. Ruzzo
**Exploiting conserved structure for faster annotation of non-coding RNAs without loss of accuracy.**[Citation Graph (0, 0)][DBLP] ISMB/ECCB (Supplement of Bioinformatics), 2004, pp:334-341 [Conf] - J. Jaeger, Rimli Sengupta, Walter L. Ruzzo
**Improved Gene Selection for Classification of Microarrays.**[Citation Graph (0, 0)][DBLP] Pacific Symposium on Biocomputing, 2003, pp:53-64 [Conf] - Donald J. Patterson, Ken Yasuhara, Walter L. Ruzzo
**Pre-mRNA Secondary Structure Prediction Aids Splice Site Prediction.**[Citation Graph (0, 0)][DBLP] Pacific Symposium on Biocomputing, 2002, pp:223-234 [Conf] - Zasha Weinberg, Walter L. Ruzzo
**Faster genome annotation of non-coding RNA families without loss of accuracy.**[Citation Graph (0, 0)][DBLP] RECOMB, 2004, pp:243-251 [Conf] - Michael A. Harrison, Walter L. Ruzzo, Jeffrey D. Ullman
**On Protection in Operating System.**[Citation Graph (0, 0)][DBLP] SOSP, 1975, pp:14-24 [Conf] - Richard J. Anderson, Paul Beame, Walter L. Ruzzo
**Low Overhead Parallel Schedules for Task Graphs.**[Citation Graph (0, 0)][DBLP] SPAA, 1990, pp:66-75 [Conf] - Tak Wah Lam, Walter L. Ruzzo
**The Power of Parallel Pointer Manipulation.**[Citation Graph (0, 0)][DBLP] SPAA, 1989, pp:92-102 [Conf] - Greg Barnes, Walter L. Ruzzo
**Deterministic Algorithms for Undirected s-t Connectivity Using Polynomial Time and Sublinear Space (Extended Abstract)**[Citation Graph (0, 0)][DBLP] STOC, 1991, pp:43-53 [Conf] - Allan Borodin, Walter L. Ruzzo, Martin Tompa
**Lower Bounds on the Length of Universal Traversal Sequences (Detailed Abstract)**[Citation Graph (0, 0)][DBLP] STOC, 1989, pp:562-573 [Conf] - Ashok K. Chandra, Prabhakar Raghavan, Walter L. Ruzzo, Roman Smolensky, Prasoon Tiwari
**The Electrical Resistance of a Graph Captures its Commute and Cover Times (Detailed Abstract)**[Citation Graph (0, 0)][DBLP] STOC, 1989, pp:574-586 [Conf] - Susan L. Graham, Michael A. Harrison, Walter L. Ruzzo
**On Line Context Free Language Recognition in Less than Cubic Time (Extended Abstract)**[Citation Graph (0, 0)][DBLP] STOC, 1976, pp:112-120 [Conf] - Mike Paterson, Walter L. Ruzzo, Lawrence Snyder
**Bounds on Minimax Edge Length for Complete Binary Trees (Extended Abstract)**[Citation Graph (0, 0)][DBLP] STOC, 1981, pp:293-299 [Conf] - Walter L. Ruzzo
**Tree-Size Bounded Alternation**[Citation Graph (0, 0)][DBLP] STOC, 1979, pp:352-359 [Conf] - Walter L. Ruzzo, Janos Simon, Martin Tompa
**Space-Bounded Hierarchies and Probabilistic Computations**[Citation Graph (0, 0)][DBLP] STOC, 1982, pp:215-223 [Conf] - Walter L. Ruzzo
**Searching for Non-coding RNA.**[Citation Graph (0, 0)][DBLP] BSB, 2005, pp:9-10 [Conf] - Leonard M. Adleman, Kellogg S. Booth, Franco P. Preparata, Walter L. Ruzzo
**Improved Time and Space Bounds for Boolean Matrix Multiplication.**[Citation Graph (0, 0)][DBLP] Acta Inf., 1978, v:11, n:, pp:61-77 [Journal] - Zasha Weinberg, Walter L. Ruzzo
**Sequence-based heuristics for faster annotation of non-coding RNA families.**[Citation Graph (0, 0)][DBLP] Bioinformatics, 2006, v:22, n:1, pp:35-39 [Journal] - Zizhen Yao, Zasha Weinberg, Walter L. Ruzzo
**CMfinder - a covariance model based RNA motif finding algorithm.**[Citation Graph (0, 0)][DBLP] Bioinformatics, 2006, v:22, n:4, pp:445-452 [Journal] - Ka Yee Yeung, Chris Fraley, A. Murua, Adrian E. Raftery, Walter L. Ruzzo
**Model-based clustering and data transformations for gene expression data.**[Citation Graph (0, 0)][DBLP] Bioinformatics, 2001, v:17, n:10, pp:977-987 [Journal] - Ka Yee Yeung, David R. Haynor, Walter L. Ruzzo
**Validating clustering for gene expression data.**[Citation Graph (0, 0)][DBLP] Bioinformatics, 2001, v:17, n:4, pp:309-318 [Journal] - Ka Yee Yeung, Walter L. Ruzzo
**Principal component analysis for clustering gene expression data.**[Citation Graph (0, 0)][DBLP] Bioinformatics, 2001, v:17, n:9, pp:763-774 [Journal] - Greg Barnes, Walter L. Ruzzo
**Undirected s-t Connectivity in Polynomial Time and Sublinear Space.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 1997, v:6, n:1, pp:1-28 [Journal] - Ashok K. Chandra, Prabhakar Raghavan, Walter L. Ruzzo, Roman Smolensky, Prasoon Tiwari
**The Electrical Resistance of a Graph Captures its Commute and Cover Times.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 1997, v:6, n:4, pp:312-340 [Journal] - Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa
**Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 1996, v:130, n:2, pp:101-129 [Journal] - Howard J. Karloff, Walter L. Ruzzo
**The Iterated Mod Problem**[Citation Graph (0, 0)][DBLP] Inf. Comput., 1989, v:80, n:3, pp:193-204 [Journal] - Patrick W. Dymond, Walter L. Ruzzo
**Parallel RAMs with owned global memory and deterministic context-free language recognition.**[Citation Graph (0, 0)][DBLP] J. ACM, 2000, v:47, n:1, pp:16-45 [Journal] - Allan Borodin, Walter L. Ruzzo, Martin Tompa
**Lower Bounds on the Length of Universal Traversal Sequences.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1992, v:45, n:2, pp:180-203 [Journal] - Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo
**Pointers versus Arithmetic in PRAMs.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1996, v:53, n:2, pp:218-232 [Journal] - Tak Wah Lam, Walter L. Ruzzo
**Results on Communication Complexity Classes.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1992, v:44, n:2, pp:324-342 [Journal] - Walter L. Ruzzo, Janos Simon, Martin Tompa
**Space-Bounded Hierarchies and Probabilistic Computations.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1984, v:28, n:2, pp:216-230 [Journal] - Greg Barnes, Jonathan F. Buss, Walter L. Ruzzo, Baruch Schieber
**A Sublinear Space, Polynomial Time Algorithm for Directed**[Citation Graph (0, 0)][DBLP]*s*-*t*Connectivity. SIAM J. Comput., 1998, v:27, n:5, pp:1273-1282 [Journal] - Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa
**A Time-Space Tradeoff for Undirected Graph Traversal by Walking Automata.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1999, v:28, n:3, pp:1051-1072 [Journal] - Allan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo, Martin Tompa
**Two Applications of Inductive Counting for Complementation Problems.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1989, v:18, n:3, pp:559-578 [Journal] - Allan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo, Martin Tompa
**Erratum: Two Applications of Inductive Counting for Complementation Problems.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1989, v:18, n:6, pp:1283- [Journal] - Susan L. Graham, Michael A. Harrison, Walter L. Ruzzo
**An Improved Context-Free Recognizer.**[Citation Graph (0, 0)][DBLP] ACM Trans. Program. Lang. Syst., 1980, v:2, n:3, pp:415-462 [Journal] **Finding Non-coding RNAs Through Genome-Scale Clustering.**[Citation Graph (, )][DBLP]**Multiperm: shuffling multiple sequence alignments while approximately preserving dinucleotide frequencies.**[Citation Graph (, )][DBLP]**How accurately is ncRNA aligned within whole-genome multiple alignments?**[Citation Graph (, )][DBLP]**A Regression-based K nearest neighbor algorithm for gene function prediction from heterogeneous data.**[Citation Graph (, )][DBLP]
Search in 0.042secs, Finished in 0.044secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |