Gil Kalai A Subexponential Randomized Simplex Algorithm (Extended Abstract) [Citation Graph (0, 0)][DBLP] STOC, 1992, pp:475-482 [Conf]
Gil Kalai On low-dimensional faces that high-dimensional polytopes must have. [Citation Graph (0, 0)][DBLP] Combinatorica, 1990, v:10, n:3, pp:271-280 [Journal]
Gil Kalai Upper Bounds for the Diameter and Height of Graphs of Convex Polyhedra. [Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 1992, v:8, n:, pp:363-372 [Journal]
Jeff Kahn, Gil Kalai A Problem of Füredi and Seymour on Covering Intersecting Families by Pairs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1994, v:68, n:2, pp:317-339 [Journal]
Gil Kalai A Note on an Evaluation of Abel Sums. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1979, v:27, n:2, pp:213-217 [Journal]
Gil Kalai Characterization of f-vectors of families of convex sets in Rd part II: Sufficiency of Eckhoff's conditions. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1986, v:41, n:2, pp:167-188 [Journal]
Gil Kalai A simple way to tell a simple polytope from its graph. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1988, v:49, n:2, pp:381-383 [Journal]
Gil Kalai, Roy Meshulam Intersections of Leray complexes and regularity of monomial ideals. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 2006, v:113, n:7, pp:1586-1592 [Journal]
Gil Kalai Linear programming, the simplex algorithm and simple polytopes. [Citation Graph (0, 0)][DBLP] Math. Program., 1997, v:79, n:, pp:217-233 [Journal]