2009 |
26 | EE | Nir Ailon:
A Simple Linear Ranking Algorithm Using Query Dependent Intercept Variables.
ECIR 2009: 685-690 |
2008 |
25 | EE | Edo Liberty,
Nir Ailon,
Amit Singer:
Dense Fast Random Projections and Lean Walsh Transforms.
APPROX-RANDOM 2008: 512-522 |
24 | EE | Nir Ailon,
Mehryar Mohri:
An Efficient Reduction of Ranking to Classification.
COLT 2008: 87-98 |
23 | EE | Nir Ailon:
Reconciling Real Scores with Binary Comparisons: A New Logistic Based Model for Ranking.
NIPS 2008: 25-32 |
22 | EE | Nir Ailon,
Edo Liberty:
Fast dimension reduction using Rademacher series on dual BCH codes.
SODA 2008: 1-9 |
21 | EE | Nir Ailon,
Bernard Chazelle,
Seshadhri Comandur,
Ding Liu:
Property-Preserving Data Reconstruction.
Algorithmica 51(2): 160-182 (2008) |
20 | EE | Nir Ailon:
A Simple Linear Ranking Algorithm Using Query Dependent Intercept Variables
CoRR abs/0810.2764: (2008) |
19 | EE | Nir Ailon,
Moses Charikar,
Alantha Newman:
Aggregating inconsistent information: Ranking and clustering.
J. ACM 55(5): (2008) |
18 | EE | 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:
Theory research at Google.
SIGACT News 39(2): 10-28 (2008) |
2007 |
17 | EE | Nir Ailon:
Aggregation of partial rankings, p-ratings and top-m lists.
SODA 2007: 415-424 |
16 | EE | Nir Ailon,
Mehryar Mohri:
An efficient reduction of ranking to classification
CoRR abs/0710.2889: (2007) |
15 | EE | Nir Ailon,
Edo Liberty:
Fast Dimension Reduction Using Rademacher Series on Dual BCH Codes.
Electronic Colloquium on Computational Complexity (ECCC) 14(070): (2007) |
14 | EE | Nir Ailon,
Noga Alon:
Hardness of fully dense problems.
Inf. Comput. 205(8): 1117-1129 (2007) |
13 | EE | Nir Ailon,
Bernard Chazelle,
Seshadhri Comandur,
Ding Liu:
Estimating the distance to a monotone function.
Random Struct. Algorithms 31(3): 371-383 (2007) |
2006 |
12 | EE | Nir Ailon,
Steve Chien,
Cynthia Dwork:
On Clusters in Markov Chains.
LATIN 2006: 43-55 |
11 | EE | Nir Ailon,
Bernard Chazelle,
Seshadhri Comandur,
Ding Liu:
Self-improving algorithms.
SODA 2006: 261-270 |
10 | EE | Nir Ailon,
Bernard Chazelle:
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform.
STOC 2006: 557-563 |
9 | EE | Nir Ailon,
Bernard Chazelle:
Information theory in property testing and monotonicity testing in higher dimension.
Inf. Comput. 204(11): 1704-1717 (2006) |
2005 |
8 | EE | Nir Ailon,
Moses Charikar:
Fitting tree metrics: Hierarchical clustering and Phylogeny.
FOCS 2005: 73-82 |
7 | EE | Nir Ailon,
Bernard Chazelle:
Information Theory in Property Testing and Monotonicity Testing in Higher Dimension.
STACS 2005: 434-447 |
6 | EE | Nir Ailon,
Moses Charikar,
Alantha Newman:
Aggregating inconsistent information: ranking and clustering.
STOC 2005: 684-693 |
5 | EE | Nir Ailon,
Bernard Chazelle:
Lower bounds for linear degeneracy testing.
J. ACM 52(2): 157-171 (2005) |
2004 |
4 | EE | Nir Ailon,
Bernard Chazelle,
Seshadhri Comandur,
Ding Liu:
Estimating the Distance to a Monotone Function.
APPROX-RANDOM 2004: 229-236 |
3 | EE | Nir Ailon,
Bernard Chazelle,
Seshadhri Comandur,
Ding Liu:
Property-Preserving Data Reconstruction.
ISAAC 2004: 16-27 |
2 | EE | Nir Ailon,
Bernard Chazelle:
Lower bounds for linear degeneracy testing.
STOC 2004: 554-560 |
1 | EE | Nir Ailon,
Bernard Chazelle:
Information Theory in Property Testing and Monotonicity Testing in Higher Dimension
Electronic Colloquium on Computational Complexity (ECCC)(068): (2004) |