UID:
almahu_9948153768202882
Format:
PDFs (182 pages) :
,
illustrations
ISBN:
9781611972931
Content:
The aim of ALENEX is to provide a forum for the presentation of original research in the design, implementation, and experimental evaluation of algorithms and data structures. Typical submissions will include an extensive experimental analysis of nontrivial algorithmic results, ideally bridging the gap between theory and practice. We also invite submissions that address methodological issues and standards in the experimental evaluation of algorithms and data structures. Some possible areas of applied algorithmic research include but are not limited to databases; networks, including web applications; operations research; and computational problems in the natural sciences or engineering. Submissions are encouraged that address algorithms and data structures for advanced models of computing including memory hierarchies and parallel computing, ranging from instruction parallelism over multicore computing to exascale and cloud computing.
Note:
Efficient algorithms for dualizing large-scale hypergraphs / Keisuke Murakami and Takeaki Uno -- A min-edge cost flow framework for capacitated covering problems / Jessica Chang and Samir Khuller -- Short and simple cycle separators in planar graphs / Eli Fox-Epstein, Shay Mozes, Phitchaya Mangpo Phothilimthana, and Christian Sommer -- Polynomial-time construction of contraction hierarchies for multi-criteria objectives / Stefan Funke and Sabine Storandt -- Engineering Java 7's dual pivot quicksort using MaLiJAn / Sebastian Wild, Markus Nebel, Raphael Reitzig, and Ulrich Laube -- 3D kinetic alpha complexes and their implementation / Michael Kerber and Herbert Edelsbrunner -- Computational topology and normal surfaces : Theoretical and experimental complexity bounds / Benjamin A. Burton, João Paixão, and Jonathan Spreer -- Inducing suffix and LCP arrays in external memory / Timo Bingmann, Johannes Fischer, and Vitaly Osipov -- Lempel-Ziv factorization : simple, fast, practical / Dominik Kempa and Simon J. Puglisi -- Fast packed string matching for short patterns / Simone Faro and M. Oğuzhan Külekci -- On parallelizing matrix multiplication by the column-row method / Andrea Campagna, Konstantin Kutzkov, and Rasmus Pagh -- Robust gossip-based aggregation : a practical point of view / Gerhard Niederbrucker and Wilfried N. Gansterer -- The cost of address translation / Tomasz Jurkiewicz and Kurt Mehlhorn -- On unifying the space of ℓ0-sampling algorithms / Graham Cormode and Donatella Firmani -- Practical batch-updatable external hashing with sorting / Hyeontaek Lim, David G. Andersen, and Michael Kaminsky.
,
Also available in print version.
,
Mode of access: World Wide Web.
,
System requirements: Adobe Acrobat Reader.
Additional Edition:
Print version: ISBN 9781611972535
Language:
English
Keywords:
Konferenzschrift
URL:
Volltext
(URL des Erstveröffentlichers)
Bookmarklink