John Tromp

Proceedings of the Computers and Games - 9th International Conference, 2016

The Number of Legal Go Positions.

[BibT_eX]

[DOI]

Proceedings of the Computers and Games - 9th International Conference, 2016

2015

Cuckoo Cycle: A Memory Bound Graph-Theoretic Proof-of-Work.

[BibT_eX]

[DOI]

Proceedings of the Financial Cryptography and Data Security, 2015

2014

Cuckoo Cycle: a memory-hard proof-of-work system.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

2008

Nearest Neighbor Interchange and Related Distances.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

2007

Prefix Reversals on Binary and Ternary Strings.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2007

Computing exact <i>P</i>-values for DNA motifs.

[BibT_eX]

[DOI]

Bioinform., 2007

The Complexity of the Single Individual SNP Haplotyping Problem.

[BibT_eX]

[DOI]

Algorithmica, 2007

2006

Binary Lambda Calculus and Combinatory Logic.

[BibT_eX]

[DOI]

Proceedings of the Kolmogorov Complexity and Applications, 29.01. - 03.02.2006, 2006

Combinatorics of Go.

[BibT_eX]

[DOI]

Gunnar Farnebäck

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

2005

Limits of Rush Hour Logic Complexity

[BibT_eX]

[DOI]

Rudi Cilibrasi

CoRR, 2005

On the Complexity of Several Haplotyping Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005

2004

Patternhunter Ii: Highly Sensitive and Fast Homology Search.

[BibT_eX]

[DOI]

J. Bioinform. Comput. Biol., 2004

On spaced seeds for similarity search.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

2003

Sharpening Occam's razor.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint.

[BibT_eX]

[DOI]

Alejandro López-Ortiz

Claude-Guy Quimper

Peter van Beek

Proceedings of the IJCAI-03, 2003

2002

Correction to "Algorithmic statistics".

[BibT_eX]

[DOI]

Péter Gács

IEEE Trans. Inf. Theory, 2002

Randomized two-process wait-free test-and-set.

[BibT_eX]

[DOI]

Distributed Comput., 2002

PatternHunter: faster and more sensitive homology search.

[BibT_eX]

[DOI]

Bin Ma

Bioinform., 2002

DNACompress: fast and effective DNA sequence compression.

[BibT_eX]

[DOI]

Bioinform., 2002

A Protocol for Randomized Anonymous Two-process Wait-free Test-and-Set with Finite-state Verification.

[BibT_eX]

Proceedings of the SIROCCO 9, 2002

2001

Algorithmic statistics.

[BibT_eX]

[DOI]

Péter Gács

IEEE Trans. Inf. Theory, 2001

On a Generalized Ruin Problem.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2001

Time and Space Bounds for Reversible Simulation.

[BibT_eX]

[DOI]

Harry Buhrman

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000

Cellular Gravity.

[BibT_eX]

[DOI]

Frédéric Gruau

Parallel Process. Lett., 2000

Ladders Are PSPACE-Complete.

[BibT_eX]

[DOI]

Marcel Crâsmaru

Proceedings of the Computers and Games, Second International Conference, 2000

Towards an Algorithmic Statistics.

[BibT_eX]

[DOI]

Péter Gács

Proceedings of the Algorithmic Learning Theory, 11th International Conference, 2000

1999

Kolmogorov Random Graphs and the Incompressibility Method.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

Mutual Search.

[BibT_eX]

[DOI]

J. ACM, 1999

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

[BibT_eX]

[DOI]

Algorithmica, 1999

On computing the nearest neighbor interchange distance.

[BibT_eX]

[DOI]

Proceedings of the Discrete Mathematical Problems with Medical Applications, 1999

1998

Mutual Search (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

1997

Small Weight Bases for Hamming Codes.

[BibT_eX]

[DOI]

Louxin Zhang

Ying Zhao

Theor. Comput. Sci., 1997

Inferring a DNA Sequence from Erroneous Copies.

[BibT_eX]

[DOI]

John D. Kececioglu

Theor. Comput. Sci., 1997

Reversible Simulation of Irreversible Computation by Pebble Games

[BibT_eX]

[DOI]

CoRR, 1997

On Distances between Phylogenetic Trees (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996

On the Vector Space of the Automatic Reals.

[BibT_eX]

[DOI]

Siegfried Lehr

Jeffrey O. Shallit

Theor. Comput. Sci., 1996

How to Share Concurrent Wait-Free Variables.

[BibT_eX]

[DOI]

J. ACM, 1996

Lower Bounds on Learning Decision Lists and Trees.

[BibT_eX]

[DOI]

Inf. Comput., 1996

Some Notes on the Nearest Neighbour Interchange Distance.

[BibT_eX]

[DOI]

Louxin Zhang

Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995

Connect-4.

[BibT_eX]

[DOI]

Dataset, February, 1995

Subword Complexity of a Generalized Thue-Morse Word.

[BibT_eX]

[DOI]

Jeffrey O. Shallit

Inf. Process. Lett., 1995

Lower Bounds on Learning Decision Lists and Trees (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the STACS 95, 1995

Inferring a DNA Sequence from Erroneous Copies (Abstract).

[BibT_eX]

[DOI]

John D. Kececioglu

Proceedings of the Algorithmic Learning Theory, 6th International Conference, 1995

1994

Linear Approximation of Shortest Superstrings.

[BibT_eX]

[DOI]

J. ACM, 1994

1993

On Update-Last Schemes.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1993

Binary Snapshots.

[BibT_eX]

[DOI]

Jaap-Henk Hoepman

Proceedings of the Distributed Algorithms, 7th International Workshop, 1993

1992

Wait-free Test-and-Set (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

Associative Storage Modification Machines.

[BibT_eX]

Peter van Emde Boas

Proceedings of the Complexity Theory: Current Research, 1992

1989

How to Construct an Atomic Variable (Extended Abstract).

[BibT_eX]

[DOI]