Shayan Oveis Gharan
where else to find them
no profile links on file
what they talk about
where they keep going back
- ITCS2 editions2022–2023
on a stage with
- Anna Karlinonce
- Ansh Nagdaonce
- Dorna Abdolazimionce
all 5 in the filters
who talks about the same things
- Farzam Ebrahimnejad2 talks
- Amin Saberi6 talks
- Shay Solomon3 talks
- Guy N. Rothblum10 talks
- Gal Yona4 talks
- Keren Censor-Hillel2 talks
| title | conference | date |
|---|---|---|
| Matroid Partition Property and the Secretary Problem | ITCS 2023 | 2023-01-10 |
Proves that no algorithm which first reduces a matroid to a partition matroid (possibly after sampling a beta fraction) and then runs the standard secretary… | ||
| Counting and Sampling Perfect Matchings in Regular Expanding Non-Bipartite Graphs | ITCS 2022 | 2022-01-31 |
Gives a randomized algorithm that approximates and samples perfect matchings in d-regular ε-spectral expanders in time n^{o(log d)} (more precisely n^{o(log d)… | ||
| On Structural Properties of Low Threshold Rank Graphs | Structure vs. Randomness 2017 | 2017-04-10 |
Defines epsilon-threshold rank as the count of normalized-adjacency eigenvalues with |λ| ≥ ε and studies graphs where that rank is small. Proves any graph… | ||
| nothing matches | ||