World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
35
Citations
9159
World Ranking
11457
National Ranking
4705

Overview

Martin Tompa is affiliated with the University of Washington in the United States. This association places them within a major research institution known for a diverse range of academic disciplines and scholarly activities.

The available data does not list specific research papers authored by Martin Tompa, nor does it provide details on frequent co-authors, publication venues, or book publications. Similarly, no information is given regarding main fields of study, subfields, or primary topics of research.

There are no awards or recognitions documented in the provided data, and Martin Tompa is currently living.

Best Publications

  • Assessing computational tools for the discovery of transcription factor binding sites.

    Martin Tompa;Nan Li;Timothy L. Bailey;George M. Church

  • Finding motifs using random projections.

    Jeremy Buhler;Martin Tompa

  • How to share a secret with cheaters

    M. Tompa;H. Woll

  • Discovery of regulatory elements by a computational method for phylogenetic footprinting.

    Mathieu Blanchette;Martin Tompa

  • YMF: a program for discovery of novel transcription factor binding sites by statistical overrepresentation

    Saurabh Sinha;Martin Tompa

  • Random self-reducibility and zero knowledge interactive proofs of possession of information

    Martin Tompa;Heather Woll

  • A Statistical Method for Finding Transcription Factor Binding Sites

    Saurabh Sinha;Martin Tompa

  • Discovery of novel transcription factor binding sites by statistical overrepresentation

    Saurabh Sinha;Martin Tompa

  • An Exact Method for Finding Short Motifs in Sequences, with Application to the Ribosome Binding Site Problem

    Martin Tompa

  • PhyME: a probabilistic algorithm for finding motifs in sets of orthologous sequences.

    Saurabh Sinha;Mathieu Blanchette;Martin Tompa

  • FootPrinter: a program designed for phylogenetic footprinting

    Mathieu Blanchette;Martin Tompa

  • Algorithms for phylogenetic footprinting.

    Mathieu Blanchette;Benno Schwikowski;Martin Tompa

  • Time-space tradeoffs for computing functions, using connectivity properties of their circuits

    Martin Tompa

  • Space-bounded hierarchies and probabilistic computations

    Walter L. Ruzzo;Janos Simon;Martin Tompa

  • Two applications of inductive counting for complementation problems

    A. Borodin;S. A. Cook;P. W. Dymond;W. L. Ruzzo

  • A Linear Time Algorithm for Finding All Maximal Scoring Subsequences

    Walter L. Ruzzo;Martin Tompa

  • A time-space tradeoff for sorting on non-oblivious machines

    Allan Borodin;Michael J. Fischer;David G. Kirkpatrick;Nancy A. Lynch

  • A Computational Pipeline for High- Throughput Discovery of cis-Regulatory Noncoding RNA in Prokaryotes

    Zizhen Yao;Jeffrey Barrick;Zasha Weinberg;Shane J. Neph

  • Analysis of computational approaches for motif discovery.

    Nan Li;Martin Tompa

  • An optimal solution to a wire-routing problem☆

    Martin Tompa

  • A time-space tradeoff for sorting on non-oblivious machines☆

    Allan Borodin;Michael J. Fischer;David G. Kirkpatrick;Nancy A. Lynch

Frequent Co-Authors

Walter L. Ruzzo
Walter L. Ruzzo University of Washington
Allan Borodin
Allan Borodin University of Toronto
Saurabh Sinha
Saurabh Sinha University of Illinois at Urbana-Champaign
Mathieu Blanchette
Mathieu Blanchette McGill University
Paul Beame
Paul Beame University of Washington
Prabhakar Raghavan
Prabhakar Raghavan Google (United States)
Michael J. Fischer
Michael J. Fischer Yale University
David G. Kirkpatrick
David G. Kirkpatrick University of British Columbia
Stephen A. Cook
Stephen A. Cook University of Toronto
Zizhen Yao
Zizhen Yao Allen Institute for Brain Science

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science opens doors to numerous online degree options and career trajectories. Many students consider expanding their expertise by enrolling in related fields that offer strong job prospects and flexible learning. For those interested in the intersection of computation and mechanics, an online degree in mechanical engineering can provide valuable skills in design and automation.

If mathematical modeling and scientific research appeal to you, you may want to look into earning an online bachelor's degree in physics. Both disciplines frequently intersect with computer science and lead to exciting roles in research and technology.

In today’s data-driven world, understanding analytics is increasingly important. Those curious about advanced computing and statistics can explore what is the cheapest data science course in the us? to find accessible pathways into this fast-growing field.

Additionally, those drawn to electronics and innovation should consider taking online electrical engineering courses USA. Each of these online degree options enables you to tailor your computer science studies and build a specialized career for the digital age.

Best Scientists Citing Martin Tompa

Recently Published Articles