1 citations · 1 across the 5 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.DS2025
Efficient Catalytic Graph Algorithms
James Cook, Edward Pyne
We give fast, simple, and implementable catalytic logspace algorithms for two fundamental graph problems. First, a randomized catalytic algorithm for connectivity running…
cs.DS2025
A Fast Coloring Oracle for Average Case Hypergraphs
Cassandra Marcussen, Edward Pyne, Ronitt Rubinfeld +2
Hypergraph -colorability is one of the classical NP-hard problems. Person and Schacht [SODA'09] designed a deterministic algorithm whose expected running time is polynomial over…