A time-space tradeoff for sorting and related non-oblivious computations. - Allan Borodin; Michael J. Fischer; David G. Kirkpatrick; Nancy A. Lynch; Martin Tompa (SIGACT News, 1979)

An Optimal Solution to a Wire-Routing Problem (Preliminary Version) - Martin Tompa (STOC, 1980)

Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of Their Circuits. - Martin Tompa (J. Comput. Syst. Sci., 1980)

An Extension of Savitch's Theorem to Small Space Bounds. - Martin Tompa (Inf. Process. Lett., 1981)

A Time-Space Tradeoff for Sorting on Non-Oblivious Machines. - Allan Borodin; Michael J. Fischer; David G. Kirkpatrick; Nancy A. Lynch; Martin Tompa (J. Comput. Syst. Sci., 1981)

Corrigendum: Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of Their Circuits. - Martin Tompa (J. Comput. Syst. Sci., 1981)

An Optimal Solution to a Wire-Routing Problem. - Martin Tompa (J. Comput. Syst. Sci., 1981)

Probabilistic, Nondeterministic, and Alternating Decision Trees - Udi Manber; Martin Tompa (STOC, 1982)

Two Familiar Transitive Closure Algorithms Which Admit No Polynomial Time, Sublinear Space Implementations. - Martin Tompa (SIAM J. Comput., 1982)

Space-Bounded Hierarchies and Probabilistic Computations. - Walter L. Ruzzo; Janos Simon; Martin Tompa (J. Comput. Syst. Sci., 1984)

The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem. - Udi Manber; Martin Tompa (SIAM J. Comput., 1984)

Speedups of Deterministic Machines by Synchronous Parallel Machines. - Patrick W. Dymond; Martin Tompa (J. Comput. Syst. Sci., 1985)

Decreasing the Nesting Depth of Expressions Involving Square Roots. - Allan Borodin; Ronald Fagin; John E. Hopcroft; Martin Tompa (J. Symb. Comput., 1985)

The Complexity of Problems on Probabilistic Nondeterministic, and Alternating Decision Trees - Udi Manber; Martin Tompa (J. ACM, 1985)

Random Self-Reducibility and Zero Knowledge Interactive Proofs of Possession of Information - Martin Tompa; Heather Woll (FOCS, 1987)

Two applications of complementation via inductive counting. - Allan Borodin; Stephen A. Cook; Patrick W. Dymond; Walter L. Ruzzo; Martin Tompa (SCT, 1988)

Zero Knowledge Interactive Proofs of Knowledge (A Digest). - Martin Tompa (TARK, 1988)

The parallel complexity of exponentiating polynomials over finite fields. - Faith E. Fich; Martin Tompa (J. ACM, 1988)

How to Share a Secret with Cheaters. - Martin Tompa; Heather Woll (J. Cryptol., 1988)

Lower Bounds on the Length of Universal Traversal Sequences (Detailed Abstract) - Allan Borodin; Walter L. Ruzzo; Martin Tompa (STOC, 1989)

Tradeoffs Between Communication and Space - Tak Wah Lam; Prasoon Tiwari; Martin Tompa (STOC, 1989)

Two Applications of Inductive Counting for Complementation Problems. - Allan Borodin; Stephen A. Cook; Patrick W. Dymond; Walter L. Ruzzo; Martin Tompa (SIAM J. Comput., 1989)

Erratum: Two Applications of Inductive Counting for Complementation Problems. - Allan Borodin; Stephen A. Cook; Patrick W. Dymond; Walter L. Ruzzo; Martin Tompa (SIAM J. Comput., 1989)

A New Pebble Game That Characterizes Parallel Complexity Classes. - H. Venkateswaran; Martin Tompa (SIAM J. Comput., 1989)

Figures of merit. - Martin Tompa (SIGACT News, 1989)

Parallel Graph Algorithms That Are Efficient on Average - Don Coppersmith; Prabhakar Raghavan; Martin Tompa (Inf. Comput., 1989)

Time-Space Tradeoffs for Undirected Graph Traversal - Paul Beame; Allan Borodin; Prabhakar Raghavan; Walter L. Ruzzo; Martin Tompa (FOCS, 1990)

The complexity of short two-person games. - Ashok K. Chandra; Martin Tompa (Discret. Appl. Math., 1990)

Figures of merit: the sequel. - Martin Tompa (SIGACT News, 1990)

Lower Bounds on the Length of Universal Traversal Sequences. - Allan Borodin; Walter L. Ruzzo; Martin Tompa (J. Comput. Syst. Sci., 1992)

Trade-Offs between Communication and Space. - Tak Wah Lam; Prasoon Tiwari; Martin Tompa (J. Comput. Syst. Sci., 1992)

Lower Bounds on Universal Traversal Sequences for Cycles and Other Low Degree Graphs. - Martin Tompa (SIAM J. Comput., 1992)

A Direct Version of Shamir and Snir's Lower Bounds on Monotone Circuit Depth. - Prasoon Tiwari; Martin Tompa (Inf. Process. Lett., 1994)

Communication-Space Tradeoffs for Unrestricted Protocols. - Paul Beame; Martin Tompa; Peiyuan Yan (SIAM J. Comput., 1994)

Lower Bounds on Universal Traversal Sequences Based on Chains of Length Five - Jonathan F. Buss; Martin Tompa (Inf. Comput., 1995)

Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata. - Paul Beame; Allan Borodin; Prabhakar Raghavan; Walter L. Ruzzo; Martin Tompa (Inf. Comput., 1996)

Minimal Adaptive Routing on the Mesh with Bounded Queue Size. - Donald D. Chinn; Frank Thomson Leighton; Martin Tompa (J. Parallel Distributed Comput., 1996)

An algorithm for finding novel gapped motifs in DNA sequences. - Emily Rocke; Martin Tompa (RECOMB, 1998)

A Linear Time Algorithm for Finding All Maximal Scoring Subsequences. - Walter L. Ruzzo; Martin Tompa (ISMB, 1999)

An Exact Method for Finding Short Motifs in Sequences, with Application to the Ribosome Binding Site Problem. - Martin Tompa (ISMB, 1999)

A Time-Space Tradeoff for Undirected Graph Traversal by Walking Automata. - Paul Beame; Allan Borodin; Prabhakar Raghavan; Walter L. Ruzzo; Martin Tompa (SIAM J. Comput., 1999)

An Exact Algorithm to Identify Motifs in Orthologous Sequences from Multiple Species. - Mathieu Blanchette; Benno Schwikowski; Martin Tompa (ISMB, 2000)

A Statistical Method for Finding Transcription Factor Binding Sites. - Saurabh Sinha; Martin Tompa (ISMB, 2000)

Equireplicate Balanced Binary Codes for Oligo Arrays. - Noga Alon; Charles J. Colbourn; Alan C. H. Ling; Martin Tompa (SIAM J. Discret. Math., 2001)

Construction of optimal quality control for oligo arrays. - Charles J. Colbourn; Alan C. H. Ling; Martin Tompa (Bioinform., 2002)

Algorithms for Phylogenetic Footprinting. - Mathieu Blanchette; Benno Schwikowski; Martin Tompa (J. Comput. Biol., 2002)

Finding Motifs Using Random Projections. - Jeremy Buhler; Martin Tompa (J. Comput. Biol., 2002)

Quality Control in Manufacturing Oligo Arrays: A Combinatorial Design Approach. - Rimli Sengupta; Martin Tompa (J. Comput. Biol., 2002)

An Empirical Comparison of Tools for Phylogenetic Footprinting. - Mathieu Blanchette; Samson Kwong; Martin Tompa (BIBE, 2003)

Performance Comparison of Algorithms for FindingTranscription Factor Binding Sites. - Saurabh Sinha; Martin Tompa (BIBE, 2003)

FootPrinter: a program designed for phylogenetic footprinting. - Mathieu Blanchette; Martin Tompa (Nucleic Acids Res., 2003)

YMF: a program for discovery of novel transcription factor binding sites by statistical overrepresentation. - Saurabh Sinha; Martin Tompa (Nucleic Acids Res., 2003)

Motif Discovery in Heterogeneous Sequence Data. - Amol Prakash; Mathieu Blanchette; Saurabh Sinha; Martin Tompa (Pacific Symposium on Biocomputing, 2004)

PhyME: A probabilistic algorithm for finding motifs in sets of orthologous sequences. - Saurabh Sinha; Mathieu Blanchette; Martin Tompa (BMC Bioinform., 2004)

Statistics of local multiple alignments. - Amol Prakash; Martin Tompa (ISMB (Supplement of Bioinformatics), 2005)

Analysis of computational approaches for motif discovery. - Nan Li; Martin Tompa (Algorithms Mol. Biol., 2006)

MicroFootPrinter: a tool for phylogenetic footprinting in prokaryotic genomes. - Shane J. Neph; Martin Tompa (Nucleic Acids Res., 2006)

How accurately is ncRNA aligned within whole-genome multiple alignments? - Adrienne X. Wang; Walter L. Ruzzo; Martin Tompa (BMC Bioinform., 2007)

A Computational Pipeline for High- Throughput Discovery of cis-Regulatory Noncoding RNA in Prokaryotes. - Zizhen Yao; Jeffrey E. Barrick; Zasha Weinberg; Shane J. Neph; Ronald R. Breaker; Martin Tompa; Walter L. Ruzzo (PLoS Comput. Biol., 2007)

Algorithms for locating extremely conserved elements in multiple sequence alignments. - Huei-Hun Elizabeth Tseng; Martin Tompa (BMC Bioinform., 2009)

Meta-analysis of Inter-species Liver Co-expression Networks Elucidates Traits Associated with Common Human Diseases. - Kai Wang 045; Manikandan Narayanan; Hua Zhong; Martin Tompa; Eric E. Schadt; Jun Zhu (PLoS Comput. Biol., 2009)

Assessing the Discordance of Multiple Sequence Alignments. - Amol Prakash; Martin Tompa (IEEE ACM Trans. Comput. Biol. Bioinform., 2009)