#### Filter Results:

- Full text PDF available (30)

#### Publication Year

1990

2018

- This year (11)
- Last 5 years (33)
- Last 10 years (44)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

Learn More

- Aleksandar Nikolov, Kunal Talwar, Li Zhang
- STOC
- 2013

We study trade-offs between accuracy and privacy in the context of linear queries over histograms. This is a rich class of queries that includes contingency tables and range queries and has been theâ€¦ (More)

In many monitoring applications, recent data is more important than distant data. How does this affect privacy of data analysis? We study a general class of data analyses --- predicate sums --- inâ€¦ (More)

- Alantha Newman, Ofer Neiman, Aleksandar Nikolov
- 2012 IEEE 53rd Annual Symposium on Foundations ofâ€¦
- 2012

Given three permutations on the integers 1 through n, consider the set system consisting of each interval in each of the three permutations. In 1982, Beck conjectured that the discrepancy of this setâ€¦ (More)

- S. Muthukrishnan, Aleksandar Nikolov
- STOC
- 2012

A range counting problem is specified by a set P of size |P| = n of points in R<sup>d</sup>, an integer weight x<sub>p</sub> associated to each point p ∈ P, and a range space R ⊆â€¦ (More)

- Moses Charikar, Alantha Newman, Aleksandar Nikolov
- SODA
- 2011

In the Discrepancy problem, we are given <i>M</i> sets {<i>S</i><sub>1</sub>,..., <i>S</i><sub><i>M</i></sub>} on <i>N</i> elements. Our goal is to find an assignment <i>χ</i> of {−1, + 1}â€¦ (More)

We give algorithms for geometric graph problems in the modern parallel models such as MapReduce. For example, for the Minimum Spanning Tree (MST) problem over a set of points in the two-dimensionalâ€¦ (More)

- Aleksandar Nikolov
- STOC
- 2015

The maximum volume j-simplex problem asks to compute the j-dimensional simplex of maximum volume inside the convex hull of a given set of n points in Q<sup>d</sup>. We give a deterministicâ€¦ (More)

- Aleksandar Nikolov, Mohit Singh
- STOC
- 2016

Given a positive semidefinte matrix <i>L</i> whose columns and rows are indexed by a set <i>U</i>, and a partition matroid <i>M</i>=(<i>U</i>, <i>I</i>), we study the problem of selecting a basisâ€¦ (More)

- Cynthia Dwork, Aleksandar Nikolov, Kunal Talwar
- Discrete & Computational Geometry
- 2015

Consider a database of n people, each represented by a bit-string of length d corresponding to the setting of d binary attributes. A k-way marginal query is specified by a subset S of k attributes,â€¦ (More)

- Cynthia Dwork, Aleksandar Nikolov, Kunal Talwar
- Symposium on Computational Geometry
- 2014

Differential privacy is a definition giving a strong privacy guarantee even in the presence of auxiliary information. In this work we pursue the application of geometric techniques for achievingâ€¦ (More)