John Tromp

According to our database1, John Tromp authored at least 50 papers between 1989 and 2016.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
Nearest Neighbor Interchange and Related Distances.
Encyclopedia of Algorithms, 2016

A Googolplex of Go Games.
Proceedings of the Computers and Games - 9th International Conference, 2016

The Number of Legal Go Positions.
Proceedings of the Computers and Games - 9th International Conference, 2016

2015
Cuckoo Cycle: A Memory Bound Graph-Theoretic Proof-of-Work.
Proceedings of the Financial Cryptography and Data Security, 2015

2014
Cuckoo Cycle: a memory-hard proof-of-work system.
IACR Cryptology ePrint Archive, 2014

2008
Nearest Neighbor Interchange and Related Distances.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

2007
Prefix Reversals on Binary and Ternary Strings.
SIAM J. Discrete Math., 2007

Computing exact P-values for DNA motifs.
Bioinformatics, 2007

The Complexity of the Single Individual SNP Haplotyping Problem.
Algorithmica, 2007

2006
Binary Lambda Calculus and Combinatory Logic.
Proceedings of the Kolmogorov Complexity and Applications, 29.01. - 03.02.2006, 2006

Combinatorics of Go.
Proceedings of the Computers and Games, 5th International Conference, 2006

2005
Limits of Rush Hour Logic Complexity
CoRR, 2005

On the Complexity of Several Haplotyping Problems.
Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005

2004
Patternhunter Ii: Highly Sensitive and Fast Homology Search.
J. Bioinformatics and Computational Biology, 2004

On spaced seeds for similarity search.
Discrete Applied Mathematics, 2004

2003
Sharpening Occam's razor.
Inf. Process. Lett., 2003

A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint.
Proceedings of the IJCAI-03, 2003

2002
Correction to "Algorithmic statistics".
IEEE Trans. Information Theory, 2002

Randomized two-process wait-free test-and-set.
Distributed Computing, 2002

PatternHunter: faster and more sensitive homology search.
Bioinformatics, 2002

DNACompress: fast and effective DNA sequence compression.
Bioinformatics, 2002

A Protocol for Randomized Anonymous Two-process Wait-free Test-and-Set with Finite-state Verification.
Proceedings of the SIROCCO 9, 2002

2001
Algorithmic statistics.
IEEE Trans. Information Theory, 2001

On a Generalized Ruin Problem.
Proceedings of the Approximation, 2001

Time and Space Bounds for Reversible Simulation.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000
Cellular Gravity.
Parallel Processing Letters, 2000

Ladders Are PSPACE-Complete.
Proceedings of the Computers and Games, Second International Conference, 2000

Towards an Algorithmic Statistics.
Proceedings of the Algorithmic Learning Theory, 11th International Conference, 2000

1999
Kolmogorov Random Graphs and the Incompressibility Method.
SIAM J. Comput., 1999

Mutual Search.
J. ACM, 1999

On the Linear-Cost Subtree-Transfer Distance between Phylogenetic Trees.
Algorithmica, 1999

On computing the nearest neighbor interchange distance.
Proceedings of the Discrete Mathematical Problems with Medical Applications, 1999

1998
Mutual Search (Extended Abstract).
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

1997
Small Weight Bases for Hamming Codes.
Theor. Comput. Sci., 1997

Inferring a DNA Sequence from Erroneous Copies.
Theor. Comput. Sci., 1997

Reversible Simulation of Irreversible Computation by Pebble Games
CoRR, 1997

On Distances between Phylogenetic Trees (Extended Abstract).
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996
On the Vector Space of the Automatic Reals.
Theor. Comput. Sci., 1996

How to Share Concurrent Wait-Free Variables.
J. ACM, 1996

Lower Bounds on Learning Decision Lists and Trees.
Inf. Comput., 1996

Some Notes on the Nearest Neighbour Interchange Distance.
Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995
Subword Complexity of a Generalized Thue-Morse Word.
Inf. Process. Lett., 1995

Lower Bounds on Learning Decision Lists and Trees (Extended Abstract).
Proceedings of the STACS 95, 1995

Inferring a DNA Sequence from Erroneous Copies (Abstract).
Proceedings of the Algorithmic Learning Theory, 6th International Conference, 1995

1994
Linear Approximation of Shortest Superstrings.
J. ACM, 1994

1993
On Update-Last Schemes.
Parallel Processing Letters, 1993

Binary Snapshots.
Proceedings of the Distributed Algorithms, 7th International Workshop, 1993

1992
Wait-free Test-and-Set (Extended Abstract).
Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

Associative Storage Modification Machines.
Proceedings of the Complexity Theory: Current Research, 1992

1989
How to Construct an Atomic Variable (Extended Abstract).
Proceedings of the Distributed Algorithms, 1989


  Loading...