☰

Nir Ailon, Ph.D. - Publications

Affiliations: 
2006 Princeton University, Princeton, NJ 
Area:
Natural Algorithms, Dynamical Systems, Dynamic Networks, Computational Geometry, Discrepancy Theory.
Tree Info Similar researchers PubMed Report error

25 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Ailon N. Paraunitary matrices, entropy, algebraic condition number and Fourier computation Theoretical Computer Science. 814: 234-248. DOI: 10.1016/J.Tcs.2020.02.002  0.421
2016 Ailon N. An omega((n log n)/R) lower bound for fourier transform computation in the R-well conditioned model Acm Transactions On Computation Theory. 8. DOI: 10.1145/2858785  0.4
2015 Bhattacharya A, Jaiswal R, Ailon N. Tight lower bound instances for k-means++ in two dimensions Theoretical Computer Science. DOI: 10.1016/J.Tcs.2016.04.012  0.377
2015 Ailon N. Tighter fourier transform lower bounds Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9134: 14-25. DOI: 10.1007/978-3-662-47672-7_2  0.326
2014 Ailon N, Hatano K, Takimoto E. Bandit online optimization over the permutahedron Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8776: 215-229. DOI: 10.1016/J.Tcs.2016.07.033  0.556
2014 Ailon N, Rauhut H. Fast and RIP-Optimal Transforms Discrete & Computational Geometry. DOI: 10.1007/S00454-014-9632-3  0.322
2014 Bhattacharya A, Jaiswal R, Ailon N. A tight lower bound instance for k-means++ in constant dimension Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8402: 7-22. DOI: 10.1007/978-3-319-06089-7_2  0.31
2014 Ailon N. Improved bounds for online learning over the permutahedron and other ranking polytopes Journal of Machine Learning Research. 33: 29-37.  0.395
2013 Ailon N, Liberty E. An almost optimal unrestricted fast Johnson-Lindenstrauss transform Acm Transactions On Algorithms. 9. DOI: 10.1145/2483699.2483701  0.416
2012 Ailon N, Avigdor-Elgrabli N, Liberty E, Van Zuylen A. Improved approximation algorithms for bipartite correlation clustering Siam Journal On Computing. 41: 1110-1121. DOI: 10.1137/110848712  0.43
2012 Ailon N. An active learning algorithm for ranking from pairwise preferences with an almost optimal query complexity Journal of Machine Learning Research. 13: 137-164.  0.312
2011 Ailon N, Charikar M. Fitting tree metrics: Hierarchical clustering and phylogeny Siam Journal On Computing. 40: 1275-1291. DOI: 10.1137/100806886  0.395
2011 Ailon N, Chazelle B, Clarkson KL, Liu D, Mulzer W, Seshadhri C. Self-improving algorithms Siam Journal On Computing. 40: 350-375. DOI: 10.1137/090766437  0.73
2011 Liberty E, Ailon N, Singer A. Dense Fast Random Projections and Lean Walsh Transforms Discrete and Computational Geometry. 45: 34-44. DOI: 10.1007/S00454-010-9309-5  0.353
2010 Ailon N, Chazelle B. Faster dimension reduction Communications of the Acm. 53: 97-104. DOI: 10.1145/1646353.1646379  0.578
2010 Ailon N, Mohri M. Preference-based learning to rank Machine Learning. 80: 189-211. DOI: 10.1007/S10994-010-5176-9  0.484
2009 Ailon N, Chazelle B. The fast johnson-lindenstrauss transform and approximate nearest neighbors Siam Journal On Computing. 39: 302-322. DOI: 10.1137/060673096  0.637
2009 Ailon N, Liberty E. Fast dimension reduction using Rademacher series on dual BCH codes Discrete and Computational Geometry. 42: 615-630. DOI: 10.1007/s00454-008-9110-x  0.362
2008 Ailon N, Charikar M, Newman A. Aggregating inconsistent information: Ranking and clustering Journal of the Acm. 55. DOI: 10.1145/1411509.1411513  0.372
2008 Ailon N, Chazelle B, Comandur S, Liu D. Property-preserving data reconstruction Algorithmica (New York). 51: 160-182. DOI: 10.1007/S00453-007-9075-9  0.583
2008 Ailon N, Mohri M. An efficient reduction of ranking to classification 21st Annual Conference On Learning Theory, Colt 2008. 87-97.  0.401
2007 Ailon N, Chazelle B, Comandur S, Liu D. Estimating the distance to a monotone function Random Structures and Algorithms. 31: 371-383. DOI: 10.1002/Rsa.V31:3  0.594
2006 Ailon N, Chazelle B. Information theory in property testing and monotonicity testing in higher dimension Information and Computation. 204: 1704-1717. DOI: 10.1016/J.Ic.2006.06.001  0.634
2006 Ailon N, Chazelle B. Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform Proceedings of the Annual Acm Symposium On Theory of Computing. 2006: 557-563.  0.488
2005 Ailon N, Chazelle B. Lower bounds for linear degeneracy testing Journal of the Acm. 52: 157-171. DOI: 10.1145/1059513.1059515  0.595
Show low-probability matches.