Ruben Becker

Orcid: 0000-0002-3495-3753

According to our database1, Ruben Becker authored at least 34 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions.
SIAM J. Comput., 2024

Counting solutions of a polynomial system locally and exactly.
J. Symb. Comput., 2024

2023
Sketching and Streaming for Dictionary Compression.
CoRR, 2023

Random Wheeler Automata.
CoRR, 2023

Proxying Betweenness Centrality Rankings in Temporal Networks.
Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

Optimal Wheeler Language Recognition.
Proceedings of the String Processing and Information Retrieval, 2023

Testing Wheelerness of Regular Languages (short paper) (text not included).
Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

Sorting Finite Automata via Partition Refinement.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Giant Components in Random Temporal Graphs.
Proceedings of the Approximation, 2023

Improving Fairness in Information Exposure by Adding Links.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

On the Cost of Demographic Parity in Influence Maximization.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Fairness in Influence Maximization through Randomization.
J. Artif. Intell. Res., 2022

2021
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models.
SIAM J. Comput., 2021

When Can Liquid Democracy Unveil the Truth?
CoRR, 2021

Influence Maximization With Co-Existing Seeds.
Proceedings of the CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1, 2021

Maximizing Influence-Based Group Shapley Centrality.
Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2021

Unveiling the Truth in Liquid Democracy with Misinformed Voters.
Proceedings of the Algorithmic Decision Theory - 7th International Conference, 2021

2020
Low Diameter Graph Decompositions by Approximate Distance Computation.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Balancing Spreads of Influence in a Social Network.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Two results on slime mold computations.
Theor. Comput. Sci., 2019

Subspace Determination through Local Intrinsic Dimensional Decomposition: Theory and Experimentation.
CoRR, 2019

Distributed Algorithms for Low Stretch Spanning Trees.
Proceedings of the 33rd International Symposium on Distributed Computing, 2019

Subspace Determination Through Local Intrinsic Dimensional Decomposition.
Proceedings of the Similarity Search and Applications - 12th International Conference, 2019

2018
On Flows, Paths, Roots, and Zeros.
PhD thesis, 2018

A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration.
J. Symb. Comput., 2018

From DQBF to QBF by Dependency Elimination.
Proceedings of the Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen, 2018

2016
An Integer Interior Point Method for Min-Cost Flow Using Arc Contractions and Deletions.
CoRR, 2016

Approximate Undirected Transshipment and Shortest Paths via Gradient Descent.
CoRR, 2016

Complexity Analysis of Root Clustering for a Complex Polynomial.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem.
Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, 2016

2015
A Simple Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration.
CoRR, 2015

2014
A Simple Efficient Interior Point Method for Min-Cost Flow.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

2013
A Combinatorial $\tilde{O}(m^{3/2})$-time Algorithm for the Min-Cost Flow Problem.
CoRR, 2013


  Loading...