Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Kalai, Gil"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A quantitative version of the Gibbard-Satterthwaite theorem for three alternatives
Ehud Friedgut
,
Gil Kalai
,
Nathan Keller
,
Noam Nisan
SIAM Journal on Computing
40
(3), 2011, pp. 934-952
Intersections of Leray complexes and regularity of monomial ideals
Gil Kalai
,
Roy Meshulam
Journal of Combinatorial Theory Series A
113
(7), 2006, pp. 1586-1592
On representation theory in computer vision problems
Amnon Shashua
,
Roy Meshulam
,
Lior Wolf
,
Anat Levin
,
Gil Kalai
Technical Report (2002-44), 2002
Polytope skeletons and paths
Gil Kalai
Handbook of Discrete and Computational Geometry, 1997, pp. 331-344
Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling
Noga Alon
,
Gil Kalai
,
Moty Ricklin
,
Larry Stockmeyer
Theoretical Computer Science
130
(1), 1994, pp. 175-201
A problem of Füredi and Seymour on covering intersecting families by pairs
Jeff Kahn
,
Gil Kalai
Journal of Combinatorial Theory Series A
68
(2), 1994, pp. 317-339
Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling
Noga Alon
,
Gil Kalai
,
Moty Ricklin
,
Larry Stockmeyer
Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'92 (Pittsburgh, PA, October 24-27, 1992)
, 1992, pp. 334-343
A subexponential randomized simplex algorithm
Gil Kalai
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC'92 (Victoria, British Columbia, Canada, May 4-6, 1992)
, 1992, pp. 475-482
Symmetric matroids
Gil Kalai
Journal of Combinatorial Theory Series B
50
, 1990, pp. 54-64
Research problems - The number of faces of centrally-symmetric polytopes
Gil Kalai
Graphs and Combinatorics
5
, 1989, pp. 389-391
A new basis of polytopes
Gil Kalai
Journal of Combinatorial Theory Series A
49
, 1988, pp. 191-209
A simple way to tell a simple polytope from its graph
Gil Kalai
Journal of Combinatorial Theory Series A
49
, 1988, pp. 381-383
Characterization of
f
-vectors of families of convex sets in
R^d
. Part II: Sufficiency of Eckhoff's conditions
Gil Kalai
Journal of Combinatorial Theory Series A
41
, 1986, pp. 167-188
Hyperconnectivity of graphs
Gil Kalai
Graphs and Combinatorics
1
, 1985, pp. 65-79
Research problems - A new approach to Turán's conjecture
Gil Kalai
Graphs and Combinatorics
1
, 1985, pp. 107-109
A note on an evaluation of Abel sums
Gill Kalai
Journal of Combinatorial Theory Series A
27
, 1979, pp. 213-217