Amin Saberi
where else to find them
no profile links on file
what they talk about
where they keep going back
- ITCS2 editions2021–2022
all 5 in the filters
on a stage with
- Aaron Schildonce
- David Wajconce
- Diyi Yangonce
all 10 in the filters
who talks about the same things
- Nima Anari8 talks
- David P. Woodruff18 talks
- Sepehr Assadi9 talks
- Shay Solomon3 talks
- Shayan Oveis Gharan3 talks
- Michael Kapralov7 talks
| title | conference | date |
|---|---|---|
| StorySage: Conversational Autobiography Writing Powered by a Multi-Agent Framework | UIST 2025 | 2025-09-28 |
A system called StorySage implements a five-agent pipeline — Interviewer, Session Scribe, Planner, Section Writer, Session Coordinator — that stores responses… | ||
| Influencing Cascades: An Algorithmic View | Graph Limits and Processes on Networks: From Epidemics to Misinformation Boot Camp | 2022-08-29 |
Models adoption as asynchronous logit (Glauber) dynamics with inverse-noise beta and a potential function; the main quantitative claim ties the worst-case… | ||
| Beating the Folklore Algorithm for Dynamic Matching | ITCS 2022 | 2022-01-31 |
Deterministic algorithm achieves a deterministic (2−ε)-approx for fully dynamic matching with worst-case update time n^{3/4}. It maintains an epsilon-D kernel… | ||
| Sampling Arborescences in Parallel | ITCS 2021 | 2021-01-06 |
Claims an RNC sampler that outputs a rooted arborescence from a weighted digraph with probability proportional to product of edge weights, running in polylog… | ||
| Computational Complexity of Matching in Ride Sharing | Platform Markets 2019 | 2019-09-16 |
A formal model has vertices that stay for d steps and arrive in random order; a simple batching with batch size d+1 is analyzed by reducing competitive… | ||
| Algorithmic Aspects of Online Advertising | Real-Time Decision Making | 2016-07-01 |
Defines the online budgeted ad-allocation (AdWords) model, proves greedy can be as bad as 1/2 worst-case and gives a multiplicative pacing algorithm that… | ||
| nothing matches | ||