The influence of variables on Boolean functions J Kahn, G Kalai, N Linial Institute for Mathematical Studies in the Social Sciences, 1989 | 875 | 1989 |
Every monotone graph property has a sharp threshold E Friedgut, G Kalai Proceedings of the American mathematical Society 124 (10), 2993-3002, 1996 | 476 | 1996 |
A counterexample to Borsuk’s conjecture J Kahn, G Kalai Bulletin of the American Mathematical Society 29 (1), 60-62, 1993 | 312 | 1993 |
Noise sensitivity of Boolean functions and applications to percolation I Benjamini, G Kalai, O Schramm Publications Mathématiques de l'Institut des Hautes Études Scientifiques 90 …, 1999 | 301 | 1999 |
A subexponential randomized simplex algorithm G Kalai Proceedings of the twenty-fourth annual ACM symposium on Theory of computing …, 1992 | 260 | 1992 |
Rationalizing choice functions by multiple rationales G Kalai, A Rubinstein, R Spiegler Econometrica 70 (6), 2481-2488, 2002 | 241 | 2002 |
Rigidity and the lower bound theorem 1 G Kalai Inventiones mathematicae 88 (1), 125-151, 1987 | 241 | 1987 |
A quasi-polynomial bound for the diameter of graphs of polyhedra G Kalai, DJ Kleitman arXiv preprint math/9204233, 1992 | 186 | 1992 |
Enumeration ofQ-acyclic simplicial complexes G Kalai Israel Journal of Mathematics 45, 337-351, 1983 | 177 | 1983 |
The influence of variables in product spaces J Bourgain, J Kahn, G Kalai, Y Katznelson, N Linial Israel Journal of Mathematics 77, 55-64, 1992 | 174 | 1992 |
First passage percolation has sublinear distance variance I Benjamini, G Kalai, O Schramm Selected Works of Oded Schramm, 779-787, 2011 | 159 | 2011 |
Algebraic shifting G Kalai Computational commutative algebra and combinatorics (Osaka, 1999) 33, 121-163, 2002 | 155 | 2002 |
A simple way to tell a simple polytope from its graph. G Kalai J. Comb. Theory, Ser. A 49 (2), 381-383, 1988 | 148 | 1988 |
Intersection patterns of convex sets G Kalai Israel Journal of Mathematics 48, 161-174, 1984 | 145 | 1984 |
A Fourier-theoretic perspective on the Condorcet paradox and Arrow's theorem G Kalai Advances in Applied Mathematics 29 (3), 412-426, 2002 | 135 | 2002 |
Elections can be manipulated often E Friedgut, G Kalai, N Nisan 2008 49th Annual IEEE symposium on foundations of computer science, 243-249, 2008 | 134 | 2008 |
Regular subgraphs of almost regular graphs N Alon, S Friedland, G Kalai Journal of Combinatorial Theory, Series B 37 (1), 79-91, 1984 | 130 | 1984 |
Boolean functions whose Fourier transform is concentrated on the first two levels E Friedgut, G Kalai, A Naor Advances in Applied Mathematics 29 (3), 427-437, 2002 | 129 | 2002 |
Linear programming, the simplex algorithm and simple polytopes G Kalai Mathematical Programming 79, 217-233, 1997 | 122 | 1997 |
Transversal numbers for hypergraphs arising in geometry N Alon, G Kalai, J Matoušek, R Meshulam Advances in Applied Mathematics 29 (1), 79-101, 2002 | 121 | 2002 |