The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Martin Tompa: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  66. How accurately is ncRNA aligned within whole-genome multiple alignments? [Citation Graph (, )][DBLP]


  67. Algorithms for locating extremely conserved elements in multiple sequence alignments. [Citation Graph (, )][DBLP]


  68. The complexity of short two-person games. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.010secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002