max planck institut
informatik
informatik
Agrawal, M., C. Saha and N. Saxena: A case of depth-3 identity testing, sparse factorization and duality. In: 45th ACM Symp. on the Theory of Computing (STOC-13). ACM, New York 2013, toappear p.
Alkassar, E., S. Böhme, K. Mehlhorn and C. Rizkallah: A framework for the verification of certifying computations.
Bringmann, K. and K. Green Larsen: Succinct sampling from discrete distributions. In: 45th ACM Symp. on Theory of Computing (STOC-13) [***Warning: Editor(s) might be missing!]. ACM, New York 2013, accepted p.
Cai, J.-Y., P. Lu and M. Xia: Dichotomy for Holant* problems with a function on domain size 3. In: Proc. Twenty-Fourth Annual ACM-SIAM Symp. on Discrete Algorithms. SIAM, Philadelphia 2013, 1278-1295.
Doerr, B. and L.A. Goldberg: Adaptive drift analysis. Algorithmica 65, 224-250 (2013).
Doerr, B., A. Huber and A. Levavi: Strong robustness of randomized rumor spreading protocols. Discrete Applied Mathematics [***Warning: Volume missing ?, ] [***Warning: Pages missing ?] (2013).
Doerr, B., T. Jansen, D. Sudholt, C. Winzen and C. Zarges: Mutation rate matters even when optimizing monotonic functions. Evolutionary Computation [***Warning: Volume missing ?, ] [***Warning: Pages missing ?] (2013).
Doerr, B., D. Johannsen, T. Kötzing, F. Neumann and M. Theile: More effective crossover operators for the all-pairs shortest path problem. Theoretical Computer Science 471, 12-26 (2013).
Doerr, B., T. Kötzing, J. Lengler and C. Winzen: Black-Box complexities of combinatorial problems. Theoretical Computer Science 471, 84-106 (2013).
Doerr, B., R. Spöhel, H. Thomas and C. Winzen: Playing mastermind with many colors. In: Proc. Twenty-Fourth Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 2013) [***Warning: Editor(s) might be missing!]. SIAM, Philadelphia 2013, 695-704.
Doerr, B., D. Sudholt and C. Witt: When do evolutionary algorithms optimize separable functions in parallel?. In: ACM/SIGEVO Foundations of Genetic Algorithms (FOGA 2013) [***Warning: Editor(s) might be missing!]. ACM, New York 2013, [***Warning: Pages missing!].
Doerr, B. and C. Winzen: Ranking-Based black-box complexity. Algorithmica [***Warning: Volume missing ?, ] [***Warning: Pages missing ?] (2013).
Doerr, C., M. Gnewuch and M. Wahlström: Calculation of discrepancy measures and applications. In: A Panorama of Discrepancy Theory, (Eds.) W.W.L. Chen, A. Srivastav, G. Travaglini. Springer, New York 2013, 1-55.
Duan, R.: Breaking the $O(n^2.5)$ deterministic time barrier for undirected unit-capacity maximum flow. In: Proc. Twenty-Second Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 2013) 6B [***Warning: Editor(s) might be missing!]. ACM-SIAM, Philadelphia 2013, 1171-1179.
Elbassioni, K., P. Chalermsook, D. Nanongkai and H. Sun: Multi-Attribute profit-maximizing pricing.
Elmasry, A., K. Mehlhorn and J.M. Schmidt: Every DFS tree of a 3-connected graph contains a contractible edge. Journal of Graph Theory 72, 112-121 (2013).
Epstein, L., A. Levin and R. van Stee: A unified approach to truthful scheduling on related machines. In: Proc. Twenty-Fourth Annual ACM-SIAM Symp. on Discrete Algorithms, SODA 2013 [ *** Wrong entry format - no comma found in name value: Sanjeev Khanna]. SIAM, Philadelphia 2013, 1243-1252.
Fountoulakis, N. and K. Panagiotou: On the insertion time of cuckoo hashing. SIAM Journal on Computing [***Warning: Volume missing ?, ] [***Warning: Pages missing ?-?] (2013).
Günther, E., O. Maurer, N. Megow and A. Wiese: A new approach to online scheduling: approximating the optimal competitive ratio. In: 24st Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 2013) [***Warning: Editor(s) might be missing!]. SIAM, USA 2013, [***Warning: Pages missing!].
Jez, A.: Recompression: a simple and powerful technique for word equations. In: 30th Int. Symp. on Theoretical Aspects of Computer Science (STACS 2013), Leibniz International Proceedings in Informatics (LIPIcs) 20, (Eds.) N. Portier, T. Wilke. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl 2013, 233-244.
Jurkiewicz, T. and K. Mehlhorn: The cost of address translation. In: Proc. Meeting on Algorithm Engineering & Experiments [***Warning: Editor(s) might be missing!]. Society for Industrial and Applied Mathematics, 3600 Market Street 2013, [***Warning: Pages missing!].
Megow, N. and J. Mestre: Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints. In: 4th Conf. on Innovations in Theoretical Computer Science (ITCS 2013) [***Warning: Editor(s) might be missing!]. ACM, USA 2013, [***Warning: Pages missing!].
Panagiotou, K., R. Spöhel, A. Steger and H. Thomas: Explosive percolation in Erdös-Rényi-like random graph processes. Combinatorics, Probability and Computing 22, 133-145 (2013).
Sanders, P., J. Singler and R. van Stee: Real-time prefetching and caching. Journal of Scheduling 16, 47-58 (2013).
Schmidt, J.M.: Contractions, removals and how to certify 3-connectivity in linear time.
Sviridenko, M. and A. Wiese: Approximating the Configuration-LP for minimizing weighted sum of completion times on unrelated machines. In: Proc. 16th Conf. on Integer Programming and Combinatorial Optimization (IPCO 2013), Lect. Notes Comput. Sci. 7801, (Ed.) M. Goemans. Springer, Heidelberg 2013, [***Warning: Pages missing!].
Yap, C., M. Sagraloff and V. Sharma: Analytic root clustering: A complete algorithm using soft zero tests.
Bogdan, P., T. Sauerwald, A. Stauffer and H. Sun: Balls into bins via local search. In: 24th ACM-SIAM Symp. on Discrete Algorithms (SODA-13) [ *** Wrong entry format - no comma found in name value: Sanjeev Khanna]. SIAM, Philadelphia 2013, 16-34 [***Warning: Internet Reference URL not specified!]..
Mehlhorn, K., M. Sagraloff and P. Wang: From approximate factorization to root isolation with application to cylindrical algebraic decomposition. arXiv abs/1301.4870, [***Warning: Pages missing!] (2013). [***Warning: Internet Reference URL not specified!].
Wahlström, M.: Abusing the Tutte matrix: an algebraic instance compression for the K-set-cycle problem. In: 29th Int. Symp. on Theoretical Aspects of Computer Science (STACS-13), (Eds.) N. Portier, T. Wilke, LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Saarbrücken/Wadern 2013, [***Warning: Pages missing!] [***Warning: Internet Reference URL not specified!]..