The following pages link to Peter Sanders (Q181233):
Displaying 50 items.
- HordeSat: A Massively Parallel Portfolio SAT Solver (Q3453220) (← links)
- Linear work suffix array construction (Q3455222) (← links)
- Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks (Q3506418) (← links)
- Semi-external LTL Model Checking (Q3512515) (← links)
- (Q3574265) (← links)
- (Q3574267) (← links)
- n-Level Graph Partitioning (Q3586469) (← links)
- Engineering Route Planning Algorithms (Q3637315) (← links)
- Towards Optimal Range Medians (Q3638057) (← links)
- (Q4218150) (← links)
- (Q4252046) (← links)
- (Q4295381) (← links)
- (Q4321597) (← links)
- (Q4417669) (← links)
- (Q4417674) (← links)
- (Q4417679) (← links)
- (Q4418656) (← links)
- (Q4428989) (← links)
- (Q4449231) (← links)
- Randomized Receiver Initiated Load-balancing Algorithms for Tree-shaped Computations (Q4456206) (← links)
- Tail Bounds and Expectations for Random Arc Allocation and Applications (Q4471154) (← links)
- (Q4536962) (← links)
- Efficient Parallel Random Sampling—Vectorized, Cache-Efficient, and Online (Q4581396) (← links)
- Scalable Parallel Suffix Array Construction (Q4643558) (← links)
- (Q4673406) (← links)
- (Q4737171) (← links)
- (Q4796704) (← links)
- (Q4799373) (← links)
- (Q4813150) (← links)
- Δ-stepping: a parallelizable shortest path algorithm (Q4820907) (← links)
- Efficient Route Compression for Hybrid Route Planning (Q4916036) (← links)
- (Q4952709) (← links)
- An asymptotic approximation scheme for multigraph edge coloring (Q4962714) (← links)
- Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies (Q4984867) (← links)
- Towards optimal locality in mesh-indexings (Q5055949) (← links)
- Parallel Weighted Random Sampling (Q5075804) (← links)
- In-Place Parallel Super Scalar Samplesort (IPSSSSo) (Q5111694) (← links)
- Dynamic Space Efficient Hashing. (Q5111747) (← links)
- Network Flow-Based Refinement for Multilevel Hypergraph Partitioning (Q5140705) (← links)
- Scalable Shared-Memory Hypergraph Partitioning (Q5147518) (← links)
- Fast, Exact and Scalable Dynamic Ridesharing (Q5147530) (← links)
- Minimum time-dependent travel times with contraction hierarchies (Q5178737) (← links)
- Sequential and Parallel Algorithms and Data Structures (Q5232044) (← links)
- (Semi-)External Algorithms for Graph Partitioning and Clustering (Q5232520) (← links)
- <i>k</i>-way Hypergraph Partitioning via <i>n</i>-Level Recursive Bisection (Q5232546) (← links)
- Engineering a direct <i>k</i>-way Hypergraph Partitioning Algorithm (Q5232562) (← links)
- Robust Massively Parallel Sorting (Q5232566) (← links)
- Engineering a Distributed Full-Text Index (Q5232570) (← links)
- Parallel <i>d</i>-D Delaunay Triangulations in Shared and Distributed Memory (Q5232581) (← links)
- Intersection in Integer Inverted Indices (Q5233493) (← links)
