| Near-optimal approximate shortest paths and transshipment in distributed and streaming models R Becker, S Forster, A Karrenbauer, C Lenzen SIAM Journal on Computing 50 (3), 815-856, 2021 | 117* | 2021 |
| A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration R Becker, M Sagraloff, V Sharma, C Yap Journal of Symbolic Computation 86, 51-96, 2018 | 63 | 2018 |
| Complexity analysis of root clustering for a complex polynomial R Becker, M Sagraloff, V Sharma, J Xu, C Yap Proceedings of the ACM on International Symposium on Symbolic and Algebraic …, 2016 | 45 | 2016 |
| Fairness in influence maximization through randomization R Becker, G D’angelo, S Ghobadi, H Gilbert Journal of Artificial Intelligence Research 73, 1251-1283, 2022 | 34 | 2022 |
| Balancing spreads of influence in a social network R Becker, F Corò, G D'Angelo, H Gilbert Proceedings of the AAAI conference on artificial intelligence 34 (01), 3-10, 2020 | 29 | 2020 |
| Unveiling the truth in liquid democracy with misinformed voters R Becker, G D’angelo, E Delfaraz, H Gilbert Algorithmic Decision Theory: 7th International Conference, ADT 2021 …, 2021 | 26* | 2021 |
| From DQBF to QBF by dependency elimination R Wimmer, A Karrenbauer, R Becker, C Scholl, B Becker International Conference on Theory and Applications of Satisfiability …, 2017 | 21 | 2017 |
| Two results on slime mold computations R Becker, V Bonifaci, A Karrenbauer, P Kolev, K Mehlhorn Theoretical Computer Science 773, 79-106, 2019 | 14 | 2019 |
| Group-Harmonic and Group-Closeness Maximization–Approximation and Engineering∗ E Angriman, R Becker, G d'Angelo, H Gilbert, A van Der Grinten, ... 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments …, 2021 | 12 | 2021 |
| A novel dual ascent algorithm for solving the min-cost flow problem R Becker, M Fickert, A Karrenbauer 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and …, 2016 | 12 | 2016 |
| A simple efficient interior point method for min-cost flow R Becker, A Karrenbauer International Symposium on Algorithms and Computation, 753-765, 2014 | 12* | 2014 |
| Low Diameter Graph Decompositions by Approximate Distance Computation R Becker, Y Emek, C Lenzen 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 2020 | 10 | 2020 |
| Subspace determination through local intrinsic dimensional decomposition R Becker, I Hafnaoui, ME Houle, P Li, A Zimek Similarity Search and Applications: 12th International Conference, SISAP …, 2019 | 10* | 2019 |
| Distributed algorithms for low stretch spanning trees R Becker, Y Emek, M Ghaffari, C Lenzen LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS 146, 2019 | 10 | 2019 |
| Giant components in random temporal graphs R Becker, A Casteigts, P Crescenzi, B Kodric, M Renken, M Raskin, ... arXiv preprint arXiv:2205.14888, 2022 | 9 | 2022 |
| Sorting finite automata via partition refinement R Becker, M Cáceres, D Cenzato, SH Kim, B Kodric, F Olivares, N Prezza arXiv preprint arXiv:2305.05129, 2023 | 7 | 2023 |
| Improving fairness in information exposure by adding links R Becker, G D'Angelo, S Ghobadi Proceedings of the AAAI Conference on Artificial Intelligence 37 (12), 14119 …, 2023 | 5 | 2023 |
| The Bolzano Method to isolate the real roots of a bitstream polynomial R Becker Bachelor thesis, Saarland University, Saarbrücken, Germany, 2012 | 5 | 2012 |
| Counting solutions of a polynomial system locally and exactly R Becker, M Sagraloff arXiv preprint arXiv:1712.05487, 2017 | 4 | 2017 |
| Optimal Wheeler Language Recognition R Becker, D Cenzato, SH Kim, B Kodric, A Policriti, N Prezza International Symposium on String Processing and Information Retrieval, 62-74, 2023 | 3 | 2023 |
Andreas KarrenbauerSenior Researcher, Max Planck Institute for Informatics, Saarland Informatics Campus, Saarbruckenmpi-inf.mpg.de의 이메일 확인됨
