16 citations · 40 across the 15 of their papers we have counts for
20 papers
Random Wheeler Automata
Ruben Becker, Davide Cenzato, Sung-Hwan Kim +3
Wheeler automata were introduced in 2017 as a tool to generalize existing indexing and compression techniques based on the Burrows-Wheeler transform. Intuitively, an automaton is s…
Optimal Wheeler Language Recognition
Ruben Becker, Davide Cenzato, Sung-Hwan Kim +3
A Wheeler automaton is a finite state automaton whose states admit a total Wheeler order, reflecting the co-lexicographic order of the strings labeling source-to-node paths. A Whee…
Sorting Finite Automata via Partition Refinement
Ruben Becker, Manuel Cáceres, Davide Cenzato +4
Wheeler nondeterministic finite automata (WNFAs) were introduced as a generalization of prefix sorting from strings to labeled graphs. WNFAs admit optimal solutions to classic hard…
Improving Fairness in Information Exposure by Adding Links
Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi
Fairness in influence maximization has been a very active research topic recently. Most works in this context study the question of how to find seeding strategies (deterministic or…
On the Cost of Demographic Parity in Influence Maximization
Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi
Modeling and shaping how information spreads through a network is a major research topic in network analysis. While initially the focus has been mostly on efficiency, recently fair…
Giant Components in Random Temporal Graphs
Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi +4
A temporal graph is a graph whose edges appear only at certain points in time. Recently, the second and the last three authors proposed a natural temporal analog of the Erdős-Rényi…