| 2011 |
|---|
| 19 | Dense Fast Random Projections and Lean Walsh Transforms. Edo Liberty, Nir Ailon, Amit Singer. Discrete & Computational Geometry (45): 34-44 (2011). Web SearchBibTeXDownload |
| 18 | Improved Approximation Algorithms for Bipartite Correlation Clustering. Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke van Zuylen. ESA 2011, 25-36. Web SearchBibTeXDownload |
| 17 | Self-Improving Algorithms. Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri. SIAM J. Comput. (40): 350-375 (2011). Web SearchBibTeXDownload |
| 16 | Fitting Tree Metrics: Hierarchical Clustering and Phylogeny. Nir Ailon, Moses Charikar. SIAM J. Comput. (40): 1275-1291 (2011). Web SearchBibTeXDownload |
| 15 | An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform. Nir Ailon, Edo Liberty. SODA 2011, 185-191. Web SearchBibTeXDownload |
| 2010 |
|---|
| 14 | An Improved Algorithm for Bipartite Correlation Clustering. Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty. CoRR (abs/1012.3011) (2010). Web SearchBibTeXDownload |
| 13 | Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform. Nir Ailon, Edo Liberty. CoRR (abs/1005.5513) (2010). Web SearchBibTeXDownload |
| 2009 |
|---|
| 12 | Self-Improving Algorithms. Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri. CoRR (abs/0907.0884) (2009). Web SearchBibTeXDownload |
| 11 | Fast Dimension Reduction Using Rademacher Series on Dual BCH Codes. Nir Ailon, Edo Liberty. Discrete & Computational Geometry (42): 615-630 (2009). Web SearchBibTeXDownload |
| 10 | Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems. Nir Ailon, Edo Liberty. ICALP (1) 2009, 24-36. Web SearchBibTeXDownload |
| 2008 |
|---|
| 9 | Dense Fast Random Projections and Lean Walsh Transforms. Edo Liberty, Nir Ailon, Amit Singer. APPROX-RANDOM 2008, 512-522. Web SearchBibTeXDownload |
| 8 | Aggregating inconsistent information: Ranking and clustering. Nir Ailon, Moses Charikar, Alantha Newman. J. ACM (55) (2008). Web SearchBibTeXDownload |
| 7 | Theory research at Google. Gagan Aggarwal, Nir Ailon, Florin Constantin, Eyal Even-Dar, Jon Feldman, Gereon Frahling, Monika Rauch Henzinger, S. Muthukrishnan, Noam Nisan, Martin Pál, Mark Sandler, Anastasios Sidiropoulos. SIGACT News (39): 10-28 (2008). Cited by 3Web SearchBibTeXDownload |
| 6 | Fast dimension reduction using Rademacher series on dual BCH codes. Nir Ailon, Edo Liberty. SODA 2008, 1-9. Web SearchBibTeXDownload |
| 2007 |
|---|
| 5 | Fast Dimension Reduction Using Rademacher Series on Dual BCH Codes. Nir Ailon, Edo Liberty. Electronic Colloquium on Computational Complexity (ECCC) (14) (2007). Web SearchBibTeXDownload |
| 4 | Hardness of fully dense problems. Nir Ailon, Noga Alon. Inf. Comput. (205): 1117-1129 (2007). Web SearchBibTeXDownload |
| 2006 |
|---|
| 3 | On Clusters in Markov Chains. Nir Ailon, Steve Chien, Cynthia Dwork. LATIN 2006, 43-55. Web SearchBibTeXDownload |
| 2005 |
|---|
| 2 | Fitting tree metrics: Hierarchical clustering and Phylogeny. Nir Ailon, Moses Charikar. FOCS 2005, 73-82. Web SearchBibTeXDownload |
| 1 | Aggregating inconsistent information: ranking and clustering. Nir Ailon, Moses Charikar, Alantha Newman. STOC 2005, 684-693. Web SearchBibTeXDownload |
