default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGil Kalai
Person information
- affiliation: Hebrew University, Jerusalem
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i15]Gil Kalai, Yosef Rinott, Tomer Shoham:
Random Circuit Sampling: Fourier Expansion and Statistics. CoRR abs/2404.00935 (2024)- 2023
- [j41]Imre Bárány, Gil Kalai, Attila Pór
:
Erdős-Szekeres Theorem for k-Flats. Discret. Comput. Geom. 69(4): 1232-1240 (2023) - [j40]Noga Alon, Ehud Friedgut, Gil Kalai, Guy Kindler:
The Success Probability in Levine's Hat Problem, and Independent Sets in Graphs. SIAM J. Discret. Math. 37(4): 2717-2729 (2023) - [i14]Gil Kalai, Yosef Rinott, Tomer Shoham:
Questions and Concerns About Google's Quantum Supremacy Claim. CoRR abs/2305.01064 (2023) - 2022
- [i13]Gil Kalai:
Quantum Computers, Predictability, and Free Will. CoRR abs/2204.02768 (2022) - [i12]Gil Kalai:
Conjecture C Still Stands. CoRR abs/2209.01648 (2022) - [i11]Gil Kalai, Yosef Rinott, Tomer Shoham:
Google's 2019 "Quantum Supremacy" Claims: Data, Documentation, and Discussion. CoRR abs/2210.12753 (2022) - 2020
- [j39]Gil Kalai, Bojan Mohar, Isabella Novik:
Guest Editors' Foreword. Discret. Comput. Geom. 64(2): 229-232 (2020) - [j38]Gil Kalai, Zuzana Patáková:
Intersection Patterns of Planar Sets. Discret. Comput. Geom. 64(2): 304-323 (2020) - [j37]David Ellis, Gil Kalai, Bhargav P. Narayanan:
On symmetric intersecting families. Eur. J. Comb. 86: 103094 (2020) - [i10]Yosef Rinott, Tomer Shoham, Gil Kalai:
Statistical Aspects of the Quantum Supremacy Demonstration. CoRR abs/2008.05177 (2020) - [i9]Gil Kalai:
The Argument against Quantum Computers, the Quantum Laws of Nature, and Google's Supremacy Claims. CoRR abs/2008.05188 (2020)
2010 – 2019
- 2019
- [i8]Gil Kalai:
The Argument against Quantum Computers. CoRR abs/1908.02499 (2019) - 2018
- [j36]Reshef Meir, Gil Kalai, Moshe Tennenholtz:
Bidding games and efficient allocations. Games Econ. Behav. 112: 166-193 (2018) - [j35]Ehud Friedgut, Jeff Kahn, Gil Kalai, Nathan Keller:
Chvátal's conjecture and correlation inequalities. J. Comb. Theory A 156: 22-43 (2018) - [i7]Gil Kalai:
Three Puzzles on Mathematics, Computation, and Games. CoRR abs/1801.02602 (2018) - 2016
- [j34]Maria Chudnovsky, Gil Kalai, Eran Nevo, Isabella Novik, Paul D. Seymour:
Bipartite minors. J. Comb. Theory B 116: 219-228 (2016) - [j33]Gil Kalai, Nathan Keller, Elchanan Mossel:
On the correlation of increasing families. J. Comb. Theory A 144: 250-276 (2016) - 2015
- [j32]Gil Kalai, Elchanan Mossel:
Sharp Thresholds for Monotone Non-Boolean Functions and Social Choice Theory. Math. Oper. Res. 40(4): 915-925 (2015) - [c9]Gil Kalai, Reshef Meir, Moshe Tennenholtz:
Bidding Games and Efficient Allocations. EC 2015: 113-130 - [p2]Gil Kalai:
Some old and new problems in combinatorial geometry I: around Borsuk's problem. Surveys in Combinatorics 2015: 147-174 - [i6]Gil Kalai:
Some old and new problems in combinatorial geometry I: Around Borsuk's problem. CoRR abs/1505.04952 (2015) - 2014
- [i5]Gil Kalai, Guy Kindler:
Gaussian Noise Sensitivity and BosonSampling. CoRR abs/1409.3093 (2014) - 2013
- [c8]Uriel Feige, Gil Kalai, Moshe Tennenholtz:
The Cascade Auction - A Mechanism for Deterring Collusion in Auctions. AAAI 2013: 313-319 - [i4]Jeff Kahn, Gil Kalai:
Functions without influential coalitions. CoRR abs/1308.2794 (2013) - [i3]Gil Kalai, Reshef Meir, Moshe Tennenholtz:
General-sum Bidding Games. CoRR abs/1311.0913 (2013) - 2011
- [j31]Ehud Friedgut, Gil Kalai, Nathan Keller, Noam Nisan:
A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three Alternatives. SIAM J. Comput. 40(3): 934-952 (2011) - [i2]Ehud Friedgut, Gil Kalai, Nathan Keller, Noam Nisan:
A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three Alternatives. CoRR abs/1105.5129 (2011) - [i1]Gil Kalai:
How Quantum Computers Fail: Quantum Codes, Correlations in Physical Systems, and Noise Accumulation. CoRR abs/1106.0485 (2011)
2000 – 2009
- 2008
- [j30]Gil Kalai, Avi Wigderson:
Neighborly Embedded Manifolds. Discret. Comput. Geom. 40(3): 319-324 (2008) - [c7]Ehud Friedgut, Gil Kalai, Noam Nisan:
Elections Can be Manipulated Often. FOCS 2008: 243-249 - 2007
- [j29]Jeff Kahn, Gil Kalai:
Thresholds and Expectation Thresholds. Comb. Probab. Comput. 16(3): 495-502 (2007) - 2006
- [j28]Olle Häggström, Gil Kalai, Elchanan Mossel:
A law of large numbers for weighted majority. Adv. Appl. Math. 37(1): 112-123 (2006) - [j27]Gil Kalai, Roy Meshulam:
Intersections of Leray complexes and regularity of monomial ideals. J. Comb. Theory A 113(7): 1586-1592 (2006) - [p1]Gil Kalai, Shmuel Safra:
Threshold Phenomena and Influence: Perspectives from Mathematics, Computer Science, and Economics. Computational Complexity and Statistical Physics 2006: 25-62 - 2004
- [r1]Gil Kalai:
Polytope Skeletons and Paths. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 455-476 - 2003
- [j26]Gil Kalai:
Learnability and rationality of choice. J. Econ. Theory 113(1): 104-117 (2003) - 2002
- [j25]Noga Alon, Gil Kalai, Jirí Matousek, Roy Meshulam:
Transversal numbers for hypergraphs arising in geometry. Adv. Appl. Math. 29(1): 79-101 (2002) - [j24]Gil Kalai:
A Fourier-theoretic perspective on the Condorcet paradox and Arrow's theorem. Adv. Appl. Math. 29(3): 412-426 (2002) - [j23]Ehud Friedgut, Gil Kalai, Assaf Naor:
Boolean functions whose Fourier transform is concentrated on the first two levels. Adv. Appl. Math. 29(3): 427-437 (2002) - 2000
- [j22]Gil Kalai, Victor Klee:
Guest Editors' Foreword. Discret. Comput. Geom. 24(2-3): 149-150 (2000) - [j21]Günter Meisinger, Peter Kleinschmidt, Gil Kalai:
Three Theorems, with Computer-Aided Proofs, on Three-Dimensional Faces and Quotients of Polytopes. Discret. Comput. Geom. 24(2-3): 413-420 (2000) - [c6]Gil Kalai:
Fractional Helly theorem, weak epsilon nets and geometric piercing. CCCG 2000
1990 – 1999
- 1997
- [j20]Gil Kalai:
Linear programming, the simplex algorithm and simple polytopes. Math. Program. 79: 217-233 (1997) - 1995
- [j19]Noga Alon, Gil Kalai:
Bounding the Piercing Number. Discret. Comput. Geom. 13: 245-256 (1995) - [j18]Gil Kalai, Nathan Linial:
On the distance distribution of codes. IEEE Trans. Inf. Theory 41(5): 1467-1472 (1995) - 1994
- [j17]Jeff Kahn, Gil Kalai:
A Problem of Füredi and Seymour on Covering Intersecting Families by Pairs. J. Comb. Theory A 68(2): 317-339 (1994) - [j16]Noga Alon, Gil Kalai, Moty Ricklin, Larry J. Stockmeyer:
Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling. Theor. Comput. Sci. 130(1): 175-201 (1994) - 1992
- [j15]Gil Kalai:
Upper Bounds for the Diameter and Height of Graphs of Convex Polyhedra. Discret. Comput. Geom. 8: 363-372 (1992) - [c5]Noga Alon, Gil Kalai, Moty Ricklin, Larry J. Stockmeyer:
Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling (Extended Abstract). FOCS 1992: 334-343 - [c4]Gil Kalai:
A Subexponential Randomized Simplex Algorithm (Extended Abstract). STOC 1992: 475-482 - 1990
- [j14]Gil Kalai:
On low-dimensional faces that high-dimensional polytopes must have. Comb. 10(3): 271-280 (1990) - [j13]Gil Kalai:
Symmetric matroids. J. Comb. Theory B 50(1): 54-64 (1990) - [c3]Anders Björner, Gil Kalai:
Extended Euler-Poincare Relations for Cell Complexes. Applied Geometry And Discrete Mathematics 1990: 81-90 - [c2]Gil Kalai:
The Diameter of Graphs of Convex Polytopes and f-Vector Theory. Applied Geometry And Discrete Mathematics 1990: 387-412
1980 – 1989
- 1989
- [j12]Gil Kalai:
The number of faces of centrally-symmetric polytopes. Graphs Comb. 5(1): 389-391 (1989) - 1988
- [j11]Gil Kalai:
Many Triangulated Spheres. Discret. Comput. Geom. 3: 1-14 (1988) - [j10]Gil Kalai:
A new basis of polytopes. J. Comb. Theory A 49(2): 191-209 (1988) - [j9]Gil Kalai:
A simple way to tell a simple polytope from its graph. J. Comb. Theory A 49(2): 381-383 (1988) - [c1]Jeff Kahn, Gil Kalai, Nathan Linial:
The Influence of Variables on Boolean Functions (Extended Abstract). FOCS 1988: 68-80 - 1986
- [j8]Gil Kalai:
Characterization of f-vectors of families of convex sets in Rd part II: Sufficiency of Eckhoff's conditions. J. Comb. Theory A 41(2): 167-188 (1986) - 1985
- [j7]Gil Kalai:
f-Vectors of acyclic complexes. Discret. Math. 55(1): 97-99 (1985) - [j6]Noga Alon, Gil Kalai:
A Simple Proof of the Upper Bound Theorem. Eur. J. Comb. 6(3): 211-214 (1985) - [j5]Gil Kalai:
Hyperconnectivity of graphs. Graphs Comb. 1(1): 65-79 (1985) - [j4]Gil Kalai:
A new approach to Turán's conjecture. Graphs Comb. 1(1): 107-109 (1985) - 1984
- [j3]Noga Alon, Shmuel Friedland, Gil Kalai:
Regular subgraphs of almost regular graphs. J. Comb. Theory B 37(1): 79-91 (1984) - [j2]Noga Alon, Shmuel Friedland, Gil Kalai:
Every 4-regular graph plus an edge contains a 3-regular subgraph. J. Comb. Theory B 37(1): 92-93 (1984) - 1983
- [b1]Gil Kalai:
בעיות קומבינטוריות בקמירות וקומבינטוריקה של קומפלכסים סימפליציאליים (Combinatorial problems in convexity and the combinatorics of simplicial complexes.). Hebrew University of Jerusalem, Israel, 1983
1970 – 1979
- 1979
- [j1]Gil Kalai:
A Note on an Evaluation of Abel Sums. J. Comb. Theory A 27(2): 213-217 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
