default search action
ALENEX 2017: Barcelona, Spain
- Sándor P. Fekete, Vijaya Ramachandran:
Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2017, Barcelona, Spain, Hotel Porta Fira, January 17-18, 2017. SIAM 2017, ISBN 978-1-61197-476-8 - Michael Stein, Karsten Weihe, Augustin Wilberg, Roland Kluge, Julian M. Klomp, Mathias Schnee, Lin Wang, Max Mühlhäuser:
Distributed Graph-based Topology Adaptation using Motif Signatures. 1-12 - Jouni Sirén:
Indexing Variation Graphs. 13-27 - Yaroslav Akhremtsev, Tobias Heuer, Peter Sanders, Sebastian Schlag:
Engineering a direct k-way Hypergraph Partitioning Algorithm. 28-42 - Nilakantha Paudel, Loukas Georgiadis, Giuseppe F. Italiano:
Computing Critical Nodes in Directed Graphs. 43-57 - Michael Hamann
, Ulrich Meyer, Manuel Penschuck, Dorothea Wagner:
I/O-efficient Generation of Massive Graphs Following the LFR Benchmark. 58-72 - Simon Gog, Alistair Moffat, Matthias Petri:
CSA++: Fast Pattern Search for Large Alphabets. 73-82 - Michael Axtmann, Peter Sanders:
Robust Massively Parallel Sorting. 83-97 - Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
Engineering External Memory Induced Suffix Sorting. 98-108 - Andreas Poyias, Simon J. Puglisi, Rajeev Raman
Compact Dynamic Rewritable (CDRW) Arrays. 109-119 - Johannes Fischer, Florian Kurpicz
Engineering a Distributed Full-Text Index. 120-134 - Julian Labeit, Simon Gog:
Elias-Fano meets Single-Term Top-k Document Retrieval. 135-145 - Preethi Lahoti, Patrick K. Nicholson
Efficient Set Intersection Counting Algorithm for Text Similarity Measures. 146-158 - Jan Dean Catarata, Scott Corbett, Harry Stern
The Moser-Tardos Resample algorithm: Where is the limit? (an experimental inquiry). 159-171 - Christopher Musco
Determining Tournament Payout Structures for Daily Fantasy Sports. 172-184 - Stefan Funke, Thomas Mendel, Alexander Miller, Sabine Storandt, Maria Wiebe:
Map Simplification with Topology Constraints: Exactly and in Practice. 185-196 - Saverio Basso, Alberto Ceselli:
Asynchronous Column Generation. 197-206 - Daniel Funke, Peter Sanders:
Parallel d-D Delaunay Triangulations in Shared and Distributed Memory. 207-217 - Peyman Afshani, Mark de Berg, Henri Casanova, Benjamin Karsin, Colin Lambrechts, Nodari Sitchinava, Constantinos Tsirogiannis:
An Efficient Algorithm for the 1D Total Visibility-Index Problem. 218-231 - Frank Staals, Constantinos Tsirogiannis:
Computing the Expected Value and Variance of Geometric Measures. 232-246 - Daniel Bahrdt, Michael Becher, Stefan Funke, Filip Krumpe, André Nusser, Martin Seybold
Growing Balls in ℝd. 247-258 - Lars Arge, Mathias Rav, Sarfraz Raza, Morten Revsbæk:
I/O-Efficient Event Based Depression Flood Risk. 259-269
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.
last updated on 2025-01-09 19:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: