| 2008 |
|---|
| 25 | EE | Ehud Friedgut,
Gil Kalai,
Noam Nisan:
Elections Can be Manipulated Often.
FOCS 2008: 243-249 |
| 24 | EE | Gil Kalai,
Avi Wigderson:
Neighborly Embedded Manifolds.
Discrete & Computational Geometry 40(3): 319-324 (2008) |
| 2006 |
|---|
| 23 | EE | Gil Kalai,
Roy Meshulam:
Intersections of Leray complexes and regularity of monomial ideals.
J. Comb. Theory, Ser. A 113(7): 1586-1592 (2006) |
| 2000 |
|---|
| 22 | EE | Gil Kalai:
Fractional Helly theorem, weak epsilon nets and geometric piercing.
CCCG 2000 |
| 21 | EE | Gil Kalai,
Victor Klee:
Guest Editors' Foreword.
Discrete & Computational Geometry 24(2-3): 149-150 (2000) |
| 20 | EE | G. Meisinger,
Peter Kleinschmidt,
Gil Kalai:
Three Theorems, with Computer-Aided Proofs, on Three-Dimensional Faces and Quotients of Polytopes.
Discrete & Computational Geometry 24(2-3): 413-420 (2000) |
| 1997 |
|---|
| 19 | | Gil Kalai:
Linear programming, the simplex algorithm and simple polytopes.
Math. Program. 79: 217-233 (1997) |
| 1995 |
|---|
| 18 | | Noga Alon,
Gil Kalai:
Bounding the Piercing Number.
Discrete & Computational Geometry 13: 245-256 (1995) |
| 17 | | Gil Kalai,
Nathan Linial:
On the distance distribution of codes.
IEEE Transactions on Information Theory 41(5): 1467-1472 (1995) |
| 1994 |
|---|
| 16 | | Jeff Kahn,
Gil Kalai:
A Problem of Füredi and Seymour on Covering Intersecting Families by Pairs.
J. Comb. Theory, Ser. A 68(2): 317-339 (1994) |
| 15 | | Noga Alon,
Gil Kalai,
Moty Ricklin,
Larry J. Stockmeyer:
Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling.
Theor. Comput. Sci. 130(1): 175-201 (1994) |
| 1992 |
|---|
| 14 | | Noga Alon,
Gil Kalai,
Moty Ricklin,
Larry J. Stockmeyer:
Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling (Extended Abstract)
FOCS 1992: 334-343 |
| 13 | | Gil Kalai:
A Subexponential Randomized Simplex Algorithm (Extended Abstract)
STOC 1992: 475-482 |
| 12 | | Gil Kalai:
Upper Bounds for the Diameter and Height of Graphs of Convex Polyhedra.
Discrete & Computational Geometry 8: 363-372 (1992) |
| 1990 |
|---|
| 11 | | Gil Kalai:
On low-dimensional faces that high-dimensional polytopes must have.
Combinatorica 10(3): 271-280 (1990) |
| 10 | EE | Gil Kalai:
Symmetric matroids.
J. Comb. Theory, Ser. B 50(1): 54-64 (1990) |
| 1988 |
|---|
| 9 | | Jeff Kahn,
Gil Kalai,
Nathan Linial:
The Influence of Variables on Boolean Functions (Extended Abstract)
FOCS 1988: 68-80 |
| 8 | | Gil Kalai:
Many Triangulated Spheres.
Discrete & Computational Geometry 3: 1-14 (1988) |
| 7 | EE | Gil Kalai:
A new basis of polytopes.
J. Comb. Theory, Ser. A 49(2): 191-209 (1988) |
| 6 | EE | Gil Kalai:
A simple way to tell a simple polytope from its graph.
J. Comb. Theory, Ser. A 49(2): 381-383 (1988) |
| 1986 |
|---|
| 5 | EE | Gil Kalai:
Characterization of f-vectors of families of convex sets in Rd part II: Sufficiency of Eckhoff's conditions.
J. Comb. Theory, Ser. A 41(2): 167-188 (1986) |
| 1985 |
|---|
| 4 | EE | Gil Kalai:
f-Vectors of acyclic complexes.
Discrete Mathematics 55(1): 97-99 (1985) |
| 1984 |
|---|
| 3 | EE | Noga Alon,
S. Friedland,
Gil Kalai:
Regular subgraphs of almost regular graphs.
J. Comb. Theory, Ser. B 37(1): 79-91 (1984) |
| 2 | EE | Noga Alon,
S. Friedland,
Gil Kalai:
Every 4-regular graph plus an edge contains a 3-regular subgraph.
J. Comb. Theory, Ser. B 37(1): 92-93 (1984) |
| 1979 |
|---|
| 1 | | Gil Kalai:
A Note on an Evaluation of Abel Sums.
J. Comb. Theory, Ser. A 27(2): 213-217 (1979) |
