Page Not Found
Page not found. Your pixels are in another canvas.
A list of all the posts and pages found on the site. For you robots out there is an XML version available for digesting as well.
Page not found. Your pixels are in another canvas.
This is a page not in th emain menu
Published:
This post will show up by default. To disable scheduling of future posts, edit config.yml
and set future: false
.
Published:
This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.
Published:
This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.
Published:
This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.
Published:
This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.
Short description of portfolio item number 1
Short description of portfolio item number 2
with Kirankumar Shiragur, Ramesh Johari, David Scheinker, Kevin Schulman, and Kristan Staudenmayer (Work in Progress), 2021
The most common approaches to looking at the question of school safety focus on absolute risk. By contrast, we take the perspective that the situation warrants an approach that evaluates school safety from the perspective of relative risk: i.e., are open schools more or less safe than the surrounding community? In looking at the problem from the perspective of relative risk, we have found a fascinating result. Under most scenarios, students would be as safe or safer in school as in their community.
Download here
with Nima Anari, Kirankumar Shiragur and Thuy-Duong Vuong. STOC, 2021
We show fully polynomial time randomized approximation schemes (FPRAS) for counting matchings of a given size, or more generally sampling/counting monomer-dimer systems in planar, not-necessarily-bipartite, graphs.
Download here
with Mohammad Akbarpour, Shengwu Li and Amin Saberi (Work in Progress), 2021
We show that in a dynamic spatial matching market, no level of sophistication in the matching algorithm and no amount of data to predict times and locations of future demand can beat a naive greedy algorithm with a small excess supply.
Download here
with Christian Borgs and Amin Saberi. (Work in Progress), 2021
We consider random digraphs on a sequence of expanders with bounded average degree. Under the assumption that the original sequence has a weak local limit, we show that the threshold for the existence of a giant strongly connected component, as well as the asymptotic fraction of nodes with a giant fan-in or a giant fan-out are local.
Download here
Published:
Published:
offered by Reyna Hulett, Stanford University, 2019
offered by Amin Saberi, Stanford University, 2020
offered by Greg Valiant and Mary Wootters, Stanford University, 2022