Gil Kalai
According to our database^{1},
Gil Kalai
authored at least 59 papers
between 1979 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on zbmath.org

on twitter.com

on id.loc.gov

on dnb.info
On csauthors.net:
Bibliography
2020
Eur. J. Comb., 2020
Discret. Comput. Geom., 2020
Discret. Comput. Geom., 2020
The Argument against Quantum Computers, the Quantum Laws of Nature, and Google's Supremacy Claims.
CoRR, 2020
CoRR, 2020
2019
CoRR, 2019
2018
J. Comb. Theory, Ser. A, 2018
Games Econ. Behav., 2018
CoRR, 2018
2016
J. Comb. Theory, Ser. A, 2016
J. Comb. Theory, Ser. B, 2016
2015
Math. Oper. Res., 2015
CoRR, 2015
Proceedings of the Surveys in Combinatorics 2015, 2015
2014
CoRR, 2014
2013
CoRR, 2013
CoRR, 2013
Proceedings of the TwentySeventh AAAI Conference on Artificial Intelligence, 2013
2011
A Quantitative Version of the GibbardSatterthwaite Theorem for Three Alternatives.
SIAM J. Comput., 2011
How Quantum Computers Fail: Quantum Codes, Correlations in Physical Systems, and Noise Accumulation
CoRR, 2011
2008
Discret. Comput. Geom., 2008
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008
2007
Comb. Probab. Comput., 2007
2006
J. Comb. Theory, Ser. A, 2006
Adv. Appl. Math., 2006
Threshold Phenomena and Influence: Perspectives from Mathematics, Computer Science, and Economics.
Proceedings of the Computational Complexity and Statistical Physics., 2006
2004
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004
2003
J. Econ. Theory, 2003
2002
Adv. Appl. Math., 2002
Boolean functions whose Fourier transform is concentrated on the first two levels.
Adv. Appl. Math., 2002
Adv. Appl. Math., 2002
2000
Three Theorems, with ComputerAided Proofs, on ThreeDimensional Faces and Quotients of Polytopes.
Discret. Comput. Geom., 2000
Discret. Comput. Geom., 2000
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000
1997
Math. Program., 1997
1995
IEEE Trans. Inf. Theory, 1995
Discret. Comput. Geom., 1995
1994
Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling.
Theor. Comput. Sci., 1994
A Problem of Füredi and Seymour on Covering Intersecting Families by Pairs.
J. Comb. Theory, Ser. A, 1994
1992
Discret. Comput. Geom., 1992
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992
Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling (Extended Abstract)
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992
1990
J. Comb. Theory, Ser. B, 1990
Comb., 1990
Proceedings of the Applied Geometry And Discrete Mathematics, 1990
Proceedings of the Applied Geometry And Discrete Mathematics, 1990
1989
Graphs Comb., 1989
1988
J. Comb. Theory, Ser. A, 1988
J. Comb. Theory, Ser. A, 1988
Discret. Comput. Geom., 1988
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988
1986
Characterization of fvectors of families of convex sets in R<sup><i>d</i></sup> part II: Sufficiency of Eckhoff's conditions.
J. Comb. Theory, Ser. A, 1986
1985
Graphs Comb., 1985
Graphs Comb., 1985
Eur. J. Comb., 1985
Discret. Math., 1985
1984
J. Comb. Theory, Ser. B, 1984
J. Comb. Theory, Ser. B, 1984
1979
J. Comb. Theory, Ser. A, 1979