The following pages link to David Eisenstat (Q352238):
Displaying 22 items.
- A simple population protocol for fast robust approximate majority (Q352239) (← links)
- Low-contention data structures (Q433458) (← links)
- The VC dimension of \(k\)-fold union (Q845927) (← links)
- \(k\)-Fold unions of low-dimensional concept classes (Q990081) (← links)
- The computational power of population protocols (Q1954251) (← links)
- Fast computation by population protocols with a leader (Q2377254) (← links)
- Expected rank and randomness in rooted graphs (Q2476261) (← links)
- Non-isomorphic caterpillars with identical subtree data (Q2495521) (← links)
- Effective storage capacity of labeled graphs (Q2637317) (← links)
- Design and analysis of bipartite experiments under a linear exposure-response model (Q2681751) (← links)
- (Q2880953) (← links)
- A Simple Population Protocol for Fast Robust Approximate Majority (Q3523196) (← links)
- Fast Computation by Population Protocols with a Leader (Q3524294) (← links)
- Combinatorial Properties of a Rooted Graph Polynomial (Q3629475) (← links)
- Time-Space Trade-offs in Population Protocols (Q4575918) (← links)
- Lower Bounds on Learning Random Structures with Statistical Queries (Q4930699) (← links)
- Facility Location in Evolving Metrics (Q5167860) (← links)
- Stably computable predicates are semilinear (Q5177291) (← links)
- Random road networks: the quadtree model (Q5194693) (← links)
- Approximating <i>k</i>-center in planar graphs (Q5384008) (← links)
- Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs (Q5495844) (← links)
- (Q5743426) (← links)
