Skip to main menu (access key '1') Skip to content (access key 's') Skip to contact info (access key '2') Skip to phone directory (access key '3') Skip to site map (access key '4') Skip to accessibility information (access key '0')
You are here: › › ›
Photo of Associate Professor Nir Ailon

Associate Professor Nir Ailon

Contact information
Homepage:
http://nailon.googlepages.com/
Email:
nailoncs.technion.ac.il
Office:
607
Phone:
(972)-4-829-4842
Office Hours:
Wednesday, 13:30-14: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
  • Nir Ailon.
    Aggregation of Partial Rankings, {\it }-Ratings and Top-{\it } Lists.
    Algorithmica, 57(2):284-300, 2010 [bibtex]
  • Nir Ailon and Bernard Chazelle.
    Faster dimension reduction.
    Commun. ACM, 53(2):97-104, 2010 [bibtex]
  • Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer and C. Seshadhri.
    Self-Improving Algorithms.
    CoRR, abs/0907.0884, 2009 [bibtex]
  • Nir Ailon and Edo Liberty.
    Fast Dimension Reduction Using Rademacher Series on Dual BCH Codes.
    Discrete {\&} Computational Geometry, 42(4):615-630, 2009 [bibtex]
  • Nir Ailon, Bernard Chazelle, Seshadhri Comandur and Ding Liu.
    Property-Preserving Data Reconstruction.
    Algorithmica, 51(2):160-182, 2008 [bibtex]
  • Nir Ailon, Moses Charikar and Alantha Newman.
    Aggregating inconsistent information: Ranking and clustering.
    J. ACM, 55(5), 2008 [bibtex]
  • Nir Ailon and Mehryar Mohri.
    An efficient reduction of ranking to classification.
    CoRR, abs/0710.2889, 2007 [bibtex]
  • Nir Ailon and Noga Alon.
    Hardness of fully dense problems.
    Inf. Comput., 205(8):1117-1129, 2007 [bibtex]
  • Nir Ailon, Bernard Chazelle, Seshadhri Comandur and Ding Liu.
    Estimating the distance to a monotone function.
    Random Struct. Algorithms, 31(3):371-383, 2007 [bibtex]
  • Nir Ailon and Bernard Chazelle.
    Information theory in property testing and monotonicity testing in higher dimension.
    Inf. Comput., 204(11):1704-1717, 2006 [bibtex]
  • Nir Ailon and Bernard Chazelle.
    Lower bounds for linear degeneracy testing.
    J. ACM, 52(2):157-171, 2005 [bibtex]
  • Nir Ailon and Bernard Chazelle.
    The Fast Johnson--Lindenstrauss Transform and Approximate Nearest Neighbors.
    SIAM J. Comput., 39(1):302-322, 2009 [bibtex]
  • Nir Ailon and Moses Charikar.
    Fitting tree metrics: Hierarchical clustering and Phylogeny.
    In FOCS, 73-82, 2005 [bibtex]
  • Nir Ailon and Edo Liberty.
    Correlation Clustering Revisited: The ``True`` Cost of Error Minimization Problems.
    In ICALP, 24-36, 2009 [bibtex]
  • Edo Liberty, Nir Ailon and Amit Singer.
    Dense Fast Random Projections and Lean Walsh Transforms.
    In APPROX-RANDOM, 512-522, 2008 [bibtex]