Peter Sanders

From MaRDI portal
(Redirected from Person:181233)
Peter Sanders Q181233



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
High performance construction of recsplit based minimal perfect hash functions2025-01-06Paper
Learned monotone minimal perfect hashing2025-01-06Paper
A sweep-plane algorithm for calculating the isolation of mountains2025-01-06Paper
Pareto sums of Pareto sets2025-01-06Paper
More hierarchy in route planning using edge hierarchies2024-08-22Paper
Fast many-to-many routing for dynamic taxi sharing with meeting points2024-05-29Paper
ShockHash: towards optimal-space minimal perfect hashing beyond brute-force2024-05-29Paper
Shared-memory \(n\)-level hypergraph partitioning2024-05-24Paper
PaCHash: packed and compressed hash tables2024-05-24Paper
SicHash -- small irregular cuckoo tables for perfect hashing2024-05-24Paper
High-Quality Hypergraph Partitioning
ACM Journal of Experimental Algorithmics
2024-04-14Paper
Deep multilevel graph partitioning
(available as arXiv preprint)
2023-09-20Paper
Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues
(available as arXiv preprint)
2023-09-20Paper
Parallel Weighted Random Sampling
ACM Transactions on Mathematical Software
2023-03-29Paper
Concurrent expandable AMQs on the basis of quotient filters2023-02-07Paper
Towards optimal locality in mesh-indexings
Fundamentals of Computation Theory
2022-12-09Paper
Decentralized Online Scheduling of Malleable NP-hard Jobs2022-12-09Paper
Parallel Weighted Random Sampling
(available as arXiv preprint)
2022-05-11Paper
Scalable SAT solving in the cloud2022-03-22Paper
Real-time traffic assignment using engineered customizable contraction hierarchies
ACM Journal of Experimental Algorithmics
2021-04-21Paper
Scalable Shared-Memory Hypergraph Partitioning
2021 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX)
2021-01-27Paper
Fast, Exact and Scalable Dynamic Ridesharing
2021 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX)
2021-01-27Paper
Network Flow-Based Refinement for Multilevel Hypergraph Partitioning
(available as arXiv preprint)
2020-12-16Paper
Load-Balancing for Parallel Delaunay Triangulations
Lecture Notes in Computer Science
2020-07-20Paper
Load-Balancing for Parallel Delaunay Triangulations
Lecture Notes in Computer Science
2020-07-20Paper
In-place parallel super scalar samplesort (\(\mathrm{IPS}^4\mathrm{o}\))
(available as arXiv preprint)
2020-05-27Paper
Dynamic space efficient hashing2020-05-27Paper
Engineering a Distributed Full-Text Index
2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX)
2019-09-12Paper
Robust massively parallel sorting
2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX)
2019-09-12Paper
Finding near-optimal independent sets at scale
2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX)
2019-09-12Paper
\(k\)-way hypergraph partitioning via \(n\)-level recursive bisection
2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX)
2019-09-12Paper
Engineering a direct \(k\)-way hypergraph partitioning algorithm
2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX)
2019-09-12Paper
Parallel \(d\)-D Delaunay triangulations in shared and distributed memory
2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX)
2019-09-12Paper
Distributed Evolutionary Graph Partitioning
2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX)
2019-09-12Paper
(Semi-)External Algorithms for Graph Partitioning and Clustering
2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX)
2019-09-12Paper
The Filter-Kruskal Minimum Spanning Tree Algorithm
2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX)
2019-09-11Paper
Simple and fast nearest neighbor search
2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments (ALENEX)
2019-09-11Paper
Algorithm engineering -- an attempt at a definition using sorting as an example
2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments (ALENEX)
2019-09-11Paper
Intersection in integer inverted indices
2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX)
2019-09-11Paper
Compressed inverted indexes for in-memory search engines
2008 Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments (ALENEX)
2019-09-11Paper
Better approximation of betweenness centrality
2008 Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments (ALENEX)
2019-09-11Paper
Time-dependent contraction hierarchies
2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX)
2019-09-11Paper
Route planning with flexible objective functions
2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments (ALENEX)
2019-09-11Paper
Sequential and parallel algorithms and data structures. The basic toolbox2019-09-05Paper
Dynamic space efficient hashing
Algorithmica
2019-06-27Paper
Dynamic space efficient hashing
Algorithmica
2019-06-27Paper
An asymptotic approximation scheme for multigraph edge coloring
ACM Transactions on Algorithms
2018-11-05Paper
Efficient parallel random sampling-vectorized, cache-efficient, and online
ACM Transactions on Mathematical Software
2018-08-17Paper
Scalable Parallel Suffix Array Construction
High Performance Computing in Science and Engineering ’06
2018-05-24Paper
Finding near-optimal independent sets at scale
Journal of Heuristics
2017-09-08Paper
Better external memory suffix array construction
ACM Journal of Experimental Algorithmics
2017-06-15Paper
Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering
Journal of Heuristics
2017-04-28Paper
Engineering parallel string sorting
Algorithmica
2017-03-06Paper
Parallel algorithms reconsidered (invited talk)2017-01-24Paper
Advanced coarsening schemes for graph partitioning
ACM Journal of Experimental Algorithmics
2016-10-24Paper
Random permutations on distributed, external and hierarchical memory
Information Processing Letters
2016-06-09Paper
Scalable generation of scale-free graphs
Information Processing Letters
2016-04-06Paper
Linear work suffix array construction
Journal of the ACM
2015-12-04Paper
HordeSat: a massively parallel portfolio SAT solver
Lecture Notes in Computer Science
2015-11-20Paper
Minimum time-dependent travel times with contraction hierarchies
ACM Journal of Experimental Algorithmics
2015-03-16Paper
The random graph threshold for \(k\)-orientiability and a fast algorithm for optimal multiple-choice allocation2014-12-18Paper
An asymptotic approximation scheme for multigraph edge coloring2014-10-13Paper
PReaCH: a fast lightweight reachability index using pruning and contraction hierarchies
Algorithms - ESA 2014
2014-10-08Paper
Real-time integrated prefetching and caching
Journal of Scheduling
2014-08-18Paper
Engineering highway hierarchies
ACM Journal of Experimental Algorithmics
2014-04-01Paper
Heuristic initialization for bipartite matching problems
ACM Journal of Experimental Algorithmics
2014-04-01Paper
Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm
ACM Journal of Experimental Algorithmics
2014-04-01Paper
Cache-, hash-, and space-efficient bloom filters
ACM Journal of Experimental Algorithmics
2014-04-01Paper
Goal-directed shortest-path queries using precomputed cluster distances
ACM Journal of Experimental Algorithmics
2014-04-01Paper
Route planning with flexible edge restrictions
ACM Journal of Experimental Algorithmics
2014-04-01Paper
Recent Advances in Graph Partitioning2013-11-13Paper
Parallel string sample sort
Lecture Notes in Computer Science
2013-09-17Paper
Parallel string sample sort
Lecture Notes in Computer Science
2013-09-17Paper
On (dynamic) range minimum queries in external memory
Lecture Notes in Computer Science
2013-08-12Paper
High quality graph partitioning2013-06-25Paper
Efficient route compression for hybrid route planning
Lecture Notes in Computer Science
2013-04-19Paper
Engineering time-dependent many-to-many shortest paths computation2012-09-28Paper
Fast detour computation for ride sharing
(available as arXiv preprint)
2012-09-28Paper
Time-dependent route planning with generalized objective functions
Algorithms – ESA 2012
2012-09-25Paper
Fast Routing in Road Networks with Transit Nodes
Science
2011-11-30Paper
Energy-efficient paths in radio networks
Algorithmica
2011-09-20Paper
Engineering multilevel graph partitioning algorithms
Algorithms – ESA 2011
2011-09-16Paper
STRONGER QUICKHEAPS
International Journal of Foundations of Computer Science
2011-07-14Paper
Towards optimal range medians
Theoretical Computer Science
2011-06-07Paper
Alternative Route Graphs in Road Networks
Theory and Practice of Algorithms in (Computer) Systems
2011-05-12Paper
Online scheduling with bounded migration
Mathematics of Operations Research
2011-04-27Paper
\(n\)-level graph partitioning
Algorithms – ESA 2010
2010-09-06Paper
Algorithmen und Datenstrukturen
eXamen.press
2010-07-19Paper
Robust, almost constant time shortest-path queries in road networks2010-07-09Paper
scientific article; zbMATH DE number 5734725 (Why is no real title available?)2010-07-09Paper
Approximating energy efficient paths in wireless multi-hop networks
Lecture Notes in Computer Science
2010-03-03Paper
A practical minimum spanning tree algorithm using the cycle property
Lecture Notes in Computer Science
2010-03-03Paper
scientific article; zbMATH DE number 5604115 (Why is no real title available?)2009-09-15Paper
A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching
Information Processing Letters
2009-07-21Paper
Towards Optimal Range Medians
Automata, Languages and Programming
2009-07-14Paper
Engineering Route Planning Algorithms
Algorithmics of Large and Complex Networks
2009-07-09Paper
A bandwidth latency tradeoff for broadcast and reduction
Information Processing Letters
2009-03-23Paper
Semi-external LTL Model Checking
Computer Aided Verification
2008-07-15Paper
Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
Experimental Algorithms
2008-06-13Paper
Algorithms and Data Structures2008-05-28Paper
How Branch Mispredictions Affect Quicksort
Lecture Notes in Computer Science
2008-03-11Paper
Engineering Highway Hierarchies
Lecture Notes in Computer Science
2008-03-11Paper
Engineering Algorithms for Approximate Weighted Matching
Experimental Algorithms
2008-01-02Paper
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science
2007-12-07Paper
Goal Directed Shortest Path Queries Using Precomputed Cluster Distances
Experimental Algorithms
2007-09-14Paper
Algorithms – ESA 2005
Lecture Notes in Computer Science
2006-06-27Paper
Automata, Languages and Programming
Lecture Notes in Computer Science
2006-01-10Paper
Duality Between Prefetching and Queued Writing with Parallel Disks
SIAM Journal on Computing
2005-09-16Paper
Automata, Languages and Programming
Lecture Notes in Computer Science
2005-08-24Paper
Algorithms – ESA 2004
Lecture Notes in Computer Science
2005-08-18Paper
Fast priority queues for cached memory
ACM Journal of Experimental Algorithmics
2005-08-04Paper
scientific article; zbMATH DE number 2163020 (Why is no real title available?)2005-04-29Paper
Space efficient hash tables with worst case constant access time
Theory of Computing Systems
2005-04-19Paper
Δ-stepping: a parallelizable shortest path algorithm
Journal of Algorithms
2004-10-01Paper
scientific article; zbMATH DE number 2090670 (Why is no real title available?)2004-08-12Paper
scientific article; zbMATH DE number 2089215 (Why is no real title available?)2004-08-12Paper
scientific article; zbMATH DE number 2086636 (Why is no real title available?)2004-08-11Paper
Tail Bounds and Expectations for Random Arc Allocation and Applications
Combinatorics, Probability and Computing
2004-06-18Paper
Randomized Receiver Initiated Load-balancing Algorithms for Tree-shaped Computations
The Computer Journal
2004-03-16Paper
scientific article; zbMATH DE number 2038766 (Why is no real title available?)2004-02-08Paper
scientific article; zbMATH DE number 1984678 (Why is no real title available?)2003-09-22Paper
scientific article; zbMATH DE number 1962820 (Why is no real title available?)2003-08-11Paper
scientific article; zbMATH DE number 1956212 (Why is no real title available?)2003-07-29Paper
scientific article; zbMATH DE number 1956216 (Why is no real title available?)2003-07-29Paper
scientific article; zbMATH DE number 1956208 (Why is no real title available?)2003-07-29Paper
Scanning multiple sequences via cache memory
Algorithmica
2003-06-02Paper
Fast concurrent access to parallel disks
Algorithmica
2003-06-02Paper
scientific article; zbMATH DE number 1877045 (Why is no real title available?)2003-03-20Paper
scientific article; zbMATH DE number 1886331 (Why is no real title available?)2003-03-19Paper
How helpers hasten \(h\)-relations
Journal of Algorithms
2002-08-01Paper
A case study in scalability: An ADI method for the two-dimensional time-dependent Dirac equation
Parallel Computing
2002-07-25Paper
scientific article; zbMATH DE number 1760031 (Why is no real title available?)2002-06-25Paper
Reconciling simplicity and realism in parallel disk models2002-06-23Paper
Towards optimal locality in mesh-indexings
Discrete Applied Mathematics
2002-05-15Paper
scientific article; zbMATH DE number 1670676 (Why is no real title available?)2001-11-11Paper
scientific article; zbMATH DE number 1629981 (Why is no real title available?)2001-10-23Paper
Parallel integer optimization for crew scheduling
Annals of Operations Research
2001-06-14Paper
scientific article; zbMATH DE number 714573 (Why is no real title available?)2000-06-21Paper
scientific article; zbMATH DE number 1445386 (Why is no real title available?)2000-05-10Paper
scientific article; zbMATH DE number 1305103 (Why is no real title available?)2000-03-13Paper
Analysis of nearest neighbor load balancing algorithms for random loads
Parallel Computing
2000-01-12Paper
Randomized priority queues for fast parallel access
Journal of Parallel and Distributed Computing
1999-06-29Paper
scientific article; zbMATH DE number 1222607 (Why is no real title available?)1999-05-10Paper
scientific article; zbMATH DE number 588400 (Why is no real title available?)1994-06-12Paper


Research outcomes over time


This page was built for person: Peter Sanders