default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Tompa
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
2000 – 2009
- 2009
[j45]Huei-Hun Elizabeth Tseng, Martin Tompa:
Algorithms for locating extremely conserved elements in multiple sequence alignments. BMC Bioinform. 10: 432 (2009)- [j44]Kai Wang
, Manikandan Narayanan, Hua Zhong, Martin Tompa, Eric E. Schadt, Jun Zhu:
Meta-analysis of Inter-species Liver Co-expression Networks Elucidates Traits Associated with Common Human Diseases. PLoS Comput. Biol. 5(12) (2009) - [j43]Amol Prakash, Martin Tompa:
Assessing the Discordance of Multiple Sequence Alignments. IEEE ACM Trans. Comput. Biol. Bioinform. 6(4): 542-551 (2009) - 2007
- [j42]Adrienne X. Wang, Walter L. Ruzzo, Martin Tompa:
How accurately is ncRNA aligned within whole-genome multiple alignments? BMC Bioinform. 8 (2007) - [j41]Zizhen Yao, Jeffrey E. Barrick, Zasha Weinberg, Shane J. Neph, Ronald R. Breaker, Martin Tompa, Walter L. Ruzzo:
A Computational Pipeline for High- Throughput Discovery of cis-Regulatory Noncoding RNA in Prokaryotes. PLoS Comput. Biol. 3(7) (2007) - 2006
- [j40]Nan Li, Martin Tompa:
Analysis of computational approaches for motif discovery. Algorithms Mol. Biol. 1 (2006) - [j39]Shane J. Neph, Martin Tompa:
MicroFootPrinter: a tool for phylogenetic footprinting in prokaryotic genomes. Nucleic Acids Res. 34(Web-Server-Issue): 366-368 (2006) - 2005
- [c31]Amol Prakash, Martin Tompa:
Statistics of local multiple alignments. ISMB (Supplement of Bioinformatics) 2005: 344-350 - 2004
- [j38]Saurabh Sinha, Mathieu Blanchette, Martin Tompa:
PhyME: A probabilistic algorithm for finding motifs in sets of orthologous sequences. BMC Bioinform. 5: 170 (2004) - [c30]Amol Prakash, Mathieu Blanchette, Saurabh Sinha, Martin Tompa:
Motif Discovery in Heterogeneous Sequence Data. Pacific Symposium on Biocomputing 2004: 348-359 - 2003
- [j37]Saurabh Sinha, Martin Tompa:
YMF: a program for discovery of novel transcription factor binding sites by statistical overrepresentation. Nucleic Acids Res. 31(13): 3586-3588 (2003) - [j36]Mathieu Blanchette, Martin Tompa:
FootPrinter: a program designed for phylogenetic footprinting. Nucleic Acids Res. 31(13): 3840-3842 (2003) - [c29]Mathieu Blanchette, Samson Kwong, Martin Tompa:
An Empirical Comparison of Tools for Phylogenetic Footprinting. BIBE 2003: 69-78 - [c28]Saurabh Sinha, Martin Tompa:
Performance Comparison of Algorithms for FindingTranscription Factor Binding Sites. BIBE 2003: 214- - 2002
- [j35]Charles J. Colbourn, Alan C. H. Ling, Martin Tompa:
Construction of optimal quality control for oligo arrays. Bioinform. 18(4): 529-535 (2002) - [j34]Rimli Sengupta, Martin Tompa:
Quality Control in Manufacturing Oligo Arrays: A Combinatorial Design Approach. J. Comput. Biol. 9(1): 1-22 (2002) - [j33]Mathieu Blanchette, Benno Schwikowski, Martin Tompa:
Algorithms for Phylogenetic Footprinting. J. Comput. Biol. 9(2): 211-223 (2002) - [j32]Jeremy Buhler, Martin Tompa:
Finding Motifs Using Random Projections. J. Comput. Biol. 9(2): 225-242 (2002) - 2001
- [j31]Noga Alon, Charles J. Colbourn, Alan C. H. Ling, Martin Tompa:
Equireplicate Balanced Binary Codes for Oligo Arrays. SIAM J. Discret. Math. 14(4): 481-497 (2001) - [c27]Rimli Sengupta, Martin Tompa:
Quality Control in Manufacturing Oligo Arrays: A Combinatorial Design Approach. Pacific Symposium on Biocomputing 2001: 348-359 - [c26]Jeremy Buhler, Martin Tompa:
Finding motifs using random projections. RECOMB 2001: 69-76 - 2000
- [c25]Mathieu Blanchette, Benno Schwikowski, Martin Tompa:
An Exact Algorithm to Identify Motifs in Orthologous Sequences from Multiple Species. ISMB 2000: 37-45 - [c24]Saurabh Sinha, Martin Tompa:
A Statistical Method for Finding Transcription Factor Binding Sites. ISMB 2000: 344-354
1990 – 1999
- 1999
- [j30]Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa:
A Time-Space Tradeoff for Undirected Graph Traversal by Walking Automata. SIAM J. Comput. 28(3): 1051-1072 (1999) - [c23]Walter L. Ruzzo, Martin Tompa:
A Linear Time Algorithm for Finding All Maximal Scoring Subsequences. ISMB 1999: 234-241 - [c22]Martin Tompa:
An Exact Method for Finding Short Motifs in Sequences, with Application to the Ribosome Binding Site Problem. ISMB 1999: 262-271 - 1998
- [c21]Emily Rocke, Martin Tompa:
An algorithm for finding novel gapped motifs in DNA sequences. RECOMB 1998: 228-233 - 1996
- [j29]Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa:
Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata. Inf. Comput. 130(2): 101-129 (1996) - [j28]Donald D. Chinn, Frank Thomson Leighton, Martin Tompa:
Minimal Adaptive Routing on the Mesh with Bounded Queue Size. J. Parallel Distributed Comput. 34(2): 154-170 (1996) - 1995
- [j27]Jonathan F. Buss, Martin Tompa:
Lower Bounds on Universal Traversal Sequences Based on Chains of Length Five. Inf. Comput. 120(2): 326-329 (1995) - 1994
- [j26]Prasoon Tiwari, Martin Tompa:
A Direct Version of Shamir and Snir's Lower Bounds on Monotone Circuit Depth. Inf. Process. Lett. 49(5): 243-248 (1994) - [j25]Paul Beame, Martin Tompa, Peiyuan Yan:
Communication-Space Tradeoffs for Unrestricted Protocols. SIAM J. Comput. 23(3): 652-661 (1994) - [c20]Donald D. Chinn, Frank Thomson Leighton, Martin Tompa:
Minimal Adaptive Routing on the Mesh with Bounded Queue Size. SPAA 1994: 354-363 - 1992
- [j24]Allan Borodin, Walter L. Ruzzo, Martin Tompa:
Lower Bounds on the Length of Universal Traversal Sequences. J. Comput. Syst. Sci. 45(2): 180-203 (1992) - [j23]Tak Wah Lam, Prasoon Tiwari, Martin Tompa:
Trade-Offs between Communication and Space. J. Comput. Syst. Sci. 45(3): 296-315 (1992) - [j22]Martin Tompa:
Lower Bounds on Universal Traversal Sequences for Cycles and Other Low Degree Graphs. SIAM J. Comput. 21(6): 1153-1160 (1992) - 1990
- [j21]Ashok K. Chandra, Martin Tompa:
The complexity of short two-person games. Discret. Appl. Math. 29(1): 21-33 (1990) - [j20]Martin Tompa:
Figures of merit: the sequel. SIGACT News 21(4): 78-81 (1990) - [c19]Paul Beame, Martin Tompa, Peiyuan Yan:
Communication-Space Tradeoffs for Unrestricted Protocols. FOCS 1990: 420-428 - [c18]Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa:
Time-Space Tradeoffs for Undirected Graph Traversal. FOCS 1990: 429-438
1980 – 1989
- 1989
- [j19]Don Coppersmith, Prabhakar Raghavan, Martin Tompa:
Parallel Graph Algorithms That Are Efficient on Average. Inf. Comput. 81(3): 318-333 (1989) - [j18]H. Venkateswaran, Martin Tompa:
A New Pebble Game That Characterizes Parallel Complexity Classes. SIAM J. Comput. 18(3): 533-549 (1989) - [j17]Allan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo, Martin Tompa:
Two Applications of Inductive Counting for Complementation Problems. SIAM J. Comput. 18(3): 559-578 (1989) - [j16]Allan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo, Martin Tompa:
Erratum: Two Applications of Inductive Counting for Complementation Problems. SIAM J. Comput. 18(6): 1283 (1989) - [j15]Martin Tompa:
Figures of merit. SIGACT News 20(1): 62-71 (1989) - [c17]Tak Wah Lam, Prasoon Tiwari, Martin Tompa:
Tradeoffs Between Communication and Space. STOC 1989: 217-226 - [c16]Allan Borodin, Walter L. Ruzzo, Martin Tompa:
Lower Bounds on the Length of Universal Traversal Sequences (Detailed Abstract). STOC 1989: 562-573 - 1988
- [j14]Faith E. Fich, Martin Tompa:
The parallel complexity of exponentiating polynomials over finite fields. J. ACM 35(3): 651-667 (1988) - [j13]Martin Tompa, Heather Woll:
How to Share a Secret with Cheaters. J. Cryptol. 1(2): 133-138 (1988) - [c15]Allan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo, Martin Tompa:
Two applications of complementation via inductive counting. SCT 1988: 116-125 - [c14]Martin Tompa:
Zero Knowledge Interactive Proofs of Knowledge (A Digest). TARK 1988: 1-12 - 1987
- [c13]Don Coppersmith, Prabhakar Raghavan, Martin Tompa:
Parallel Graph Algorithms that Are Efficient on Average. FOCS 1987: 260-269 - [c12]Martin Tompa, Heather Woll:
Random Self-Reducibility and Zero Knowledge Interactive Proofs of Possession of Information. FOCS 1987: 472-482 - 1986
- [c11]Martin Tompa, Heather Woll:
How to Share a Secret with Cheaters. CRYPTO 1986: 261-265 - [c10]H. Venkateswaran, Martin Tompa:
A New Pebble Game that Characterizes Parallel Complexity Classes. FOCS 1986: 348-360 - 1985
- [j12]Udi Manber, Martin Tompa:
The Complexity of Problems on Probabilistic Nondeterministic, and Alternating Decision Trees. J. ACM 32(3): 720-732 (1985) - [j11]Patrick W. Dymond, Martin Tompa:
Speedups of Deterministic Machines by Synchronous Parallel Machines. J. Comput. Syst. Sci. 30(2): 149-161 (1985) - [j10]Allan Borodin, Ronald Fagin, John E. Hopcroft, Martin Tompa:
Decreasing the Nesting Depth of Expressions Involving Square Roots. J. Symb. Comput. 1(2): 169-188 (1985) - [c9]Faith E. Fich, Martin Tompa:
The Parallel Complexity of Exponentiating Polynomials over Finite Fields. STOC 1985: 38-47 - 1984
- [j9]Walter L. Ruzzo, Janos Simon, Martin Tompa:
Space-Bounded Hierarchies and Probabilistic Computations. J. Comput. Syst. Sci. 28(2): 216-230 (1984) - [j8]Udi Manber, Martin Tompa:
The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem. SIAM J. Comput. 13(1): 109-115 (1984) - 1983
- [c8]Patrick W. Dymond, Martin Tompa:
Speedups of Deterministic Machines by Synchronous Parallel Machines. STOC 1983: 336-343 - 1982
- [j7]Martin Tompa:
Two Familiar Transitive Closure Algorithms Which Admit No Polynomial Time, Sublinear Space Implementations. SIAM J. Comput. 11(1): 130-137 (1982) - [c7]Walter L. Ruzzo, Janos Simon, Martin Tompa:
Space-Bounded Hierarchies and Probabilistic Computations. STOC 1982: 215-223 - [c6]Udi Manber, Martin Tompa:
Probabilistic, Nondeterministic, and Alternating Decision Trees. STOC 1982: 234-244 - 1981
- [j6]Martin Tompa:
An Extension of Savitch's Theorem to Small Space Bounds. Inf. Process. Lett. 12(2): 106-108 (1981) - [j5]Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa:
A Time-Space Tradeoff for Sorting on Non-Oblivious Machines. J. Comput. Syst. Sci. 22(3): 351-364 (1981) - [j4]Martin Tompa:
Corrigendum: Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of Their Circuits. J. Comput. Syst. Sci. 23(1): 106 (1981) - [j3]Martin Tompa:
An Optimal Solution to a Wire-Routing Problem. J. Comput. Syst. Sci. 23(2): 127-150 (1981) - [c5]Udi Manber, Martin Tompa:
The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem. FOCS 1981: 220-227 - 1980
- [j2]Martin Tompa:
Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of Their Circuits. J. Comput. Syst. Sci. 20(2): 118-132 (1980) - [c4]Martin Tompa:
An Optimal Solution to a Wire-Routing Problem (Preliminary Version). STOC 1980: 161-176 - [c3]Martin Tompa:
Two Familiar Transitive Closure Algorithms which Admit No Polynomial Time, Sublinear Space Implementations. STOC 1980: 333-338
1970 – 1979
- 1979
- [j1]Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa:
A time-space tradeoff for sorting and related non-oblivious computations. SIGACT News 11(2): 24 (1979) - [c2]Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa:
A Time-Space Tradeoff for Sorting on Non-Oblivious Machines. FOCS 1979: 319-327 - 1978
- [c1]Martin Tompa:
Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of their Circuits. STOC 1978: 196-204
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-04-24 22:46 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:
