The following pages link to Peter Sanders (Q181233):
Displaying 50 items.
- (Q269738) (redirect page) (← links)
- Scalable generation of scale-free graphs (Q269740) (← links)
- Random permutations on distributed, external and hierarchical memory (Q293386) (← links)
- (Q398833) (redirect page) (← links)
- Real-time integrated prefetching and caching (Q398835) (← links)
- (Q513305) (redirect page) (← links)
- Engineering parallel string sorting (Q513306) (← links)
- Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering (Q525113) (← links)
- Towards optimal range medians (Q541663) (← links)
- (Q587827) (redirect page) (← links)
- Energy-efficient paths in radio networks (Q639290) (← links)
- A bandwidth latency tradeoff for broadcast and reduction (Q1007568) (← links)
- Randomized priority queues for fast parallel access (Q1130320) (← links)
- Towards optimal locality in mesh-indexings (Q1348392) (← links)
- Fast concurrent access to parallel disks (Q1566373) (← links)
- Scanning multiple sequences via cache memory (Q1566375) (← links)
- (Q1606869) (redirect page) (← links)
- A case study in scalability: An ADI method for the two-dimensional time-dependent Dirac equation (Q1606870) (← links)
- Cohesive subgraph computation over large sparse graphs. Algorithms, data structures, and programming techniques (Q1755625) (← links)
- Space efficient hash tables with worst case constant access time (Q1771320) (← links)
- Ranked document retrieval for multiple patterns (Q1784746) (← links)
- Analysis of nearest neighbor load balancing algorithms for random loads (Q1960603) (← links)
- Dynamic space efficient hashing (Q1999966) (← links)
- Scalable SAT solving in the cloud (Q2118345) (← links)
- Data structures and algorithms analysis -- new perspectives. Volume 1: Data structures based on linear relations (Q2184843) (← links)
- A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching (Q2390325) (← links)
- Finding near-optimal independent sets at scale (Q2401330) (← links)
- Optimizing sorting algorithms by using sorting networks (Q2628305) (← links)
- (Q2729101) (← links)
- (Q2753955) (← links)
- (Q2765958) (← links)
- (Q2768273) (← links)
- Advanced Coarsening Schemes for Graph Partitioning (Q2828188) (← links)
- On (Dynamic) Range Minimum Queries in External Memory (Q2842141) (← links)
- Parallel String Sample Sort (Q2849308) (← links)
- Time-Dependent Route Planning with Generalized Objective Functions (Q2912839) (← links)
- Engineering Time-Dependent Many-to-Many Shortest Paths Computation (Q2917289) (← links)
- Fast Detour Computation for Ride Sharing (Q2917292) (← links)
- PReaCH: A Fast Lightweight Reachability Index Using Pruning and Contraction Hierarchies (Q2921455) (← links)
- (Q2921756) (← links)
- (Q2934628) (← links)
- (Q2954980) (← links)
- Alternative Route Graphs in Road Networks (Q2999330) (← links)
- STRONGER QUICKHEAPS (Q3016226) (← links)
- (Q3046484) (← links)
- Engineering Multilevel Graph Partitioning Algorithms (Q3092253) (← links)
- Fast Routing in Road Networks with Transit Nodes (Q3101693) (← links)
- Online Scheduling with Bounded Migration (Q3169046) (← links)
- Load-Balancing for Parallel Delaunay Triangulations (Q3297568) (← links)
- (Q3395999) (← links)
