23 citations · 28 across the 13 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019★ 3 cited
Efficient Gauss Elimination for Near-Quadratic Matrices with One Short Random Block per Row, with Applications
Martin Dietzfelbinger, Stefan Walzer
In this paper we identify a new class of sparse near-quadratic random Boolean matrices that have full row rank over with high probability and can be transfor…
cs.DS2019
Dense Peelable Random Uniform Hypergraphs
Martin Dietzfelbinger, Stefan Walzer
We describe a new family of -uniform hypergraphs with independent random edges. The hypergraphs have a high probability of being peelable, i.e. to admit no sub-hypergraph of min…