default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRuben Becker
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Ruben Becker
, Michael Sagraloff:
Counting solutions of a polynomial system locally and exactly. J. Symb. Comput. 120: 102222 (2024)- [j5]Ruben Becker, Yuval Emek, Mohsen Ghaffari, Christoph Lenzen:
Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions. SIAM J. Comput. 53(2): 247-286 (2024) - [c25]Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Riccardo Maso, Nicola Prezza:
Random Wheeler Automata. CPM 2024: 5:1-5:15 - [c24]Ruben Becker, Matteo Canton, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Nicola Prezza:
Sketching and Streaming for Dictionary Compression. DCC 2024: 213-222 - [c23]Ruben Becker, Sung-Hwan Kim, Nicola Prezza, Carlo Tosoni:
Indexing Finite-State Automata Using Forward-Stable Partitions. SPIRE 2024: 26-40 - [i23]Ruben Becker, Sung-Hwan Kim, Nicola Prezza, Carlo Tosoni:
Indexing Finite-State Automata Using Forward-Stable Partitions. CoRR abs/2406.02763 (2024) - [i22]Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Tomasz Kociumaka, Bojana Kodric, Alberto Policriti, Nicola Prezza:
On the Complexity of Computing the Co-lexicographic Width of a Regular Language. CoRR abs/2410.04771 (2024) - 2023
- [c22]Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi:
On the Cost of Demographic Parity in Influence Maximization. AAAI 2023: 14110-14118 - [c21]Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi:
Improving Fairness in Information Exposure by Adding Links. AAAI 2023: 14119-14126 - [c20]Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Malte Renken, Michael Raskin, Viktor Zamaraev:
Giant Components in Random Temporal Graphs. APPROX/RANDOM 2023: 29:1-29:17 - [c19]Ruben Becker, Manuel Cáceres, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Francisco Olivares, Nicola Prezza:
Sorting Finite Automata via Partition Refinement. ESA 2023: 15:1-15:15 - [c18]Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Alberto Policriti, Nicola Prezza:
Testing Wheelerness of Regular Languages (short paper) (text not included). ICTCS 2023 - [c17]Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Alberto Policriti, Nicola Prezza:
Optimal Wheeler Language Recognition. SPIRE 2023: 62-74 - [c16]Ruben Becker, Pierluigi Crescenzi, Antonio Cruciani, Bojana Kodric:
Proxying Betweenness Centrality Rankings in Temporal Networks. SEA 2023: 6:1-6:22 - [i21]Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi:
On the Cost of Demographic Parity in Influence Maximization. CoRR abs/2302.13110 (2023) - [i20]Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi:
Improving Fairness in Information Exposure by Adding Links. CoRR abs/2302.13112 (2023) - [i19]Ruben Becker, Manuel Cáceres, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Francisco Olivares, Nicola Prezza:
Sorting Finite Automata via Partition Refinement. CoRR abs/2305.05129 (2023) - [i18]Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Alberto Policriti, Nicola Prezza:
Optimal Wheeler Language Recognition. CoRR abs/2306.04737 (2023) - [i17]Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Riccardo Maso, Nicola Prezza:
Random Wheeler Automata. CoRR abs/2307.07267 (2023) - [i16]Ruben Becker, Matteo Canton, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Nicola Prezza:
Sketching and Streaming for Dictionary Compression. CoRR abs/2310.17980 (2023) - 2022
- [j4]Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi, Hugo Gilbert:
Fairness in Influence Maximization through Randomization. J. Artif. Intell. Res. 73: 1251-1283 (2022) - [i15]Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Malte Renken, Michael Raskin, Viktor Zamaraev:
Giant Components in Random Temporal Graphs. CoRR abs/2205.14888 (2022) - 2021
- [j3]Ruben Becker, Sebastian Forster, Andreas Karrenbauer, Christoph Lenzen:
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. SIAM J. Comput. 50(3): 815-856 (2021) - [c15]Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi, Hugo Gilbert:
Fairness in Influence Maximization through Randomization. AAAI 2021: 14684-14692 - [c14]Ruben Becker, Gianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert:
Unveiling the Truth in Liquid Democracy with Misinformed Voters. ADT 2021: 132-146 - [c13]Eugenio Angriman, Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert, Alexander van der Grinten, Henning Meyerhenke:
Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering. ALENEX 2021: 154-168 - [c12]Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert:
Maximizing Influence-Based Group Shapley Centrality. AAMAS 2021: 1461-1463 - [c11]Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert:
Influence Maximization With Co-Existing Seeds. CIKM 2021: 100-109 - [i14]Ruben Becker, Gianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert:
When Can Liquid Democracy Unveil the Truth? CoRR abs/2104.01828 (2021) - [i13]Ruben Becker, Michael Sagraloff, Vikram Sharma, Juan Xu, Chee Yap:
Complexity Analysis of Root Clustering for a Complex Polynomial. CoRR abs/2105.05183 (2021) - 2020
- [c10]Ruben Becker, Federico Corò, Gianlorenzo D'Angelo, Hugo Gilbert:
Balancing Spreads of Influence in a Social Network. AAAI 2020: 3-10 - [c9]Ruben Becker, Yuval Emek, Christoph Lenzen:
Low Diameter Graph Decompositions by Approximate Distance Computation. ITCS 2020: 50:1-50:29 - [i12]Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert:
Maximizing Influence-based Group Shapley Centrality. CoRR abs/2003.07966 (2020) - [i11]Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi, Hugo Gilbert:
Fairness in Influence Maximization through Randomization. CoRR abs/2010.03438 (2020) - [i10]Eugenio Angriman, Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert, Alexander van der Grinten, Henning Meyerhenke:
Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering. CoRR abs/2010.15435 (2020)
2010 – 2019
- 2019
- [j2]Ruben Becker, Vincenzo Bonifaci, Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn:
Two results on slime mold computations. Theor. Comput. Sci. 773: 79-106 (2019) - [c8]Ruben Becker, Imane Hafnaoui, Michael E. Houle, Pan Li, Arthur Zimek:
Subspace Determination Through Local Intrinsic Dimensional Decomposition. SISAP 2019: 281-289 - [c7]Ruben Becker, Yuval Emek, Mohsen Ghaffari, Christoph Lenzen:
Distributed Algorithms for Low Stretch Spanning Trees. DISC 2019: 4:1-4:14 - [i9]Ruben Becker, Federico Corò, Gianlorenzo D'Angelo, Hugo Gilbert:
Balancing spreads of influence in a social network. CoRR abs/1906.00074 (2019) - [i8]Ruben Becker, Imane Hafnaoui, Michael E. Houle, Pan Li, Arthur Zimek:
Subspace Determination through Local Intrinsic Dimensional Decomposition: Theory and Experimentation. CoRR abs/1907.06771 (2019) - [i7]Ruben Becker, Yuval Emek, Christoph Lenzen:
Low Diameter Graph Decompositions by Approximate Distance Computation. CoRR abs/1909.09002 (2019) - 2018
- [b1]Ruben Becker:
On Flows, Paths, Roots, and Zeros. Saarland University, Saarbrücken, Germany, 2018 - [j1]Ruben Becker, Michael Sagraloff, Vikram Sharma, Chee Yap:
A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration. J. Symb. Comput. 86: 51-96 (2018) - [c6]Ralf Wimmer, Andreas Karrenbauer, Ruben Becker, Christoph Scholl, Bernd Becker:
From DQBF to QBF by Dependency Elimination. MBMV 2018 - 2017
- [c5]Ralf Wimmer, Andreas Karrenbauer, Ruben Becker, Christoph Scholl, Bernd Becker:
From DQBF to QBF by Dependency Elimination. SAT 2017: 326-343 - [c4]Ruben Becker, Andreas Karrenbauer, Sebastian Krinninger, Christoph Lenzen:
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. DISC 2017: 7:1-7:16 - [i6]Ruben Becker, Vincenzo Bonifaci, Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn:
Two Results on Slime Mold Computations. CoRR abs/1707.06631 (2017) - [i5]Ruben Becker, Michael Sagraloff:
Counting Solutions of a Polynomial System Locally and Exactly. CoRR abs/1712.05487 (2017) - 2016
- [c3]Ruben Becker, Maximilian Fickert, Andreas Karrenbauer:
A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem. ALENEX 2016: 151-159 - [c2]Ruben Becker, Michael Sagraloff, Vikram Sharma, Juan Xu, Chee Yap:
Complexity Analysis of Root Clustering for a Complex Polynomial. ISSAC 2016: 71-78 - [i4]Ruben Becker, Andreas Karrenbauer, Sebastian Krinninger, Christoph Lenzen:
Approximate Undirected Transshipment and Shortest Paths via Gradient Descent. CoRR abs/1607.05127 (2016) - [i3]Ruben Becker, Andreas Karrenbauer, Kurt Mehlhorn:
An Integer Interior Point Method for Min-Cost Flow Using Arc Contractions and Deletions. CoRR abs/1612.04689 (2016) - 2015
- [i2]Ruben Becker, Michael Sagraloff, Vikram Sharma, Chee-Keng Yap:
A Simple Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration. CoRR abs/1509.06231 (2015) - 2014
- [c1]Ruben Becker, Andreas Karrenbauer:
A Simple Efficient Interior Point Method for Min-Cost Flow. ISAAC 2014: 753-765 - 2013
- [i1]Ruben Becker, Andreas Karrenbauer:
A Combinatorial $\tilde{O}(m^{3/2})$-time Algorithm for the Min-Cost Flow Problem. CoRR abs/1312.3905 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-13 23:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
