65 citations · 195 across the 64 of their papers we have counts for
5 papers · 1 filter
Algorithms for Provisioning Queries and Analytics
Sepehr Assadi, Sanjeev Khanna, Yang Li +1
Provisioning is a technique for avoiding repeated expensive computations in what-if analysis. Given a query, an analyst formulates hypotheticals, each retaining some of the tup…
Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches
Sepehr Assadi, Sanjeev Khanna, Yang Li +1
In this paper, we introduce a new model for sublinear algorithms called \emph{dynamic sketching}. In this model, the underlying data is partitioned into a large \emph{static} part…
Fast Convergence in the Double Oral Auction
Sepehr Assadi, Sanjeev Khanna, Yang Li +1
A classical trading experiment consists of a set of unit demand buyers and unit supply sellers with identical items. Each agent's value or opportunity cost for the item is their pr…
Online Assignment of Heterogeneous Tasks in Crowdsourcing Markets
Sepehr Assadi, Justin Hsu, Shahin Jabbari
We investigate the problem of heterogeneous task assignment in crowdsourcing markets from the point of view of the requester, who has a collection of tasks. Workers arrive online o…
Tight Bounds for Linear Sketches of Approximate Matchings
Sepehr Assadi, Sanjeev Khanna, Yang Li +1
We resolve the space complexity of linear sketches for approximating the maximum matching problem in dynamic graph streams where the stream may include both edge insertion and dele…