1 citations · 1 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2022
Bernoulli Factories for Flow-Based Polytopes
Rad Niazadeh, Renato Paes Leme, Jon Schneider
We construct explicit combinatorial Bernoulli factories for the class of \emph{flow-based polytopes}; integral 0/1-polytopes defined by a set of network flow constraints. This gene…
cs.DS2014
Fast Dynamic Pointer Following via Link-Cut Trees
Erik Demaine, Nathan Pinsker, Jon Schneider
In this paper, we study the problem of fast dynamic pointer following: given a directed graph where each vertex has outdegree , efficiently support the operations of i) chan…