| Author/Editor | Year | | Title | Type |
|---|
| Agrawal, Saha, Saxena | 2013 | | A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: 45th ACM Symposium on the Theory of Computing (STOC-13), toappear | Proceedings Article |
| Alkassar, Böhme, Mehlhorn, Rizkallah | 2013 | | A Framework for the Verification of Certifying Computations | Unpublished/Draft |
| Bogdan, Sauerwald, Stauffer, Sun | 2013 | | Balls into Bins via Local Search
In: 24th ACM-SIAM Symposium on Discrete Algorithms (SODA-13), 16-34 | Electronic Proceedings Article |
| Bringmann, Green Larsen | 2013 | | Succinct Sampling from Discrete Distributions
In: 45th ACM Symposium on Theory of Computing (STOC-13), accepted | Proceedings Article |
| Cai, Lu, Xia | 2013 | | Dichotomy for Holant* Problems with a Function on Domain Size 3
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 1278-1295 | Proceedings Article |
| Doerr, Gnewuch, Wahlström | 2013 | | Calculation of Discrepancy Measures and Applications
In: A Panorama of Discrepancy Theory, 1-55 | Part of a Book |
| Doerr, Goldberg | 2013 | | Adaptive Drift Analysis
In: Algorithmica [65], 224-250 | Journal Article |
| Doerr, Huber, Levavi | 2013 | | Strong robustness of randomized rumor spreading protocols
In: Discrete Applied Mathematics [?], ? | Journal Article |
| Doerr, Jansen, Sudholt, Winzen, Zarges | 2013 | | Mutation rate matters even when optimizing monotonic functions
In: Evolutionary Computation [?], ? | Journal Article |
| Doerr, Johannsen, Kötzing, Neumann, Theile | 2013 | | More effective crossover operators for the all-pairs shortest path problem
In: Theoretical Computer Science [471], 12-26 | Journal Article |
| Doerr, Kötzing, Lengler, Winzen | 2013 | | Black-Box Complexities of Combinatorial Problems
In: Theoretical Computer Science [471], 84-106 | Journal Article |
| Doerr, Spöhel, Thomas, Winzen | 2013 | | Playing Mastermind with many colors
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 695-704 | Proceedings Article |
| Doerr, Sudholt, Witt | 2013 | | When Do Evolutionary Algorithms Optimize Separable Functions in Parallel?
In: ACM/SIGEVO Foundations of Genetic Algorithms (FOGA 2013), | Proceedings Article |
| Doerr, Winzen | 2013 | | Ranking-Based Black-Box Complexity
In: Algorithmica [?], ? | Journal Article |
| Duan | 2013 |  | Breaking the $O(n^2.5)$ Deterministic Time Barrier for Undirected Unit-Capacity Maximum Flow
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 1171-1179 | Proceedings Article |
| Elbassioni, Chalermsook, Nanongkai, Sun | 2013 | | Multi-Attribute Profit-Maximizing Pricing | Unpublished/Draft |
| Elmasry, Mehlhorn, Schmidt | 2013 | | Every DFS tree of a 3-connected graph contains a contractible edge
In: Journal of Graph Theory [72], 112-121 | Journal Article |
| Epstein, Levin, van Stee | 2013 | | A unified approach to truthful scheduling on related machines
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, 1243-1252 | Proceedings Article |
| Fountoulakis, Panagiotou | 2013 | | On the Insertion Time of Cuckoo Hashing
In: SIAM Journal on Computing [?], ?-? | Journal Article |
| Günther, Maurer, Megow, Wiese | 2013 | | A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio
In: 24st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), | Proceedings Article |
| Jez | 2013 | | Recompression: a simple and powerful technique for word equations
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 233-244 | Proceedings Article |
| Jurkiewicz, Mehlhorn | 2013 | | The cost of address translation
In: Proceedings of the Meeting on Algorithm Engineering & Experiments, | Proceedings Article |
| Megow, Mestre | 2013 | | Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints
In: 4th Conference on Innovations in Theoretical Computer Science (ITCS 2013), | Proceedings Article |
| Mehlhorn, Sagraloff, Wang | 2013 | | From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition
In: arXiv [abs/1301.4870], | Electronic Journal Article |
| Panagiotou, Spöhel, Steger, Thomas | 2013 | | Explosive percolation in Erdös-Rényi-like random graph processes
In: Combinatorics, Probability and Computing [22], 133-145 | Journal Article |
| Sanders, Singler, van Stee | 2013 | | Real-time prefetching and caching
In: Journal of Scheduling [16], 47-58 | Journal Article |
| Schmidt | 2013 | | Contractions, Removals and How to Certify 3-Connectivity in Linear Time | Unpublished/Draft |
| Sviridenko, Wiese | 2013 | | Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines
In: Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013), | Proceedings Article |
| Wahlström | 2013 | | Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem
In: 29th International Symposium on Theoretical Aspects of Computer Science (STACS-13), | Electronic Proceedings Article |
| Yap, Sagraloff, Sharma | 2013 | | Analytic Root Clustering: A Complete Algorithm using Soft Zero Tests | Unpublished/Draft |
