default search action
Walter L. Ruzzo
Person information
- affiliation: University of Washington, Seattle, Washington, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [i2]Nathaniel McVicar, Akina Hoshino, Anna La Torre, Thomas A. Reh, Walter L. Ruzzo, Scott Hauck:
FPGA Acceleration of Short Read Alignment. CoRR abs/1805.00106 (2018) - 2014
- [j31]Zizhen Yao
, Kyle L. MacQuarrie
Discriminative motif analysis of high-throughput dataset. Bioinform. 30(6): 775-783 (2014) - 2013
- [c28]Nathaniel McVicar, Walter L. Ruzzo
Accelerating ncRNA homology search with FPGAs. FPGA 2013: 43-52 - 2012
- [j30]Daniel C. Jones, Walter L. Ruzzo
A new approach to bias correction in RNA-Seq. Bioinform. 28(7): 921-928 (2012) - [j29]Hamid Bolouri, Walter L. Ruzzo
Integration of 198 ChIP-seq Datasets Reveals Human cis-Regulatory Regions. J. Comput. Biol. 19(9): 989-997 (2012) - [c27]Corey B. Olson, Maria Kim, Cooper Clauson, Boris Kogon, Carl Ebeling, Scott Hauck, Walter L. Ruzzo
Hardware Acceleration of Short Read Mapping. FCCM 2012: 161-168 - [i1]Daniel C. Jones, Walter L. Ruzzo, Xinxia Peng, Michael G. Katze:
Compression of next-generation sequencing reads aided by highly efficient de novo assembly. CoRR abs/1207.2424 (2012)
2000 – 2009
- 2009
- [j28]Parvez Anandam, Elfar Torarinsson, Walter L. Ruzzo
Multiperm: shuffling multiple sequence alignments while approximately preserving dinucleotide frequencies. Bioinform. 25(5): 668-669 (2009) - [j27]Huei-Hun Elizabeth Tseng, Zasha Weinberg
Finding Non-Coding RNAs through genome-Scale Clustering. J. Bioinform. Comput. Biol. 7(2): 373-388 (2009) - 2008
- [c26]Huei-Hun Elizabeth Tseng, Zasha Weinberg, Jeremy Gore, Ronald R. Breaker, Walter L. Ruzzo:
Finding Non-coding RNAs Through Genome-Scale Clustering. APBC 2008: 199-210 - 2007
- [j26]Adrienne X. Wang, Walter L. Ruzzo
How accurately is ncRNA aligned within whole-genome multiple alignments? BMC Bioinform. 8 (2007) - [j25]Zizhen Yao
A Computational Pipeline for High- Throughput Discovery of cis-Regulatory Noncoding RNA in Prokaryotes. PLoS Comput. Biol. 3(7) (2007) - 2006
- [j24]Zasha Weinberg
Sequence-based heuristics for faster annotation of non-coding RNA families. Bioinform. 22(1): 35-39 (2006) - [j23]Zizhen Yao
CMfinder - a covariance model based RNA motif finding algorithm. Bioinform. 22(4): 445-452 (2006) - [j22]Zizhen Yao
A Regression-based K nearest neighbor algorithm for gene function prediction from heterogeneous data. BMC Bioinform. 7(S-1) (2006) - 2005
- [c25]Walter L. Ruzzo
Searching for Non-coding RNA. BSB 2005: 9-10 - 2004
- [c24]Zasha Weinberg
Exploiting conserved structure for faster annotation of non-coding RNAs without loss of accuracy. ISMB/ECCB (Supplement of Bioinformatics) 2004: 334-341 - [c23]Zasha Weinberg
Faster genome annotation of non-coding RNA families without loss of accuracy. RECOMB 2004: 243-251 - 2003
- [c22]Jochen Jaeger, Rimli Sengupta, Walter L. Ruzzo:
Improved Gene Selection for Classification of Microarrays. Pacific Symposium on Biocomputing 2003: 53-64 - 2002
- [c21]Donald J. Patterson, Ken Yasuhara, Walter L. Ruzzo:
Pre-mRNA Secondary Structure Prediction Aids Splice Site Prediction. Pacific Symposium on Biocomputing 2002: 223-234 - 2001
- [j21]Ka Yee Yeung
Validating clustering for gene expression data. Bioinform. 17(4): 309-318 (2001) - [j20]Ka Yee Yeung
Principal component analysis for clustering gene expression data. Bioinform. 17(9): 763-774 (2001) - [j19]Ka Yee Yeung, Chris Fraley, Alejandro Murua, Adrian E. Raftery, Walter L. Ruzzo
Model-based clustering and data transformations for gene expression data. Bioinform. 17(10): 977-987 (2001) - 2000
- [j18]Patrick W. Dymond, Walter L. Ruzzo
Parallel RAMs with owned global memory and deterministic context-free language recognition. J. ACM 47(1): 16-45 (2000) - [c20]Joshua Redstone, Walter L. Ruzzo
Algorithms for a Simple Point Placement Problem. CIAC 2000: 32-43
1990 – 1999
- 1999
- [j17]Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo
A Time-Space Tradeoff for Undirected Graph Traversal by Walking Automata. SIAM J. Comput. 28(3): 1051-1072 (1999) - [c19]Walter L. Ruzzo, Martin Tompa:
A Linear Time Algorithm for Finding All Maximal Scoring Subsequences. ISMB 1999: 234-241 - 1998
- [j16]Greg Barnes, Jonathan F. Buss, Walter L. Ruzzo
A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity. SIAM J. Comput. 27(5): 1273-1282 (1998) - 1997
- [j15]Greg Barnes, Walter L. Ruzzo
Undirected s-t Connectivity in Polynomial Time and Sublinear Space. Comput. Complex. 6(1): 1-28 (1997) - [j14]Ashok K. Chandra, Prabhakar Raghavan, Walter L. Ruzzo
The Electrical Resistance of a Graph Captures its Commute and Cover Times. Comput. Complex. 6(4): 312-340 (1997) - 1996
- [j13]Paul Beame, Allan Borodin, Prabhakar Raghavan
Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata. Inf. Comput. 130(2): 101-129 (1996) - [j12]Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo
Pointers versus Arithmetic in PRAMs. J. Comput. Syst. Sci. 53(2): 218-232 (1996) - 1993
- [c18]Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo
Pointers versus Arithmetic in PRAMs. SCT 1993: 239-252 - 1992
- [j11]Tak Wah Lam
Results on Communication Complexity Classes. J. Comput. Syst. Sci. 44(2): 324-342 (1992) - [j10]Allan Borodin, Walter L. Ruzzo
Lower Bounds on the Length of Universal Traversal Sequences. J. Comput. Syst. Sci. 45(2): 180-203 (1992) - [c17]Greg Barnes, Jonathan F. Buss, Walter L. Ruzzo
A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity. SCT 1992: 27-33 - 1991
- [c16]Greg Barnes, Walter L. Ruzzo
Deterministic Algorithms for Undirected s-t Connectivity Using Polynomial Time and Sublinear Space (Extended Abstract). STOC 1991: 43-53 - 1990
- [c15]Paul Beame
Time-Space Tradeoffs for Undirected Graph Traversal. FOCS 1990: 429-438 - [c14]Richard J. Anderson, Paul Beame
Low Overhead Parallel Schedules for Task Graphs. SPAA 1990: 66-75
1980 – 1989
- 1989
- [j9]Howard J. Karloff, Walter L. Ruzzo
The Iterated Mod Problem. Inf. Comput. 80(3): 193-204 (1989) - [j8]Allan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo
Two Applications of Inductive Counting for Complementation Problems. SIAM J. Comput. 18(3): 559-578 (1989) - [j7]Allan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo
Erratum: Two Applications of Inductive Counting for Complementation Problems. SIAM J. Comput. 18(6): 1283 (1989) - [c13]Tak Wah Lam, Walter L. Ruzzo
Results on Communication Complexity Classes. SCT 1989: 148-157 - [c12]Tak Wah Lam
The Power of Parallel Pointer Manipulation. SPAA 1989: 92-102 - [c11]Allan Borodin, Walter L. Ruzzo
Lower Bounds on the Length of Universal Traversal Sequences (Detailed Abstract). STOC 1989: 562-573 - [c10]Ashok K. Chandra, Prabhakar Raghavan, Walter L. Ruzzo
The Electrical Resistance of a Graph Captures its Commute and Cover Times (Detailed Abstract). STOC 1989: 574-586 - 1988
- [c9]Allan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo
Two applications of complementation via inductive counting. SCT 1988: 116-125 - 1986
- [c8]Patrick W. Dymond, Walter L. Ruzzo
Parallel RAMs with Owned Global Memory and Deterministic Context-Free Language Recognition (Extended Abstract). ICALP 1986: 95-104 - 1984
- [j6]Walter L. Ruzzo
Space-Bounded Hierarchies and Probabilistic Computations. J. Comput. Syst. Sci. 28(2): 216-230 (1984) - 1983
- [e1]David S. Johnson, Ronald Fagin, Michael L. Fredman, David Harel, Richard M. Karp, Nancy A. Lynch, Christos H. Papadimitriou, Ronald L. Rivest, Walter L. Ruzzo, Joel I. Seiferas:
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 25-27 April, 1983, Boston, Massachusetts, USA. ACM 1983 [contents] - 1982
- [c7]Walter L. Ruzzo
Space-Bounded Hierarchies and Probabilistic Computations. STOC 1982: 215-223 - 1981
- [j5]Walter L. Ruzzo
On Uniform Circuit Complexity. J. Comput. Syst. Sci. 22(3): 365-383 (1981) - [c6]Mike Paterson, Walter L. Ruzzo
Bounds on Minimax Edge Length for Complete Binary Trees (Extended Abstract). STOC 1981: 293-299 - 1980
- [j4]Walter L. Ruzzo
Tree-Size Bounded Alternation. J. Comput. Syst. Sci. 21(2): 218-235 (1980) - [j3]Susan L. Graham, Michael A. Harrison, Walter L. Ruzzo
An Improved Context-Free Recognizer. ACM Trans. Program. Lang. Syst. 2(3): 415-462 (1980)
1970 – 1979
- 1979
- [c5]Walter L. Ruzzo
On Uniform Circuit Complexity (Extended Abstract). FOCS 1979: 312-318 - [c4]Walter L. Ruzzo
On the Complexity of General Context-Free Language Parsing and Recognition (Extended Abstract). ICALP 1979: 489-497 - [c3]Walter L. Ruzzo
Tree-Size Bounded Alternation. STOC 1979: 352-359 - 1978
- [j2]Leonard M. Adleman, Kellogg S. Booth, Franco P. Preparata, Walter L. Ruzzo
Improved Time and Space Bounds for Boolean Matrix Multiplication. Acta Informatica 11: 61-77 (1978) - 1976
- [j1]Michael A. Harrison, Walter L. Ruzzo
Protection in Operating Systems. Commun. ACM 19(8): 461-471 (1976) - [c2]Susan L. Graham, Michael A. Harrison, Walter L. Ruzzo
On Line Context Free Language Recognition in Less than Cubic Time (Extended Abstract). STOC 1976: 112-120 - 1975
- [c1]Michael A. Harrison, Walter L. Ruzzo
On Protection in Operating System. SOSP 1975: 14-24
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-30 20:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: