Katalog der Deutschen Nationalbibliothek

Go to:

Knowledge Web

Person
Person

Person

Peter Sanders (1967-)

Informatiker

Name

Peter Sanders

Time

1967- (Date of birth and death)

Place

Neubeckum (Geburtsort)
Karlsruhe (Wirkungsort)
Deutschland

Gender

männlich

Academic degree

Prof. Dr. rer. nat.

Profession

Informatiker (characteristic profession)

Variant

P. Sanders

Topic

Personen zu Bildungswesen
Personen zu Informatik, Datenverarbeitung

Further information

Dt. Informatiker; Leibniz-Preis 2012, Prof. am Karlsruher Institut für Technologie. Hier leitet er das Institut für Theoretische Informatik, Algorithmik II.

Source

Landesbibliographie Baden-Württemberg

Record type

Person

GND-Identifier

136120113

Record ID

136120113

Involved in

show all

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

Pareto Sums of Pareto Sets: Lower Bounds and Algorithms

Combined Search and Encoding for Seeds, with an Application to Minimal Perfect Hashing

Engineering Minimal k-Perfect Hash Functions

Fast and Lightweight Distributed Suffix Array Construction

Linear-Time Multilevel Graph Partitioning via Edge Sparsification

Pareto Sums of Pareto Sets : Lower Bounds and Algorithms

Pareto Sums of Pareto Sets : Lower Bounds and Algorithms

PHOBIC: Perfect Hashing With Optimized Bucket Sizes and Interleaved Coding

Scalable Distributed String Sorting

Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks

High Performance Construction of RecSplit Based Minimal Perfect Hash Functions

Learned Monotone Minimal Perfect Hashing

Pareto Sums of Pareto Sets

Pareto Sums of Pareto Sets

Parallel Flow-Based Hypergraph Partitioning

Online Scheduling with Bounded Migration

28th Annual European Symposium on Algorithms (ESA 2020)

Algorithms and Data Structures : Foundations and Probabilistic Methods for Design and Analysis

Concurrent Expandable AMQs on the Basis of Quotient Filters

Front Matter, Table of Contents, Preface, Conference Organization

Dynamic Space Efficient Hashing

Dynamic Space Efficient Hashing

In-Place Parallel Super Scalar Samplesort (IPSSSSo)

Algorithm Engineering : Selected Results and Surveys

Algorithmen und Datenstrukturen : die Grundwerkzeuge

Combinatorial pattern matching : 24th annual symposium ; proceedings

Combinatorial Pattern Matching : 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings

Algorithmen und Datenstrukturen

Exact routing in large road networks using contraction hierarchies

Algorithm Engineering

Special issue: algorithm engineering

Engineering Time-Dependent Many-to-Many Shortest Paths Computation

Fast Detour Computation for Ride Sharing

Engineering route planning algorithms

Algorithms and data structures : the basic toolbox

Algorithm Engineering

MCSTL: the multi-core standard template library

Linear work suffix array construction

Online scheduling with bounded migration : (extended abstract for Dagstuhl Seminar 05031 on Algorithms for Optimization with Incomplete Information)

Stxxl : standard template library for xxl data sets

A simpler linear time 2/3 - ε [epsilon] approximation for maximum weight matching

Algorithms for scalable storage servers

Engineering an external memory minimum spanning tree algorithm

Online scheduling with bounded migration

Asynchronous parallel disk sorting

Polynomial time algorithms for network information flow

Polynomial time algorithms for network information flow

Scheduling and traffic allocation for tasks with bounded splittability

A practical minimum spanning tree algorithm using the cycle property

Fast priority queues for cached memory

Fast concurrent access to parallel disks

Feasible models of computation : three dimensionality and energy consumption

Lastverteilungsalgorithmen für parallele Tiefensuche

Lastverteilungsalgorithmen für parallele Tiefensuche

Parallele Programmierung mit MPI : ein Praktikum ; [Programmtexte im Internet]

Randomized priority queues for fast parallel access

Towards optimal locality in mesh indexings

On the Manhattan distance between points on space filling mesh indexings

Efficient emulation of MIMD behavior on SIMD machines
Please note

The beta version does not yet contain all functions and information of the DNB portal catalogue. If you are missing information or want to order a medium, please visit the page in the DNB portal catalogue via the following link:

DNB portal