max planck institut
informatik
informatik
| Export...\All to MPG RTF format... |
Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)
Show entries starting with: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
| # |  | edoc | Lck | Author(s) [non member] | Editor(s) [non member] | Year | Title | Type | edoc identifier | ||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 27 |
| | |||||||||||
| | | [Agrawal, Manindra] Saha, Chandan [Saxena, Nitin] | | 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 | 99186A05A3B58639C1257B0A006132FF-SSS13 | | ||||
| [Alkassar, Eyad] [Böhme, Sascha] Mehlhorn, Kurt Rizkallah, Christine | 2013 | A Framework for the Verification of Certifying Computations | Unpublished/Draft | 8753D8F9EE253A4EC1257AEC00545A6F-VerificationCertComp12 | | ||||||||
| | | Bringmann, Karl [Green Larsen, Kasper] | | 2013 | Succinct Sampling from Discrete Distributions In: 45th ACM Symposium on Theory of Computing (STOC-13), accepted | Proceedings Article | E271DD01C0D95601C1257B17004BB405-BringmannGL | | ||||
 | [Cai, Jin-Yi] [Lu, Pinyan] Xia, Mingji | 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 | FDC5AB73FD748103C1257B09002746A5-Xia2013-soda-clx | | |||||||
| | | Doerr, Benjamin [Goldberg, Leslie Ann] | | 2013 | Adaptive Drift Analysis In: Algorithmica [65], 224-250 | Journal Article | EEEDAB9AEE90AFC8C1257984005B6EC8-DoerrG13algo | | ||||
| Doerr, Benjamin [Huber, Anna] [Levavi, Ariel] | 2013 | Strong robustness of randomized rumor spreading protocols In: Discrete Applied Mathematics [?], ? | Journal Article | 3EC1B7E39D5D1D05C1257AD0004507E9-DoerrHL13 | | ||||||||
| | | Doerr, Benjamin [Jansen, Thomas] [Sudholt, Dirk] Winzen, Carola [Zarges, Christine] | | 2013 | Mutation rate matters even when optimizing monotonic functions In: Evolutionary Computation [?], ? | Journal Article | 6C2BC07CAFCB2F51C1257AD00045B45C-DoerrJSWZ13EvCo | | ||||
| Doerr, Benjamin [Johannsen, Daniel] Kötzing, Timo [Neumann, Frank] [Theile, Madeleine] | 2013 | More effective crossover operators for the all-pairs shortest path problem In: Theoretical Computer Science [471], 12-26 | Journal Article | 39E06A3D747E8472C1257AD000448E13-DoerrJKNT13 | | |||||||
| | | Doerr, Benjamin Kötzing, Timo [Lengler, Johannes] Winzen, Carola | | 2013 | Black-Box Complexities of Combinatorial Problems In: Theoretical Computer Science [471], 84-106 | Journal Article | 635EA60BE46EBBB9C1257ACD0040C0FB-DoerrKLW13 | | ||||
| Doerr, Benjamin Spöhel, Reto [Thomas, Henning] Winzen, Carola | 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 | D782B05150717126C1257ACD0042784D-DoerrSTW13 | | ||||||||
| | | Doerr, Benjamin [Sudholt, Dirk] [Witt, Carsten] | | 2013 | When Do Evolutionary Algorithms Optimize Separable Functions in Parallel? In: ACM/SIGEVO Foundations of Genetic Algorithms (FOGA 2013), | Proceedings Article | 46FD99F393716B9FC1257AD2005C8A49-DoerrSW2013FOGA | | ||||
| Doerr, Benjamin Winzen, Carola | 2013 | Ranking-Based Black-Box Complexity In: Algorithmica [?], ? | Journal Article | 9AEA2B67A0E46252C1257ACD003FECFD-DoerrW12Ranking | | ||||||||
| | | Doerr, Carola [Gnewuch, Michael] Wahlström, Magnus | [Chen, W.W.L.] [Srivastav, A.] [Travaglini, G.] | 2013 | Calculation of Discrepancy Measures and Applications In: A Panorama of Discrepancy Theory, 1-55 | Part of a Book | 43D6DE28F67C287EC1257AF5006669F0-GnewuchWW13 | | ||||
| Duan, Ran | 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 | BFE7035295CDA850C1257AD900645A84-Duan2013 | | |||||||
| | | Elbassioni, Khaled [Chalermsook, Parinya] [Nanongkai, Danupon] Sun, He | | 2013 | Multi-Attribute Profit-Maximizing Pricing | Unpublished/Draft | B95BF1F23657EEFBC1257AF50064D296-Elbassioni2013a | | ||||
| Elmasry, Amr Mehlhorn, Kurt Schmidt, Jens M. | 2013 | Every DFS tree of a 3-connected graph contains a contractible edge In: Journal of Graph Theory [72], 112-121 | Journal Article | 4FE50A6D333665B3C1257AC200498D2D-Elmasry2013 | | |||||||
| | | [Epstein, Leah] [Levin, Asaf] van Stee, Rob | [Sanjeev Khanna] | 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 | B278696172DF5485C1257AB60047F733-EpLeSt13 | | |||
| Fountoulakis, Nikolaos Panagiotou, Konstantinos | 2013 | On the Insertion Time of Cuckoo Hashing In: SIAM Journal on Computing [?], ?-? | Journal Article | BA9C91C2BAA65051C1257AD400768921-FPSSICOMP2013 | | ||||||||
| | | [Günther, Elisabeth] [Maurer, Olaf] Megow, Nicole Wiese, Andreas | | 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 | 44C35A19C560F0F3C1257AC5007DB018-MegowWiese-SODA2013 | | ||||
| Jez, Artur | Portier, Natacha Wilke, Thomas | 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 | 46A2F9168BACE6DEC1257B1D0053AE6C-Jez2013STACS | | ||||||
| | | Jurkiewicz, Tomasz Mehlhorn, Kurt | | 2013 | The cost of address translation In: Proceedings of the Meeting on Algorithm Engineering & Experiments, | Proceedings Article | 8547751BA6E798C6C1257AD20051B773-VAT2013 | | ||||
| Megow, Nicole [Mestre, Julian] | 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 | 2CEE80588FA75A9EC1257AC5007D5A9A-MegowMestre2013 | | ||||||||
| | | Panagiotou, Konstantinos Spöhel, Reto [Steger, Angelika] [Thomas, Henning] | | 2013 | Explosive percolation in Erdös-Rényi-like random graph processes In: Combinatorics, Probability and Computing [22], 133-145 | Journal Article | 1C565636F6E3B7F4C1257ACE00624AEF-SpoehelPST2013 | | ||||
| [Sanders, Peter] [Singler, Johannes] van Stee, Rob | 2013 | | Real-time prefetching and caching In: Journal of Scheduling [16], 47-58 | Journal Article | 4C305E1770C9FEA3C1257B2000507C64-SaSiSt13 | | |||||||
| | | Schmidt, Jens M. | | 2013 | Contractions, Removals and How to Certify 3-Connectivity in Linear Time | Unpublished/Draft | 6C5EACE1C844FD72C1257AF0006144A2-Schmidt2013 | | ||||
| [Sviridenko, Maxim] Wiese, Andreas | [Goemans, Michel] | 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 | 56F6AEF322B11592C1257AD30034D756-SviridenkoWiese2013 | | |||||||
| | | [Yap, Chee] Sagraloff, Michael [Sharma, Vikram] | | 2013 | Analytic Root Clustering: A Complete Algorithm using Soft Zero Tests | Unpublished/Draft | 285F7D331C20EF4DC1257AFB00642AEE-YSSSoftpredicates2013 | | ||||
| 3 |
| | |||||||||||
| | | [Bogdan, Paul] Sauerwald, Thomas [Stauffer, Alexandre] Sun, He | [Sanjeev Khanna] | 2013 | Balls into Bins via Local Search In: 24th ACM-SIAM Symposium on Discrete Algorithms (SODA-13), 16-34 | Electronic Proceedings Article | BF4403ADFD759E30C1257AD6007453BC-BogdanSSS2012 | | ||||
| Mehlhorn, Kurt Sagraloff, Michael Wang, Pengming | 2013 | From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition In: arXiv [abs/1301.4870], | Electronic Journal Article | F285536EED8E2824C1257AFB0064A004-MSWClustering2013 | | ||||||||
| | | Wahlström, Magnus | [Portier, Natacha] [Wilke, Thomas] | 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 | 6CAA4B8E4AB14B6AC1257AD40051AD7C-Wahlstroem2013a | | ||||
| 30 |
| | |||||||||||
