


default search action
ACM Journal of Experimental Algorithmics, Volume 25
Volume 25, November 2020
- Michael Mitzenmacher, Salvatore Pontarelli, Pedro Reviriego
:
Adaptive Cuckoo Filters. 1-20 - Jakob L. Andersen
, Daniel Merkle:
A Generic Framework for Engineering Graph Canonization Algorithms. 1-26 - Thomas Mueller Graf
, Daniel Lemire
:
Xor Filters. 1-16 - Allan Borodin, Christodoulos Karavasilis, Denis Pankratov:
An Experimental Study of Algorithms for Online Bipartite Matching. 1-37 - Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer:
Hyperbolic Embeddings for Near-Optimal Greedy Routing. 1-18 - Alathea Jensen
, Isabel Beichl:
A Sequential Importance Sampling Algorithm for Counting Linear Extensions. 1-14 - Guillaume Escamocher, Barry O'Sullivan, Steven David Prestwich:
Generating Difficult CNF Instances in Unexplored Constrainedness Regions. 1-12 - Panagiotis Charalampopoulos
, Costas S. Iliopoulos, Chang Liu, Solon P. Pissis
:
Property Suffix Array with Applications in Indexing Weighted Sequences. 1-16 - Alexandra Henzinger, Alexander Noe
, Christian Schulz
:
ILP-Based Local Search for Graph Partitioning. 1-26 - Miguel Coviello Gonzalez, Marek Chrobak:
A Waste-Efficient Algorithm for Single-Droplet Sample Preparation on Microfluidic Chips. 1-22 - Konrad von Kirchbach, Christian Schulz
, Jesper Larsson Träff:
Better Process Mapping and Sparse Quadratic Assignment. 1-19 - Rebecca J. Stones, Raúl M. Falcón
, Daniel Kotlar
, Trent G. Marbach
:
Computing Autotopism Groups of Partial Latin Rectangles. 1-39 - Shunsuke Kanda
, Dominik Köppl
, Yasuo Tabei, Kazuhiro Morita, Masao Fuketa:
Dynamic Path-decomposed Tries. 1-28 - Jacob Focke, Nicole Megow, Julie Meißner:
Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments. 1-20

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.