Aleksandar Nikolov

According to our database1, Aleksandar Nikolov authored at least 40 papers between 2010 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
The Power of Factorization Mechanisms in Local and Central Differential Privacy.
CoRR, 2019

Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Towards Instance-Optimal Private Query Release.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Preconditioning for the Geometric Transportation Problem.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

On Mean Estimation for General Norms with Statistical Queries.
Proceedings of the Conference on Learning Theory, 2019

2018
Editorial: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016 Special Issue.
ACM Trans. Algorithms, 2018

Data-dependent hashing via nonlinear spectral gaps.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Balancing Vectors in Any Norm.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

Hölder Homeomorphisms and Approximate Nearest Neighbors.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017
Tighter Bounds for the Discrepancy of Boxes and Polytopes.
CoRR, 2017

Tusnády's problem, the transference principle, and non-uniform QMC sampling.
CoRR, 2017

Approximate near neighbors for general symmetric norms.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Lower Bounds for Differential Privacy from Gaussian Width.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016
Geometric Approaches to Answering Queries.
Encyclopedia of Algorithms, 2016

The Geometry of Differential Privacy: The Small Database and Approximate Cases.
SIAM J. Comput., 2016

Approximate Near Neighbors for General Symmetric Norms.
CoRR, 2016

Maximizing determinants under partition constraints.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem.
Proceedings of the Approximation, 2016

2015
Efficient Algorithms for Privately Releasing Marginals via Convex Relaxations.
Discrete & Computational Geometry, 2015

Randomized Rounding for the Largest Simplex Problem.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Approximating Hereditary Discrepancy via Small Width Ellipsoids.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

An Improved Private Mechanism for Small Databases.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Combinatorial Discrepancy for Boxes via the gamma_2 Norm.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014
Randomized Rounding for the Largest $j$-Simplex Problem.
CoRR, 2014

Factorization Norms and Hereditary Discrepancy.
CoRR, 2014

Parallel algorithms for geometric graph problems.
Proceedings of the Symposium on Theory of Computing, 2014

Using Convex Relaxations for Efficiently and Privately Releasing Marginals.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013
The Komlos Conjecture Holds for Vector Colorings
CoRR, 2013

The geometry of differential privacy: the sparse and approximate cases.
Proceedings of the Symposium on Theory of Computing Conference, 2013

Private decayed predicate sums on streams.
Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

Nearly Optimal Private Convolution.
Proceedings of the Algorithms - ESA 2013, 2013

2012
Optimal private halfspace counting via discrepancy.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Beck's Three Permutations Conjecture: A Counterexample and Some Consequences.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011
Private Decayed Sum Estimation under Continual Observation
CoRR, 2011

A counterexample to Beck's conjecture on the discrepancy of three permutations
CoRR, 2011

Tight Hardness Results for Minimizing Discrepancy.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Pan-private algorithms via statistics on sketches.
Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2011

2010
Pan-private Algorithms: When Memory Does Not Help
CoRR, 2010

Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes)
CoRR, 2010


  Loading...