7 citations · 19 across the 40 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
Polynomial Property Testing
Lior Gishboliner, Asaf Shapira
Property testers are fast, randomized "election polling"-type algorithms that determine if an input (e.g., graph or hypergraph) has a certain property or is -far from…
cs.DS2020★ 1 cited
Counting Homomorphic Cycles in Degenerate Graphs
Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira +1
Since counting subgraphs in general graphs is, by and large, a computationally demanding problem, it is natural to try and design fast algorithms for restricted families of graphs.…