You have Guest access.
Log In
Jan Vahrenhold
Front matter
1
Parallelism in Current and Future Processors – Challenges and Support for Designing Optimal Algorithms (Invited Talk)
2
From Streaming B-Trees to Tokutek: How a Theoretician Learned to be VP of Engineering (Invited Talk)
3-15
Experimental Comparisons of Derivative Free Optimization Algorithms (Invited Talk)
16-27
On Computational Models for Flash Memory Devices
28-39
Competitive Buffer Management with Stochastic Packet Arrivals
40-50
Fast and Accurate Bounds on Linear Programs
51-62
Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study
63-75
Rotated-Box Trees: A Lightweight c-Oriented Bounding-Volume Hierarchy
76-88
psort, Yet Another Fast Stable Sorting Software
89-100
A Heuristic for Fair Correlation-Aware Resource Placement
101-112
Measuring the Similarity of Geometric Graphs
113-124
A Heuristic Strong Connectivity Algorithm for Large Graphs
125-136
Pareto Paths with SHARC
137-148
An Application of Self-organizing Data Structures to Compression
149-160
Scheduling Additional Trains on Dense Corridors
161-172
Broadword Computing and Fibonacci Code Speed Up Compressed Suffix Arrays
173-184
Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion Games
185-196
Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching (Extended Abstract)
197-208
Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow
209-220
Univariate Algebraic Kernel and Application to Arrangements
221-232
Fast Algorithm for Graph Isomorphism Testing
233-244
Algorithms and Experiments for Clique Relaxations—Finding Maximum s-Plexes
245-256
A Design-for-Yield Algorithm to Assess and Improve the Structural and Energetic Robustness of Proteins and Drugs
257-268
Multi-level Algorithms for Modularity Clustering
269-280
Bulk-Insertion Sort: Towards Composite Measures of Presortedness
281-292
Computing Elevation Maxima by Searching the Gauss Sphere
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info