Остановите войну!
for scientists:
default search action
Martin Tompa
- > Home > Persons > Martin Tompa
Publications
- 2009
- [j45]Huei-Hun Elizabeth Tseng, Martin Tompa:
Algorithms for locating extremely conserved elements in multiple sequence alignments. BMC Bioinform. 10: 432 (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
- [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) - 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) - 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 - 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 - 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) - 1990
- [j21]Ashok K. Chandra, Martin Tompa:
The complexity of short two-person games. Discret. Appl. Math. 29(1): 21-33 (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 - 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) - [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) - [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 - 1987
- [c13]Don Coppersmith, Prabhakar Raghavan, Martin Tompa:
Parallel Graph Algorithms that Are Efficient on Average. FOCS 1987: 260-269 - 1986
- [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
- [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
- [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) - [c5]Udi Manber, Martin Tompa:
The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem. FOCS 1981: 220-227 - 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
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-25 05:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint