Ragnar Groot Koerkamp

Orcid: 0000-0002-2091-1237

According to our database1, Ragnar Groot Koerkamp authored at least 12 papers between 2019 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
The open-closed mod-minimizer algorithm.
Algorithms Mol. Biol., December, 2025

Compressing Suffix Trees by Path Decompositions.
CoRR, June, 2025

SimdMinimizers: Computing Random Minimizers, fast.
Proceedings of the 23rd International Symposium on Experimental Algorithms, 2025

PtrHash: Minimal Perfect Hashing at RAM Throughput.
Proceedings of the 23rd International Symposium on Experimental Algorithms, 2025

U-Index: A Universal Indexing Framework for Matching Long Patterns.
Proceedings of the 23rd International Symposium on Experimental Algorithms, 2025

2024
OCMu64.
Dataset, December, 2024

RagnarGrootKoerkamp/astar-pairwise-aligner.
Dataset, November, 2024

The {mod-minimizer}: A Simple and Efficient Sampling Algorithm for Long k-Mers.
Proceedings of the 24th International Workshop on Algorithms in Bioinformatics, 2024

A*PA2: Up to 19× Faster Exact Global Alignment.
Proceedings of the 24th International Workshop on Algorithms in Bioinformatics, 2024

PACE Solver Description: OCMu64, a Solver for One-Sided Crossing Minimization.
Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

2021
On rainbow-free colourings of uniform hypergraphs.
Theor. Comput. Sci., 2021

2019
Stable gonality is computable.
Discret. Math. Theor. Comput. Sci., 2019


  Loading...