Gil Kalai
#5,175
Most Influential Person Now
Israeli mathematician and computer scientist
Gil Kalai's AcademicInfluence.com Rankings
Gil Kalaicomputer-science Degrees
Computer Science
#475
World Rank
#493
Historical Rank
Theoretical Computer Science
#58
World Rank
#58
Historical Rank
Gil Kalaimathematics Degrees
Mathematics
#561
World Rank
#1072
Historical Rank
Combinatorics
#16
World Rank
#20
Historical Rank
Measure Theory
#2404
World Rank
#2875
Historical Rank
Download Badge
Computer Science Mathematics
Why Is Gil Kalai Influential?
(Suggest an Edit or Addition)According to Wikipedia, Gil Kalai is an Israeli mathematician and computer scientist. He is the Henry and Manya Noskwith Professor Emeritus of Mathematics at the Hebrew University of Jerusalem, Israel, Professor of Computer Science at the Interdisciplinary Center, Herzliya, and adjunct Professor of mathematics and of computer science at Yale University, United States.
Gil Kalai's Published Works
Published Works
- The influence of variables on Boolean functions (1988) (687)
- Every monotone graph property has a sharp threshold (1996) (398)
- Noise sensitivity of Boolean functions and applications to percolation (1998) (263)
- A counterexample to Borsuk's conjecture (1993) (212)
- Rigidity and the lower bound theorem 1 (1987) (208)
- Rationalizing choice functions by multiple rationales (2002) (189)
- A quasi-polynomial bound for the diameter of graphs of polyhedra (1992) (163)
- First Passage Percolation Has Sublinear Distance Variance (2002) (155)
- The influence of variables in product spaces (1992) (145)
- Enumeration ofQ-acyclic simplicial complexes (1983) (143)
- A subexponential randomized simplex algorithm (extended abstract) (1992) (140)
- A Fourier-theoretic perspective on the Condorcet paradox and Arrow's theorem (2002) (133)
- Elections Can be Manipulated Often (2008) (125)
- Boolean functions whose Fourier transform is concentrated on the first two levels (2002) (117)
- Regular subgraphs of almost regular graphs (1984) (114)
- A simple way to tell a simple polytope from its graph (1988) (113)
- Transversal numbers for hypergraphs arising in geometry (2002) (105)
- Many triangulated spheres (1988) (98)
- An extended Euler-Poincaré theorem (1988) (94)
- Shadows of colored complexes. (1988) (86)
- The Influence of Variables on Boolean Functions (Extended Abstract) (1988) (83)
- A topological colorful Helly theorem (2005) (82)
- The Diameter of Graphs of Convex Polytopes and f-Vector Theory (1990) (80)
- Influences of Variables and Threshold Intervals under Group Symmetries (1997) (74)
- Polytopes : combinatorics and computation (2000) (74)
- A new basis of polytopes (1988) (67)
- Thresholds and Expectation Thresholds (2006) (66)
- Intersections of Leray complexes and regularity of monomial ideals (2006) (61)
- Characterization off-vectors of families of convex sets inRd Part I: Necessity of Eckhoff’s conditions (1984) (61)
- Intersection patterns of convex sets (1984) (57)
- Threshold Phenomena and Influence (2005) (54)
- On the distance distribution of codes (1995) (54)
- Bounding the piercing number (1995) (50)
- Some Aspects of the Combinatorial Theory of Convex Polytopes (1994) (47)
- Polytope Skeletons and Paths (2004) (46)
- A Simple Proof of the Upper Bound Theorem (1985) (46)
- Gaussian Noise Sensitivity and BosonSampling (2014) (42)
- Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling (1992) (42)
- On f‐Vectors and Homology a (1989) (42)
- A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three Alternatives (2011) (40)
- Upper bounds for the diameter and height of graphs of convex polyhedra (1992) (40)
- Weakly Saturated Graphs are Rigid (1984) (39)
- Learnability and rationality of choice (2003) (39)
- Solving the Bible Code Puzzle (1999) (39)
- Hyperconnectivity of graphs (1985) (39)
- Linear programming, the simplex algorithm and simple polytopes (1997) (37)
- Leray numbers of projections and a topological Helly‐type theorem (2007) (36)
- The number of faces of centrally-symmetric polytopes (1989) (36)
- Noise sensitivity and chaos in social choice theory (2005) (34)
- Characterization of f-vectors of families of convex sets in Rd part II: Sufficiency of Eckhoff's conditions (1986) (33)
- Guarding galleries where every point sees a large area (1997) (32)
- Every 4-regular graph plus an edge contains a 3-regular subgraph (1984) (29)
- Threshold Phenomena and Influence, with Some Perspectives from Mathematics, Computer Science, and Economics (2005) (28)
- On low-dimensional faces that high-dimensional polytopes must have (1990) (26)
- Threshold Phenomena and Influence: Perspectives from Mathematics, Computer Science, and Economics (2006) (26)
- The Quantum Computer Puzzle (2016) (22)
- Combinatorics with a Geometric Flavor (2000) (21)
- How Quantum Computers Fail: Quantum Codes, Correlations in Physical Systems, and Noise Accumulation (2011) (21)
- A law of large numbers for weighted majority (2004) (19)
- Asymptotic stability and other properties of trajectories and transfer sequences leading to the bargaining sets (1975) (19)
- Notes and comments: Rationalizing choice functions by multiple rationales (2002) (19)
- Quantum Computers: Noise Propagation and Adversarial Noise Models (2009) (18)
- The Argument against Quantum Computers (2019) (18)
- Symmetric matroids (1990) (16)
- Jerusalem Combinatorics ’93 (1994) (15)
- Bidding Games and Efficient Allocations (2013) (14)
- Bipartite Rigidity (2013) (14)
- Some old and new problems in combinatorial geometry I: around Borsuk's problem (2015) (14)
- The Quantum Computer Puzzle (Expanded Version) (2016) (13)
- Statistical Aspects of the Quantum Supremacy Demonstration (2020) (13)
- f-Vectors of acyclic complexes (1985) (13)
- Extended Euler-Poincare Relations for Cell Complexes (1990) (12)
- The Argument against Quantum Computers, the Quantum Laws of Nature, and Google's Supremacy Claims (2020) (12)
- Neighborly Embedded Manifolds (2008) (11)
- On symmetric intersecting families (2017) (11)
- How Quantum Computers Can Fail (2006) (10)
- Combinatorics and Convexity (1995) (10)
- Helly-type problems (2021) (10)
- On the correlation of increasing families (2015) (10)
- Three Puzzles on Mathematics, Computation, and Games (2018) (9)
- A new approach to Turán's conjecture (1985) (8)
- A Problem of Füredi and Seymour on Covering Intersecting Families by Pairs (1994) (7)
- A Tverberg type theorem for matroids (2016) (7)
- Chvátal's conjecture and correlation inequalities (2016) (6)
- Detrimental Decoherence (2008) (6)
- Boolean Functions : Influence , threshold and noise (2017) (6)
- The n-Category Café (2018) (6)
- Combinatorial Expectations from Commutative Algebra (2010) (6)
- Bipartite minors (2013) (5)
- NOTES AND COMMENTS: SOCIAL INDETERMINACY (2004) (5)
- Social Choice and Threshold Phenomena (2001) (5)
- Threshold Intervals under Group Symmetries (1998) (5)
- Unions and Intersections of Leray Complexes ∗ (2005) (5)
- INFLUENCES OF VARIABLES AND THRESHOLDINTERVALS UNDER GROUP (4)
- Thoughts on Noise and Quantum Computation (2005) (4)
- Hypercube embedding of distances with few values (1994) (4)
- Sharp Thresholds for Monotone Non-Boolean Functions and Social Choice Theory (2010) (4)
- Contagious error sources would need time travel to prevent quantum computation (2014) (4)
- Flag Numbers and FLAGTOOL (2000) (4)
- Problems for Imre Bárány ’ s Birthday (2017) (3)
- Three Theorems, with Computer-Aided Proofs, on Three-Dimensional Faces and Quotients of Polytopes (2000) (3)
- The Work of June Huh (2022) (3)
- Influential coalitions for Boolean Functions (2014) (3)
- Social Choice without Rationality (2002) (3)
- Intersection Patterns of Planar Sets (2019) (2)
- Quasi-random multilinear polynomials (2018) (2)
- Geometric, Algebraic, and Topological Combinatorics (2020) (2)
- Geometric and Algebraic Combinatorics (2015) (2)
- Around two theorems and a lemma by Lucio Russo (2018) (2)
- Periodic Boundary Conditions for Periodic Jacobi Matrices on Trees (2020) (2)
- Threshold Phenomena and Influences (2005) (2)
- The Cascade Auction - A Mechanism for Deterring Collusion in Auctions (2013) (2)
- Google's 2019 "Quantum Supremacy" Claims: Data, Documentation, and Discussion (2022) (2)
- The success probability in Lionel Levine's hat problem is strictly decreasing with the number of players, and this is related to interesting questions regarding Hamming powers of Kneser graphs and independent sets in random subgraphs (2021) (1)
- When Noise Accumulates (2011) (1)
- Elections Can be Manipulated Often Extended Abstract (2008) (1)
- Jerusalem Combinatorics '93 : an International Conference in Combinatorics, May 9-17, 1993, Jerusalem, Israel (1994) (1)
- How Can Quantum Computers Fail ? (2008) (1)
- Geometric and Topological Combinatorics (2007) (1)
- The work of Daniel A. Spielman (2011) (1)
- A Note on an Evaluation of Abel Sums (1979) (1)
- Google's Quantum Supremacy Claim: Data, Documentation, and Discussion (2022) (1)
- בעיות קומבינטוריות בקמירות וקומבינטוריקה של קומפלכסים סימפליציאליים (Combinatorial problems in convexity and the combinatorics of simplicial complexes.) (1983) (1)
- Erdős–Szekeres Theorem for k-Flats (2022) (1)
- Analogues for Sperner and Erdös-Ko-Rado Theorems For Subspaces of Linear Spaces (1980) (1)
- Topological and Geometric Combinatorics (2011) (1)
- NOT EVEN WRONG: The Blog of Peter Woit (2018) (0)
- FKN, first proof, rewritten (2021) (0)
- Concerns About Recent Claims of a Huge Quantum Computational Advantage via Gaussian Boson Sampling ∗ (2021) (0)
- Is the Universe Noise-Sensitive? (2007) (0)
- Science, Beliefs and Knowledge: A Personal Reflection on Robert J. Aumann’s Approach (2006) (0)
- RELATIVE LERAY NUMBERS VIA SPECTRAL SEQUENCES (2020) (0)
- Fourier Analysis of Boolean functions and Discrete Isoperimetry (2004) (0)
- C O ] 1 D ec 2 01 3 BIPARTITE MINORS (0)
- Erd\H{o}s-Szekeres theorem for $k$-flats (2021) (0)
- Conjecture C Still Stands (2022) (0)
- Efficient Allocation via Sequential Scrip Auctions (2013) (0)
- An extended Euler-Poincar 6 theorem (2006) (0)
- The success probability in Levine's hat problem, and independent sets in graphs (2022) (0)
- Economics and Common Sense a Review of Steven E. Landsburg's Book More Sex Is Safer Sex, the Unconventional Wisdom of Economics הרציונליות לחקר מרכז Center for the Study of Rationality (2008) (0)
- General-sum Bidding Games (2013) (0)
- Quantum Computers - How Can They Fail? (2006) (0)
- ICM 2018 Lecture Sampler (2018) (0)
- Transversal Numbers for Hypergraphs Arising inGeometryNoga (2001) (0)
- Gina Says: Adventures In The Blogosphere String War (2017) (0)
- Functions without influential coalitions (2013) (0)
- Interview with Gil Kalai Toufik Mansour (2021) (0)
- A Multiperversity Generalization of Intersection Homology (2007) (0)
- Voting rules and threshold phenomena (2003) (0)
- Fractional Helly theorem, weak epsilon nets and geometric piercing (2000) (0)
- Questions and Concerns About Google's Quantum Supremacy Claim (2023) (0)
- Guest Editors’ Foreword (2020) (0)
- Turán, involution and shifting (2018) (0)
- 17 POLYTOPE SKELETONS AND PATHSGil (0)
- Guest Editors' Foreword (2000) (0)
- Asymptotia and Lee Smolin’s “The Trouble with Physics” (2018) (0)
- Guest Editors’ Foreword (2020) (0)
- Intersection Patterns of Planar Sets (2020) (0)
- We need the following result of Frankl and Wilson (2010) (0)
- Economics and Common Sense (2008) (0)
- 19 POLYTOPE SKELETONS AND PATHS (2016) (0)
- Quantum Computers, Predictability, and Free Will (2022) (0)
- Elections Can be Manipulated Often Draft – Comments Welcome (2007) (0)
- Universal sequences of lines in $\mathbb R^d$ (2021) (0)
- Quasi-random multilinear polynomials (2019) (0)
- Implementing Social Choice Correspondences using k-Strong Nash Equilibrium zizxag dxiga zen ` zd yenin wfg (2009) (0)
- Attempting perfect hypergraphs (2021) (0)
This paper list is powered by the following services:
Other Resources About Gil Kalai
What Schools Are Affiliated With Gil Kalai?
Gil Kalai is affiliated with the following schools: