Ronitt Rubinfeld
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 7 in the filters
on a stage with
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Dana is NOT average | Workshop on Local Algorithms (WoLA) 2024 | 2024-08-05 |
Average-case LCAs for random inputs give concrete gains: k-spanner constructions on G(n,p) achieve size/stretch tradeoffs impossible in the worst case while… | ||
| Sublinear-Time Algorithms in Learning | Extroverted Sublinear Algorithms 2024 | 2024-06-17 |
Claims sublinear certification for distribution-dependent agnostic learning: tester-learner pair procedures certify use of agnostic learners for decision lists… | ||
| Local Access to Random Walks | ITCS 2022 | 2022-01-31 |
Provides a local-access algorithm that answers position-at-time queries on a random walk with per-query cost about (1/(1−λ))·√n (up to polylog factors), and… | ||
| Sublinear Time Local-Access Random Generators | Sublinear Algorithms and Nearest-Neighbor Search | 2018-11-27 |
Generates huge random graphs on the fly and answers vertex-pair, next-neighbor, all-neighbor and random-neighbor queries while spending polylogarithmic time… | ||
| Sub-Linear Time Algorithms: Fast, Cheap and (Only a Little) Out of Control | Real-Time Decision Making Boot Camp, Spring 2018 | 2018-01-22 |
Claims that many global questions about huge data are answerable with sublinear work: property testing of lists (a one/epsilon·log n tester that… | ||
| Local Computation Algorithms | Real-Time Decision Making | 2016-07-01 |
Defines a formal model where an algorithm answers queries about pieces of a huge output without computing the whole output, proving that many tasks admit… | ||
| Something for Almost Nothing: Advances in Sub-Linear Time Algorithms | Workshop on Succinct Data Representations and Applications (Simons Institute Big Data 2013) | 2013-09-16 |
Algorithms decide properties and approximate values without reading all data by sampling, random orderings, and simulating local procedures. Key concrete… | ||
| nothing matches | ||