Peter Sanders

About Peter Sanders

Peter Sanders, With an exceptional h-index of 74 and a recent h-index of 44 (since 2020), a distinguished researcher at Karlsruher Institut für Technologie, specializes in the field of algorithm engineering, graph algorithms, data structures, parallel algorithms, algorithms for big data.

His recent articles reflect a diverse array of research interests and contributions to the field:

PHOBIC: Perfect Hashing with Optimized Bucket Sizes and Interleaved Coding

Scalable Distributed String Sorting

KaMPIng: Flexible and (Near) Zero-overhead C++ Bindings for MPI

Scalable High-Quality Hypergraph Partitioning

Formally Verifying an Efficient Sorter

Fast Many-to-Many Routing for Dynamic Taxi Sharing with Meeting Points

ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force

Bipartite ShockHash: Pruning ShockHash Search for Efficient Perfect Hashing

Peter Sanders Information

University

Position

Professor of Computer Science

Citations(all)

21726

Citations(since 2020)

7463

Cited By

17433

hIndex(all)

74

hIndex(since 2020)

44

i10Index(all)

221

i10Index(since 2020)

138

Email

University Profile Page

Google Scholar

Peter Sanders Skills & Research Interests

algorithm engineering

graph algorithms

data structures

parallel algorithms

algorithms for big data

Top articles of Peter Sanders

PHOBIC: Perfect Hashing with Optimized Bucket Sizes and Interleaved Coding

arXiv preprint arXiv:2404.18497

2024/4/29

Peter Sanders
Peter Sanders

H-Index: 45

Scalable Distributed String Sorting

arXiv preprint arXiv:2404.16517

2024/4/25

Florian Kurpicz
Florian Kurpicz

H-Index: 6

Peter Sanders
Peter Sanders

H-Index: 45

KaMPIng: Flexible and (Near) Zero-overhead C++ Bindings for MPI

arXiv preprint arXiv:2404.05610

2024/4/8

Scalable High-Quality Hypergraph Partitioning

ACM Transactions on Algorithms

2024/1/22

Formally Verifying an Efficient Sorter

2024/4/4

Bernhard Beckert
Bernhard Beckert

H-Index: 15

Peter Sanders
Peter Sanders

H-Index: 45

Fast Many-to-Many Routing for Dynamic Taxi Sharing with Meeting Points

2024

Peter Sanders
Peter Sanders

H-Index: 45

ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force

2024

Peter Sanders
Peter Sanders

H-Index: 45

Bipartite ShockHash: Pruning ShockHash Search for Efficient Perfect Hashing

arXiv preprint arXiv:2310.14959

2023/10/23

Peter Sanders
Peter Sanders

H-Index: 45

Distributed Deep Multilevel Graph Partitioning

2023/8/24

Peter Sanders
Peter Sanders

H-Index: 45

Daniel Seemaier
Daniel Seemaier

H-Index: 2

A Sweep-plane Algorithm for Calculating the Isolation of Mountains

arXiv preprint arXiv:2305.08470

2023/5/15

Peter Sanders
Peter Sanders

H-Index: 45

Engineering massively parallel MST algorithms

arXiv preprint arXiv:2302.12199

2023/2/23

Peter Sanders
Peter Sanders

H-Index: 45

Engineering a distributed-memory triangle counting algorithm

arXiv preprint arXiv:2302.11443

2023/2/22

Peter Sanders
Peter Sanders

H-Index: 45

Fast Many-to-Many Routing for Ridesharing with Multiple Pickup and Dropoff Locations

arXiv preprint arXiv:2305.05417

2023/5/9

Peter Sanders
Peter Sanders

H-Index: 45

Learned Monotone Minimal Perfect Hashing

arXiv preprint arXiv:2304.11012

2023/4/21

Peter Sanders
Peter Sanders

H-Index: 45

Sliding Block Hashing (Slick)--Basic Algorithmic Ideas

arXiv preprint arXiv:2304.09283

2023/4/18

Peter Sanders
Peter Sanders

H-Index: 45

Efficient Yao Graph Construction

arXiv preprint arXiv:2303.07858

2023/3/14

Peter Sanders
Peter Sanders

H-Index: 45

High-quality hypergraph partitioning

ACM Journal of Experimental Algorithmics

2023/2/10

Scalable discrete algorithms for big data applications

2021/1/1

See List of Professors in Peter Sanders University(Karlsruher Institut für Technologie)

Co-Authors

academic-engine