Peter Sanders
#18,689
Most Influential Person Now
German computer scientist
Peter Sanders 's AcademicInfluence.com Rankings
Peter Sanders computer-science Degrees
Computer Science
#1587
World Rank
#1642
Historical Rank
Distributed Computing
#11
World Rank
#12
Historical Rank
Parallel Computing
#27
World Rank
#27
Historical Rank
Database
#2657
World Rank
#2779
Historical Rank
Download Badge
Computer Science
Why Is Peter Sanders Influential?
(Suggest an Edit or Addition)According to Wikipedia, Peter Sanders is a German computer scientist who works as a professor of computer science at the Karlsruhe Institute of Technology. His research concerns the design, analysis, and implementation of algorithms and data structures, and he is particularly known for his research on suffix sorting finding shortest paths in road networks.
Peter Sanders 's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Polynomial time algorithms for multicast network code construction (2005) (965)
- Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks (2008) (732)
- Route Planning in Transportation Networks (2015) (629)
- Recent Advances in Graph Partitioning (2013) (489)
- Engineering Route Planning Algorithms (2009) (488)
- Simple Linear Work Suffix Array Construction (2003) (469)
- Highway Hierarchies Hasten Exact Shortest Path Queries (2005) (392)
- Linear work suffix array construction (2006) (388)
- Exact Routing in Large Road Networks Using Contraction Hierarchies (2012) (311)
- Polynomial time algorithms for network information flow (2003) (310)
- Algorithms and Data Structures: The Basic Toolbox (2008) (263)
- Fast Routing in Road Networks with Transit Nodes (2007) (259)
- Better Approximation of Betweenness Centrality (2008) (240)
- Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm (2008) (237)
- In Transit to Constant Time Shortest-Path Queries in Road Networks (2007) (234)
- Space Efficient Hash Tables with Worst Case Constant Access Time (2003) (204)
- Δ-stepping: a parallelizable shortest path algorithm (2003) (198)
- Engineering highway hierarchies (2006) (196)
- Think Locally, Act Globally: Highly Balanced Graph Partitioning (2013) (192)
- A Parallelization of Dijkstra's Shortest Path Algorithm (1998) (189)
- Cache-, hash-, and space-efficient bloom filters (2009) (185)
- Engineering Multilevel Graph Partitioning Algorithms (2010) (182)
- STXXL: standard template library for XXL data sets (2008) (182)
- Dynamic Highway-Node Routing (2007) (180)
- MCSTL: the multi-core standard template library (2007) (153)
- [Delta]-stepping: a parallelizable shortest path algorithm (2003) (139)
- Engineering Fast Route Planning Algorithms (2007) (131)
- Parallel Graph Partitioning for Complex Networks (2014) (129)
- Benchmarking for Graph Clustering and Partitioning (2014) (127)
- Fast priority queues for cached memory (1999) (125)
- Fast Concurrent Access to Parallel Disks (2000) (123)
- Towards optimal locality in mesh-indexings (1997) (122)
- Algorithms for Memory Hierarchies (2003) (122)
- Online Scheduling with Bounded Migration (2004) (119)
- GPU sample sort (2009) (119)
- SKaMPI: A Detailed, Accurate MPI Benchmark (1998) (118)
- Better external memory suffix array construction (2008) (115)
- Computing Many-to-Many Shortest Paths Using Highway Hierarchies (2007) (112)
- Graph Partitioning and Graph Clustering, 10th DIMACS Implementation Challenge Workshop, Georgia Institute of Technology, Atlanta, GA, USA, February 13-14, 2012. Proceedings (2013) (111)
- Engineering a scalable high quality graph partitioner (2009) (106)
- Time-Dependent Contraction Hierarchies (2009) (104)
- Distributed Evolutionary Graph Partitioning (2011) (104)
- Graph Partitioning and Graph Clustering (2013) (102)
- Advanced Coarsening Schemes for Graph Partitioning (2012) (96)
- Delta-Stepping: A Parallel Single Source Shortest Path Algorithm (1998) (87)
- Minimum time-dependent travel times with contraction hierarchies (2013) (85)
- Automated Empirical Optimization (2011) (84)
- High quality graph partitioning (2012) (83)
- Two-tree algorithms for full bandwidth broadcast, reduction and scan (2009) (82)
- Algorithms - ESA 2009 (2009) (79)
- Goal-directed shortest-path queries using precomputed cluster distances (2009) (77)
- Super Scalar Sample Sort (2004) (76)
- Algorithms for Memory Hierarchies: Advanced Lectures (2003) (74)
- Alternative Route Graphs in Road Networks (2011) (73)
- Highway Hierarchies Star (2006) (73)
- k-way Hypergraph Partitioning via n-Level Recursive Bisection (2015) (72)
- The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation (2007) (70)
- A simpler linear time 2/3-epsilon approximation for maximum weight matching (2004) (68)
- Fast Detour Computation for Ride Sharing (2009) (67)
- Intersection in Integer Inverted Indices (2007) (66)
- HordeSat: A Massively Parallel Portfolio SAT Solver (2015) (65)
- Algorithm Engineering - An Attempt at a Definition (2009) (64)
- SKaMPI: a comprehensive benchmark for public benchmarking of MPI (2002) (64)
- Route Planning with Flexible Objective Functions (2010) (64)
- Cache-Efficient Aggregation: Hashing Is Sorting (2015) (64)
- Scalable Parallel Suffix Array Construction (2006) (63)
- Finding near-optimal independent sets at scale (2015) (62)
- Transit Node Routing Reconsidered (2013) (62)
- Asynchronous parallel disk sorting (2003) (61)
- Engineering an External Memory Minimum Spanning Tree Algorithm (2004) (61)
- Engineering a Multi-core Radix Sort (2011) (61)
- Partitioning Complex Networks via Size-Constrained Clustering (2014) (60)
- An Efficient Parallel Algorithm for Graph-Based Image Segmentation (2009) (60)
- Mobile Route Planning (2008) (59)
- The Filter-Kruskal Minimum Spanning Tree Algorithm (2009) (58)
- Parallel Prefix (Scan) Algorithms for MPI (2006) (56)
- A simpler linear time 2 / 3 − ε approximation for maximum weight matching (2004) (55)
- Shortest Paths (2020) (55)
- Communication-Free Massively Distributed Graph Generation (2017) (54)
- Engineering Algorithms for Approximate Weighted Matching (2007) (52)
- Engineering a direct k-way Hypergraph Partitioning Algorithm (2017) (52)
- n-Level Graph Partitioning (2010) (50)
- Randomized Priority Queues for Fast Parallel Access (1998) (50)
- Towards optimal range medians (2009) (50)
- Distributed Time-Dependent Contraction Hierarchies (2010) (49)
- Thrill: High-performance algorithmic distributed batch data processing with C++ (2016) (47)
- The Hierarchical Factor Algorithm for All-to-All Communication (Research Note) (2002) (45)
- Time-Dependent Contraction Hierarchies and Approximation (2010) (44)
- Duality Between Prefetching and Queued Writing with Parallel Disks (2001) (43)
- Random Permutations on Distributed, External and Hierarchical Memory (1998) (43)
- MultiQueues: Simple Relaxed Concurrent Priority Queues (2015) (42)
- Massively Parallel Search for Transition-Tables of Polyautomata (1994) (41)
- Network Flow-Based Refinement for Multilevel Hypergraph Partitioning (2018) (40)
- How Branch Mispredictions Affect Quicksort (2006) (39)
- Polynomial time algorithms for network code construction (2005) (38)
- A Practical Minimum Spanning Tree Algorithm Using the Cycle Property (2003) (38)
- Heuristic initialization for bipartite matching problems (2010) (37)
- Using Finite Experiments to Study Asymptotic Performance (2000) (37)
- High-Quality Shared-Memory Graph Partitioning (2017) (36)
- An asymptotic approximation scheme for multigraph edge coloring (2005) (36)
- Robust, Almost Constant Time Shortest-Path Queries in Road Networks (2006) (35)
- A bandwidth latency tradeoff for broadcast and reduction (2000) (33)
- On the Manhattan-Distance Between Points on Space-Filling Mesh-Indexings (1996) (33)
- Energy-efficient sorting using solid state disks (2010) (33)
- Parallel Label-Setting Multi-objective Shortest Path Search (2013) (33)
- Communication efficient algorithms for fundamental big data problems (2013) (32)
- A detailed analysis of random polling dynamic load balancing (1994) (32)
- Concurrent hash tables: fast and general?(!) (2016) (32)
- Optimized Hybrid Parallel Lattice Boltzmann Fluid Flow Simulations on Complex Geometries (2012) (32)
- Reconciling simplicity and realism in parallel disk models (2001) (32)
- Engineering basic algorithms of an in-memory text search engine (2010) (32)
- Semi-external LTL Model Checking (2008) (32)
- Towards Optimal Multiple Selection (2005) (31)
- Energy Efficient Frequency Scaling and Scheduling for Malleable Tasks (2012) (30)
- Parallel Integer Optimization for Crew Scheduling (2000) (30)
- High-Quality Hypergraph Partitioning (2021) (30)
- Practical Massively Parallel Sorting (2014) (29)
- High Performance in the Cloud with FPGA Groups (2016) (29)
- Accelerating Local Search for the Maximum Independent Set Problem (2016) (29)
- Efficient Massively Parallel Quicksort (1997) (29)
- Scanning Multiple Sequences via Cache Memory (2002) (27)
- Sequential and Parallel Algorithms and Data Structures: The Basic Toolbox (2019) (27)
- Algorithm Engineering (2010) (27)
- Route planning with flexible edge restrictions (2012) (26)
- Algorithm Engineering for Parallel Computation (2000) (26)
- Parallel Bi-objective Shortest Paths Using Weight-Balanced B-trees with Bulk Updates (2014) (26)
- Efficient Parallel and External Matching (2013) (26)
- Asynchronous scheduling of redundant disk arrays (2000) (26)
- Parallel Shortest Path for Arbitrary Graphs (2000) (25)
- Simple and Fast Nearest Neighbor Search (2010) (25)
- : Standard Template Library for XXL Data Sets (2005) (25)
- Time-Dependent Route Planning with Generalized Objective Functions (2012) (25)
- Scalable distributed-memory external sorting (2009) (25)
- Efficient many-core query execution in main memory column-stores (2013) (24)
- Fast Parallel Operations on Search Trees (2015) (24)
- Compressed Inverted Indexes for In-Memory Search Engines (2008) (23)
- Fast Priority Queues for Parallel Branch-and-Bound (1995) (23)
- Accessing Multiple Sequences Through Set Associative Caches (1999) (22)
- Generating semi-synthetic validation benchmarks for embryomics (2016) (22)
- Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies (2019) (22)
- Improved Fast Similarity Search in Dictionaries (2010) (22)
- Engineering Parallel String Sorting (2014) (21)
- Scalable generation of scale-free graphs (2016) (21)
- Better Algorithms for Parallel Backtracking (1995) (21)
- Efficient Parallel Random Sampling—Vectorized, Cache-Efficient, and Online (2016) (21)
- 588 Graph Partitioning and Graph Clustering (2013) (19)
- Emulating MIMD Behavior on SIMD Machines (1994) (19)
- Cache-, Hash- and Space-Efficient Bloom Filters (2007) (19)
- Energy Optimal Routing in Radio Networks Using Geometric Data Structures (2002) (19)
- Retrieval and Perfect Hashing Using Fingerprinting (2014) (19)
- Engineering a Sorted List Data Structure for 32 Bit Key (2004) (18)
- In-place Parallel Super Scalar Samplesort (IPSSSSo) (2017) (18)
- MultiQueues: Simpler, Faster, and Better Relaxed Concurrent Priority Queues (2014) (18)
- Parallel String Sample Sort (2013) (17)
- Hierarchy Decomposition for Faster User Equilibria on Road Networks (2011) (17)
- Parallel Weighted Random Sampling (2019) (17)
- Analysis of nearest neighbor load balancing algorithms for random loads (1999) (17)
- HARNESS Project: Managing Heterogeneous Computing Resources for a Cloud Platform (2014) (17)
- KaHIP v0.53 - Karlsruhe High Quality Partitioning - User Guide (2013) (17)
- Robust Massively Parallel Sorting (2016) (16)
- Graph Partitioning for Independent Sets (2015) (16)
- Defining and Computing Alternative Routes in Road Networks (2010) (15)
- Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering (2016) (15)
- Recent Advances in Scalable Network Generation (2020) (15)
- Parallel Crew Scheduling in PAROS (1998) (15)
- Novel Parallel Algorithms for Fast Multi-GPU-Based Generation of Massive Scale-Free Networks (2019) (14)
- Fast OLAP query execution in main memory on large data in a cluster (2013) (14)
- A case study in scalability: An ADI method for the two-dimensional time-dependent Dirac equation (1999) (14)
- Tree Shaped Computations as a Model for Parallel Applications (1998) (14)
- Efficient Parallel Scheduling of Malleable Tasks (2011) (14)
- Presenting Data from Experiments in Algorithmics (2000) (13)
- Real-Time Traffic Assignment Using Fast Queries in Customizable Contraction Hierarchies (2018) (13)
- Algorithms for Scalable Storage Servers (2004) (13)
- (Semi-)External Algorithms for Graph Partitioning and Clustering (2014) (13)
- Dynamic Space Efficient Hashing (2017) (13)
- Engineering Time-Dependent Many-to-Many Shortest Paths Computation (2010) (13)
- On the Competitive Analysis of Randomized Static Load Balancing (2017) (13)
- Communication Efficient Algorithms for Top-k Selection Problems (2015) (12)
- Scalable Shared-Memory Hypergraph Partitioning (2020) (12)
- Scheduling and Traffic Allocation for Tasks with Bounded Splittability (2003) (12)
- Parallel Game Tree Search on SIMD Machines (1995) (12)
- Asynchronous Random Polling Dynamic Load Balancing (1999) (12)
- PReaCH: A Fast Lightweight Reachability Index Using Pruning and Contraction Hierarchies (2014) (12)
- Out of the Box Phrase Indexing (2008) (12)
- Parallel d-D Delaunay Triangulations in Shared and Distributed Memory (2017) (12)
- Linear work generation of R-MAT graphs (2019) (12)
- How Helpers Hasten h-Relations (2000) (11)
- In-place Parallel Super Scalar Samplesort (IPS$^4$o) (2017) (11)
- Randomized Static Load Balancing for Tree-Shaped Computations (1994) (11)
- Algorithmic Skeletons (2011) (11)
- Advanced Multilevel Node Separator Algorithms (2015) (11)
- Recent Advances in Graph Partitioning. [Preprint] (2015) (11)
- Randomized Receiver Initiated Load-balancing Algorithms for Tree-shaped Computations (2002) (10)
- Engineering Graph Partitioning Algorithms (2012) (10)
- Analysis of Random Polling Dynamic Load Balancing (1997) (10)
- Full Bandwidth Broadcast, Reduction and Scan with Only Two Trees (2007) (10)
- Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas (2008) (10)
- Approximating Energy Efficient Paths in Wireless Multi-hop Networks (2003) (10)
- Deep Multilevel Graph Partitioning (2021) (10)
- The PEPPHER Approach to Programmability and Performance Portability for Heterogeneous many-core Architectures (2011) (10)
- On the Efficient Implementation of Massively Parallel Quicksort (1997) (9)
- Efficient Emulation of MIMD Behavior on SIMD Machines (1995) (9)
- Concurrent Hash Tables (2019) (9)
- Simple Linear Work SuÆx Array Constru tion ? (2007) (9)
- Engineering In-place (Shared-memory) Sorting Algorithms (2020) (9)
- Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms (2000) (9)
- Incorporating road networks into territory design (2015) (9)
- High Performance Integer Optimization for Crew Scheduling (1999) (9)
- Cross Resource Optimisation of Database Functionality across Heterogeneous Processors (2014) (8)
- On the Efficiency of Nearest Neighbor Load Balancing for Random Loads (1996) (8)
- Memory Hierarchies - Models and Lower Bounds (2002) (8)
- A Scalable Parallel Tree Search Library (1996) (8)
- Goal Directed Shortest Path Queries Using Precomputed Cluster Distances (2006) (8)
- Malleable Sorting (2013) (8)
- More Recent Advances in (Hyper)Graph Partitioning (2022) (8)
- DEMSort — Distributed External Memory Sort (2009) (7)
- Distributed evolutionary k-way node separators (2017) (7)
- Algorithm Engineering - An Attempt at a Definition Using Sorting as an Example (2010) (7)
- Shared-Memory n-level Hypergraph Partitioning (2021) (7)
- On (Dynamic) Range Minimum Queries in External Memory (2013) (7)
- Engineering DFS-Based Graph Algorithms (2017) (7)
- Tail Bounds and Expectations for Random Arc Allocation and Applications (2003) (7)
- 1 Spatial urban dynamics (2004) (7)
- Determination of maximally stable extremal regions in large images (2008) (6)
- High-performance algorithm engineering for parallel computation (2002) (6)
- Efficient Calculation of Microscopic Travel Demand Data with Low Calibration Effort (2019) (6)
- n-Level Hypergraph Partitioning (2015) (6)
- A Bulk-Parallel Priority Queue in External Memory with STXXL (2015) (6)
- The power of duality for prefetching and sorting with parallel disks (2001) (6)
- Operating Power Grids with Few Flow Control Buses (2015) (6)
- Think Locally, Act Globally: Perfectly Balanced Graph Partitioning (2012) (6)
- High Quality Hypergraph Partitioning via Max-Flow-Min-Cut Computations (2018) (6)
- Engineering efficient error-correcting geocoding (2011) (5)
- The factor algorithm for all-to-all communication on clusters of SMP nodes (2002) (5)
- Efficient Route Compression for Hybrid Route Planning (2012) (5)
- Communication-Efficient Weighted Reservoir Sampling from Fully Distributed Data Streams (2019) (5)
- Parallelizing NP-Complete Problems Using Tree Shaped Computations (1999) (5)
- Work-efficient matrix inversion in polylogarithmic time (2013) (5)
- KaHIP - Karlsruhe High Quality Partitioning (2014) (5)
- Faster Radix Sort via Virtual Memory and Write-Combining (2010) (5)
- Introduction to the Special Issue on SPAA 2014 (2017) (5)
- ONLINE SCHEDULING WITH BOUNDED MIGRATION (EXTENDED ABSTRACT FOR DAGSTUHL SEMINAR 05031 ON ALGORITHMS FOR OPTIMIZATION WITH INCOMPLETE INFORMATION) (2005) (5)
- Using MaxCompiler for the high level synthesis of trigger algorithms (2017) (5)
- Relational Equivalence Proofs Between Imperative and MapReduce Algorithms (2018) (5)
- The HARNESS Platform: A Hardware- and Network-Enhanced Software System for Cloud Computing (2017) (5)
- Parallel Flow-Based Hypergraph Partitioning (2022) (5)
- An Implementation of the Binary Blocking Flow Algorithm (1998) (4)
- Lightweight MPI Communicators with Applications to Perfectly Balanced Quicksort (2017) (4)
- Graph Traversal (2019) (4)
- Lifetime Maximization of Monitoring Sensor Networks (2010) (4)
- Practical Massively Parallel Sorting - Basic Algorithmic Ideas (2014) (4)
- Drawing Metro Maps on Concentric Circles (2016) (4)
- Some Implementation Results on Random Polling Dynamic Load Balancing (1995) (3)
- Efficient Error-Correcting Geocoding (2011) (3)
- Communication Efficient Checking of Big Data Operations (2017) (3)
- Highly Efficient Screening for Point-Like Targets via Concentric Shells (2010) (3)
- Atomic Operations (2011) (3)
- Engineering and applications track - engineering highway hierarchies (2006) (3)
- Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues (2021) (3)
- Time‐based zones: an alternate pricing strategy (1999) (3)
- Network Flow Models for Power Grids (2014) (3)
- Feasible Models of Computation: Three-Dimensionality and Energy Consumption (1997) (3)
- Hashing with Linear Probing and Referential Integrity (2018) (3)
- 3D Cell Nuclei Segmentation with Balanced Graph Partitioning (2017) (3)
- PaCHash: Packed and Compressed Hash Tables (2022) (3)
- Decentralized Online Scheduling of Malleable NP-hard Jobs (2022) (2)
- Communication-Efficient String Sorting (2020) (2)
- Engineering Fully-Compressed Suffix Trees (2015) (2)
- Single-Pass List Partitioning (2008) (2)
- Emulating MIMD Behaviour on SIMD-Machines (1994) (2)
- Space Efficient Approximation of Piecewise Linear Functions Student (2009) (2)
- Report from Dagstuhl: SocioPaths - Multimodal Door-to-Door Route Planning via Social Paths (2015) (2)
- Ant-based Algorithms for the Wind Farm Cable Layout Problem (2017) (2)
- Load-Balancing for Parallel Delaunay Triangulations (2019) (2)
- Algorithm Engineering for Big Data (2014) (2)
- Concurrent Expandable AMQs on the Basis of Quotient Filters (2019) (2)
- Generic Approaches to Optimization (2019) (2)
- Fast Computation of Distance Tables using Highway Hierarchies (2006) (2)
- Algorithms -- ESA 2009 : 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009 : proceedings (2009) (2)
- n-Level Hypergraph Partitioning. [Preprint] (2015) (2)
- Editing to (P5, C5)-free Graphs - a Model for Community Detection? (2015) (2)
- A Unified Framework for Electric Vehicle Routing (2017) (2)
- Locality Aware DAG-Scheduling for LU-Decomposition (2015) (2)
- Cellular Automata: Energy Consumption and Physical Feasibility (2002) (2)
- Faster Exact Search Using Document Clustering (2014) (2)
- Work-Efficient Matrix Inversion in Polylogarithmic Time (2015) (2)
- SicHash - Small Irregular Cuckoo Tables for Perfect Hashing (2022) (2)
- Engineering Algorithms for Large Data Sets (2013) (2)
- A Case Study in Object Oriented Programming: Algebraic Structures in Eiffel (1993) (2)
- Engineering a Distributed Full-Text Index (2016) (2)
- Engineering a Compact Bit-Sliced Signature Index for Approximate Search on Genomic Data (2018) (2)
- Random Arc Allocation and Applications to Disks, Drums and DRAMs (2002) (2)
- 2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (2013) (1)
- Weighted F-free Edge Editing (2020) (1)
- Energy-Ecient Fast Sorting 2011 (2011) (1)
- An efficient algorithm for fault-tolerant geocoding (2010) (1)
- High Performance Construction of RecSplit Based Minimal Perfect Hash Functions (2022) (1)
- Energy-Efficient Paths in Radio Networks (2011) (1)
- Consumption and Travel Time Profiles in Electric Vehicle Routing (2015) (1)
- Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures (2014) (1)
- Engineering Massively Parallel MST Algorithms (2023) (1)
- Exploring parallel MPI fault tolerance mechanisms for phylogenetic inference with RAxML-NG (2021) (1)
- Lightweight MPI Communicators with Applications to Perfectly Balanced Schizophrenic Quicksort (2017) (1)
- Representing Sequences by Arrays and Linked Lists (2019) (1)
- Connecting MapReduce Computations to Realistic Machine Models (2020) (1)
- Parallel Algorithm Engineering (2010) (1)
- Real-time integrated prefetching and caching (2013) (1)
- Customizable Route Planning in External Memory Bachelor (2013) (1)
- Engineering State-of-the-Art Graph Partitioning Libraries @KIT (2011) (1)
- Dynamic Space Efficient Hashing (2019) (1)
- Constant Time Queries for Energy Efficient Paths in Multi-hop Wireless Networks (2008) (1)
- Customizable Route Planning in External Memory (2013) (1)
- Planning Geometric Microgrid Cable Layouts (2021) (1)
- Compressed Transmission of Route Descriptions (2010) (1)
- Proving Equivalence Between Imperative and MapReduce Implementations Using Program Transformations (2018) (1)
- Engineering FPT-based Edge Editing Algorithms (2017) (1)
- Optimizing energy consumption and user experience in a mobile video streaming scenario (2018) (1)
- More Hierarchy in Route Planning Using Edge Hierarchies (2019) (1)
- Peppher : Performance Portability and Programmability for Heterogeneous Many-Core Architectures (2017) (1)
- Random Arc Allocation and Applications (2002) (1)
- Parallel SAT-Solving for Product Configuration (2020) (1)
- Energy-Optimal Routes for Electric Vehicles with Charging Stops Bachelor (2015) (1)
- Maximum Independent Set Problem (2012) (1)
- Ridesharing with Multiple Riders (2019) (1)
- Algorithms for Memory Hierarchies (Column: Algorithmics) (2004) (1)
- Hash Tables and Associative Arrays (2019) (1)
- Combinatorial Pattern Matching (2013) (1)
- Engineering Parallel Algorithms: The multicore transformation (Ubiquity symposium) (2014) (0)
- Engineering Multimodal Transit Route Planning (2017) (0)
- 3D+T terabyte image analysis (2017) (0)
- IMPROVING COARSENING FOR MULTILEVEL PARTITIONING OF COMPLEX NETWORKS (2014) (0)
- Learned Monotone Minimal Perfect Hashing (2023) (0)
- Algorithm Engineering (2013) (0)
- 10261 Abstracts Collection Algorithm Engineering Dagstuhl Seminar (2010) (0)
- PRELIMINARY ALLOCATION OF BUDGETS FOR USE IN PAVEMENT MANAGEMENT SYSTEMS (2000) (0)
- Scalable High-Quality Hypergraph Partitioning (2023) (0)
- 10261 Abstracts Collection - Algorithm Engineering (2010) (0)
- Novel Parallel Algorithms for Fast Multi-GPU-Based Generation of Massive Scale-Free Networks (2019) (0)
- A case study in object oriented programming: algebraic studies in Eiffel (1993) (0)
- 16 CHAPTER THE HARNESS PLATFORM : A HARDWARE-AND NETWORK-ENHANCED SOFTWARE SYSTEM FOR CLOUD COMPUTING (2017) (0)
- Pn-free colorings of planar graphs (2020) (0)
- Engineering Parallel String Sorting (2015) (0)
- PCA-Based Compression of Travel Time Functions (2010) (0)
- Appetizer: Integer Arithmetic (2019) (0)
- E(cid:14)cient Emulation of MIMD Behavior on SIMD Machines (1997) (0)
- Algorithm Engineering for the Basic Toolbox (2007) (0)
- Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering (2016) (0)
- Sliding Block Hashing (Slick) - Basic Algorithmic Ideas (2023) (0)
- KaMIS v2.0 – Karlsruhe Maximum Independent Sets User Guide (2015) (0)
- Induced Universal Graphs for edge-colored Complete Graphs (2021) (0)
- AD7674 18-Bit, 2.5 LSB INL, 800 kSPS SAR ADC Data Sheet (Rev. A) (2003) (0)
- Bend Minimization of Ortho-Radial Graph Drawings (2016) (0)
- D S ] 6 M ay 2 01 3 Parallel String Sample Sort (2013) (0)
- Minimum Spanning Trees (2019) (0)
- Algorithm engineering for scalable parallel external sorting (2010) (0)
- Scalable prallel Ssffix aray Ccnstruction (2006) (0)
- Engineering an Efficient Reachability Algorithm for Directed Graphs (2014) (0)
- Algorithm Engineering (2013) (0)
- An equal opportunity concept for the coordinated research effort AESC (2018) (0)
- STXXL 1.4.0 and Beyond (2014) (0)
- On a dynamic scheduling algorithm for massively parallel computations of atomic isotopes (2016) (0)
- Randomized Priority Queues for Fast Parallel AccessPeter (1997) (0)
- Scalable Text Index Construction (2022) (0)
- Collective communication - parallel prefix (scan) algorithms for MPI (2006) (0)
- adopt besttwo local searchesexchange boundaries (2011) (0)
- Combinatorial pattern matching : 24th annual symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013, proceedings (2013) (0)
- Parallel Algorithms Reconsidered (2015) (0)
- Turbo für Graphdatenbanken: Graphpartitionierung mit KaHIP (2015) (0)
- Constructing Delaunay triangulations along space-filling curves (2009) (0)
- On Collinearity of Independent Sets – Algorithmic Challenges (2018) (0)
- 10261 Executive Summary - Algorithm Engineering (2010) (0)
- Finding near-optimal independent sets at scale (2017) (0)
- Inclusion-Minimal Quasi-Threshold Editing (2020) (0)
- Skampi: a Detailed, Accurate Mpi Benchmark 1 the Role of Benchmarking in Parallel Programming (2007) (0)
- External Matrix Operations for the STXXL (2011) (0)
- Chapter 10. Challenges in Algorithm Engineering (0)
- Parallel Algorithms Reconsidered (Invited Talk) (2015) (0)
- D6.5: First PEPPHER Prototype (2011) (0)
- Towards Better Algorithms for Parallel Backtracking (1997) (0)
- On Rigidity of Graphs Bachelor Thesis of Oliver Suchan (2019) (0)
- Cooperative Route Planning On Time-Dependent Road Networks (2022) (0)
- Distributed Deep Multilevel Graph Partitioning (2023) (0)
- Algorithm Engineering Algorithm Engineering (0)
- Special session: memory hierarchies (2003) (0)
- Rectilinear Crossing Minimization Master Thesis of Klara Reichard (2017) (0)
- Hierarchy Implosion for Faster User Equilibria on Road Networks? (2011) (0)
- Algorithm Engineering for Scalable Parallel External Sorting (2010) (0)
- Pruning Techniques for Li ed SAT-Based Hierarchical Planning (2021) (0)
- Automated Performance Tuning (2011) (0)
- Stronger Quickheaps (2011) (0)
- SKaMPI : A Detailed , Accurate MPI (1998) (0)
- Vectorized and performance‐portable quicksort (2022) (0)
- New Binary Search Tree Bounds via Geometric Inversions (2020) (0)
- 2003 Penny sort (2003) (0)
- Optimizing the Emulation of MIMD Behavior on SIMD Machines (1996) (0)
- Communication-efficient Massively Distributed Connected Components (2022) (0)
- A Comparative Study of Overlapping Community Detection Algorithms (2019) (0)
- ReStore: In-Memory REplicated STORagE for Rapid Recovery in Fault-Tolerant Algorithms (2022) (0)
- Three Dimensional Dynamic Point Labelling (2014) (0)
- Engineering a Distributed-Memory Triangle Counting Algorithm (2023) (0)
- Load Balancing (2019) (0)
- On Threshold Editing (2016) (0)
- 09491 Abstracts Collection - Graph Search Engineering (2009) (0)
- Initial Partitioning Algorithms for direct kway Hypergraph Partitioning (2015) (0)
- Fast, Exact and Scalable Dynamic Ridesharing (2020) (0)
- Sorting and Selection (2019) (0)
- A new framework for interactive knowledge discovery in large-scale trajectory data of zebrafish embryos (2017) (0)
- Introduction to Special Issue ALENEX 2013 (2016) (0)
- Efficient Yao Graph Construction (2023) (0)
- Core Augmentation for Subgraphs Bachelor (2013) (0)
- A Cluster-First-Route-Second-Approach for Solving Rich Vehicle Routing Problems in Urban and Suburban Areas (2014) (0)
- Proceedings of the 15th Meeting on Algorithm Engineering and Experiments, ALENEX 2013, New Orleans, Louisiana, USA, January 7, 2013 (2013) (0)
- Weighted Random Sampling on GPUs (2021) (0)
- Collective Communication and Computation (2019) (0)
- 09491 Abstracts Collection Graph Search Engineering Dagstuhl Seminar (2010) (0)
- Ab Initio Molecular Dynamics (2011) (0)
- Real-time integrated prefetching and caching (2012) (0)
- Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling (2022) (0)
- Communication-Efficient (Weighted) Reservoir Sampling (2019) (0)
This paper list is powered by the following services:
Other Resources About Peter Sanders
What Schools Are Affiliated With Peter Sanders ?
Peter Sanders is affiliated with the following schools:
