Peter Sanders

Dikutip oleh

	Semua	Sejak 2020
Kutipan	23606	7801
indeks-h	80	46
indeks-i10	232	135

1700

850

425

1275

200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202589 101 153 184 231 375 477 594 722 870 917 1025 1278 1211 1383 1420 1372 1369 1465 1509 1451 1465 1611 1490 266

Akses publik

Lihat semua

102 artikel

8 artikel

tersedia

tidak tersedia

Berdasarkan pada mandat pendanaan

Pengarang bersama

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

Ikuti

Peter Sanders

Professor of Computer Science, Karlsruhe Institute of Technology

Email yang diverifikasi di kit.edu

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


Judul Urutkan menurut kutipan Urutkan menurut tahun Urutkan menurut judul	Dikutip oleh Dikutip oleh	Tahun
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	1195	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	1149	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	1021	2016
Engineering route planning algorithms D Delling, P Sanders, D Schultes, D Wagner Algorithmics of large and complex networks, 117-139, 2009	813	2009
Algorithms and data structures: The basic toolbox K Mehlhorn, P Sanders Springer Science & Business Media, 2008	699	2008
Simple linear work suffix array construction J Kärkkäinen, P Sanders International Colloquium on Automata, Languages, and Programming, 943-955, 2003	693	2003
Recent advances in graph partitioning A Buluç, H Meyerhenke, I Safro, P Sanders, C Schulz Algorithm engineering: selected results and surveys, 117-158, 2016	662	2016
Highway hierarchies hasten exact shortest path queries P Sanders, D Schultes European Symposium on Algorithms, 568-579, 2005	526	2005
Linear work suffix array construction J Kärkkäinen, P Sanders, S Burkhardt Journal of the ACM (JACM) 53 (6), 918-936, 2006	524	2006
Exact routing in large road networks using contraction hierarchies R Geisberger, P Sanders, D Schultes, C Vetter Transportation Science 46 (3), 388-404, 2012	497	2012
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	434	2003
Δ-stepping: a parallelizable shortest path algorithm U Meyer, P Sanders Journal of Algorithms 49 (1), 114-152, 2003	380	2003
Δ-stepping: a parallelizable shortest path algorithm U Meyer, P Sanders Journal of Algorithms 49 (1), 114-152, 2003	380	2003
Better approximation of betweenness centrality R Geisberger, P Sanders, D Schultes 2008 Proceedings of the Tenth Workshop on Algorithm Engineering and …, 2008	342	2008
Graph partitioning and graph clustering, 10th DIMACS implementation challenge postworkshop proceedings DA Bader, H Meyerhenke, P Sanders, D Wagner	334*	2012
Fast routing in road networks with transit nodes H Bast, S Funke, P Sanders, D Schultes Science 316 (5824), 566-566, 2007	331	2007
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	311	2007
Engineering highway hierarchies P Sanders, D Schultes European Symposium on Algorithms, 804-816, 2006	306	2006
Think locally, act globally: Highly balanced graph partitioning P Sanders, C Schulz International Symposium on Experimental Algorithms, 164-175, 2013	297	2013
Engineering multilevel graph partitioning algorithms P Sanders, C Schulz European Symposium on algorithms, 469-480, 2011	259	2011

Sistem tidak dapat melakukan operasi ini. Coba lagi nanti.

Artikel 1–20

Kutipan per tahun

Kutipan duplikat

Kutipan yang digabung

Tambahkan pengarang bersamaPengarang bersama

Ikuti

Dikutip oleh

Pengarang bersama