Martin Tompa

Publication Activity (10 Years)

Years Active: 1978-2009
Publications (10 Years): 0

Publications

Amol Prakash, Martin Tompa
Assessing the Discordance of Multiple Sequence Alignments. IEEE ACM Trans. Comput. Biol. Bioinform. 6 (4) (2009)
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)
Huei-Hun E. Tseng, Martin Tompa
Algorithms for locating extremely conserved elements in multiple sequence alignments. BMC Bioinform. 10 (2009)
Adrienne X. Wang, Walter L. Ruzzo, Martin Tompa
How accurately is ncRNA aligned within whole-genome multiple alignments? BMC Bioinform. 8 (2007)
Zizhen Yao, Jeffrey Barrick, Zasha Weinberg, Shane J. Neph, Ronald R. Breaker, Martin Tompa, Walter L. Ruzzo
-Regulatory Noncoding RNA in Prokaryotes. PLoS Comput. Biol. 3 (7) (2007)
Nan Li, Martin Tompa
Analysis of computational approaches for motif discovery. Algorithms Mol. Biol. 1 (2006)
Shane J. Neph, Martin Tompa
MicroFootPrinter: a tool for phylogenetic footprinting in prokaryotic genomes. Nucleic Acids Res. 34 (Web-Server-Issue) (2006)
Amol Prakash, Martin Tompa
Statistics of local multiple alignments. ISMB (Supplement of Bioinformatics) (2005)
Saurabh Sinha, Mathieu Blanchette, Martin Tompa
PhyME: A probabilistic algorithm for finding motifs in sets of orthologous sequences. BMC Bioinform. 5 (2004)
Amol Prakash, Mathieu Blanchette, Saurabh Sinha, Martin Tompa
Motif Discovery in Heterogeneous Sequence Data. Pacific Symposium on Biocomputing (2004)
Mathieu Blanchette, Martin Tompa
FootPrinter: a program designed for phylogenetic footprinting. Nucleic Acids Res. 31 (13) (2003)
Mathieu Blanchette, Samson Kwong, Martin Tompa
An Empirical Comparison of Tools for Phylogenetic Footprinting. BIBE (2003)
Saurabh Sinha, Martin Tompa
YMF: a program for discovery of novel transcription factor binding sites by statistical overrepresentation. Nucleic Acids Res. 31 (13) (2003)
Saurabh Sinha, Martin Tompa
Performance Comparison of Algorithms for FindingTranscription Factor Binding Sites. BIBE (2003)
Rimli Sengupta, Martin Tompa
Quality Control in Manufacturing Oligo Arrays: A Combinatorial Design Approach. J. Comput. Biol. 9 (1) (2002)
Mathieu Blanchette, Benno Schwikowski, Martin Tompa
Algorithms for Phylogenetic Footprinting. J. Comput. Biol. 9 (2) (2002)
Jeremy Buhler, Martin Tompa
Finding Motifs Using Random Projections. J. Comput. Biol. 9 (2) (2002)
Charles J. Colbourn, Alan C. H. Ling, Martin Tompa
Construction of optimal quality control for oligo arrays. Bioinform. 18 (4) (2002)
Noga Alon, Charles J. Colbourn, Alan C. H. Ling, Martin Tompa
Equireplicate Balanced Binary Codes for Oligo Arrays. SIAM J. Discret. Math. 14 (4) (2001)
Rimli Sengupta, Martin Tompa
Quality Control in Manufacturing Oligo Arrays: A Combinatorial Design Approach. Pacific Symposium on Biocomputing (2001)
Jeremy Buhler, Martin Tompa
Finding motifs using random projections. RECOMB (2001)
Saurabh Sinha, Martin Tompa
A Statistical Method for Finding Transcription Factor Binding Sites. ISMB (2000)
Mathieu Blanchette, Benno Schwikowski, Martin Tompa
An Exact Algorithm to Identify Motifs in Orthologous Sequences from Multiple Species. ISMB (2000)
Walter L. Ruzzo, Martin Tompa
A Linear Time Algorithm for Finding All Maximal Scoring Subsequences. ISMB (1999)
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) (1999)
Martin Tompa
An Exact Method for Finding Short Motifs in Sequences, with Application to the Ribosome Binding Site Problem. ISMB (1999)
Emily Rocke, Martin Tompa
An algorithm for finding novel gapped motifs in DNA sequences. RECOMB (1998)
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) (1996)
Donald D. Chinn, Frank Thomson Leighton, Martin Tompa
Minimal Adaptive Routing on the Mesh with Bounded Queue Size. J. Parallel Distributed Comput. 34 (2) (1996)
Jonathan F. Buss, Martin Tompa
Lower Bounds on Universal Traversal Sequences Based on Chains of Length Five Inf. Comput. 120 (2) (1995)
Donald D. Chinn, Frank Thomson Leighton, Martin Tompa
Minimal Adaptive Routing on the Mesh with Bounded Queue Size. SPAA (1994)
Prasoon Tiwari, Martin Tompa
A Direct Version of Shamir and Snir's Lower Bounds on Monotone Circuit Depth. Inf. Process. Lett. 49 (5) (1994)
Paul Beame, Martin Tompa, Peiyuan Yan
Communication-Space Tradeoffs for Unrestricted Protocols. SIAM J. Comput. 23 (3) (1994)
Martin Tompa
Lower Bounds on Universal Traversal Sequences for Cycles and Other Low Degree Graphs. SIAM J. Comput. 21 (6) (1992)
Allan Borodin, Walter L. Ruzzo, Martin Tompa
Lower Bounds on the Length of Universal Traversal Sequences. J. Comput. Syst. Sci. 45 (2) (1992)
Tak Wah Lam, Prasoon Tiwari, Martin Tompa
Trade-Offs between Communication and Space. J. Comput. Syst. Sci. 45 (3) (1992)
Ashok K. Chandra, Martin Tompa
The complexity of short two-person games. Discret. Appl. Math. 29 (1) (1990)
Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa
Time-Space Tradeoffs for Undirected Graph Traversal FOCS (1990)
Martin Tompa
Figures of merit: the sequel. SIGACT News 21 (4) (1990)
Paul Beame, Martin Tompa, Peiyuan Yan
Communication-Space Tradeoffs for Unrestricted Protocols FOCS (1990)
Allan Borodin, Walter L. Ruzzo, Martin Tompa
Lower Bounds on the Length of Universal Traversal Sequences (Detailed Abstract) STOC (1989)
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) (1989)
Don Coppersmith, Prabhakar Raghavan, Martin Tompa
Parallel Graph Algorithms That Are Efficient on Average Inf. Comput. 81 (3) (1989)
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) (1989)
H. Venkateswaran, Martin Tompa
A New Pebble Game That Characterizes Parallel Complexity Classes. SIAM J. Comput. 18 (3) (1989)
Martin Tompa
Figures of merit. SIGACT News 20 (1) (1989)
Tak Wah Lam, Prasoon Tiwari, Martin Tompa
Tradeoffs Between Communication and Space STOC (1989)
Martin Tompa
Zero Knowledge Interactive Proofs of Knowledge (A Digest). TARK (1988)
Martin Tompa, Heather Woll
How to Share a Secret with Cheaters. J. Cryptol. 1 (2) (1988)
Faith E. Fich, Martin Tompa
The parallel complexity of exponentiating polynomials over finite fields. J. ACM 35 (3) (1988)
Allan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo, Martin Tompa
Two applications of complementation via inductive counting. Computational Complexity Conference (1988)
Martin Tompa, Heather Woll
Random Self-Reducibility and Zero Knowledge Interactive Proofs of Possession of Information FOCS (1987)
Don Coppersmith, Prabhakar Raghavan, Martin Tompa
Parallel Graph Algorithms that Are Efficient on Average FOCS (1987)
Martin Tompa, Heather Woll
How to Share a Secret with Cheaters. CRYPTO (1986)
H. Venkateswaran, Martin Tompa
A New Pebble Game that Characterizes Parallel Complexity Classes FOCS (1986)
Patrick W. Dymond, Martin Tompa
Speedups of Deterministic Machines by Synchronous Parallel Machines. J. Comput. Syst. Sci. 30 (2) (1985)
Allan Borodin, Ronald Fagin, John E. Hopcroft, Martin Tompa
Decreasing the Nesting Depth of Expressions Involving Square Roots. J. Symb. Comput. 1 (2) (1985)
Udi Manber, Martin Tompa
The Complexity of Problems on Probabilistic Nondeterministic, and Alternating Decision Trees J. ACM 32 (3) (1985)
Faith E. Fich, Martin Tompa
The Parallel Complexity of Exponentiating Polynomials over Finite Fields STOC (1985)
Udi Manber, Martin Tompa
The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem. SIAM J. Comput. 13 (1) (1984)
Walter L. Ruzzo, Janos Simon, Martin Tompa
Space-Bounded Hierarchies and Probabilistic Computations. J. Comput. Syst. Sci. 28 (2) (1984)
Patrick W. Dymond, Martin Tompa
Speedups of Deterministic Machines by Synchronous Parallel Machines STOC (1983)
Walter L. Ruzzo, Janos Simon, Martin Tompa
Space-Bounded Hierarchies and Probabilistic Computations STOC (1982)
Martin Tompa
Two Familiar Transitive Closure Algorithms Which Admit No Polynomial Time, Sublinear Space Implementations. SIAM J. Comput. 11 (1) (1982)
Udi Manber, Martin Tompa
Probabilistic, Nondeterministic, and Alternating Decision Trees STOC (1982)
Udi Manber, Martin Tompa
The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem FOCS (1981)
Martin Tompa
Corrigendum: Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of Their Circuits. J. Comput. Syst. Sci. 23 (1) (1981)
Martin Tompa
An Optimal Solution to a Wire-Routing Problem. J. Comput. Syst. Sci. 23 (2) (1981)
Martin Tompa
An Extension of Savitch's Theorem to Small Space Bounds. Inf. Process. Lett. 12 (2) (1981)
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) (1981)
Martin Tompa
Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of Their Circuits. J. Comput. Syst. Sci. 20 (2) (1980)
Martin Tompa
Two Familiar Transitive Closure Algorithms which Admit No Polynomial Time, Sublinear Space Implementations STOC (1980)
Martin Tompa
An Optimal Solution to a Wire-Routing Problem (Preliminary Version) STOC (1980)
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)
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) (1979)
Martin Tompa
Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of their Circuits STOC (1978)