Beier, R., S. Funke, D. Matijevic and P. Sanders: Energy-Efficient Paths in Radio Networks. In: Algorithmica 61, 2, 298-319 (2011).
doi: 10.1007/s00453-010-9414-0
url: http://dx.doi.org/10.1007/s00453-010-9414-0
localid: C1256428004B93B8-606C1973C781AC1FC12579C90052B53F-Beier2011
Mehlhorn, K. and P. Sanders: Algorithms and Data Structures: The Basic Toolbox. Springer, Berlin (2009) 300 p.
localid: C1256428004B93B8-75AD1CF772C0FE5BC12575850043645F-Mehlhorn-Sanders:Toolbox
Dementiev, R., L. Kettner and P. Sanders: STXXL: standard template library for XXL data sets. In: Software - Practice & Experience 38, 6, 589-637 (2008).
doi: 10.1002/spe.844
url: http://dx.doi.org/10.1002/spe.844
localid: C125756E0038A185-07A5F0C61FEBE40AC1257576003CA5F0-Kettner2008
Bast, H., S. Funke, P. Sanders and D. Schultes: Fast Routing in Road Networks using Transit Nodes. In: Science 316, 5824, 566-566 (2007).
doi: 10.1126/science.1137521
localid: C12573CC004A8E26-B7EC401F13BCFE21C12573D4004BCBB0-BFSS07
Bast, H., S. Funke, D. Matijevic, P. Sanders and D. Schultes: In Transit to Constant Time Shortest-Path Queries in Road Networks. In: Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithmics and Combinatorics, (Eds.) Applegate, David; Brodal, Gerth Stølting; Panario, Daniel; Sedgewick, Robert. Proceedings in Applied Mathematics. SIAM, Philadelphia, PA, USA (2007) 46-59.
localid: C12573CC004A8E26-E90810A80D03CF90C125721E0061D015-BastFMSS07
Maue, J., P. Sanders and D. Matijevic: Goal Directed Shortest Path Queries Using Precomputed Cluster Distances. In: Experimental Algorithms, 5th International Workshop, WEA 2006 Lecture Notes in Computer Science. Springer, Berlin, Germany (2006) 316-327.
localid: C1256428004B93B8-E6D1991056F598FCC1257194003878C7-MaueSandersMatijevic2006
Kaligosi, K. and P. Sanders: How Branch Mispredictions Affect Quicksort. In: Algorithms - ESA 2006, 14th Annual European Symposium Lecture Notes in Computer Science. Springer, Berlin, Germany (2006) 780-791.
localid: C1256428004B93B8-9F331DF0CA804105C1257296005020FB-Kaligosi2006a
Sanders, P. and D. Steurer: An Asymptotic Approximation Scheme for Multigraph Edge Coloring. In: 16th ACM-SIAM Symposium on Discrete Algorithms ACM/SIAM, New York/Philadephia (2005) 897-906.
localid: C1256428004B93B8-80FBF454740A9BF3C12571030031E632-Sanders2005a
Sanders, P. and D. Steurer: An Asymptotic Approximation Scheme for Multigraph Edge Coloring. In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05) SIAM, Philadelphia, USA (2005) 897-906.
localid: C1256428004B93B8-8D31C50979686514C1256FAC004D3661-SanSte2005
Dementiev, R., J. Kärkkäinen, J. Mehnert and P. Sanders: Better External Memory Suffix Array Construction. In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALCO 2005) SIAM, Philadelphia, USA (2005) 86-97.
localid: C1256428004B93B8-3A3C24F177ACF9B2C1256FAC0057E187-DKMS05
http://edoc.mpg.de
The Max Planck Society does not take any responsibility for the content of this export.