| Titel | Autor | Quelle |
|---|---|---|
| Algorithms - ESA 2009 Proceedings | P. Sanders, A. Fiat (eds.) |
2009, 17th Annual European Symposium on Algorithms ESA, Springer-Verlag, ISBN 978-3-642-04127-3 |
| Algorithms and Data Structures: The Basic Toolbox | K. Mehlhorn, P. Sanders |
2008, Springer-Verlag, ISBN 978-3540779773 |
| Titel | Autor | Quelle |
|---|---|---|
| Benchmarking for Graph Clustering and Partitioning | D. Bader, A. Kappes, H. Meyerhenke, P. Sanders, C. Schulz and D. Wagner |
Encyclopedia of Social Network Analysis and Mining, ISBN: 978-1-4614-6169-2 |
| Shortest Paths | P. Sanders, J. Singler |
Algorithms Unplugged, ISBN 978-3642153273, S. 317-324, Springer-Verlag 2011. |
| Libraries | R. Dementiev, J. Singler |
Algorithm Engineering. LNCS Band 5971, Seiten 290-324. Springer-Verlag, 2010. |
| Algorithm Engineering – An Attempt at a Definition | P. Sanders |
2009, Efficient Algorithms - Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, Springer-Verlag, ISBN 978-3-642-03455-8, 321-340 |
| Engineering Route Planning Algorithms | D. Delling, P. Sanders, D. Schultes, D. Wagner |
2009, Algorithmics of Large and Complex Networks, Springer-Verlag, ISBN 978-3-642-02093-3, 117-139 |
| Kürzeste Wege | P. Sanders, J. Singler |
Taschenbuch der Algorithmen, Springer-Verlag, ISBN 978-3540763932, S. 345-352, 2008 |
| Multidimensional packing problems | L. Epstein, R. van Stee |
Handbook of Approximation Algorithms and Metaheuristics, ISBN 978-1-58488-550-4 |
| Titel | Autor | Quelle |
|---|---|---|
| Location-Free Detection of Network Boundaries | Dennis Schieferdecker |
ACM Transactions on Sensor Networks, Volume 11 Issue 4, December 2015 |
| Candidate Sets for Alternative Routes in Road Networks | Dennis Luxen, Dennis Schieferdecker |
Journal of Experimental Algorithmics, Volume 19, 2014 |
| Finding Near-Optimal Independent Sets at Scale | Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck |
ACM Journal of Heuristics |
| Drawing Large Graphs by Multilevel Maxent-Stress Optimization | Henning Meyerhenke, Martin Nöllenburg, Christian Schulz |
IEEE TVCG |
| Parallel Graph Partitioning for Complex Networks | Henning Meyerhenke, Peter Sanders, Christian Schulz |
IEEE TPDS |
| Partitioning (Hierarchically Clustered) Complex Networks via Size-Constrained Graph Clustering | Henning Meyerhenke, Peter Sanders, Christian Schulz |
ACM Journal of Heuristics |
| Tree-based Coarsening and Partitioning of Complex Networks | Roland Glantz, Henning Meyerhenke, and Christian Schulz |
ACM JEA |
| Scalable Generation of Scale-free Graphs | Peter Sanders and Christian Schulz |
IPL |
| Work-Efficient Matrix Inversion in Polylogarithmic Time | Peter Sanders, Jochen Speck, Raoul Steffen |
ACM Transactions on Parallel Computing September 2015 |
| Engineering Parallel String Sorting | Timo Bingmann, Andreas Eberle, Peter Sanders |
Algorithmica, 2015 |
| Turbo für Graphdatenbanken: Graphpartitionierung mit KaHIP | Heiko Papenfuß, Peter Sanders, and Christian Schulz |
JavaSPEKTRUM |
| Constraint-based large neighborhood search for machine reassignment | Felix Brandt, Jochen Speck, Markus Völker |
Annals of Operations Research, December 2014 |
| The SAP HANA Database - An Architecture Overview |
F. Färber, N. May, W. Lehner, P. Große, I. Müller, H. Rauhe, J. Dees |
IEEE Data Engineering Bulletin, 35 (1): 28-33, 2012 |
| Exact Routing in Large Road Networks Using Contraction Hierarchies |
R. Geisberger, P. Sanders, D. Schultes, C. Vetter |
Transportation Science, April 2012 |
| Energy-Efficient Sorting using Solid State Disks | A. Beckmann, U. Meyer, P. Sanders, J. Singler | Sustainable Computing, Elsevier. |
| Stronger Quickheaps |
G. Navarro, R. Paredes, P. v. Poblete, P. Sanders |
International Journal of Foundations of Computer Science (IJFCS), 22(4), p. 945-969. |
| Parallel Geometric Algorithms for Multi-Core Computers | V. H. F. Batista, D. L. Millman, S. Pion, J. Singler |
Computational Geometry: Theory and Applications, 43 (8), Seiten 663–677, 2010 |
| Energy-efficient paths in radio networks | R. Beier, S. Funke, D. Matijevic, P. Sanders |
Algorithmica, 2011 |
| Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra’s Algorithm | Reinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, Dominik Schultes, Dorothea Wagner |
ACM Journal of Experimental Algorithmics, Volume 15, 2010 |
| Online Scheduling with Bounded Migration | P. Sanders, N. Sivadasan, M. Skutella |
Mathematics of Operations Research, 34 (2): 481-498, 2009 |
| Goal directed shortest path queries using Precomputed Cluster Distances | J. Maue, P. Sanders, D. Matijevic |
ACM Journal of Experimental Algorithmics, 2009 |
| Cache-, Hash- and Space-Efficient Bloom Filters | F. Putze, P. Sanders, J. Singler |
ACM Journal of Experimental Algorithmics, Volume 14, 2009 |
| Two-tree algorithms for full bandwidth broadcast, reduction and scan | P. Sanders, J. Speck, J. Larsson Träff |
Parallel Computing, 2009 |
| Single-Pass List Partitioning | L. Frias, J. Singler, P. Sanders |
Scalable Computing: Practice and Experience, 9 (3), Seiten 179–184, 2008. |
| An Asymptotic Approximation Scheme for Multigraph Edge Coloring | P. Sanders, D. Steurer |
ACM Transactions on Algorithms 4 (2): S. 897-906, 2008 |
| Fast routing in road networks with transit nodes | H. Bast, S. Funke, P. Sanders, D. Schultes |
Science 316 (5824): S. 566, 2007 |
| Better External Memory Suffix Array Construction | R. Dementiev, J. Kärkkäinen, J. Mehnert, P. Sanders |
ACM Journal of Experimental Algorithmics (to appear in special issue on ALENEX 2005), 2007 |
| Scalable Parallel Suffix Array Construction | F. Kulla, P. Sanders |
Parallel Computing, 33 (Special issue on EuroPVM/MPI 2006), 2007, 605-612 |
| STXXL: Standard Template Library for XXL Data Sets | R. Dementiev, L. Kettner, P. Sanders |
Software Practice & Experience, 37(10), 2007 |
| Calculating lower bounds for caching problems | L. Epstein, R. van Stee |
Computing, 80(3):275--285, 2007 |
| Bounds for online bounded space hypercube packing | L. Epstein und R. van Stee | Discrete Optimization 4 (2): 185-197, 2007 |
| Paging with connections: FIFO strikes again | L. Epstein, Y. Kleiman, J. Sgall und R. van Stee | Theoretical Computer Science 377: 55-64, 2007. |
| A study of integrated document and connection caching in the WWW | Susanne Albers, Rob van Stee | Algorithmica 47(3): 239-252, 2007 |
| This side up! | Leah Epstein, Rob van Stee | ACM Transactions on Algorithms 2(2):228-243, 2006 |
| Linear Work Suffix Array Construction | J. Kärkkäinen, P. Sanders, S. Burkhardt |
Journal of the ACM 53 (6): 1-19, 2006 |
| Online scheduling of splittable tasks | Leah Epstein, Rob van Stee | ACM Transactions on Algorithms 2(1):79--94, 2006 |
| Polynomial Time Algorithms for Multicast Network Code Construction | S. Jaggi, P. Sanders et al. | IEEE Transactions on Information Theory 51 (6): 1973-1982, 2005 |
| Optimal online algorithms for multidimensional packing problems | L. Epstein, R. van Stee | SIAM Journal on Computing, 35(2):431--448, 2005 |
| Duality Between Prefetching and Queued Writing with Parallel Disks | D. A. Hutchinson, P. Sanders, J.S. Vitter | SIAM Journal on Computing 34 (6): 1443-1463, 2005 |
| Online square and cube packing | L. Epstein, R. van Stee | Acta Informatica, 41(9):595--606, 2005 |
| Space Efficient Hash Tables With Worst Case Constant Access Time | D. Fotakis, R. Pagh, P. Sanders, P. Spirakis | Theory of Computing Systems 38 (2): 229-248, 2005 |
| Improved competitive guarantees for QoS buffering | A. Kesselman, Y. Mansour, R. van Stee | Algorithmica, 43(1--2):63--80, 2005. Special issue on network design |
| Minimizing the total completion time on a single on-line machine, using restarts | R. van Stee, J. A. La Poutré | Journal of Algorithms, 57(2):95--129, 2005 |
| Titel | Autoren | Tagung | Datum |
|---|---|---|---|
| GRK 1194 "Selbstorganisierende Sensor-Aktor-Netzwerke" | |||
| Online bin packing with resource augmentation | L. Epstein, R. van Stee | In Proceedings of the 2nd Workshop on Approximation and Online Algorithms (WAOA 2004) | |
| This side up! | L. Epstein, R. van Stee | In Proceedings of the 2nd Workshop on Approximation and Online Algorithms (WAOA 2004) | |
| HiDAR: An Alternative Approach to Alternative Routes | Moritz Kobitzsch | European Symposium on Algorithms (ESA) - 2013 |
02-04. 09. 2013 |
| Scalable Construction of Text Indexes with Thrill | Timo Bingmann, Simon Gog, Florian Kurpicz |
IEEE International Conference on Big Data |
10.12.-13.12.2018 |
| Towards Optimal Multiple Selection | K. Kaligosi, K. Mehlhorn, J. I. Munro, P. Sanders | 32th International Colloquium on Automata, Languages and Programming | 2005 |
| Better External Memory Suffix Array Construction | R. Dementiev, J. Kärkkäinen, J. Mehnert, P. Sanders | Workshop on Algorithm Engineering, Experiments | 2005 |
| On strip packing with rotations | K. Jansen, R. van Stee | 37th ACM Symposium on Theory of Computing (STOC 2005) | 22.--24. Mai 2005 |
| Communication Efficient Algorithms for Top-k Selection Problems | IPDPS'16 |
23.-27.05.2016 |
|
| Thrill: High-Performance Algorithmic Distributed Batch Data Processing with C++ | Timo Bingmann, Michael Axtmann, Emanuel Jöbstl, Sebastian Lamm, Huyen Chau Nguyen, |
IEEE International Conference on Big Data |
5.12.-8.12.2016 |
| Paging with request sets | Leah Epstein, Rob van Stee, Tami Tamir | Tenth Scandinavian Workshop on Algorithm Theory (SWAT 2006) | 6.-8. Juli 2006 |
| GPU Sample Sort | N. Leischner, V. Osipov and P. Sanders |
IPDPS 2010 |
April 2010 |
| Alternative Route Graphs in Road Networks | R. Bader, J. Dees, R. Geisberger, P. Sanders |
International ICST Conference on Theory and Practice of Algorithms |
April 2011 |
| A Generalized Computational Framework for Accessibility: From the Pedestrian to the Metropolitan Scale | Fletcher Foti, Paul Waddell, Dennis Luxen |
4th Transportation Research Board Conference on Innovations in Travel Modeling (ITM) |
April 30-May 2, 2012 |
| Multi-dimensional packing with conflicts | L. Epstein, A. Levin, R. van Stee | 16th International Symposium on Fundamentals of Computation Theory (FCT 2007) |
August 2007 |
| Preemptive scheduling on selfish machines | L. Epstein, R. van Stee |
Fourth Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN 2007) |
August 2007 |
| Improved results for a memory allocation problem | L. Epstein, R. van Stee |
Workshop on Algorithms and Data Structures (WADS 2007) |
August 2007 |
| Parallelization of Bulk Operations for STL Dictionaries | L. Frias, J. Singler |
Workshop on Highly Parallel Processing on a Chip (HPPC) |
August 2007 |
| MCSTL: The Multi-Core Standard Template Library | J. Singler, P. Sanders, F. Putze |
Euro-Par 2007 |
August 2007 |
| Energy-Efficient Sorting using Solid State Disks | A. Beckmann, U. Meyer, P. Sanders, J. Singler |
International Green Computing Conference (IGCC) |
August 2010 |
| Energy Efficient Frequency Scaling and Scheduling Malleable Tasks |
P. Sanders, J. Speck |
Euro-Par 2012 |
August 2012 |
| Vectorizing Database Column Scans with Complex Predicates | Thomas Willhalm, Ismail Oukid, Ingo Müller |
Accelerating Data Management Systems Using Modern Processor and Storage Architectures (ADMS) – 2013 |
August 2013 |
| Efficient Parallel and External Matching | Marcel Birn, Vitaly Osipov, Peter Sanders, Christian Schulz, Nodari Sitchinava |
Euro-Par'13 |
August 2013 |
| Engineering a Multi-core Radix Sort |
J. Wassenberg, P. Sanders |
Euro-Par 2011 |
August/September 2011 |
| Efficient Route Compression for Hybrid Route Planning | G.V. Batz, R. Geisberger, D. Luxen, P. Sanders, and R. Zubkov |
Mediterranean Conference on Algorithms (MedAlg 2012) |
December 2012 |
| Robust Mobile Route Planning with Limited Connectivity | Daniel Delling, Moritz Kobitzsch, Dennis Luxen, Renato Werneck |
Meeting on Algorithm Engineering & Experiments (Alenex12) |
Jan 16th, 2012 |
| Distributed Evolutionary Graph Partitioning | Peter Sanders, Christian Schulz |
Meeting on Algorithm Engineering & Experiments (Alenex12) |
Jan, 16th 2012 |
| An Asymptotic Approximation Scheme for Multigraph Edge Coloring | P. Sanders, D. Steurer | 16th ACM-SIAM Symposium on Discrete Algorithms | Januar 2005 |
| A Computational Study of External-Memory BFS Algorithms | D. Ajwani, R. Dementiev, U. Meyer | SODA2006: ACM-SIAM Symposium on Discrete Algorithms | Januar 2006 |
| Simple and Fast Nearest Neighbor Search | M. Birn, M. Holtgrewe, P. Sanders, J. Singler |
Workshop on Algorithm Engineering and Experiments (ALENEX 2010) |
Januar 2010 |
| Intersection in Integer Inverted Indices | P. Sanders, F. Transier |
ALENEX 2007 |
January 2007 |
| Computing Many-to-Many Shortest Paths Using Highway Hierarchies | S. Knopp, P. Sanders, D. Schultes, F. Schulz, D. Wagner |
Workshop on Algorithm Engineering and Experiments (ALENEX 2007) |
January 2007 |
| In Transit to Constant Shortest-Path Queries in Road Networks | H. Bast, S. Funke, D. Matijevic, P. Sanders, D. Schultes |
Workshop on Algorithm Engineering and Experiments (ALENEX 2007) |
January 2007 |
| The Random Graph Threshold for k-orientiability and a Fast Algorithm for Optimal Multiple-Choice Allocation | J. Cain, P. Sanders, N. Wormald | SODA07 | January 2007 |
| Compressed Inverted Indexes for In-Memory Search Engines | F. Transier, P. Sanders |
ALENEX 2008 |
January 2008 |
| Design and Implementation of a Practical I/O-efficient Shortest Paths Algorithm | U. Meyer, V.Osipov |
ALENEX 2009 |
January 2009 |
| The Filter-Kruskal Minimum Spanning Tree Algorithm | V. Osipov, P. Sanders, J. Singler |
ALENEX 2009 |
January 2009 |
| Time-Dependent Contraction Hierarchies | G.V. Batz, D. Delling, P. Sanders, and C. Vetter |
Workshop on Algorithm Engineering and Experiments (ALENEX 2009) |
January 2009 |
| Route Planning with Flexible Objective Functions | R. Geisberger, M. Kobitzsch, P. Sanders |
Workshop on Algorithm Engineering and Experiments (ALENEX 2010) |
January 2010 |
| Firm Growth and the Spatial Impact of Geolocated External Factors – Empirical Evidence for German Manufacturing Firms | Matthias Duschl, Thomas Brenner, Antje Schimke, and Dennis Luxen |
Geography of Innovation 2012 |
January 2012 |
| Inducing Suffix and LCP Arrays in External Memory | Timo Bingmann, Johannes Fischer, Vitaly Osipov |
Workshop on Algorithm Engineering and Experiments (ALENEX 2013) |
January 2013 |
| (Semi-)External Algorithms for Graph Partitioning and Clustering | Yaroslav Akhremtsev, Peter Sanders, Christian Schulz |
ALENEX'15 |
January 2015 |
| Finding Near-Optimal Independent Sets at Scale | Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck |
ALENEX'16 |
January 2016 |
| k-way Hypergraph Partitioning via n-Level Recursive Bisection | Sebastian Schlag, Vitali Henne, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Christian Schulz |
ALENEX'16 |
January 2016 |
| Practical Minimum Cut Algorithms | Monika Henzinger, Alexander Noe, Christian Schulz and Darren Strash. |
ALENEX'18 |
January 2018 |
| Scalable Kernelization for Maximum Independent Sets | Demian Hespe, Christian Schulz and Darren Strash |
ALENEX'18 |
January 2018 |
| Gaussian Mixture Reduction via Clustering | Dennis Schieferdecker, Marco Huber |
International Conference on Information Fusion (FUSION 2009) |
Juli 2009 |
| Lifetime Maximization of Monitoring Sensor Networks | Peter Sanders, Dennis Schieferdecker |
International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS 2010) |
Juli 2010 |
| Heuristic Contraction Hierarchies with Approximation Guarantee | Robert Geisberger, Dennis Schieferdecker |
Symposium on Combinatorial Search (SoCS 2010) |
Juli 2010 |
| Work-efficient matrix inversion in polylogarithmic time | P. Sanders, J. Speck, R. Steffen |
SPAA 2013 |
Juli 2013 |
| Candidate Sets for Alternative Routes in Road Networks - Extended Abstract | Dennis Luxen, Dennis Schieferdecker |
6th Annual Symposium on Combinatorial Search (SoCS 2013) |
Juli 2013 |
| Semi-external LTL model checking | S. Edelkamp, P. Sanders, P. Simecek |
CAV 2008 |
July 2008 |
| Multi-Hop Ride Sharing | Florian Drews, Dennis Luxen |
6th Annual Symposium on Combinatorial Search (SoCS 2013) |
July 2013 |
| Distributed Evolutionary k-way Node Separators | Peter Sanders, Christian Schulz, Darren Strash, Robert Williger |
GECCO'17 |
July 2017 |
| Towards Optimal Range Medians | B. Gfeller, P. Sanders |
International Colloquium Automata, Languages and Programming ICALP 2009 |
July 5-12, 2009 |
| Engineering Graph Partitioning Algorithms | Vitaly Osipov, Peter Sanders, Christian Schulz | 11'th International Symposium on Experimental Algorithms (SEA'2012) | Jun 7-9, 2012 |
| Advanced Coarsening Schemes for Graph Partitioning | Ilya Safro, Peter Sanders & Christian Schulz |
11th International Symposium on Experimental Algorithms (SEA'12) |
Jun 7-9, 2012 |
| Dynamic Highway-Node Routing | P. Sanders, D. Schultes |
6th Workshop on Experimental Algorithms (WEA 2007) |
June 2007 |
| Engineering Fast Route Planning Algorithms | P. Sanders, D. Schultes |
6th Workshop on Experimental Algorithms (WEA) |
June 2007 |
| Think Locally, Act Globally: Highly Balanced Graph Partitioning | Peter Sanders and Christian Schulz |
12th International Symposium on Experimental Algorithms (SEA 2013) |
June 2013 |
| Transit Node Routing Reconsidered | Julian Arz, Dennis Luxen, Peter Sanders |
12th International Symposium on Experimental Algorithms (SEA 2013) |
June 2013 |
| Graph Partitioning for Independent Sets | Sebastian Lamm, Peter Sanders and Christian Schulz |
SEA'15 |
June 2015 |
| A Bulk-Parallel Priority Queue in External Memory with STXXL | Timo Bingmann, Thomas Keh, Peter Sanders |
SEA'15 |
June 2015 |
| Tree Compression with Top Trees Revisited | SEA'15 |
June 2015 |
|
| MultiQueues: Simple Relaxed Concurrent Priority Queues | Romand Dementiev, Hamza Rihani, Peter Sanders |
SPAA'15 |
June 2015 |
| Practical Massively Parallel Sorting | Michael Axtmann, Timo Bingmann, Peter Sanders, and Christian Schulz |
SPAA'15 |
June 2015 |
| Accelerating Local Search for the Maximum Independent Set Problem | Jakob Dahlum, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck |
SEA'16 |
June 2016 |
| Advanced Multilevel Node Separator Algorithms | Peter Sanders, Christian Schulz |
SEA'16 |
June 2016 |
| Better Process Mapping and Sparse Quadradic Assignment | Christian Schulz, Jesper Larsson Träff |
SEA'17 |
June 2017 |
| Graph Partitioning with Acyclicity Constraints | Orlando Moreira, Merten Popp, Christian Schulz |
SEA'17 |
June 2017 |
| Retrieval and Perfect Hashing using Fingerprinting | Ingo Müller, Peter Sanders, Robert Schulze, Wei Zhou |
Symposium on Experimental Algorithms (SEA) – 2014 |
June/July 2014 |
| Cache-, Hash- and Space-Efficient Bloom Filters | F. Putze, P. Sanders, J. Singler |
WEA 2007 |
Juni 2007 |
| Engineering Algorithms for Approximate Weighted Matching | J. Maue, P. Sanders |
WEA 2007 |
Juni 2007 |
| Parallel Geometric Algorithms for Multi-Core Computers | V. H. F. Batista, D. L. Millman, S. Pion, J. Singler |
Symposium on Computational Geometry (SoCG) |
Juni 2009 |
| Candidate Sets for Alternative Routes in Road Networks | Dennis Luxen, Dennis Schieferdecker |
11th International Symposium on Experimental Algorithms (SEA'12) |
Juni 2012 |
| Partitioning Complex Networks via Size-constrained Clustering | Henning Meyerhenke, Peter Sanders, Christian Schulz |
SEA'14 |
Juni 2014 |
| Tree-based Coarsening and Partitioning of Complex Networks | Roland Glantz, Henning Meyerhenke, Christian Schulz |
SEA'14 |
Juni 2014 |
| MCSTL: The Multi-Core Standard Template Library (Poster) | F. Putze, P. Sanders, J. Singler |
PPoPP 2007 |
März 2007 |
| Single-Pass List Partitioning | L. Frias, J. Singler, P. Sanders |
International Workshop on Multi-Core Computing Systems (MuCoCoS) 2008 | März 2008 |
| Scalable Distributed-Memory External Sorting | M. Rahn, P. Sanders, J. Singler |
International Conference on Data Engineering (ICDE) |
März 2010 |
| Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra’s Algorithm | Reinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, Dominik Schultes, Dorothea Wagner |
International Workshop on Experimental Algorithms (WEA 2008) |
Mai / Juni 2008 |
| The libstdc++ parallel mode: Software Engineering Considerations | J. Singler, B. Kosnik |
International Workshop on Multicore Software Engineering (IWMSE) |
Mai 2008 |
| Building A Parallel Pipelined External Memory Algorithm Library | A. Beckmann, R. Dementiev, J. Singler |
IEEE International Parallel & Distributed Processing Symposium (IPDPS) |
Mai 2009 |
| Efficient Parallel Scheduling of Malleable Tasks | P. Sanders, J. Speck |
IPDPS 2011 |
Mai 2011 |
| Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks | Dennis Schieferdecker, Markus Völker and Dorothea Wagner |
International Symposium on Experimental Algorithms (SEA 2011) |
Mai 2011 |
| Malleable Sorting | P. Flick, P. Sanders, J. Speck |
IPDPS 2013 |
Mai 2013 |
| Locality Aware DAG-Scheduling for LU-Decomposition | T. Maier, P. Sanders, J. Speck |
IPDPS 2015 |
Mai 2015 |
| Parallel Graph Partitioning for Complex Networks | H. Meyerhenke, P. Sanders, C. Schulz |
IPDPS'15 |
Mai 2015 |
| Adaptive String Dictionary Compression in In-Memory Column-Store Database Systems | Ingo Müller, Cornelius Ratsch, Franz Faerber |
17th International Conference on Extending Database Technology (EDBT) – 2014 |
March 2014 |
| LZ-Compressed String Dictionaries | Julian Arz, Johannes Fischer |
Data Compression Conference (DCC) - 2014 |
March 2014 |
| Goal Directed Shortest Path Queries Using Precomputed Cluster Distances | J. Maue, P. Sanders, D. Matijevic | WEA 2006 | May 2006 |
| Time-Dependent Contraction Hierarchies and Approximation | G.V. Batz, R. Geisberger, S. Neubauer, P. Sanders |
International Symposium on Experimental Algorithms (SEA 2010) |
May 2010 |
| Contraction of Timetable Networks with Realistic Transfers | R. Geisberger |
International Symposium on Experimental Algorithms (SEA 2010) |
May 2010 |
| Distributed Time-Dependent Contraction Hierarchies | T. Kieritz, D. Luxen, P. Sanders, C. Vetter |
International Symposium on Experimental Algorithms (SEA 2010) |
May 2010 |
| Hierarchy Decomposition and Faster User Equilibria on Road Networks | International Symposium on Experimental Algorithms (SEA 2011) |
May 2011 |
|
| Efficient Routing in Road Networks with Turn Costs | R. Geisberger, C. Vetter |
International Symposium on Experimental Algorithms (SEA 2011) |
May 2011 |
| Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks | R. Geisberger, P. Sanders, D. Schultes, D. Delling |
International Workshop on Experimental Algorithms (WEA 2008) |
May/June 2008 |
| Cache-Efficient Aggregation: Hashing Is Sorting | Ingo Müller, Peter Sanders, Arnaud Lacurie, Wolfgang Lehner, Franz Färber |
International Conference on Management of Data (SIGMOD) – 2015 |
May/June 2015 |
| Highway Hierarchies Star | D. Delling, P. Sanders, D. Schultes, D. Wagner |
9th DIMACS Challenge on Shortest Paths |
November 2006 |
| Out of the Box Phrase Indexing | F. Transier, P. Sanders |
SPIRE 2008 |
November 2008 |
| Real-Time Routing with OpenStreetMap data | Dennis Luxen, Christian Vetter |
19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM GIS 2011) |
November 2011 |
| Engineering Efficient Error-Correcting Geocoding | Christian Jung, Daniel Karch, Sebastian Knopp, Dennis Luxen, Peter Sanders | ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM GIS 2011) |
November 2011 |
| Incorporating Road Networks into Territory Design | Nitin Ahuja, Matthias Bender, Peter Sanders, Christian Schulz, Andreas Wagner |
GIS'15 |
November 2015 |
| A Comparison of High-Level Approaches for Speeding up Pathfinding | R. Geisberger, N. Sturtevant |
Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE 2010) |
October 2010 |
| Improved Fast Similarity Search in Dictionaries | Daniel Karch, Dennis Luxen and Peter Sanders |
String Processing and Information Retrieval Symposium (SPIRE 2010) |
October 2010 |
| CST++ | String Processing and Information Retrieval Symposium (Spire 2010) |
October 2010 |
|
| Communication Efficient Algorithms for Fundamental Big Data Problems | Peter Sanders, Sebastian Schlag, Ingo Müller | IEEE BigData Conference 2013 |
October 2013 |
| STXXL: Standard Template Library for XXL Data Sets | R. Dementiev, L. Kettner, P. Sanders | 13th Ann. European Symposium on Algorithms (ESA) | Oktober 2005 |
| Highway Hierarchies Hasten Exact Shortest Path Queries | P. Sanders, D. Schultes | 13th European Symposium on Algorithms (ESA) | Oktober 2005 |
| Speed scaling of tasks with precedence constraints | Kirk Pruhs, Rob van Stee, Patchrawat Uthaisombut | Workshop on Approximation and Online Algorithms (WAOA 2005) | Oktober 2005 |
| Approximation schemes for packing splittable items with cardinality | L. Epstein, R. van Stee |
Workshop on Approximation and Online Algorithms (WAOA 2007) |
Oktober 2007 |
| The online unit clustering problem | L. Epstein, R. van Stee |
Workshop on Approximation and Online Algorithms (WAOA 2007) |
Oktober 2007 |
| Parallel Prefix (Scan) Algorithms for MPI | P. Sanders, J. L.Träff |
EuroPVM/MPI 2006 |
September 2006 |
| Engineering Highway Hierarchies | P. Sanders, D. Schultes |
14th European Symposium on Algorithms (ESA 2006) |
September 2006 |
| How Branch Mispredictions Affect Quicksort | K. Kaligosi, P. Sanders | ESA 2006 | September 2006 |
| Scalable Parallel Suffix Array Construction | F. Kulla, P. Sanders | EuroPVM/MPI 2006 | September 2006 |
| Mobile Route Planning | P. Sanders, D. Schultes, C. Vetter |
ESA 2008 |
September 2008 |
| An Efficient Parallel Algorithm for Graph-Based Image Segmentation | J. Wassenberg, W. Middelmann, P. Sanders |
Computer Analysis of Images and Patterns CAIP 2009 |
September 2009 |
| n-Level Graph Partitioning | V. Osipov and P. Sanders |
ESA 2010 |
September 2010 |
| Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns | H. Bast, E. Carlsson, A. Eigenwillig, R. Geisberger, C. Harrelson, V. Raychev, F. Viger |
European Symposium on Algorithms (ESA 2010) |
September 2010 |
| Fast Detour Computation for Ride Sharing | R. Geisberger, D. Luxen, P. Sanders, S. Neubauer, L. Volker |
Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2010) |
September 2010 |
| Engineering Time-Dependent Many-to-Many Shortest Paths Computation | R. Geisberger, P. Sanders |
Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2010) |
September 2010 |
| Engineering Multilevel Graph Partitioning Algorithms | Peter Sanders, Christian Schulz |
ESA 2011 |
September 2011 |
| Time-Dependent Route Planning with Generalized Objective Functions | G.V. Batz and P. Sanders |
European Symposium on Algorithms (ESA 2012) |
September 2012 |
| Evolution and Evaluation of the Penalty Method for Alternative Graphs | Moritz Kobitzsch, Marcel Radermacher, Dennis Schieferdecker |
13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2013) |
September 2013 |
| Parallel String Sample Sort | Timo Bingmann, Peter Sanders |
ESA 2013, 21st European Symposium on Algorithms |
September 2013 |
| Drawing Large Graphs by Multilevel Maxent-Stress Optimization | Henning Meyerhenke, Martin Nöllenburg, Christian Schulz |
GD'15 |
September 2015 |
| On Minimizing Crossings in Storyline Visualizations | Irina Kostitsyna, Martin Nöllenburg, Valentin Polishchuk, André Schulz, Darren Strash |
GD'15 |
September 2015 |
| Full Bandwidth Broadcast, Reduction and Scan with only two Trees | P. Sanders, J. Speck, J. Larsson Träff |
EuroPVM/MPI 2007 |
September/Oktober 2007 |
| Optimized Hybrid Parallel Lattice Boltzmann Fluid Flow Simulations on Complex Geometries |
J. Fietz, M. Krause, P. Sanders, C. Schulz, V. Heuveline |
Euro-Par 2012 |
August 2012 |
| Titel | Tagung | Referent | Datum |
|---|---|---|---|
| Measuring access at a parcel level to improve land use and transportation modelling and planning | European Regional Science Association Congress 2011 |
Paul Waddell |
September 2011 |
| MoNav & OSRM: 1 Jahr später | FossGIS 2011 |
D. Luxen, C. Vetter |
5. April 2011 |
| Energieeffiziente Verarbeitung großer Datenmengen | 2. Elektronik ecodesign congress |
Johannes Singler |
13.10.2010 |
| Scalable Distributed-Memory External Sorting | Dagstuhl Seminar "Graph Search Engeneering" |
Johannes Singler |
Dezember 2009 |
| Exploiting Up-to-Date Traffic Information Requires Extra Fast Route Planning Algorithms | KIT Workshop "Fahrzeugkommnikation" | G. Veit Batz |
11. Nov 2009 |
| Building A Parallel Pipelined External Memory Algorithm Library | Workshop on Massive Data Algorithms (MASSIVE), Aarhus |
Johannes Singler |
2009-06-11 |
| Scalable Distributed-Memory External Sorting | Workshop on Massive Data Algorithms (MASSIVE), Aarhus |
Johannes Singler |
2009-06-11 |
| The GNU libstdc++ parallel mode: Benefit from Multi-Core using the STL | CI-Kolloquium, TU Dortmund |
Johannes Singler |
2008-11-17 |
| The GNU libstdc++ parallel mode | Geometrica Seminar, INRIA Sophia Antipolis |
Johannes Singler |
2008-05-21 |
| Covering selfish machines | Workshop on Fair Division |
Rob van Stee |
Juni 2007 |
| Genauer Hochleistungsroutenplaner | Heidelberger Innovationsforum | Peter Sanders | 30.11.2005 |
| An Asymptotic Approximation Scheme for Multigraph Edge Coloring | Discrete Math Seminar University of Waterloo | Peter Sanders | 27.09.2005 |
| Algorithm Engineering | CS Seminar University of Western Ontario | Peter Sanders | 26.09.2005 |
| Fast Algorithms for Finding Energy Efficient Routes in Radio Networks | Form and Content in Sensor Networks | Peter Sanders | 19.09.2005 |
| Highway Hierarchies Hasten Exact Shortest Path Queries | Algorithmic Aspects of Large and Complex Networks | Peter Sanders | 06.09.2005 |
| Highway Hierarchies Hasten Exact Shortest Path Queries | 2nd Bertinoro Workshop on Algorithms and Data Structures | Peter Sanders | 31.5.2005 |
| Algorithm Engineering von Anfang an: Sortieren und grundlegende Datenstrukturen | Antrittsvorlesung | Peter Sanders | 17.01.2005 |
| Online algorithms for square packing | Oberseminar Theoretische Informatik, Eberhard Karls Universität Tübingen | Rob van Stee | Dezember 2005 |
| On strip packing with rotations | Upper Rhine Algorithms Workshop (URAW 2005)Tübingen | Rob van Stee | Juli 2005 |
| On strip packing with rotations | Universität Freiburg | Rob van Stee | Juni 2005 |
| On strip packing with rotations | University of Pittsburgh | Rob van Stee | Mai 2005 |
| On-line scheduling of splittable tasks | Dagstuhl Workshop on Optimization with Incomplete Information | Rob van Stee | Januar 2005 |
| Titel | Autor | Quelle |
|---|---|---|
| Communication Efficient Algorithms for Top-k Selection Problems | Technical Report Februar/Oktober 2015, arXiv:1502.03942 |
|
| A Bulk-Parallel Priority Queue in External Memory with STXXL | Timo Bingmann, Thomas Keh, and Peter Sanders |
Technial Report April 2015, arXiv:1504.00545 |
| Practical Massively Parallel Sorting -- Basic Algorithmic Ideas | Michael Axtmann, Timo Bingmann, Peter Sanders, and Christian Schulz |
Technial Report October 2014, arXiv:1410.6754 |
| Engineering Parallel String Sorting | Timo Bingmann, Andreas Eberle and Peter Sanders |
Technial Report March 2014, arXiv:1403.2056 |
| Parallel String Sample Sort | Timo Bingmann and Peter Sanders |
Technial Report May 2013, arXiv:1305.1157 |
| Doing More for Less -- Cache-Aware Parallel Contraction Hierarchies Preprocessing | Dennis Luxen and Dennis Schieferdecker |
Technical Report, August 13, 2012, Fakultät für Informatik, Karlsruher Institut für Technologie |
| Efficient Error-Correcting Geocoding | Christian Jung, Daniel Karch, Sebastian Knopp, Dennis Luxen and Peter Sanders |
Technical Report, February 16, 2011, Fakultät für Informatik, Karlsruher Institut für Technologie, arXiv:1102.3306v1 |
| Compressed Transmission of Route Descriptions | G.V. Batz, R. Geisberger, D. Luxen, P. Sanders |
Technical Report, November 22, 2010, Fakultät für Informatik, Karlsruher Institut für Technologie, arXiv:1011.4465v1 |
| Improved Fast Similarity Search in Dictionaries | Daniel Karch, Dennis Luxen and Peter Sanders |
Technischer Bericht, Fakultät für Informatik, Karlsruher Institut für Technologie |
| Defining and Computing Alternative Routes in Road Networks | J. Dees, R. Geisberger, P. Sanders, R. Bader |
Technical Report, February 23, 2010, Fakultät für Informatik, Karlsruher Institut für Technologie |
| Engineering a Scalable High Quality Graph Partitioner | M. Holtgrewe, P. Sanders, C. Schulz |
Technical Report, 2009, Fakultät für Informatik, Karlsruher Institut für Technologie |
| Fast Detour Computation for Ride Sharing | R. Geisberger, D. Luxen, S. Neubauer, P. Sanders, L. Volker |
Technical Report, July 30, 2009, Fakultät für Informatik, Universität Karlsruhe |
| Time Dependent Contraction Hierarchies - Basic Algorithmic Ideas | G.V. Batz, R. Geisberger, P. Sanders |
Technical Report, April 24, 2008, Fakultät für Informatik, Universität Karlsruhe |
| STXXL: Standard Template Library for XXL Data Sets | R. Dementiev, L. Kettner, P. Sanders | Technical Report 2005/18, Fakultät für Informatik, Universität Karlsruhe |
