Peter Sanders - Concepedia

Author

Peter Sanders

Also Known As

Bibliothek, Kit, Ers Dominik Schultes, Funke, Stefan, Hespe, Demian, Kliemann, Lasse, P Sanders, P W Sanders, P. Sanders, P. W. Sanders, P.W. Sanders

716

Publications

14.6K

Citations

H-Index

157

Concepts

All Affiliations

Karlsruhe Institute of Technology Max Planck Society Karlsruhe University of Education Max Planck Institute for Informatics

About

Peter Sanders is an author at Karlsruhe Institute of Technology specializing in engineering, computer science, and parallel computing.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	37	72	5.2K
2	Business	13	15	2.4K
3	Education	5	5	208
4	Medicine	4	4	99
5	Management	3	3	140

Peter Sanders

Publications

Citations

H-Index

Page 1

	Year	Citations
Polynomial Time Algorithms for Multicast Network Code Construction Sidharth Jaggi, Peter Sanders, Philip A. Chou, IEEE Transactions on Information Theory EngineeringNetwork AnalysisComputational ComplexityCommunication ComplexitySink Node T	2005	956
Linear work suffix array construction Juha Kärkkäinen, Peter Sanders, Stefan Burkhardt Journal of the ACM Mathematical ProgrammingArray ComputingEngineeringString-searching AlgorithmString Processing	2006	397
Exact Routing in Large Road Networks Using Contraction Hierarchies Robert Geisberger, Peter Sanders, Dominik Schultes, Transportation Science EngineeringNetwork RoutingNetwork AnalysisContraction HierarchiesFast Routing	2012	317
Polynomial time algorithms for network information flow Peter Sanders, Sebastian Egner, Ludo Tolhuizen EngineeringNetwork AnalysisComputational ComplexitySink Node TDistributed Source Coding	2003	271
Fast Routing in Road Networks with Transit Nodes Holger Bast, Stefan Funke, Peter Sanders, Science Transport Network AnalysisEngineeringNetwork RoutingNetwork AnalysisWestern Europe	2007	225
Better Approximation of Betweenness Centrality Robert Geisberger, Peter Sanders, Dominik Schultes Society for Industrial and Applied Mathematics eBooks Unbiased ApproximationEngineeringNetwork AnalysisGood ApproximationsComputational Social Science	2008	198
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm Reinhard Bauer, Daniel Delling, Peter Sanders, ACM Journal of Experimental Algorithmics Mathematical ProgrammingEngineeringNetwork RoutingNetwork AnalysisOperations Research	2010	186
Space Efficient Hash Tables with Worst Case Constant Access Time Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Theory of Computing Systems	2004	169
MCSTL Felix Putze, Peter Sanders, Johannes Singler Abstract Object Theory	2007	113
Cache-, hash-, and space-efficient bloom filters Felix Putze, Peter Sanders, Johannes Singler ACM Journal of Experimental Algorithmics Cluster ComputingEngineeringSpace-efficient Bloom FiltersComputer ArchitectureHardware Security	2009	107

Page 1