 | 2007 |
|---|
| 68 |       | Adrienne X. Wang,
Walter L. Ruzzo,
Martin Tompa:
How accurately is ncRNA aligned within whole-genome multiple alignments?
BMC Bioinformatics 8: (2007) |
| 2006 |
|---|
| 67 | | Nan Li,
Martin Tompa:
Analysis of computational approaches for motif discovery.
Algorithms for Molecular Biology 1: (2006) |
| 66 | | Shane Neph,
Martin Tompa:
MicroFootPrinter: a tool for phylogenetic footprinting in prokaryotic genomes.
Nucleic Acids Research 34(Web-Server-Issue): 366-368 (2006) |
| 2005 |
|---|
| 65 | | Amol Prakash,
Martin Tompa:
Statistics of local multiple alignments.
ISMB (Supplement of Bioinformatics) 2005: 344-350 |
| 2004 |
|---|
| 64 | | Amol Prakash,
Mathieu Blanchette,
Saurabh Sinha,
Martin Tompa:
Motif Discovery in Heterogeneous Sequence Data.
Pacific Symposium on Biocomputing 2004: 348-359 |
| 63 | | Saurabh Sinha,
Mathieu Blanchette,
Martin Tompa:
PhyME: A probabilistic algorithm for finding motifs in sets of orthologous sequences.
BMC Bioinformatics 5: 170 (2004) |
| 2003 |
|---|
| 62 | | Saurabh Sinha,
Martin Tompa:
Performance Comparison of Algorithms for FindingTranscription Factor Binding Sites.
BIBE 2003: 214- |
| 61 | | Mathieu Blanchette,
Samson Kwong,
Martin Tompa:
An Empirical Comparison of Tools for Phylogenetic Footprinting.
BIBE 2003: 69-78 |
| 60 |  | Saurabh Sinha,
Martin Tompa:
YMF: a program for discovery of novel transcription factor binding sites by statistical overrepresentation.
Nucleic Acids Research 31(13): 3586-3588 (2003) |
| 59 | | Mathieu Blanchette,
Martin Tompa:
FootPrinter: a program designed for phylogenetic footprinting.
Nucleic Acids Research 31(13): 3840-3842 (2003) |
| 2002 |
|---|
| 58 | | Charles J. Colbourn,
Alan C. H. Ling,
Martin Tompa:
Construction of optimal quality control for oligo arrays.
Bioinformatics 18(4): 529-535 (2002) |
| 57 | | Rimli Sengupta,
Martin Tompa:
Quality Control in Manufacturing Oligo Arrays: A Combinatorial Design Approach.
Journal of Computational Biology 9(1): 1-22 (2002) |
| 56 | | Mathieu Blanchette,
Benno Schwikowski,
Martin Tompa:
Algorithms for Phylogenetic Footprinting.
Journal of Computational Biology 9(2): 211-223 (2002) |
| 55 | | Jeremy Buhler,
Martin Tompa:
Finding Motifs Using Random Projections.
Journal of Computational Biology 9(2): 225-242 (2002) |
| 2001 |
|---|
| 54 | | Rimli Sengupta,
Martin Tompa:
Quality Control in Manufacturing Oligo Arrays: A Combinatorial Design Approach.
Pacific Symposium on Biocomputing 2001: 348-359 |
| 53 | | Jeremy Buhler,
Martin Tompa:
Finding motifs using random projections.
RECOMB 2001: 69-76 |
| 52 | | Noga Alon,
Charles J. Colbourn,
Alan C. H. Ling,
Martin Tompa:
Equireplicate Balanced Binary Codes for Oligo Arrays.
SIAM J. Discrete Math. 14(4): 481-497 (2001) |
| 2000 |
|---|
| 51 | | Saurabh Sinha,
Martin Tompa:
A Statistical Method for Finding Transcription Factor Binding Sites.
ISMB 2000: 344-354 |
| 50 | | Mathieu Blanchette,
Benno Schwikowski,
Martin Tompa:
An Exact Algorithm to Identify Motifs in Orthologous Sequences from Multiple Species.
ISMB 2000: 37-45 |
| 1999 |
|---|
| 49 | | Walter L. Ruzzo,
Martin Tompa:
A Linear Time Algorithm for Finding All Maximal Scoring Subsequences.
ISMB 1999: 234-241 |
| 48 | | Martin Tompa:
An Exact Method for Finding Short Motifs in Sequences, with Application to the Ribosome Binding Site Problem.
ISMB 1999: 262-271 |
| 47 | | 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) |
| 1998 |
|---|
| 46 | | Emily Rocke,
Martin Tompa:
An algorithm for finding novel gapped motifs in DNA sequences.
RECOMB 1998: 228-233 |
| 1996 |
|---|
| 45 | | 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) |
| 44 | | Donald D. Chinn,
Frank Thomson Leighton,
Martin Tompa:
Minimal Adaptive Routing on the Mesh with Bounded Queue Size.
J. Parallel Distrib. Comput. 34(2): 154-170 (1996) |
| 1995 |
|---|
| 43 | | 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 |
|---|
| 42 | | Donald D. Chinn,
Frank Thomson Leighton,
Martin Tompa:
Minimal Adaptive Routing on the Mesh with Bounded Queue Size.
SPAA 1994: 354-363 |
| 41 | | 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) |
| 40 | | Paul Beame,
Martin Tompa,
Peiyuan Yan:
Communication-Space Tradeoffs for Unrestricted Protocols.
SIAM J. Comput. 23(3): 652-661 (1994) |
| 1992 |
|---|
| 39 | | 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) |
| 38 | | Tak Wah Lam,
Prasoon Tiwari,
Martin Tompa:
Trade-Offs between Communication and Space.
J. Comput. Syst. Sci. 45(3): 296-315 (1992) |
| 37 | | Martin Tompa:
Lower Bounds on Universal Traversal Sequences for Cycles and Other Low Degree Graphs.
SIAM J. Comput. 21(6): 1153-1160 (1992) |
| 1990 |
|---|
| 36 | | Paul Beame,
Martin Tompa,
Peiyuan Yan:
Communication-Space Tradeoffs for Unrestricted Protocols
FOCS 1990: 420-428 |
| 35 | | Paul Beame,
Allan Borodin,
Prabhakar Raghavan,
Walter L. Ruzzo,
Martin Tompa:
Time-Space Tradeoffs for Undirected Graph Traversal
FOCS 1990: 429-438 |
| 34 | | Ashok K. Chandra,
Martin Tompa:
The complexity of short two-person games.
Discrete Applied Mathematics 29(1): 21-33 (1990) |
| 1989 |
|---|
| 33 | | Tak Wah Lam,
Prasoon Tiwari,
Martin Tompa:
Tradeoffs Between Communication and Space
STOC 1989: 217-226 |
| 32 | | Allan Borodin,
Walter L. Ruzzo,
Martin Tompa:
Lower Bounds on the Length of Universal Traversal Sequences (Detailed Abstract)
STOC 1989: 562-573 |
| 31 | | Don Coppersmith,
Prabhakar Raghavan,
Martin Tompa:
Parallel Graph Algorithms That Are Efficient on Average
Inf. Comput. 81(3): 318-333 (1989) |
| 30 | | H. Venkateswaran,
Martin Tompa:
A New Pebble Game That Characterizes Parallel Complexity Classes.
SIAM J. Comput. 18(3): 533-549 (1989) |
| 29 | | 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) |
| 28 | | 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) |
| 1988 |
|---|
| 27 | | Martin Tompa:
Zero Knowledge Interactive Proofs of Knowledge (A Digest).
TARK 1988: 1-12 |
| 26 | | Faith E. Fich,
Martin Tompa:
The parallel complexity of exponentiating polynomials over finite fields.
J. ACM 35(3): 651-667 (1988) |
| 25 | | Martin Tompa,
Heather Woll:
How to Share a Secret with Cheaters.
J. Cryptology 1(2): 133-138 (1988) |
| 1987 |
|---|
| 24 | | Don Coppersmith,
Prabhakar Raghavan,
Martin Tompa:
Parallel Graph Algorithms that Are Efficient on Average
FOCS 1987: 260-269 |
| 23 | | Martin Tompa,
Heather Woll:
Random Self-Reducibility and Zero Knowledge Interactive Proofs of Possession of Information
FOCS 1987: 472-482 |
| 1986 |
|---|
| 22 | | Martin Tompa,
Heather Woll:
How to Share a Secret with Cheaters.
CRYPTO 1986: 261-265 |
| 21 | | H. Venkateswaran,
Martin Tompa:
A New Pebble Game that Characterizes Parallel Complexity Classes
FOCS 1986: 348-360 |
| 1985 |
|---|
| 20 | | Faith E. Fich,
Martin Tompa:
The Parallel Complexity of Exponentiating Polynomials over Finite Fields
STOC 1985: 38-47 |
| 19 | | Udi Manber,
Martin Tompa:
The Complexity of Problems on Probabilistic Nondeterministic, and Alternating Decision Trees
J. ACM 32(3): 720-732 (1985) |
| 18 | | Patrick W. Dymond,
Martin Tompa:
Speedups of Deterministic Machines by Synchronous Parallel Machines.
J. Comput. Syst. Sci. 30(2): 149-161 (1985) |
| 17 | | 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) |
| 1984 |
|---|
| 16 | | Walter L. Ruzzo,
Janos Simon,
Martin Tompa:
Space-Bounded Hierarchies and Probabilistic Computations.
J. Comput. Syst. Sci. 28(2): 216-230 (1984) |
| 15 | | 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 |
|---|
| 14 | | Patrick W. Dymond,
Martin Tompa:
Speedups of Deterministic Machines by Synchronous Parallel Machines
STOC 1983: 336-343 |
| 1982 |
|---|
| 13 | | Walter L. Ruzzo,
Janos Simon,
Martin Tompa:
Space-Bounded Hierarchies and Probabilistic Computations
STOC 1982: 215-223 |
| 12 | | Udi Manber,
Martin Tompa:
Probabilistic, Nondeterministic, and Alternating Decision Trees
STOC 1982: 234-244 |
| 11 | | Martin Tompa:
Two Familiar Transitive Closure Algorithms Which Admit No Polynomial Time, Sublinear Space Implementations.
SIAM J. Comput. 11(1): 130-137 (1982) |
| 1981 |
|---|
| 10 | | Udi Manber,
Martin Tompa:
The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem
FOCS 1981: 220-227 |
| 9 | | Martin Tompa:
An Extension of Savitch's Theorem to Small Space Bounds.
Inf. Process. Lett. 12(2): 106-108 (1981) |
| 8 | | 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) |
| 7 | | Martin Tompa:
Corrigendum: Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of Their Circuits.
J. Comput. Syst. Sci. 23(1): 106 (1981) |
| 6 | | Martin Tompa:
An Optimal Solution to a Wire-Routing Problem.
J. Comput. Syst. Sci. 23(2): 127-150 (1981) |
| 1980 |
|---|
| 5 | | Martin Tompa:
An Optimal Solution to a Wire-Routing Problem (Preliminary Version)
STOC 1980: 161-176 |
| 4 | | Martin Tompa:
Two Familiar Transitive Closure Algorithms which Admit No Polynomial Time, Sublinear Space Implementations
STOC 1980: 333-338 |
| 3 | | Martin Tompa:
Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of Their Circuits.
J. Comput. Syst. Sci. 20(2): 118-132 (1980) |
| 1979 |
|---|
| 2 | | 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 |
|---|
| 1 | | Martin Tompa:
Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of their Circuits
STOC 1978: 196-204 |
