default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn Tromp
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[c25]John Tromp:
The Number of Legal Go Positions. Computers and Games 2016: 183-190- [c24]Matthieu Walraet, John Tromp:
A Googolplex of Go Games. Computers and Games 2016: 191-201 - [r2]Bhaskar DasGupta, Xin He, Ming Li, John Tromp, Louxin Zhang:
Nearest Neighbor Interchange and Related Distances. Encyclopedia of Algorithms 2016: 1402-1405 - 2015
- [c23]John Tromp:
Cuckoo Cycle: A Memory Bound Graph-Theoretic Proof-of-Work. Financial Cryptography Workshops 2015: 49-62 - 2014
- [i9]John Tromp:
Cuckoo Cycle: a memory-hard proof-of-work system. IACR Cryptol. ePrint Arch. 2014: 59 (2014)
2000 – 2009
- 2008
- [r1]Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, John Tromp, Louxin Zhang:
Nearest Neighbor Interchange and Related Distances. Encyclopedia of Algorithms 2008 - 2007
- [j23]Rudi Cilibrasi
, Leo van Iersel, Steven Kelk, John Tromp:
The Complexity of the Single Individual SNP Haplotyping Problem. Algorithmica 49(1): 13-36 (2007) - [j22]Jing Zhang, Bo Jiang, Ming Li, John Tromp, Xuegong Zhang, Michael Q. Zhang:
Computing exact P-values for DNA motifs. Bioinform. 23(5): 531-537 (2007) - [j21]Cor A. J. Hurkens, Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie, John Tromp:
Prefix Reversals on Binary and Ternary Strings. SIAM J. Discret. Math. 21(3): 592-611 (2007) - [c22]Cor A. J. Hurkens, Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie, John Tromp:
Prefix Reversals on Binary and Ternary Strings. AB 2007: 292-306 - 2006
- [c21]John Tromp, Gunnar Farnebäck:
Combinatorics of Go. Computers and Games 2006: 84-99 - [i8]John Tromp:
Binary Lambda Calculus and Combinatory Logic. Kolmogorov Complexity and Applications 2006 - 2005
- [c20]Rudi Cilibrasi, Leo van Iersel, Steven Kelk, John Tromp:
On the Complexity of Several Haplotyping Problems. WABI 2005: 128-139 - [i7]John Tromp, Rudi Cilibrasi:
Limits of Rush Hour Logic Complexity. CoRR abs/cs/0502068 (2005) - 2004
- [j20]Uri Keich, Ming Li, Bin Ma, John Tromp:
On spaced seeds for similarity search. Discret. Appl. Math. 138(3): 253-263 (2004) - [j19]Ming Li, Bin Ma, Derek Kisman, John Tromp:
Patternhunter Ii: Highly Sensitive and Fast Homology Search. J. Bioinform. Comput. Biol. 2(3): 417-440 (2004) - 2003
- [j18]Ming Li, John Tromp, Paul M. B. Vitányi:
Sharpening Occam's razor. Inf. Process. Lett. 85(5): 267-274 (2003) - [c19]Alejandro López-Ortiz, Claude-Guy Quimper, John Tromp, Peter van Beek:
A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint. IJCAI 2003: 245-250 - 2002
- [j17]Bin Ma, John Tromp, Ming Li:
PatternHunter: faster and more sensitive homology search. Bioinform. 18(3): 440-445 (2002) - [j16]Xin Chen, Ming Li, Bin Ma, John Tromp:
DNACompress: fast and effective DNA sequence compression. Bioinform. 18(12): 1696-1698 (2002) - [j15]John Tromp, Paul M. B. Vitányi:
Randomized two-process wait-free test-and-set. Distributed Comput. 15(3): 127-135 (2002) - [j14]Péter Gács, John Tromp, Paul M. B. Vitányi:
Correction to "Algorithmic statistics". IEEE Trans. Inf. Theory 48(8): 2427 (2002) - [c18]Ming Li, John Tromp, Paul M. B. Vitányi:
Sharpening Occam's Razor. COCOON 2002: 411-419 - [c17]John Tromp, Paul M. B. Vitányi:
A Protocol for Randomized Anonymous Two-process Wait-free Test-and-Set with Finite-state Verification. SIROCCO 2002: 275-291 - [i6]Ming Li, John Tromp, Paul M. B. Vitányi:
Sharpening Occam's Razor. CoRR cs.LG/0201005 (2002) - 2001
- [j13]Péter Gács, John Tromp, Paul M. B. Vitányi:
Algorithmic statistics. IEEE Trans. Inf. Theory 47(6): 2443-2463 (2001) - [c16]Harry Buhrman, John Tromp, Paul M. B. Vitányi:
Time and Space Bounds for Reversible Simulation. ICALP 2001: 1017-1027 - [c15]Kazuyuki Amano, John Tromp, Paul M. B. Vitányi, Osamu Watanabe:
On a Generalized Ruin Problem. RANDOM-APPROX 2001: 181-191 - [i5]John Tromp, Paul M. B. Vitányi:
Randomized Two-Process Wait-Free Test-and-Set. CoRR cs.DC/0106056 (2001) - [i4]Harry Buhrman, John Tromp, Paul M. B. Vitányi:
Time and Space Bounds for Reversible Simulation. CoRR quant-ph/0101133 (2001) - 2000
- [j12]Frédéric Gruau, John Tromp:
Cellular Gravity. Parallel Process. Lett. 10(4): 383-393 (2000) - [c14]Péter Gács, John Tromp, Paul M. B. Vitányi:
Towards an Algorithmic Statistics. ALT 2000: 41-55 - [c13]Marcel Crâsmaru, John Tromp:
Ladders Are PSPACE-Complete. Computers and Games 2000: 241-249 - [i3]Péter Gács, John Tromp, Paul M. B. Vitányi:
Algorithmic Statistics. CoRR math.PR/0006233 (2000)
1990 – 1999
- 1999
- [j11]Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, John Tromp:
On the Linear-Cost Subtree-Transfer Distance between Phylogenetic Trees. Algorithmica 25(2-3): 176-195 (1999) - [j10]Harry Buhrman, Matthew K. Franklin, Juan A. Garay, Jaap-Henk Hoepman, John Tromp, Paul M. B. Vitányi:
Mutual Search. J. ACM 46(4): 517-536 (1999) - [j9]Harry Buhrman, Ming Li, John Tromp, Paul M. B. Vitányi:
Kolmogorov Random Graphs and the Incompressibility Method. SIAM J. Comput. 29(2): 590-599 (1999) - [c12]Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, John Tromp, Louxin Zhang:
On computing the nearest neighbor interchange distance. Discrete Mathematical Problems with Medical Applications 1999: 125-143 - [i2]Harry Buhrman, Matthew K. Franklin, Juan A. Garay, Jaap-Henk Hoepman, John Tromp, Paul M. B. Vitányi:
Mutual Search. CoRR cs.DS/9902005 (1999) - 1998
- [c11]Harry Buhrman, Matthew K. Franklin, Juan A. Garay, Jaap-Henk Hoepman, John Tromp, Paul M. B. Vitányi:
Mutual Search (Extended Abstract). SODA 1998: 481-489 - 1997
- [j8]John Tromp, Louxin Zhang, Ying Zhao:
Small Weight Bases for Hamming Codes. Theor. Comput. Sci. 181(2): 337-345 (1997) - [j7]John D. Kececioglu, Ming Li, John Tromp:
Inferring a DNA Sequence from Erroneous Copies. Theor. Comput. Sci. 185(1): 3-13 (1997) - [c10]Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, John Tromp, Louxin Zhang:
On Distances between Phylogenetic Trees (Extended Abstract). SODA 1997: 427-436 - [i1]Ming Li, John Tromp, Paul M. B. Vitányi:
Reversible Simulation of Irreversible Computation by Pebble Games. CoRR quant-ph/9703009 (1997) - 1996
- [j6]Thomas R. Hancock, Tao Jiang, Ming Li, John Tromp:
Lower Bounds on Learning Decision Lists and Trees. Inf. Comput. 126(2): 114-122 (1996) - [j5]Ming Li, John Tromp, Paul M. B. Vitányi:
How to Share Concurrent Wait-Free Variables. J. ACM 43(4): 723-746 (1996) - [j4]Siegfried Lehr, Jeffrey O. Shallit, John Tromp:
On the Vector Space of the Automatic Reals. Theor. Comput. Sci. 163(1&2): 193-210 (1996) - [c9]Ming Li, John Tromp, Louxin Zhang:
Some Notes on the Nearest Neighbour Interchange Distance. COCOON 1996: 343-351 - 1995
- [j3]John Tromp, Jeffrey O. Shallit:
Subword Complexity of a Generalized Thue-Morse Word. Inf. Process. Lett. 54(6): 313-316 (1995) - [c8]John D. Kececioglu, Ming Li, John Tromp:
Inferring a DNA Sequence from Erroneous Copies (Abstract). ALT 1995: 151-152 - [c7]John Tromp, Louxin Zhang, Ying Zhao:
Small Weight Bases for Hamming Codes. COCOON 1995: 235-243 - [c6]Thomas R. Hancock, Tao Jiang, Ming Li, John Tromp:
Lower Bounds on Learning Decision Lists and Trees (Extended Abstract). STACS 1995: 527-538 - [d1]John Tromp:
Connect-4. UCI Machine Learning Repository, 1995
- 1994
- [j2]Avrim Blum, Tao Jiang, Ming Li, John Tromp, Mihalis Yannakakis:
Linear Approximation of Shortest Superstrings. J. ACM 41(4): 630-647 (1994) - 1993
- [j1]John Tromp:
On Update-Last Schemes. Parallel Process. Lett. 3: 25-28 (1993) - [c5]Jaap-Henk Hoepman, John Tromp:
Binary Snapshots. WDAG 1993: 18-25 - 1992
- [c4]John Tromp, Peter van Emde Boas:
Associative Storage Modification Machines. Complexity Theory: Current Research 1992: 291-313 - [c3]Yehuda Afek, Eli Gafni, John Tromp, Paul M. B. Vitányi:
Wait-free Test-and-Set (Extended Abstract). WDAG 1992: 85-94 - 1991
- [c2]Avrim Blum, Tao Jiang, Ming Li, John Tromp, Mihalis Yannakakis:
Linear Approximation of Shortest Superstrings. STOC 1991: 328-336
1980 – 1989
- 1989
- [c1]John Tromp:
How to Construct an Atomic Variable (Extended Abstract). WDAG 1989: 292-302
Coauthor Index
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-06-19 21:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
