Gil Kalai

According to our database1, Gil Kalai authored at least 55 papers between 1979 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
On symmetric intersecting families.
Eur. J. Comb., 2020

2019
The Argument against Quantum Computers.
CoRR, 2019

2018
Chvátal's conjecture and correlation inequalities.
J. Comb. Theory, Ser. A, 2018

Bidding games and efficient allocations.
Games Econ. Behav., 2018

Three Puzzles on Mathematics, Computation, and Games.
CoRR, 2018

2016
On the correlation of increasing families.
J. Comb. Theory, Ser. A, 2016

Bipartite minors.
J. Comb. Theory, Ser. B, 2016

2015
Sharp Thresholds for Monotone Non-Boolean Functions and Social Choice Theory.
Math. Oper. Res., 2015

Some old and new problems in combinatorial geometry I: Around Borsuk's problem.
CoRR, 2015

Some old and new problems in combinatorial geometry I: around Borsuk's problem.
Proceedings of the Surveys in Combinatorics 2015, 2015

2014
Gaussian Noise Sensitivity and BosonSampling.
CoRR, 2014

2013
General-sum Bidding Games.
CoRR, 2013

Functions without influential coalitions.
CoRR, 2013

The Cascade Auction - A Mechanism for Deterring Collusion in Auctions.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2011
A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three Alternatives.
SIAM J. Comput., 2011

How Quantum Computers Fail: Quantum Codes, Correlations in Physical Systems, and Noise Accumulation
CoRR, 2011

2008
Neighborly Embedded Manifolds.
Discret. Comput. Geom., 2008

Elections Can be Manipulated Often.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007
Thresholds and Expectation Thresholds.
Comb. Probab. Comput., 2007

2006
Intersections of Leray complexes and regularity of monomial ideals.
J. Comb. Theory, Ser. A, 2006

A law of large numbers for weighted majority.
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
Polytope Skeletons and Paths.
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

2003
Learnability and rationality of choice.
J. Econ. Theory, 2003

2002
A Fourier-theoretic perspective on the Condorcet paradox and Arrow's theorem.
Adv. Appl. Math., 2002

Boolean functions whose Fourier transform is concentrated on the first two levels.
Adv. Appl. Math., 2002

Transversal numbers for hypergraphs arising in geometry.
Adv. Appl. Math., 2002

2000
Three Theorems, with Computer-Aided Proofs, on Three-Dimensional Faces and Quotients of Polytopes.
Discret. Comput. Geom., 2000

Guest Editors' Foreword.
Discret. Comput. Geom., 2000

Fractional Helly theorem, weak epsilon nets and geometric piercing.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1997
Linear programming, the simplex algorithm and simple polytopes.
Math. Program., 1997

1995
On the distance distribution of codes.
IEEE Trans. Inf. Theory, 1995

Bounding the Piercing Number.
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
Upper Bounds for the Diameter and Height of Graphs of Convex Polyhedra.
Discret. Comput. Geom., 1992

A Subexponential Randomized Simplex Algorithm (Extended Abstract)
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
Symmetric matroids.
J. Comb. Theory, Ser. B, 1990

On low-dimensional faces that high-dimensional polytopes must have.
Comb., 1990

The Diameter of Graphs of Convex Polytopes and f-Vector Theory.
Proceedings of the Applied Geometry And Discrete Mathematics, 1990

Extended Euler-Poincare Relations for Cell Complexes.
Proceedings of the Applied Geometry And Discrete Mathematics, 1990

1989
The number of faces of centrally-symmetric polytopes.
Graphs Comb., 1989

1988
A simple way to tell a simple polytope from its graph.
J. Comb. Theory, Ser. A, 1988

A new basis of polytopes.
J. Comb. Theory, Ser. A, 1988

Many Triangulated Spheres.
Discret. Comput. Geom., 1988

The Influence of Variables on Boolean Functions (Extended Abstract)
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

1986
Characterization of f-vectors 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
A new approach to Turán's conjecture.
Graphs Comb., 1985

Hyperconnectivity of graphs.
Graphs Comb., 1985

A Simple Proof of the Upper Bound Theorem.
Eur. J. Comb., 1985

f-Vectors of acyclic complexes.
Discret. Math., 1985

1984
Every 4-regular graph plus an edge contains a 3-regular subgraph.
J. Comb. Theory, Ser. B, 1984

Regular subgraphs of almost regular graphs.
J. Comb. Theory, Ser. B, 1984

1979
A Note on an Evaluation of Abel Sums.
J. Comb. Theory, Ser. A, 1979


  Loading...