Search the dblp DataBase
Nir Ailon :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Nir Ailon , Bernard Chazelle , Seshadhri Comandur , Ding Liu Estimating the Distance to a Monotone Function. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:229-236 [Conf ] Nir Ailon , Moses Charikar Fitting tree metrics: Hierarchical clustering and Phylogeny. [Citation Graph (0, 0)][DBLP ] FOCS, 2005, pp:73-82 [Conf ] Nir Ailon , Bernard Chazelle , Seshadhri Comandur , Ding Liu Property-Preserving Data Reconstruction. [Citation Graph (0, 0)][DBLP ] ISAAC, 2004, pp:16-27 [Conf ] Nir Ailon , Steve Chien , Cynthia Dwork On Clusters in Markov Chains. [Citation Graph (0, 0)][DBLP ] LATIN, 2006, pp:43-55 [Conf ] Nir Ailon , Bernard Chazelle , Seshadhri Comandur , Ding Liu Self-improving algorithms. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:261-270 [Conf ] Nir Ailon , Bernard Chazelle Information Theory in Property Testing and Monotonicity Testing in Higher Dimension. [Citation Graph (0, 0)][DBLP ] STACS, 2005, pp:434-447 [Conf ] Nir Ailon , Bernard Chazelle Lower bounds for linear degeneracy testing. [Citation Graph (0, 0)][DBLP ] STOC, 2004, pp:554-560 [Conf ] Nir Ailon , Bernard Chazelle Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:557-563 [Conf ] Nir Ailon , Moses Charikar , Alantha Newman Aggregating inconsistent information: ranking and clustering. [Citation Graph (0, 0)][DBLP ] STOC, 2005, pp:684-693 [Conf ] Nir Ailon , Bernard Chazelle Information Theory in Property Testing and Monotonicity Testing in Higher Dimension [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:068, pp:- [Journal ] Nir Ailon , Bernard Chazelle Information theory in property testing and monotonicity testing in higher dimension. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2006, v:204, n:11, pp:1704-1717 [Journal ] Nir Ailon , Bernard Chazelle Lower bounds for linear degeneracy testing. [Citation Graph (0, 0)][DBLP ] J. ACM, 2005, v:52, n:2, pp:157-171 [Journal ] Nir Ailon Aggregation of partial rankings, p -ratings and top-m lists. [Citation Graph (0, 0)][DBLP ] SODA, 2007, pp:415-424 [Conf ] Nir Ailon , Mehryar Mohri An efficient reduction of ranking to classification [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] Nir Ailon , Noga Alon Hardness of fully dense problems. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2007, v:205, n:8, pp:1117-1129 [Journal ] Dense Fast Random Projections and Lean Walsh Transforms. [Citation Graph (, )][DBLP ] An Efficient Reduction of Ranking to Classification. [Citation Graph (, )][DBLP ] A Simple Linear Ranking Algorithm Using Query Dependent Intercept Variables. [Citation Graph (, )][DBLP ] Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems. [Citation Graph (, )][DBLP ] Reconciling Real Scores with Binary Comparisons: A New Logistic Based Model for Ranking. [Citation Graph (, )][DBLP ] Fast dimension reduction using Rademacher series on dual BCH codes. [Citation Graph (, )][DBLP ] Property-Preserving Data Reconstruction. [Citation Graph (, )][DBLP ] Aggregation of Partial Rankings, p -Ratings and Top-m Lists. [Citation Graph (, )][DBLP ] Faster dimension reduction. [Citation Graph (, )][DBLP ] A Simple Linear Ranking Algorithm Using Query Dependent Intercept Variables [Citation Graph (, )][DBLP ] Self-Improving Algorithms [Citation Graph (, )][DBLP ] Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform [Citation Graph (, )][DBLP ] Fast Dimension Reduction Using Rademacher Series on Dual BCH Codes. [Citation Graph (, )][DBLP ] Fast Dimension Reduction Using Rademacher Series on Dual BCH Codes. [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.003secs