The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gil Kalai: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gil Kalai
    Fractional Helly theorem, weak epsilon nets and geometric piercing. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  2. 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) [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:334-343 [Conf]
  3. Jeff Kahn, Gil Kalai, Nathan Linial
    The Influence of Variables on Boolean Functions (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:68-80 [Conf]
  4. Gil Kalai
    A Subexponential Randomized Simplex Algorithm (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:475-482 [Conf]
  5. 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]
  6. Noga Alon, Gil Kalai
    Bounding the Piercing Number. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:13, n:, pp:245-256 [Journal]
  7. Gil Kalai
    Many Triangulated Spheres. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:1-14 [Journal]
  8. 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]
  9. Gil Kalai, Victor Klee
    Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:24, n:2-3, pp:149-150 [Journal]
  10. G. Meisinger, Peter Kleinschmidt, Gil Kalai
    Three Theorems, with Computer-Aided Proofs, on Three-Dimensional Faces and Quotients of Polytopes. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:24, n:2-3, pp:413-420 [Journal]
  11. Noga Alon, S. Friedland, Gil Kalai
    Regular subgraphs of almost regular graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:1, pp:79-91 [Journal]
  12. Noga Alon, S. Friedland, Gil Kalai
    Every 4-regular graph plus an edge contains a 3-regular subgraph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:1, pp:92-93 [Journal]
  13. 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]
  14. 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]
  15. 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]
  16. Gil Kalai
    A new basis of polytopes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1988, v:49, n:2, pp:191-209 [Journal]
  17. 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]
  18. Gil Kalai
    Symmetric matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:50, n:1, pp:54-64 [Journal]
  19. 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]
  20. 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]
  21. Noga Alon, Gil Kalai, Moty Ricklin, Larry J. Stockmeyer
    Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:130, n:1, pp:175-201 [Journal]
  22. Gil Kalai, Nathan Linial
    On the distance distribution of codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:5, pp:1467-1472 [Journal]
  23. Gil Kalai
    f-Vectors of acyclic complexes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:1, pp:97-99 [Journal]

  24. Elections Can be Manipulated Often. [Citation Graph (, )][DBLP]


  25. Neighborly Embedded Manifolds. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002