Abstract is missing.
- Parallelism in Current and Future Processors - Challenges and Support for Designing Optimal AlgorithmsHeinz Bast. 1 [doi]
- From Streaming B-Trees to Tokutek: How a Theoretician Learned to be VP of EngineeringMichael A. Bender. 2 [doi]
- Experimental Comparisons of Derivative Free Optimization AlgorithmsAnne Auger, Nikolaus Hansen, J. M. Perez Zerpa, Raymond Ros, Marc Schoenauer. 3-15 [doi]
- On Computational Models for Flash Memory DevicesDeepak Ajwani, Andreas Beckmann, Riko Jacob, Ulrich Meyer, Gabriel Moruz. 16-27 [doi]
- Competitive Buffer Management with Stochastic Packet ArrivalsKamal Al-Bawani, Alexander Souza. 28-39 [doi]
- Fast and Accurate Bounds on Linear ProgramsErnst Althaus, Daniel Dumitriu. 40-50 [doi]
- Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental StudyReinhard Bauer, Dorothea Wagner. 51-62 [doi]
- Rotated-Box Trees: A Lightweight c-Oriented Bounding-Volume HierarchyMark de Berg, Peter Hachenberger. 63-75 [doi]
- psort, Yet Another Fast Stable Sorting SoftwarePaolo Bertasi, Marco Bressan 0002, Enoch Peserico. 76-88 [doi]
- A Heuristic for Fair Correlation-Aware Resource PlacementRaouf Boutaba, Martin Karsten, Maxwell Young. 89-100 [doi]
- Measuring the Similarity of Geometric GraphsOtfried Cheong, Joachim Gudmundsson, Hyo-Sil Kim, Daria Schymura, Fabian Stehn. 101-112 [doi]
- A Heuristic Strong Connectivity Algorithm for Large GraphsAdan Cosgaya-Lozano, Norbert Zeh. 113-124 [doi]
- Pareto Paths with SHARCDaniel Delling, Dorothea Wagner. 125-136 [doi]
- An Application of Self-organizing Data Structures to CompressionReza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro. 137-148 [doi]
- Scheduling Additional Trains on Dense CorridorsHolger Flier, Thomas Graffagnino, Marc Nunkesser. 149-160 [doi]
- Broadword Computing and Fibonacci Code Speed Up Compressed Suffix ArraysSimon Gog. 161-172 [doi]
- Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion GamesMatthias Kirschner, Philipp Schengbier, Tobias Tscheuschner. 173-184 [doi]
- Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-MatchingLasse Kliemann, Anand Srivastav. 185-196 [doi]
- Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and FlowKevin J. Lang, Michael W. Mahoney, Lorenzo Orecchia. 197-208 [doi]
- Univariate Algebraic Kernel and Application to ArrangementsSylvain Lazard, Luis Mariano Peñaranda, Elias P. Tsigaridas. 209-220 [doi]
- Fast Algorithm for Graph Isomorphism TestingJosé Luis López-Presa, Antonio Fernández Anta. 221-232 [doi]
- Algorithms and Experiments for Clique Relaxations-Finding Maximum s-PlexesHannes Moser, Rolf Niedermeier, Manuel Sorge. 233-244 [doi]
- A Design-for-Yield Algorithm to Assess and Improve the Structural and Energetic Robustness of Proteins and DrugsGiuseppe Nicosia, Giovanni Stracquadanio. 245-256 [doi]
- Multi-level Algorithms for Modularity ClusteringAndreas Noack, Randolf Rotta. 257-268 [doi]
- Bulk-Insertion Sort: Towards Composite Measures of PresortednessRiku Saikkonen, Eljas Soisalon-Soininen. 269-280 [doi]
- Computing Elevation Maxima by Searching the Gauss SphereBei Wang, Herbert Edelsbrunner, Dmitriy Morozov. 281-292 [doi]