Martin Tompa - RankMe

76 papers A* 17A 4B 4C 2Misc 2Journal 45Unranked 2

Year	Rank	Type	Title / Venue / Authors
2009	J	`jnl`	Algorithms for locating extremely conserved elements in multiple sequence alignments. BMC Bioinform. Huei-Hun Elizabeth Tseng, Martin Tompa
2009	J	`jnl`	Assessing the Discordance of Multiple Sequence Alignments. IEEE ACM Trans. Comput. Biol. Bioinform. Amol Prakash, Martin Tompa
2009	J	`jnl`	Meta-analysis of Inter-species Liver Co-expression Networks Elucidates Traits Associated with Common Human Diseases. PLoS Comput. Biol. Kai Wang, Manikandan Narayanan, Hua Zhong, Martin Tompa, Eric E. Schadt, Jun Zhu
2007	J	`jnl`	A Computational Pipeline for High- Throughput Discovery of PLoS Comput. Biol. Zizhen Yao, Jeffrey E. Barrick, Zasha Weinberg, Shane J. Neph, Ronald R. Breaker, Martin Tompa, Walter L. Ruzzo
2007	J	`jnl`	How accurately is ncRNA aligned within whole-genome multiple alignments? BMC Bioinform. Adrienne X. Wang, Walter L. Ruzzo, Martin Tompa
2006	J	`jnl`	Analysis of computational approaches for motif discovery. Algorithms Mol. Biol. Nan Li, Martin Tompa
2006	J	`jnl`	MicroFootPrinter: a tool for phylogenetic footprinting in prokaryotic genomes. Nucleic Acids Res. Shane J. Neph, Martin Tompa
2005	—	`conf`	Statistics of local multiple alignments. ISMB (Supplement of Bioinformatics) Amol Prakash, Martin Tompa
2004	Misc	`conf`	Motif Discovery in Heterogeneous Sequence Data. Pacific Symposium on Biocomputing Amol Prakash, Mathieu Blanchette, Saurabh Sinha, Martin Tompa
2004	J	`jnl`	PhyME: A probabilistic algorithm for finding motifs in sets of orthologous sequences. BMC Bioinform. Saurabh Sinha, Mathieu Blanchette, Martin Tompa
2003	C	`conf`	An Empirical Comparison of Tools for Phylogenetic Footprinting. BIBE Mathieu Blanchette, Samson Kwong, Martin Tompa
2003	J	`jnl`	FootPrinter: a program designed for phylogenetic footprinting. Nucleic Acids Res. Mathieu Blanchette, Martin Tompa
2003	C	`conf`	Performance Comparison of Algorithms for FindingTranscription Factor Binding Sites. BIBE Saurabh Sinha, Martin Tompa
2003	J	`jnl`	YMF: a program for discovery of novel transcription factor binding sites by statistical overrepresentation. Nucleic Acids Res. Saurabh Sinha, Martin Tompa
2002	J	`jnl`	Algorithms for Phylogenetic Footprinting. J. Comput. Biol. Mathieu Blanchette, Benno Schwikowski, Martin Tompa
2002	J	`jnl`	Construction of optimal quality control for oligo arrays. Bioinform. Charles J. Colbourn, Alan C. H. Ling, Martin Tompa
2002	J	`jnl`	Finding Motifs Using Random Projections. J. Comput. Biol. Jeremy Buhler, Martin Tompa
2002	J	`jnl`	Quality Control in Manufacturing Oligo Arrays: A Combinatorial Design Approach. J. Comput. Biol. Rimli Sengupta, Martin Tompa
2001	J	`jnl`	Equireplicate Balanced Binary Codes for Oligo Arrays. SIAM J. Discret. Math. Noga Alon, Charles J. Colbourn, Alan C. H. Ling, Martin Tompa
2001	B	`conf`	Finding motifs using random projections. RECOMB Jeremy Buhler, Martin Tompa
2001	Misc	`conf`	Quality Control in Manufacturing Oligo Arrays: A Combinatorial Design Approach. Pacific Symposium on Biocomputing Rimli Sengupta, Martin Tompa
2000	A	`conf`	A Statistical Method for Finding Transcription Factor Binding Sites. ISMB Saurabh Sinha, Martin Tompa
2000	A	`conf`	An Exact Algorithm to Identify Motifs in Orthologous Sequences from Multiple Species. ISMB Mathieu Blanchette, Benno Schwikowski, Martin Tompa
1999	A	`conf`	A Linear Time Algorithm for Finding All Maximal Scoring Subsequences. ISMB Walter L. Ruzzo, Martin Tompa
1999	J	`jnl`	A Time-Space Tradeoff for Undirected Graph Traversal by Walking Automata. SIAM J. Comput. Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa
1999	A	`conf`	An Exact Method for Finding Short Motifs in Sequences, with Application to the Ribosome Binding Site Problem. ISMB Martin Tompa
1998	B	`conf`	An algorithm for finding novel gapped motifs in DNA sequences. RECOMB Emily Rocke, Martin Tompa
1996	J	`jnl`	Minimal Adaptive Routing on the Mesh with Bounded Queue Size. J. Parallel Distributed Comput. Donald D. Chinn, Frank Thomson Leighton, Martin Tompa
1996	J	`jnl`	Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata. Inf. Comput. Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa
1995	J	`jnl`	Lower Bounds on Universal Traversal Sequences Based on Chains of Length Five Inf. Comput. Jonathan F. Buss, Martin Tompa
1994	J	`jnl`	A Direct Version of Shamir and Snir's Lower Bounds on Monotone Circuit Depth. Inf. Process. Lett. Prasoon Tiwari, Martin Tompa
1994	J	`jnl`	Communication-Space Tradeoffs for Unrestricted Protocols. SIAM J. Comput. Paul Beame, Martin Tompa, Peiyuan Yan
1994	B	`conf`	Minimal Adaptive Routing on the Mesh with Bounded Queue Size. SPAA Donald D. Chinn, Frank Thomson Leighton, Martin Tompa
1992	J	`jnl`	Lower Bounds on Universal Traversal Sequences for Cycles and Other Low Degree Graphs. SIAM J. Comput. Martin Tompa
1992	J	`jnl`	Lower Bounds on the Length of Universal Traversal Sequences. J. Comput. Syst. Sci. Allan Borodin, Walter L. Ruzzo, Martin Tompa
1992	J	`jnl`	Trade-Offs between Communication and Space. J. Comput. Syst. Sci. Tak Wah Lam, Prasoon Tiwari, Martin Tompa
1990	A*	`conf`	Communication-Space Tradeoffs for Unrestricted Protocols FOCS Paul Beame, Martin Tompa, Peiyuan Yan
1990	J	`jnl`	Figures of merit: the sequel. SIGACT News Martin Tompa
1990	J	`jnl`	The complexity of short two-person games. Discret. Appl. Math. Ashok K. Chandra, Martin Tompa
1990	A*	`conf`	Time-Space Tradeoffs for Undirected Graph Traversal FOCS Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa
1989	J	`jnl`	A New Pebble Game That Characterizes Parallel Complexity Classes. SIAM J. Comput. H. Venkateswaran, Martin Tompa
1989	J	`jnl`	Erratum: Two Applications of Inductive Counting for Complementation Problems. SIAM J. Comput. Allan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo, Martin Tompa
1989	J	`jnl`	Figures of merit. SIGACT News Martin Tompa
1989	A*	`conf`	Lower Bounds on the Length of Universal Traversal Sequences (Detailed Abstract) STOC Allan Borodin, Walter L. Ruzzo, Martin Tompa
1989	J	`jnl`	Parallel Graph Algorithms That Are Efficient on Average Inf. Comput. Don Coppersmith, Prabhakar Raghavan, Martin Tompa
1989	A*	`conf`	Tradeoffs Between Communication and Space STOC Tak Wah Lam, Prasoon Tiwari, Martin Tompa
1989	J	`jnl`	Two Applications of Inductive Counting for Complementation Problems. SIAM J. Comput. Allan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo, Martin Tompa
1988	J	`jnl`	How to Share a Secret with Cheaters. J. Cryptol. Martin Tompa, Heather Woll
1988	J	`jnl`	The parallel complexity of exponentiating polynomials over finite fields. J. ACM Faith E. Fich, Martin Tompa
1988	—	`conf`	Two applications of complementation via inductive counting. SCT Allan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo, Martin Tompa
1988	B	`conf`	Zero Knowledge Interactive Proofs of Knowledge (A Digest). TARK Martin Tompa
1987	A*	`conf`	Parallel Graph Algorithms that Are Efficient on Average FOCS Don Coppersmith, Prabhakar Raghavan, Martin Tompa
1987	A*	`conf`	Random Self-Reducibility and Zero Knowledge Interactive Proofs of Possession of Information FOCS Martin Tompa, Heather Woll
1986	A*	`conf`	A New Pebble Game that Characterizes Parallel Complexity Classes FOCS H. Venkateswaran, Martin Tompa
1986	A*	`conf`	How to Share a Secret with Cheaters. CRYPTO Martin Tompa, Heather Woll
1985	J	`jnl`	Decreasing the Nesting Depth of Expressions Involving Square Roots. J. Symb. Comput. Allan Borodin, Ronald Fagin, John E. Hopcroft, Martin Tompa
1985	J	`jnl`	Speedups of Deterministic Machines by Synchronous Parallel Machines. J. Comput. Syst. Sci. Patrick W. Dymond, Martin Tompa
1985	J	`jnl`	The Complexity of Problems on Probabilistic Nondeterministic, and Alternating Decision Trees J. ACM Udi Manber, Martin Tompa
1985	A*	`conf`	The Parallel Complexity of Exponentiating Polynomials over Finite Fields STOC Faith E. Fich, Martin Tompa
1984	J	`jnl`	Space-Bounded Hierarchies and Probabilistic Computations. J. Comput. Syst. Sci. Walter L. Ruzzo, Janos Simon, Martin Tompa
1984	J	`jnl`	The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem. SIAM J. Comput. Udi Manber, Martin Tompa
1983	A*	`conf`	Speedups of Deterministic Machines by Synchronous Parallel Machines STOC Patrick W. Dymond, Martin Tompa
1982	A*	`conf`	Probabilistic, Nondeterministic, and Alternating Decision Trees STOC Udi Manber, Martin Tompa
1982	A*	`conf`	Space-Bounded Hierarchies and Probabilistic Computations STOC Walter L. Ruzzo, Janos Simon, Martin Tompa
1982	J	`jnl`	Two Familiar Transitive Closure Algorithms Which Admit No Polynomial Time, Sublinear Space Implementations. SIAM J. Comput. Martin Tompa
1981	J	`jnl`	A Time-Space Tradeoff for Sorting on Non-Oblivious Machines. J. Comput. Syst. Sci. Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa
1981	J	`jnl`	An Extension of Savitch's Theorem to Small Space Bounds. Inf. Process. Lett. Martin Tompa
1981	J	`jnl`	An Optimal Solution to a Wire-Routing Problem. J. Comput. Syst. Sci. Martin Tompa
1981	J	`jnl`	Corrigendum: Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of Their Circuits. J. Comput. Syst. Sci. Martin Tompa
1981	A*	`conf`	The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem FOCS Udi Manber, Martin Tompa
1980	A*	`conf`	An Optimal Solution to a Wire-Routing Problem (Preliminary Version) STOC Martin Tompa
1980	J	`jnl`	Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of Their Circuits. J. Comput. Syst. Sci. Martin Tompa
1980	A*	`conf`	Two Familiar Transitive Closure Algorithms which Admit No Polynomial Time, Sublinear Space Implementations STOC Martin Tompa
1979	A*	`conf`	A Time-Space Tradeoff for Sorting on Non-Oblivious Machines FOCS Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa
1979	J	`jnl`	A time-space tradeoff for sorting and related non-oblivious computations. SIGACT News Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa
1978	A*	`conf`	Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of their Circuits STOC Martin Tompa