Peter Sanders

Citata da

	Tutte	Dal 2018
Citazioni	21217	8365
Indice H	74	48
i10-index	220	145

1500

750

375

1125

2001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202391 99 153 176 223 366 473 575 710 870 890 993 1281 1214 1377 1420 1377 1379 1468 1458 1453 1437 1167

Accesso pubblico

Visualizza tutto

88 articoli

5 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Christian SchulzProfessor of Computer Science, Heidelberg UniversityEmail verificata su informatik.uni-heidelberg.de
Dominik SchultesProfessor für Informatik, Technische Hochschule MittelhessenEmail verificata su iem.thm.de
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusEmail verificata su mpi-inf.mpg.de
Dorothea WagnerProfessor of Computer Science, Karlsruhe Institute of Technology (KIT)Email verificata su kit.edu
Robert GeisbergerGoogleEmail verificata su google.com
Roman DementievIntelEmail verificata su intel.com
Ulrich MeyerProfessor of Algorithm Engineering, Goethe University FrankfurtEmail verificata su cs.uni-frankfurt.de
Henning MeyerhenkeProfessor of Computer Science, HU BerlinEmail verificata su hu-berlin.de
Johannes SinglerEmail verificata su singler.name
Daniel DellingGoogleEmail verificata su google.com
Sebastian SchlagAlgorithm Engineer at AppleEmail verificata su sebastianschlag.de
Juha KärkkäinenDepartment of Computer scienceEmail verificata su cs.helsinki.fi
Dennis LuxenBloomberg L.P.Email verificata su bloomberg.net
Ilya SafroAssociate Professor of Computer Science, University of DelawareEmail verificata su udel.edu
Stefan FunkeUniversität Stuttgart, GermanyEmail verificata su fmi.uni-stuttgart.de
Tobias HeuerPostdoctoral Researcher, Karlsruhe Institute of TechnologyEmail verificata su kit.edu
Renato WerneckAmazonEmail verificata su cs.princeton.edu
Sebastian LammKarlsruhe Institute of Technology (KIT)Email verificata su kit.edu
Dennis SchieferdeckerKarlsruhe Institute of Technology Email verificata su kit.edu
Timo BingmannKarlsruhe Institute of TechnologyEmail verificata su kit.edu

Segui

Peter Sanders

Professor of Computer Science, Karlsruhe Institute of Technology

Email verificata su kit.edu

algorithm engineering graph algorithms data structures parallel algorithms algorithms for big data


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
Polynomial time algorithms for multicast network code construction S Jaggi, P Sanders, PA Chou, M Effros, S Egner, K Jain, LMGM Tolhuizen IEEE Transactions on Information Theory 51 (6), 1973-1982, 2005	1183	2005
Contraction hierarchies: Faster and simpler hierarchical routing in road networks R Geisberger, P Sanders, D Schultes, D Delling International Workshop on Experimental and Efficient Algorithms, 319-333, 2008	1023	2008
Route planning in transportation networks H Bast, D Delling, A Goldberg, M Müller-Hannemann, T Pajor, P Sanders, ... Algorithm Engineering, 19-80, 2016	871	2016
Engineering route planning algorithms D Delling, P Sanders, D Schultes, D Wagner Algorithmics of large and complex networks, 117-139, 2009	740	2009
Simple linear work suffix array construction J Kärkkäinen, P Sanders International Colloquium on Automata, Languages, and Programming, 943-955, 2003	678	2003
Algorithms and data structures: The basic toolbox K Mehlhorn, P Sanders Springer Science & Business Media, 2008	621	2008
Recent advances in graph partitioning A Buluç, H Meyerhenke, I Safro, P Sanders, C Schulz Algorithm engineering: selected results and surveys, 117-158, 2016	571	2016
Highway hierarchies hasten exact shortest path queries P Sanders, D Schultes European Symposium on Algorithms, 568-579, 2005	496	2005
Linear work suffix array construction J Kärkkäinen, P Sanders, S Burkhardt Journal of the ACM (JACM) 53 (6), 918-936, 2006	484	2006
Polynomial time algorithms for network information flow P Sanders, S Egner, L Tolhuizen Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and …, 2003	427	2003
Exact routing in large road networks using contraction hierarchies R Geisberger, P Sanders, D Schultes, C Vetter Transportation Science 46 (3), 388-404, 2012	415	2012
Δ-stepping: a parallelizable shortest path algorithm U Meyer, P Sanders Journal of Algorithms 49 (1), 114-152, 2003	330	2003
Δ-stepping: a parallelizable shortest path algorithm U Meyer, P Sanders Journal of Algorithms 49 (1), 114-152, 2003	330	2003
Better approximation of betweenness centrality R Geisberger, P Sanders, D Schultes 2008 Proceedings of the Tenth Workshop on Algorithm Engineering and …, 2008	313	2008
Fast routing in road networks with transit nodes H Bast, S Funke, P Sanders, D Schultes Science 316 (5824), 566-566, 2007	312	2007
Graph partitioning and graph clustering, 10th DIMACS implementation challenge postworkshop proceedings DA Bader, H Meyerhenke, P Sanders, D Wagner	307*	2012
In transit to constant time shortest-path queries in road networks H Bast, S Funke, D Matijevic, P Sanders, D Schultes Proceedings of the Meeting on Algorithm Engineering & Expermiments, 46-59, 2007	302	2007
Engineering highway hierarchies P Sanders, D Schultes European Symposium on Algorithms, 804-816, 2006	285	2006
Think locally, act globally: Highly balanced graph partitioning P Sanders, C Schulz International Symposium on Experimental Algorithms, 164-175, 2013	268	2013
A parallelization of Dijkstra's shortest path algorithm A Crauser, K Mehlhorn, U Meyer, P Sanders Mathematical Foundations of Computer Science 1998: 23rd International …, 1998	250	1998

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori