Author of the publication

Logconcave Functions: Geometry and Efficient Sampling Algorithms

, and . FOCS, page 640-649. IEEE Computer Society, (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Approximating Clique is Almost NP-Complete (Preliminary Version), , , , and . Proc. 32th FOCS, page 2--12. (1991)Matrix Cones, Projection Representations, and Stable Set Polyhedra., and . Polyhedral Combinatorics, volume 1 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 1-18. DIMACS/AMS, (1990)Lattices, Möbius Functions and Communication Complexity, and . FOCS, page 81-90. IEEE Computer Society, (1988)Approximating Clique is Almost NP-Complete (Preliminary Version), , , , and . FOCS, page 2-12. IEEE Computer Society, (1991)Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization., and . FOCS, page 57-68. IEEE Computer Society, (2006)Normal hypergraphs and the perfect graph conjecture.. Discret. Math., 2 (3): 253-267 (1972)On integer points in polyhedra: a lower bound., , and . Combinatorica, 12 (2): 135-142 (1992)Large Networks and Graph Limits.. Colloquium Publications American Mathematical Society, (2012)Linear Decision Trees: Volume Estimates and Topological Bounds, , and . STOC, page 170-177. ACM, (1992)Vertex Packing Algorithms.. ICALP, volume 194 of Lecture Notes in Computer Science, page 1-14. Springer, (1985)