![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
ALENEX 2013: New Orleans, Louisiana, USA
- Peter Sanders, Norbert Zeh:
Proceedings of the 15th Meeting on Algorithm Engineering and Experiments, ALENEX 2013, New Orleans, Louisiana, USA, January 7, 2013. SIAM 2013, ISBN 978-1-61197-253-5
Session 1
- Keisuke Murakami, Takeaki Uno:
Efficient algorithms for dualizing large-scale hypergraphs. 1-13 - Jessica Chang, Samir Khuller:
A Min-Edge Cost Flow Framework for Capacitated Covering Problems. 14-25 - Eli Fox-Epstein, Shay Mozes
, Phitchaya Mangpo Phothilimthana, Christian Sommer:
Short and Simple Cycle Separators in Planar Graphs. 26-40 - Stefan Funke, Sabine Storandt:
Polynomial-time construction of contraction hierarchies for multi-criteria objectives. 41-54 - Sebastian Wild
, Markus E. Nebel, Raphael Reitzig, Ulrich Laube:
Engineering Java 7's Dual Pivot Quicksort Using MaLiJan. 55-69
Session 2
- Michael Kerber, Herbert Edelsbrunner:
3D kinetic alpha complexes and their implementation. 70-77 - Benjamin A. Burton
, João Paixão, Jonathan Spreer
:
Computational topology and normal surfaces: Theoretical and experimental complexity bounds. 78-87 - Timo Bingmann, Johannes Fischer, Vitaly Osipov:
Inducing Suffix and Lcp Arrays in External Memory. 88-102 - Dominik Kempa
, Simon J. Puglisi
:
Lempel-Ziv factorization: Simple, fast, practical. 103-112 - Simone Faro
, M. Oguzhan Külekci
:
Fast Packed String Matching for Short Patterns. 113-121
Session 3
- Andrea Campagna, Konstantin Kutzkov
, Rasmus Pagh:
On parallelizing matrix multiplication by the column-row method. 122-132 - Gerhard Niederbrucker, Wilfried N. Gansterer:
Robust gossip-based aggregation: A practical point of view. 133-147 - Tomasz Jurkiewicz, Kurt Mehlhorn:
The cost of address translation. 148-162 - Graham Cormode
, Donatella Firmani
:
On Unifying the Space of ℓ0-Sampling Algorithms. 163-172 - Hyeontaek Lim, David G. Andersen, Michael Kaminsky:
Practical Batch-Updatable External Hashing with Sorting. 173-182
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.