
Associate Professor Nir Ailon
- Contact information
- Homepage:
- http://nailon.googlepages.com/
- Email:
- nailon
cs.technion.ac.il
- Office:
- 607
- Phone:
- (972)-4-829-4842
- Office Hours:
- Tuesday, 14:30-15:30
- Research interests
- Algorithms for analysis of large datasets, Fast dimension reduction techniques, Combinatorial optimization algorithms, Clustering, Ranking, Social Choice and Machine Learning.
- Selected publications
Aggregation of Partial Rankings, {\it }-Ratings and Top-{\it } Lists.
Algorithmica, 57(2):284-300, 2010 [bibtex]
.
Faster dimension reduction.
Commun. ACM, 53(2):97-104, 2010 [bibtex]
.
Self-Improving Algorithms.
CoRR, abs/0907.0884, 2009 [bibtex]
.
Fast Dimension Reduction Using Rademacher Series on Dual BCH Codes.
Discrete {\&} Computational Geometry, 42(4):615-630, 2009 [bibtex]
.
Property-Preserving Data Reconstruction.
Algorithmica, 51(2):160-182, 2008 [bibtex]
.
Aggregating inconsistent information: Ranking and clustering.
J. ACM, 55(5), 2008 [bibtex]
.
An efficient reduction of ranking to classification.
CoRR, abs/0710.2889, 2007 [bibtex]
.
Hardness of fully dense problems.
Inf. Comput., 205(8):1117-1129, 2007 [bibtex]
.
Estimating the distance to a monotone function.
Random Struct. Algorithms, 31(3):371-383, 2007 [bibtex]
.
Information theory in property testing and monotonicity testing in higher dimension.
Inf. Comput., 204(11):1704-1717, 2006 [bibtex]
.
Lower bounds for linear degeneracy testing.
J. ACM, 52(2):157-171, 2005 [bibtex]
.
The Fast Johnson--Lindenstrauss Transform and Approximate Nearest Neighbors.
SIAM J. Comput., 39(1):302-322, 2009 [bibtex]
.
Fitting tree metrics: Hierarchical clustering and Phylogeny.
In FOCS, 73-82, 2005 [bibtex]
.
Correlation Clustering Revisited: The ``True`` Cost of Error Minimization Problems.
In ICALP, 24-36, 2009 [bibtex]
.
Dense Fast Random Projections and Lean Walsh Transforms.
In APPROX-RANDOM, 512-522, 2008 [bibtex]
.