Gil Kalai - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 52 from 52

2023

The Success Probability in Levine's Hat Problem, and Independent Sets in GraphsNoga Alon, Ehud Friedgut, Gil Kalai, Guy Kindler. siamdm, 37(4):2717-2729, December 2023. [doi]

Erdős-Szekeres Theorem for k-FlatsImre Bárány, Gil Kalai, Attila Pór. dcg, 69(4):1232-1240, June 2023. [doi]

2020

On symmetric intersecting familiesDavid Ellis, Gil Kalai, Bhargav Narayanan. ejc, 86:103094, 2020. [doi]

Intersection Patterns of Planar SetsGil Kalai, Zuzana Patáková. dcg, 64(2):304-323, 2020. [doi]

Guest Editors' ForewordGil Kalai, Bojan Mohar, Isabella Novik. dcg, 64(2):229-232, 2020. [doi]

2018

Chvátal's conjecture and correlation inequalitiesEhud Friedgut, Jeff Kahn, Gil Kalai, Nathan Keller. JCT, 156:22-43, 2018. [doi]

Bidding games and efficient allocationsReshef Meir, Gil Kalai, Moshe Tennenholtz. geb, 112:166-193, 2018. [doi]

2016

Bipartite minorsMaria Chudnovsky, Gil Kalai, Eran Nevo, Isabella Novik, Paul D. Seymour. JCT, 116:219-228, 2016. [doi]

On the correlation of increasing familiesGil Kalai, Nathan Keller, Elchanan Mossel. JCT, 144:250-276, 2016. [doi]

2015

Some old and new problems in combinatorial geometry I: around Borsuk's problemGil Kalai. In Artur Czumaj, Agelos Georgakopoulos, Daniel Král, Vadim V. Lozin, Oleg Pikhurko, editors, Surveys in Combinatorics 2015. Volume 424 of London Mathematical Society Lecture Note Series, pages 147-174, Cambridge University Press, 2015. [doi]

Sharp Thresholds for Monotone Non-Boolean Functions and Social Choice TheoryGil Kalai, Elchanan Mossel. mor, 40(4):915-925, 2015. [doi]

Bidding Games and Efficient AllocationsGil Kalai, Reshef Meir, Moshe Tennenholtz. sigecom 2015: 113-130 [doi]

2013

The Cascade Auction - A Mechanism for Deterring Collusion in AuctionsUriel Feige, Gil Kalai, Moshe Tennenholtz. AAAI 2013: 313-319 [doi]

2011

A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three AlternativesEhud Friedgut, Gil Kalai, Nathan Keller, Noam Nisan. SICOMP, 40(3):934-952, 2011. [doi]

2008

Elections Can be Manipulated OftenEhud Friedgut, Gil Kalai, Noam Nisan. focs 2008: 243-249 [doi]

Neighborly Embedded ManifoldsGil Kalai, Avi Wigderson. dcg, 40(3):319-324, 2008. [doi]

2006

A law of large numbers for weighted majorityOlle Häggström, Gil Kalai, Elchanan Mossel. aam, 37(1):112-123, 2006. [doi]

Intersections of Leray complexes and regularity of monomial idealsGil Kalai, Roy Meshulam. JCT, 113(7):1586-1592, 2006. [doi]

Threshold Phenomena and Influence: Perspectives from Mathematics, Computer Science, and EconomicsGil Kalai, Shmuel Safra. In Allon G. Percus, Gabriel Istrate, Cristopher Moore, editors, Computational Complexity and Statistical Physics. Studies in the sciences of complexity, pages 25-62, Oxford University Press, 2006.

2003

Learnability and rationality of choiceGil Kalai. jet, 113(1):104-117, 2003. [doi]

2002

Transversal numbers for hypergraphs arising in geometryNoga Alon, Gil Kalai, Jirí Matousek 0001, Roy Meshulam. aam, 29(1):79-101, 2002. [doi]

Boolean functions whose Fourier transform is concentrated on the first two levelsEhud Friedgut, Gil Kalai, Assaf Naor. aam, 29(3):427-437, 2002. [doi]

A Fourier-theoretic perspective on the Condorcet paradox and Arrow's theoremGil Kalai. aam, 29(3):412-426, 2002. [doi]

2000

Fractional Helly theorem, weak epsilon nets and geometric piercingGil Kalai. cccg 2000: [doi]

Guest Editors ForewordGil Kalai, Victor Klee. dcg, 24(2-3):149-150, 2000. [doi]

Three Theorems, with Computer-Aided Proofs, on Three-Dimensional Faces and Quotients of PolytopesG. Meisinger, Peter Kleinschmidt, Gil Kalai. dcg, 24(2-3):413-420, 2000. [doi]

1997

Linear programming, the simplex algorithm and simple polytopesGil Kalai. mp, 79:217-233, 1997.

1995

Bounding the Piercing NumberNoga Alon, Gil Kalai. dcg, 13:245-256, 1995.

On the distance distribution of codesGil Kalai, Nathan Linial. TIT, 41(5):1467-1472, 1995.

1994

Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job SchedulingNoga Alon, Gil Kalai, Moty Ricklin, Larry J. Stockmeyer. TCS, 130(1):175-201, 1994.

A Problem of Füredi and Seymour on Covering Intersecting Families by PairsJeff Kahn, Gil Kalai. JCT, 68(2):317-339, 1994.

1992

Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling (Extended Abstract)Noga Alon, Gil Kalai, Moty Ricklin, Larry J. Stockmeyer. focs 1992: 334-343

A Subexponential Randomized Simplex Algorithm (Extended Abstract)Gil Kalai. stoc 1992: 475-482

Upper Bounds for the Diameter and Height of Graphs of Convex PolyhedraGil Kalai. dcg, 8:363-372, 1992.

1990

Extended Euler-Poincare Relations for Cell ComplexesAnders Björner, Gil Kalai. dimacs 1991: 81-90

The Diameter of Graphs of Convex Polytopes and f-Vector TheoryGil Kalai. dimacs 1991: 387-412

Symmetric matroidsGil Kalai. JCT, 50(1):54-64, 1990. [doi]

On low-dimensional faces that high-dimensional polytopes must haveGil Kalai. combinatorica, 10(3):271-280, 1990.

1989

The number of faces of centrally-symmetric polytopesGil Kalai. gc, 5(1):389-391, 1989. [doi]

1988

The Influence of Variables on Boolean Functions (Extended Abstract)Jeff Kahn, Gil Kalai, Nathan Linial. focs 1988: 68-80

A new basis of polytopesGil Kalai. JCT, 49(2):191-209, 1988. [doi]

A simple way to tell a simple polytope from its graphGil Kalai. JCT, 49(2):381-383, 1988. [doi]

Many Triangulated SpheresGil Kalai. dcg, 3:1-14, 1988.

1986

Characterization of f-vectors of families of convex sets in R:::::::d::::::: part II: Sufficiency of Eckhoff s conditionsGil Kalai. JCT, 41(2):167-188, 1986. [doi]

1985

A Simple Proof of the Upper Bound TheoremNoga Alon, Gil Kalai. ejc, 6(3):211-214, 1985. [doi]

f-Vectors of acyclic complexesGil Kalai. DM, 55(1):97-99, 1985. [doi]

A new approach to Turán's conjectureGil Kalai. gc, 1(1):107-109, 1985. [doi]

Hyperconnectivity of graphsGil Kalai. gc, 1(1):65-79, 1985. [doi]

1984

Regular subgraphs of almost regular graphsNoga Alon, S. Friedland, Gil Kalai. JCT, 37(1):79-91, 1984. [doi]

Every 4-regular graph plus an edge contains a 3-regular subgraphNoga Alon, S. Friedland, Gil Kalai. JCT, 37(1):92-93, 1984. [doi]

1983

בעיות קומבינטוריות בקמירות וקומבינטוריקה של קומפלכסים סימפליציאליים (Combinatorial problems in convexity and the combinatorics of simplicial complexes.)Gil Kalai. PhD thesis, Hebrew University of Jerusalem, Israel, 1983. [doi]

1979

A Note on an Evaluation of Abel SumsGil Kalai. JCT, 27(2):213-217, 1979.

Sign in or sign up to see more results.

runs on WebDSL