We stand with Ukraine

We stand with Ukraine

Gil Kalai

Orcid: 0000-0003-0982-1000

Affiliations:

Hebrew University, Jerusalem

According to our database¹, Gil Kalai authored at least 69 papers between 1979 and 2024.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of two.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

Online presence:

On csauthors.net:

Bibliography

2024

Influential Coalitions for Boolean Functions I: Constructions.

[BibT_eX]

[DOI]

,

,

Theory Comput., 2024

Random Circuit Sampling: Fourier Expansion and Statistics.

[BibT_eX]

[DOI]

,

,

CoRR, 2024

A Dense Model Theorem for the Boolean Slice.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023

The Success Probability in Levine's Hat Problem, and Independent Sets in Graphs.

[BibT_eX]

[DOI]

,

,

,

SIAM J. Discret. Math., December, 2023

Erdős-Szekeres Theorem for k-Flats.

[BibT_eX]

[DOI]

,

,

Discret. Comput. Geom., June, 2023

Questions and Concerns About Google's Quantum Supremacy Claim.

[BibT_eX]

[DOI]

,

,

CoRR, 2023

2022

Google's 2019 "Quantum Supremacy" Claims: Data, Documentation, and Discussion.

[BibT_eX]

[DOI]

,

,

CoRR, 2022

Conjecture C Still Stands.

[BibT_eX]

[DOI]

CoRR, 2022

Quantum Computers, Predictability, and Free Will.

[BibT_eX]

[DOI]

CoRR, 2022

2020

On symmetric intersecting families.

[BibT_eX]

[DOI]

,

,

Bhargav P. Narayanan

Eur. J. Comb., 2020

Intersection Patterns of Planar Sets.

[BibT_eX]

[DOI]

,

Zuzana Patáková

Discret. Comput. Geom., 2020

Guest Editors' Foreword.

[BibT_eX]

[DOI]

,

,

Discret. Comput. Geom., 2020

The Argument against Quantum Computers, the Quantum Laws of Nature, and Google's Supremacy Claims.

[BibT_eX]

[DOI]

CoRR, 2020

Statistical Aspects of the Quantum Supremacy Demonstration.

[BibT_eX]

[DOI]

,

,

CoRR, 2020

2019

The Argument against Quantum Computers.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Chvátal's conjecture and correlation inequalities.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Theory A, 2018

Bidding games and efficient allocations.

[BibT_eX]

[DOI]

,

,

Moshe Tennenholtz

Games Econ. Behav., 2018

Three Puzzles on Mathematics, Computation, and Games.

[BibT_eX]

[DOI]

CoRR, 2018

2016

On the correlation of increasing families.

[BibT_eX]

[DOI]

,

,

Elchanan Mossel

J. Comb. Theory A, 2016

Bipartite minors.

[BibT_eX]

[DOI]

Maria Chudnovsky

,

,

,

,

Paul D. Seymour

J. Comb. Theory B, 2016

2015

Sharp Thresholds for Monotone Non-Boolean Functions and Social Choice Theory.

[BibT_eX]

[DOI]

,

Elchanan Mossel

Math. Oper. Res., 2015

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

[BibT_eX]

[DOI]

CoRR, 2015

Some old and new problems in combinatorial geometry I: around Borsuk's problem.

[BibT_eX]

[DOI]

Proceedings of the Surveys in Combinatorics 2015, 2015

2014

Gaussian Noise Sensitivity and BosonSampling.

[BibT_eX]

[DOI]

,

CoRR, 2014

2013

General-sum Bidding Games.

[BibT_eX]

[DOI]

,

,

Moshe Tennenholtz

CoRR, 2013

Functions without influential coalitions.

[BibT_eX]

[DOI]

,

CoRR, 2013

The Cascade Auction - A Mechanism for Deterring Collusion in Auctions.

[BibT_eX]

[DOI]

,

,

Moshe Tennenholtz

Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2011

A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three Alternatives.

[BibT_eX]

[DOI]

,

,

,

SIAM J. Comput., 2011

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

[BibT_eX]

[DOI]

CoRR, 2011

2008

Neighborly Embedded Manifolds.

[BibT_eX]

[DOI]

,

Discret. Comput. Geom., 2008

Elections Can be Manipulated Often.

[BibT_eX]

[DOI]

,

,

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007

Thresholds and Expectation Thresholds.

[BibT_eX]

[DOI]

,

Comb. Probab. Comput., 2007

2006

Intersections of Leray complexes and regularity of monomial ideals.

[BibT_eX]

[DOI]

,

J. Comb. Theory A, 2006

A law of large numbers for weighted majority.

[BibT_eX]

[DOI]

Olle Häggström

,

,

Elchanan Mossel

Adv. Appl. Math., 2006

Threshold Phenomena and Influence: Perspectives from Mathematics, Computer Science, and Economics.

[BibT_eX]

,

Proceedings of the Computational Complexity and Statistical Physics., 2006

2004

Polytope Skeletons and Paths.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

2003

Learnability and rationality of choice.

[BibT_eX]

[DOI]

J. Econ. Theory, 2003

2002

A Fourier-theoretic perspective on the Condorcet paradox and Arrow's theorem.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2002

Boolean functions whose Fourier transform is concentrated on the first two levels.

[BibT_eX]

[DOI]

,

,

Adv. Appl. Math., 2002

Transversal numbers for hypergraphs arising in geometry.

[BibT_eX]

[DOI]

,

,

,

Adv. Appl. Math., 2002

2000

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

[BibT_eX]

[DOI]

Günter Meisinger

,

Peter Kleinschmidt

,

Discret. Comput. Geom., 2000

Guest Editors' Foreword.

[BibT_eX]

[DOI]

,

Discret. Comput. Geom., 2000

Fractional Helly theorem, weak epsilon nets and geometric piercing.

[BibT_eX]

[DOI]

Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1997

Linear programming, the simplex algorithm and simple polytopes.

[BibT_eX]

[DOI]

Math. Program., 1997

1995

On the distance distribution of codes.

[BibT_eX]

[DOI]

,

IEEE Trans. Inf. Theory, 1995

Bounding the Piercing Number.

[BibT_eX]

[DOI]

,

Discret. Comput. Geom., 1995

1994

Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling.

[BibT_eX]

[DOI]

,

,

,

Larry J. Stockmeyer

Theor. Comput. Sci., 1994

A Problem of Füredi and Seymour on Covering Intersecting Families by Pairs.

[BibT_eX]

,

J. Comb. Theory A, 1994

1992

Upper Bounds for the Diameter and Height of Graphs of Convex Polyhedra.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1992

A Subexponential Randomized Simplex Algorithm (Extended Abstract)

[BibT_eX]

[DOI]

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)

[BibT_eX]

[DOI]

,

,

,

Larry J. Stockmeyer

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1990

Symmetric matroids.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1990

On low-dimensional faces that high-dimensional polytopes must have.

[BibT_eX]

[DOI]

Comb., 1990

The Diameter of Graphs of Convex Polytopes and f-Vector Theory.

[BibT_eX]

[DOI]

Proceedings of the Applied Geometry And Discrete Mathematics, 1990

Extended Euler-Poincare Relations for Cell Complexes.

[BibT_eX]

[DOI]

Anders Björner

,

Proceedings of the Applied Geometry And Discrete Mathematics, 1990

1989

The number of faces of centrally-symmetric polytopes.

[BibT_eX]

[DOI]

Graphs Comb., 1989

1988

A simple way to tell a simple polytope from its graph.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1988

A new basis of polytopes.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1988

Many Triangulated Spheres.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1988

The Influence of Variables on Boolean Functions (Extended Abstract)

[BibT_eX]

[DOI]

,

,

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.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1986

1985

A new approach to Turán's conjecture.

[BibT_eX]

[DOI]

Graphs Comb., 1985

Hyperconnectivity of graphs.

[BibT_eX]

[DOI]

Graphs Comb., 1985

A Simple Proof of the Upper Bound Theorem.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 1985

f-Vectors of acyclic complexes.

[BibT_eX]

[DOI]

Discret. Math., 1985

1984

Every 4-regular graph plus an edge contains a 3-regular subgraph.

[BibT_eX]

[DOI]

,

Shmuel Friedland

,

J. Comb. Theory B, 1984

Regular subgraphs of almost regular graphs.

[BibT_eX]

[DOI]

,

Shmuel Friedland

,

J. Comb. Theory B, 1984

1983

בעיות קומבינטוריות בקמירות וקומבינטוריקה של קומפלכסים סימפליציאליים (Combinatorial problems in convexity and the combinatorics of simplicial complexes.).

[BibT_eX]

[DOI]

PhD thesis, 1983

1979

A Note on an Evaluation of Abel Sums.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1979

Loading...