BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × Greece
5 × USA
Collaborated with:
S.Vempala R.Kannan P.Winkler U.Feige F.Chen I.Pak A.Björner A.C.Yao R.Kannan A.K.Lenstra C.Borgs J.T.Chayes V.T.Sós B.Szegedy K.Vesztergombi J.Chen R.D.Kleinberg R.Rajaraman R.Sundaram A.Vetta
Talks about:
markov (2) chain (2) bound (2) mix (2) transcendent (1) nonrandom (1) confluent (1) algorithm (1) polynomi (1) topolog (1)

Person: László Lovász

DBLP DBLP: Lov=aacute=sz:L=aacute=szl=oacute=

Contributed to:

STOC 20062006
STOC 20042004
STOC 19991999
STOC 19951995
STOC 19921992
ICALP 19851985
STOC 19841984

Wrote 10 papers:

STOC-2006-BorgsCLSSV #graph #parametricity #testing
Graph limits and parameter testing (CB, JTC, LL, VTS, BS, KV), pp. 261–270.
STOC-2004-ChenKLRSV #bound #confluence #theorem
(Almost) tight bounds and existence theorems for confluent flows (JC, RDK, LL, RR, RS, AV), pp. 529–538.
Hit-and-run from a corner (LL, SV), pp. 310–314.
STOC-1999-ChenLP #markov
Lifting Markov Chains to Speed up Mixing (FC, LL, IP), pp. 275–281.
STOC-1999-LovaszK #performance
Faster Mixing via Average Conductance (LL, RK), pp. 282–287.
STOC-1995-LovaszW #markov #performance
Efficient stopping rules for Markov chains (LL, PW), pp. 76–82.
STOC-1992-BjornerLY #bound #linear
Linear Decision Trees: Volume Estimates and Topological Bounds (AB, LL, ACCY), pp. 170–177.
STOC-1992-FeigeL92a #problem #proving
Two-Prover One-Round Proof Systems: Their Power and Their Problems (UF, LL), pp. 733–744.
ICALP-1985-Lovasz #algorithm
Vertex Packing Algorithms (LL), pp. 1–14.
STOC-1984-KannanLL #algebra #polynomial
Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers (RK, AKL, LL), pp. 191–200.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.