3 citations · 8 across the 12 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.DC2023★ 1 cited
No distributed quantum advantage for approximate graph coloring
Xavier Coiteux-Roy, Francesco d'Amore, Rishikesh Gajjala +7
We give an almost complete characterization of the hardness of -coloring -chromatic graphs with distributed algorithms, for a wide range of models of distributed computing. I…
cs.CC2023
Pseudorandom Generators for Sliding-Window Algorithms
Augusto Modanese
A sliding-window algorithm of window size is an algorithm whose current operation depends solely on the last symbols read. We construct pseudorandom generators (PRGs) for l…