We study the reverse shortest path problem on disk graphs in the plane. ...
Let S ⊆ℝ^2 be a set of n sites in the plane, so
that every site s ∈ S ha...
A weighted directed graph G=(V,A,c), where A⊆ V× V and
c:A→ R, describes...
In this work we introduce an interactive variant of joint differential
p...
We introduce the concurrent shuffle model of differential privacy. In th...
Binary search trees (BSTs) are one of the most basic and widely used dat...
Traffic splitting is a required functionality in networks, for example f...
Search trees on trees (STTs) generalize the fundamental binary search tr...
We study the online facility location problem with uniform facility cost...
A (ϕ,ϵ)-Expander-decomposition of a graph G is a partition of
V into clu...
The amount of training-data is one of the key factors which determines t...
Traffic splitting is a required functionality in networks, for example f...
Clustering is a fundamental problem in data analysis. In differentially
...
The literature on data sanitization aims to design algorithms that take ...
A dynamic algorithm against an adaptive adversary is required to be corr...
Differentially private algorithms for common metric aggregation tasks, s...
In this work we study the problem of differentially private (DP) quantil...
Let S be a set of n sites, each associated with a point in ℝ^2
and a rad...
We give an (ε,δ)-differentially private algorithm for the
multi-armed ba...
We study the classical online bipartite matching problem: One side of th...
We study a novel variant of online finite-horizon Markov Decision Proces...
We present a streaming problem for which every adversarially-robust stre...
Locality Sensitive Hashing (LSH) is an effective method of indexing a se...
We revisit one of the most basic and widely applicable techniques in the...
We design an efficient data structure for computing a suitably defined
a...
An ϵ-approximate incidence between a point and some geometric object
(li...
We review the theory of, and develop algorithms for transforming a finit...
We present a differentially private learner for halfspaces over a finite...
Locality Sensitive Hashing (LSH) is an effective method to index a set o...
A streaming algorithm is said to be adversarially robust if its accuracy...
We study the question of how to compute a point in the convex hull of an...
Stochastic shortest path (SSP) is a well-known problem in planning and
c...
We study the sample complexity of learning threshold functions under the...
We consider the applications of the Frank-Wolfe (FW) algorithm for
Appre...
Influence maximization (IM) is the problem of finding a set of s nodes i...
We extend the standard online worst-case model to accommodate past exper...
Let S ⊂R^2 be a set of n sites, where each s ∈ S has
an associated radiu...
We study the Thompson sampling algorithm in an adversarial setting,
spec...
We derive and analyze learning algorithms for policy evaluation,
apprent...
We consider the classical camera pose estimation problem that arises in ...
We consider a settings of hierarchical reinforcement learning, in which ...
We present differentially private efficient algorithms for learning unio...
We study a classic algorithmic problem through the lens of statistical
l...
Our goal is to compare two planar point sets by finding subsets of a giv...
We revisit multipass pairing heaps and path-balanced binary search trees...
We design new differentially private algorithms for the Euclidean k-mean...
In this work, we provide theoretical guarantees for reward decomposition...
In 1999, Brodal and Fagerberg (BF) gave an algorithm for maintaining a l...
We use soft heaps to obtain simpler optimal algorithms for selecting the...
We present an O(n) expected time algorithm and an O(n n)
deterministic ...