D-Index & Metrics Best Publications

D-Index & Metrics

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Computer Science D-index 66 Citations 16,664 255 World Ranking 1075 National Ranking 38

Overview

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Programming language
  • Artificial intelligence

Peter Sanders mostly deals with Theoretical computer science, Algorithm, Contraction hierarchies, Dijkstra's algorithm and Parallel computing. His Theoretical computer science study combines topics from a wide range of disciplines, such as Computation, Data structure and Graph partition, Graph. Peter Sanders works in the field of Algorithm, focusing on Directed graph in particular.

His Contraction hierarchies research includes themes of Node, Routing and Speedup. The Dijkstra's algorithm study which covers Distributed computing that intersects with Contraction. His study looks at the intersection of Parallel computing and topics like Merge sort with Integer and Radix sort.

His most cited work include:

  • Polynomial time algorithms for multicast network code construction (937 citations)
  • Contraction hierarchies: faster and simpler hierarchical routing in road networks (495 citations)
  • Engineering Route Planning Algorithms (347 citations)

What are the main themes of his work throughout his whole career to date?

Peter Sanders focuses on Parallel computing, Algorithm, Theoretical computer science, Data structure and Graph partition. His Parallel computing research is multidisciplinary, incorporating perspectives in Sorting, Sorting algorithm, Auxiliary memory and Scalability. His Algorithm research is multidisciplinary, relying on both Upper and lower bounds and Shortest path problem.

The study incorporates disciplines such as Contraction hierarchies, Algorithm engineering, Computation and Benchmark in addition to Theoretical computer science. His biological study spans a wide range of topics, including Routing and Speedup. His Graph partition study incorporates themes from Evolutionary algorithm and Local search.

He most often published in these fields:

  • Parallel computing (25.69%)
  • Algorithm (23.39%)
  • Theoretical computer science (22.71%)

What were the highlights of his more recent work (between 2015-2021)?

  • Theoretical computer science (22.71%)
  • Parallel computing (25.69%)
  • Algorithm (23.39%)

In recent papers he was focusing on the following fields of study:

His primary areas of investigation include Theoretical computer science, Parallel computing, Algorithm, Sorting and Graph. His work carried out in the field of Theoretical computer science brings together such families of science as Hypergraph, Correctness, Efficient algorithm and Graph partition. His studies deal with areas such as Hash table and Data structure as well as Parallel computing.

His Algorithm study which covers Hash function that intersects with Element. Peter Sanders has researched Sorting in several fields, including Algorithm engineering and Algorithmics. His Graph research integrates issues from Scalability, Graph, Local search, Embarrassingly parallel and Complex network.

Between 2015 and 2021, his most popular works were:

  • Route Planning in Transportation Networks (283 citations)
  • Recent Advances in Graph Partitioning (227 citations)
  • Parallel Graph Partitioning for Complex Networks (60 citations)

In his most recent research, the most cited papers focused on:

  • Algorithm
  • Programming language
  • Artificial intelligence

Peter Sanders mostly deals with Parallel computing, Algorithm, Theoretical computer science, Graph partition and Data structure. His specific area of interest is Parallel computing, where Peter Sanders studies Parallel algorithm. His work in the fields of Algorithm, such as Sorting algorithm and Asymptotically optimal algorithm, intersects with other areas such as Merge.

His Theoretical computer science research includes elements of Hypergraph, Counting sort, Internal sort, External sorting and Priority queue. Peter Sanders works mostly in the field of Graph partition, limiting it down to concerns involving Local search and, occasionally, Independent set, Kernelization, Point and Balanced graph. His Data structure study integrates concerns from other disciplines, such as Sorting, Toolbox and Memory management.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

Polynomial time algorithms for multicast network code construction

S. Jaggi;P. Sanders;P.A. Chou;M. Effros.
IEEE Transactions on Information Theory (2005)

1145 Citations

Contraction hierarchies: faster and simpler hierarchical routing in road networks

Robert Geisberger;Peter Sanders;Dominik Schultes;Daniel Delling.
WEA'08 Proceedings of the 7th international conference on Experimental algorithms (2008)

843 Citations

Simple linear work suffix array construction

Juha Kärkkäinen;Peter Sanders.
international colloquium on automata languages and programming (2003)

638 Citations

Engineering Route Planning Algorithms

Daniel Delling;Peter Sanders;Dominik Schultes;Dorothea Wagner.
Algorithmics of Large and Complex Networks (2009)

629 Citations

Highway hierarchies hasten exact shortest path queries

Peter Sanders;Dominik Schultes.
european symposium on algorithms (2005)

454 Citations

Route Planning in Transportation Networks

Hannah Bast;Daniel Delling;Andrew V. Goldberg;Matthias Müller-Hannemann.
Algorithm Engineering (2016)

447 Citations

Linear work suffix array construction

Juha Kärkkäinen;Peter Sanders;Stefan Burkhardt.
Journal of the ACM (2006)

442 Citations

Polynomial time algorithms for network information flow

Peter Sanders;Sebastian Egner;Ludo Tolhuizen.
acm symposium on parallel algorithms and architectures (2003)

417 Citations

Exact Routing in Large Road Networks Using Contraction Hierarchies

Robert Geisberger;Peter Sanders;Dominik Schultes;Christian Vetter.
Transportation Science (2012)

302 Citations

Fast Routing in Road Networks with Transit Nodes

Holger Bast;Stefan Funke;Peter Sanders;Dominik Schultes.
Science (2007)

289 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

Best Scientists Citing Peter Sanders

Dorothea Wagner

Dorothea Wagner

Karlsruhe Institute of Technology

Publications: 76

Daniel Delling

Daniel Delling

Apple (United States)

Publications: 72

Muriel Medard

Muriel Medard

MIT

Publications: 61

Gonzalo Navarro

Gonzalo Navarro

University of Chile

Publications: 57

Renato F. Werneck

Renato F. Werneck

Microsoft (United States)

Publications: 48

Andrew V. Goldberg

Andrew V. Goldberg

Amazon (United States)

Publications: 42

David A. Bader

David A. Bader

New Jersey Institute of Technology

Publications: 35

Zongpeng Li

Zongpeng Li

Wuhan University

Publications: 31

Michael Langberg

Michael Langberg

University at Buffalo, State University of New York

Publications: 31

Guy E. Blelloch

Guy E. Blelloch

Carnegie Mellon University

Publications: 29

Andrew Lumsdaine

Andrew Lumsdaine

Pacific Northwest National Laboratory

Publications: 27

Michael Mitzenmacher

Michael Mitzenmacher

Harvard University

Publications: 27

William F. Smyth

William F. Smyth

McMaster University

Publications: 27

Raymond W. Yeung

Raymond W. Yeung

Chinese University of Hong Kong

Publications: 26

Stefan Edelkamp

Stefan Edelkamp

Czech Technical University in Prague

Publications: 26

Michelle Effros

Michelle Effros

California Institute of Technology

Publications: 26

Something went wrong. Please try again later.