5 citations · 7 across the 10 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2021
Spectral Clustering Oracles in Sublinear Time
Grzegorz Gluch, Michael Kapralov, Silvio Lattanzi +2
Given a graph that can be partitioned into disjoint expanders with outer conductance upper bounded by , can we efficiently construct a small space data structure th…
cs.DS2017
4/3 Rectangle Tiling lower bound
Grzegorz Głuch, Krzysztof Loryś
The problem that we consider is the following: given an array of positive numbers, find a tiling using at most rectangles (which means that each array element…