ALENEX A

16 papers

YearTitle / Authors
20133D kinetic alpha complexes and their implementation.
Michael Kerber, Herbert Edelsbrunner
2013A Min-Edge Cost Flow Framework for Capacitated Covering Problems.
Jessica Chang, Samir Khuller
2013Computational topology and normal surfaces: Theoretical and experimental complexity bounds.
Benjamin A. Burton, João Paixão, Jonathan Spreer
2013Efficient algorithms for dualizing large-scale hypergraphs.
Keisuke Murakami, Takeaki Uno
2013Engineering Java 7's Dual Pivot Quicksort Using MaLiJan.
Sebastian Wild, Markus E. Nebel, Raphael Reitzig, Ulrich Laube
2013Fast Packed String Matching for Short Patterns.
Simone Faro, M. Oguzhan Külekci
2013Inducing Suffix and Lcp Arrays in External Memory.
Timo Bingmann, Johannes Fischer, Vitaly Osipov
2013Lempel-Ziv factorization: Simple, fast, practical.
Dominik Kempa, Simon J. Puglisi
2013On Unifying the Space of ℓ
Graham Cormode, Donatella Firmani
2013On parallelizing matrix multiplication by the column-row method.
Andrea Campagna, Konstantin Kutzkov, Rasmus Pagh
2013Polynomial-time construction of contraction hierarchies for multi-criteria objectives.
Stefan Funke, Sabine Storandt
2013Practical Batch-Updatable External Hashing with Sorting.
Hyeontaek Lim, David G. Andersen, Michael Kaminsky
2013Proceedings of the 15th Meeting on Algorithm Engineering and Experiments, ALENEX 2013, New Orleans, Louisiana, USA, January 7, 2013
Peter Sanders, Norbert Zeh
2013Robust gossip-based aggregation: A practical point of view.
Gerhard Niederbrucker, Wilfried N. Gansterer
2013Short and Simple Cycle Separators in Planar Graphs.
Eli Fox-Epstein, Shay Mozes, Phitchaya Mangpo Phothilimthana, Christian Sommer
2013The cost of address translation.
Tomasz Jurkiewicz, Kurt Mehlhorn