The following pages link to Jon Schneider (Q2692530):
Displayed 15 items.
- Combinatorial Bernoulli factories (Q2692531) (← links)
- Competitive analysis of the top-<i>K</i> ranking problem (Q4575824) (← links)
- Information complexity is computable (Q4598227) (← links)
- Tight space-noise tradeoffs in computing the ergodic measure (Q4610200) (← links)
- Condorcet-consistent and approximately strategyproof tournament rules (Q4638087) (← links)
- Optimal Instance Adaptive Algorithm for the Top-$K$ Ranking Problem (Q4682903) (← links)
- (Q5090413) (← links)
- Contextual Search via Intrinsic Volumes (Q5092512) (← links)
- Combinatorial Bernoulli factories: matchings, flows, and other polytopes (Q6087048) (← links)
- Contextual Bandits with Cross-Learning (Q6121640) (← links)
- (Q6147317) (← links)
- Multiparameter Bernoulli factories (Q6187484) (← links)
- Learning Product Rankings Robust to Fake Users (Q6192789) (← links)
- Bernoulli Factories for Flow-Based Polytopes (Q6202751) (← links)
- Enumeration and Quasipolynomiality of Chip-Firing Configurations (Q6224585) (← links)