Experimental algorithms

InhaltsverzeichnisParallelism in Current and Future Processors – Challenges and Support for Designing Optimal Algorithms.From Streaming B-Trees to Tokutek: How a Theoretician Learned to be VP of Engineering.Experimental Comparisons of Derivative Free Optimization Algorithms.On Computational Models for Flash Memory Devices.Competitive Buffer Management with Stochastic Packet Arrivals.Fast and Accurate Bounds on Linear Programs.Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study.Rotated-Box Trees: A Lightweight c-Oriented Bounding-Volume Hierarchy.psort, Yet Another Fast Stable Sorting Software.A Heuristic for Fair Correlation-Aware Resource Placement.Measuring the Similarity of Geometric Graphs.A Heuristic Strong Connectivity Algorithm for Large Graphs.Pareto Paths with SHARC.An Application of Self-organizing Data Structures to Compression.Scheduling Additional Trains on Dense Corridors.Broadword Computing and Fibonacci Code Speed Up Compressed Suffix Arrays.Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion Games.Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching.Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow.Univariate Algebraic Kernel and Application to Arrangements.Fast Algorithm for Graph Isomorphism Testing.Algorithms and Experiments for Clique Relaxations—Finding Maximum s-Plexes.A Design-for-Yield Algorithm to Assess and Improve the Structural and Energetic Robustness of Proteins and Drugs.Multi-level Algorithms for Modularity Clustering.Bulk-Insertion Sort: Towards Composite Measures of Presortedness.Computing Elevation Maxima by Searching the Gauss Sphere.