Peter Sanders

From MaRDI portal
Person:181233

Available identifiers

zbMath Open sanders.peterDBLPs/PeterSandersWikidataQ2078004 ScholiaQ2078004MaRDI QIDQ181233

List of research outcomes





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 Partitioning2024-04-14Paper
Deep multilevel graph partitioning2023-09-20Paper
Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues2023-09-20Paper
Parallel Weighted Random Sampling2023-03-29Paper
Concurrent expandable AMQs on the basis of quotient filters2023-02-07Paper
Towards optimal locality in mesh-indexings2022-12-09Paper
Decentralized Online Scheduling of Malleable NP-hard Jobs2022-12-09Paper
Parallel Weighted Random Sampling2022-05-11Paper
Scalable SAT solving in the cloud2022-03-22Paper
Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies2021-04-21Paper
Scalable Shared-Memory Hypergraph Partitioning2021-01-27Paper
Fast, Exact and Scalable Dynamic Ridesharing2021-01-27Paper
Network Flow-Based Refinement for Multilevel Hypergraph Partitioning2020-12-16Paper
Load-Balancing for Parallel Delaunay Triangulations2020-07-20Paper
In-Place Parallel Super Scalar Samplesort (IPSSSSo)2020-05-27Paper
Dynamic Space Efficient Hashing.2020-05-27Paper
Engineering a Distributed Full-Text Index2019-09-12Paper
Robust Massively Parallel Sorting2019-09-12Paper
Finding near-optimal independent sets at scale2019-09-12Paper
k-way Hypergraph Partitioning via n-Level Recursive Bisection2019-09-12Paper
Engineering a direct k-way Hypergraph Partitioning Algorithm2019-09-12Paper
Parallel d-D Delaunay Triangulations in Shared and Distributed Memory2019-09-12Paper
Distributed Evolutionary Graph Partitioning2019-09-12Paper
(Semi-)External Algorithms for Graph Partitioning and Clustering2019-09-12Paper
The Filter-Kruskal Minimum Spanning Tree Algorithm2019-09-11Paper
Simple and Fast Nearest Neighbor Search2019-09-11Paper
Algorithm Engineering – An Attempt at a Definition Using Sorting as an Example2019-09-11Paper
Intersection in Integer Inverted Indices2019-09-11Paper
Compressed Inverted Indexes for In-Memory Search Engines2019-09-11Paper
Better Approximation of Betweenness Centrality2019-09-11Paper
Time-Dependent Contraction Hierarchies2019-09-11Paper
Route Planning with Flexible Objective Functions2019-09-11Paper
Sequential and Parallel Algorithms and Data Structures2019-09-05Paper
Dynamic space efficient hashing2019-06-27Paper
An asymptotic approximation scheme for multigraph edge coloring2018-11-05Paper
Efficient Parallel Random Sampling—Vectorized, Cache-Efficient, and Online2018-08-17Paper
Scalable Parallel Suffix Array Construction2018-05-24Paper
Finding near-optimal independent sets at scale2017-09-08Paper
Better external memory suffix array construction2017-06-15Paper
Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering2017-04-28Paper
Engineering parallel string sorting2017-03-06Paper
https://portal.mardi4nfdi.de/entity/Q29549802017-01-24Paper
Advanced coarsening schemes for graph partitioning2016-10-24Paper
Random permutations on distributed, external and hierarchical memory2016-06-09Paper
Scalable generation of scale-free graphs2016-04-06Paper
Linear work suffix array construction2015-12-04Paper
HordeSat: A Massively Parallel Portfolio SAT Solver2015-11-20Paper
Minimum time-dependent travel times with contraction hierarchies2015-03-16Paper
https://portal.mardi4nfdi.de/entity/Q29346282014-12-18Paper
An asymptotic approximation scheme for multigraph edge coloring2014-10-13Paper
PReaCH: A Fast Lightweight Reachability Index Using Pruning and Contraction Hierarchies2014-10-08Paper
Real-time integrated prefetching and caching2014-08-18Paper
Engineering highway hierarchies2014-04-01Paper
Heuristic initialization for bipartite matching problems2014-04-01Paper
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm2014-04-01Paper
Cache-, hash-, and space-efficient bloom filters2014-04-01Paper
Goal-directed shortest-path queries using precomputed cluster distances2014-04-01Paper
Route planning with flexible edge restrictions2014-04-01Paper
Recent Advances in Graph Partitioning2013-11-13Paper
Parallel String Sample Sort2013-09-17Paper
On (Dynamic) Range Minimum Queries in External Memory2013-08-12Paper
https://portal.mardi4nfdi.de/entity/Q52989292013-06-25Paper
Efficient Route Compression for Hybrid Route Planning2013-04-19Paper
Engineering time-dependent many-to-many shortest paths computation2012-09-28Paper
Fast detour computation for ride sharing2012-09-28Paper
Time-Dependent Route Planning with Generalized Objective Functions2012-09-25Paper
Fast Routing in Road Networks with Transit Nodes2011-11-30Paper
Energy-efficient paths in radio networks2011-09-20Paper
Engineering Multilevel Graph Partitioning Algorithms2011-09-16Paper
STRONGER QUICKHEAPS2011-07-14Paper
Towards optimal range medians2011-06-07Paper
Alternative Route Graphs in Road Networks2011-05-12Paper
Online Scheduling with Bounded Migration2011-04-27Paper
n-Level Graph Partitioning2010-09-06Paper
Algorithmen und Datenstrukturen2010-07-19Paper
https://portal.mardi4nfdi.de/entity/Q35742672010-07-09Paper
https://portal.mardi4nfdi.de/entity/Q35742652010-07-09Paper
Algorithms - ESA 20032010-03-03Paper
Algorithms - ESA 20032010-03-03Paper
https://portal.mardi4nfdi.de/entity/Q33959992009-09-15Paper
A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching2009-07-21Paper
Towards Optimal Range Medians2009-07-14Paper
Engineering Route Planning Algorithms2009-07-09Paper
A bandwidth latency tradeoff for broadcast and reduction2009-03-23Paper
Semi-external LTL Model Checking2008-07-15Paper
Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks2008-06-13Paper
Algorithms and Data Structures2008-05-28Paper
How Branch Mispredictions Affect Quicksort2008-03-11Paper
Engineering Highway Hierarchies2008-03-11Paper
Engineering Algorithms for Approximate Weighted Matching2008-01-02Paper
Mathematical Foundations of Computer Science 20032007-12-07Paper
Goal Directed Shortest Path Queries Using Precomputed Cluster Distances2007-09-14Paper
Algorithms – ESA 20052006-06-27Paper
Automata, Languages and Programming2006-01-10Paper
Duality Between Prefetching and Queued Writing with Parallel Disks2005-09-16Paper
Automata, Languages and Programming2005-08-24Paper
Algorithms – ESA 20042005-08-18Paper
Fast priority queues for cached memory2005-08-04Paper
https://portal.mardi4nfdi.de/entity/Q46734062005-04-29Paper
Space efficient hash tables with worst case constant access time2005-04-19Paper
Δ-stepping: a parallelizable shortest path algorithm2004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q48131502004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q30464842004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q47371712004-08-11Paper
Tail Bounds and Expectations for Random Arc Allocation and Applications2004-06-18Paper
Randomized Receiver Initiated Load-balancing Algorithms for Tree-shaped Computations2004-03-16Paper
https://portal.mardi4nfdi.de/entity/Q44492312004-02-08Paper
https://portal.mardi4nfdi.de/entity/Q44289892003-09-22Paper
https://portal.mardi4nfdi.de/entity/Q44186562003-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44176742003-07-29Paper
https://portal.mardi4nfdi.de/entity/Q44176792003-07-29Paper
https://portal.mardi4nfdi.de/entity/Q44176692003-07-29Paper
Scanning multiple sequences via cache memory2003-06-02Paper
Fast concurrent access to parallel disks2003-06-02Paper
https://portal.mardi4nfdi.de/entity/Q47967042003-03-20Paper
https://portal.mardi4nfdi.de/entity/Q47993732003-03-19Paper
How helpers hasten \(h\)-relations2002-08-01Paper
A case study in scalability: An ADI method for the two-dimensional time-dependent Dirac equation2002-07-25Paper
https://portal.mardi4nfdi.de/entity/Q45369622002-06-25Paper
Reconciling simplicity and realism in parallel disk models2002-06-23Paper
Towards optimal locality in mesh-indexings2002-05-15Paper
https://portal.mardi4nfdi.de/entity/Q27539552001-11-11Paper
https://portal.mardi4nfdi.de/entity/Q27291012001-10-23Paper
Parallel integer optimization for crew scheduling2001-06-14Paper
https://portal.mardi4nfdi.de/entity/Q43215972000-06-21Paper
https://portal.mardi4nfdi.de/entity/Q49527092000-05-10Paper
https://portal.mardi4nfdi.de/entity/Q42520462000-03-13Paper
Analysis of nearest neighbor load balancing algorithms for random loads2000-01-12Paper
Randomized priority queues for fast parallel access1999-06-29Paper
https://portal.mardi4nfdi.de/entity/Q42181501999-05-10Paper
https://portal.mardi4nfdi.de/entity/Q42953811994-06-12Paper

Research outcomes over time

This page was built for person: Peter Sanders