default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAleksandar Nikolov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Lily Li, Aleksandar Nikolov:
On the Gap Between Hereditary Discrepancy and the Determinant Lower Bound. SIAM J. Discret. Math. 38(2): 1222-1238 (2024)- [c36]Aleksandar Nikolov, Haohua Tang:
General Gaussian Noise Mechanisms and Their Optimality for Unbiased Mean Estimation. ITCS 2024: 85:1-85:23 - 2023
- [c35]Lily Li, Evi Micha, Aleksandar Nikolov, Nisarg Shah:
Partitioning Friends Fairly. AAAI 2023: 5747-5754 - [c34]Aleksandar Nikolov:
Private Query Release via the Johnson-Lindenstrauss Transform. SODA 2023: 4982-5002 - [i34]Aleksandar Nikolov, Haohua Tang:
Gaussian Noise is Nearly Instance Optimal for Private Unbiased Mean Estimation. CoRR abs/2301.13850 (2023) - [i33]Lily Li, Aleksandar Nikolov:
On the Gap between Hereditary Discrepancy and the Determinant Lower Bound. CoRR abs/2303.08167 (2023) - 2022
- [j9]Aleksandar Nikolov, Mohit Singh, Uthaipon Tao Tantipongpipat
:
Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design. Math. Oper. Res. 47(2): 847-877 (2022) - [j8]Sepehr Abbasi Zadeh, Nikhil Bansal, Guru Guruganesh, Aleksandar Nikolov, Roy Schwartz, Mohit Singh:
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems. ACM Trans. Algorithms 18(4): 33:1-33:50 (2022) - [c33]Alexander Edmonds, Aleksandar Nikolov, Toniann Pitassi:
On Learning and Refutation in Noninteractive Local Differential Privacy. NeurIPS 2022 - [i32]Aleksandar Nikolov:
Private Query Release via the Johnson-Lindenstrauss Transform. CoRR abs/2208.07410 (2022) - [i31]Alexander Edmonds, Aleksandar Nikolov, Toniann Pitassi:
Learning versus Refutation in Noninteractive Local Differential Privacy. CoRR abs/2210.15439 (2022) - 2021
- [c32]Deepanshu Kush, Aleksandar Nikolov, Haohua Tang:
Near Neighbor Search via Efficient Average Distortion Embeddings. SoCG 2021: 50:1-50:14 - [c31]Alexandr Andoni, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten:
Approximate Nearest Neighbors Beyond Space Partitions. SODA 2021: 1171-1190 - [i30]Deepanshu Kush, Aleksandar Nikolov, Haohua Tang:
Near Neighbor Search via Efficient Average Distortion Embeddings. CoRR abs/2105.04712 (2021) - 2020
- [j7]Andrey Boris Khesin, Aleksandar Nikolov, Dmitry Paramonov:
Preconditioning for the Geometric Transportation Problem. J. Comput. Geom. 11(2): 234-259 (2020) - [j6]Aleksandar Nikolov, Lars Vilhuber:
Editorial for Special Issue on the Theory and Practice of Differential Privacy 2018. J. Priv. Confidentiality 10(1) (2020) - [j5]Aleksandar Nikolov, Lars Vilhuber:
Program for TPDP 2018. J. Priv. Confidentiality 10(1) (2020) - [c30]Sivakanth Gopi, Gautam Kamath, Janardhan Kulkarni, Aleksandar Nikolov, Zhiwei Steven Wu, Huanyu Zhang:
Locally Private Hypothesis Selection. COLT 2020: 1785-1816 - [c29]Lily Li, Aleksandar Nikolov:
On the Computational Complexity of Linear Discrepancy. ESA 2020: 69:1-69:16 - [c28]Vivek Madan, Aleksandar Nikolov, Mohit Singh, Uthaipon Tantipongpipat:
Maximizing Determinants under Matroid Constraints. FOCS 2020: 565-576 - [c27]Raef Bassily, Albert Cheu, Shay Moran, Aleksandar Nikolov, Jonathan R. Ullman, Zhiwei Steven Wu:
Private Query Release Assisted by Public Data. ICML 2020: 695-703 - [c26]Sepehr Abbasi Zadeh, Nikhil Bansal, Guru Guruganesh, Aleksandar Nikolov, Roy Schwartz, Mohit Singh:
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems. SODA 2020: 854-873 - [c25]Alexander Edmonds, Aleksandar Nikolov, Jonathan R. Ullman:
The power of factorization mechanisms in local and central differential privacy. STOC 2020: 425-438 - [i29]Sivakanth Gopi, Gautam Kamath, Janardhan Kulkarni, Aleksandar Nikolov, Zhiwei Steven Wu, Huanyu Zhang:
Locally Private Hypothesis Selection. CoRR abs/2002.09465 (2020) - [i28]Vivek Madan, Aleksandar Nikolov, Mohit Singh, Uthaipon Tantipongpipat:
Maximizing Determinants under Matroid Constraints. CoRR abs/2004.07886 (2020) - [i27]Raef Bassily, Albert Cheu, Shay Moran, Aleksandar Nikolov, Jonathan R. Ullman, Zhiwei Steven Wu:
Private Query Release Assisted by Public Data. CoRR abs/2004.10941 (2020) - [i26]Lily Li, Aleksandar Nikolov:
On the Computational Complexity of Linear Discrepancy. CoRR abs/2008.00044 (2020)
2010 – 2019
- 2019
- [j4]Daniel Dadush, Shashwat Garg, Shachar Lovett, Aleksandar Nikolov:
Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem. Theory Comput. 15: 1-58 (2019) - [c24]Jerry Li, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten:
On Mean Estimation for General Norms with Statistical Queries. COLT 2019: 2158-2172 - [c23]Andrey Boris Khesin, Aleksandar Nikolov, Dmitry Paramonov:
Preconditioning for the Geometric Transportation Problem. SoCG 2019: 15:1-15:14 - [c22]Aleksandar Nikolov, Mohit Singh, Uthaipon Tao Tantipongpipat:
Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design. SODA 2019: 1369-1386 - [c21]Jaroslaw Blasiok, Mark Bun, Aleksandar Nikolov, Thomas Steinke:
Towards Instance-Optimal Private Query Release. SODA 2019: 2480-2497 - [i25]Jerry Li, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten:
On Mean Estimation for General Norms with Statistical Queries. CoRR abs/1902.02459 (2019) - [i24]Andrey Boris Khesin, Aleksandar Nikolov, Dmitry Paramonov:
Preconditioning for the Geometric Transportation Problem. CoRR abs/1902.08384 (2019) - [i23]Alexander Edmonds, Aleksandar Nikolov, Jonathan R. Ullman:
The Power of Factorization Mechanisms in Local and Central Differential Privacy. CoRR abs/1911.08339 (2019) - 2018
- [j3]Arnab Bhattacharyya, Fabrizio Grandoni, Aleksandar Nikolov, Barna Saha, Saket Saurabh, Aravindan Vijayaraghavan, Qin Zhang:
Editorial: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016 Special Issue. ACM Trans. Algorithms 14(3): 26:1-26:2 (2018) - [c20]Daniel Dadush, Aleksandar Nikolov, Kunal Talwar, Nicole Tomczak-Jaegermann:
Balancing Vectors in Any Norm. FOCS 2018: 1-10 - [c19]Alexandr Andoni, Assaf Naor, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten:
Hölder Homeomorphisms and Approximate Nearest Neighbors. FOCS 2018: 159-169 - [c18]Alexandr Andoni, Assaf Naor, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten:
Data-dependent hashing via nonlinear spectral gaps. STOC 2018: 787-800 - [i22]Aleksandar Nikolov, Mohit Singh, Uthaipon Tao Tantipongpipat:
Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design. CoRR abs/1802.08318 (2018) - [i21]Jaroslaw Blasiok, Mark Bun, Aleksandar Nikolov, Thomas Steinke:
Towards Instance-Optimal Private Query Release. CoRR abs/1811.03763 (2018) - [i20]Sepehr Abbasi Zadeh, Nikhil Bansal, Guru Guruganesh, Aleksandar Nikolov, Roy Schwartz, Mohit Singh:
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems. CoRR abs/1812.07769 (2018) - 2017
- [c17]Assimakis Kattis, Aleksandar Nikolov:
Lower Bounds for Differential Privacy from Gaussian Width. SoCG 2017: 45:1-45:16 - [c16]Alexandr Andoni, Huy L. Nguyen, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten:
Approximate near neighbors for general symmetric norms. STOC 2017: 902-913 - [i19]Aleksandar Nikolov:
Tighter Bounds for the Discrepancy of Boxes and Polytopes. CoRR abs/1701.05532 (2017) - [i18]Christoph Aistleitner, Dmitriy Bilyk, Aleksandar Nikolov:
Tusnády's problem, the transference principle, and non-uniform QMC sampling. CoRR abs/1703.06127 (2017) - 2016
- [j2]Aleksandar Nikolov, Kunal Talwar, Li Zhang:
The Geometry of Differential Privacy: The Small Database and Approximate Cases. SIAM J. Comput. 45(2): 575-616 (2016) - [c15]Daniel Dadush, Shashwat Garg, Shachar Lovett, Aleksandar Nikolov:
Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem. APPROX-RANDOM 2016: 28:1-28:12 - [c14]Aleksandar Nikolov, Mohit Singh:
Maximizing determinants under partition constraints. STOC 2016: 192-201 - [r1]Aleksandar Nikolov:
Geometric Approaches to Answering Queries. Encyclopedia of Algorithms 2016: 828-834 - [i17]Alexandr Andoni, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten:
Approximate Near Neighbors for General Symmetric Norms. CoRR abs/1611.06222 (2016) - [i16]Assimakis Kattis, Aleksandar Nikolov:
Lower Bounds for Differential Privacy from Gaussian Width. CoRR abs/1612.02914 (2016) - [i15]Daniel Dadush, Shashwat Garg, Shachar Lovett, Aleksandar Nikolov:
Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem. CoRR abs/1612.04304 (2016) - 2015
- [j1]Cynthia Dwork, Aleksandar Nikolov, Kunal Talwar:
Efficient Algorithms for Privately Releasing Marginals via Convex Relaxations. Discret. Comput. Geom. 53(3): 650-673 (2015) - [c13]Jirí Matousek, Aleksandar Nikolov:
Combinatorial Discrepancy for Boxes via the gamma_2 Norm. SoCG 2015: 1-15 - [c12]Aleksandar Nikolov:
An Improved Private Mechanism for Small Databases. ICALP (1) 2015: 1010-1021 - [c11]Aleksandar Nikolov, Kunal Talwar:
Approximating Hereditary Discrepancy via Small Width Ellipsoids. SODA 2015: 324-336 - [c10]Aleksandar Nikolov:
Randomized Rounding for the Largest Simplex Problem. STOC 2015: 861-870 - [i14]Aleksandar Nikolov:
An Improved Private Mechanism for Small Databases. CoRR abs/1505.00244 (2015) - 2014
- [c9]Cynthia Dwork, Aleksandar Nikolov, Kunal Talwar:
Using Convex Relaxations for Efficiently and Privately Releasing Marginals. SoCG 2014: 261 - [c8]Alexandr Andoni, Aleksandar Nikolov, Krzysztof Onak, Grigory Yaroslavtsev:
Parallel algorithms for geometric graph problems. STOC 2014: 574-583 - [i13]Alexandr Andoni, Aleksandar Nikolov, Krzysztof Onak, Grigory Yaroslavtsev:
Parallel Algorithms for Geometric Graph Problems. CoRR abs/1401.0042 (2014) - [i12]Jirí Matousek, Aleksandar Nikolov, Kunal Talwar:
Factorization Norms and Hereditary Discrepancy. CoRR abs/1408.1376 (2014) - [i11]Aleksandar Nikolov:
Randomized Rounding for the Largest $j$-Simplex Problem. CoRR abs/1412.0036 (2014) - 2013
- [c7]Nadia Fawaz, S. Muthukrishnan, Aleksandar Nikolov:
Nearly Optimal Private Convolution. ESA 2013: 445-456 - [c6]Jean Bolot, Nadia Fawaz, S. Muthukrishnan, Aleksandar Nikolov, Nina Taft:
Private decayed predicate sums on streams. ICDT 2013: 284-295 - [c5]Aleksandar Nikolov, Kunal Talwar, Li Zhang:
The geometry of differential privacy: the sparse and approximate cases. STOC 2013: 351-360 - [i10]Aleksandar Nikolov:
The Komlos Conjecture Holds for Vector Colorings. CoRR abs/1301.4039 (2013) - [i9]Nadia Fawaz, S. Muthukrishnan, Aleksandar Nikolov:
Nearly Optimal Private Convolution. CoRR abs/1301.6447 (2013) - [i8]Cynthia Dwork, Aleksandar Nikolov, Kunal Talwar:
Efficient Algorithms for Privately Releasing Marginals via Convex Relaxations. CoRR abs/1308.1385 (2013) - [i7]Aleksandar Nikolov, Kunal Talwar:
Approximating Hereditary Discrepancy via Small Width Ellipsoids. CoRR abs/1311.6204 (2013) - 2012
- [c4]Alantha Newman, Ofer Neiman, Aleksandar Nikolov:
Beck's Three Permutations Conjecture: A Counterexample and Some Consequences. FOCS 2012: 253-262 - [c3]S. Muthukrishnan, Aleksandar Nikolov:
Optimal private halfspace counting via discrepancy. STOC 2012: 1285-1292 - [i6]S. Muthukrishnan, Aleksandar Nikolov:
Optimal Private Halfspace Counting via Discrepancy. CoRR abs/1203.5453 (2012) - [i5]Aleksandar Nikolov, Kunal Talwar, Li Zhang:
The Geometry of Differential Privacy: the Sparse and Approximate Cases. CoRR abs/1212.0297 (2012) - 2011
- [c2]Darakhshan J. Mir, S. Muthukrishnan, Aleksandar Nikolov, Rebecca N. Wright:
Pan-private algorithms via statistics on sketches. PODS 2011: 37-48 - [c1]Moses Charikar, Alantha Newman, Aleksandar Nikolov:
Tight Hardness Results for Minimizing Discrepancy. SODA 2011: 1607-1614 - [i4]Alantha Newman, Aleksandar Nikolov:
A counterexample to Beck's conjecture on the discrepancy of three permutations. CoRR abs/1104.2922 (2011) - [i3]Jean Bolot, Nadia Fawaz, S. Muthukrishnan, Aleksandar Nikolov, Nina Taft:
Private Decayed Sum Estimation under Continual Observation. CoRR abs/1108.6123 (2011) - 2010
- [i2]Prahladh Harsha, Moses Charikar, Matthew Andrews, Sanjeev Arora, Subhash Khot, Dana Moshkovitz, Lisa Zhang, Ashkan Aazami, Dev Desai, Igor Gorodezky, Geetha Jagannathan, Alexander S. Kulikov, Darakhshan J. Mir, Alantha Newman, Aleksandar Nikolov, David Pritchard, Gwen Spencer:
Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes). CoRR abs/1002.3864 (2010) - [i1]Darakhshan J. Mir, S. Muthukrishnan, Aleksandar Nikolov, Rebecca N. Wright:
Pan-private Algorithms: When Memory Does Not Help. CoRR abs/1009.1544 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
