László Lovász
Affiliations:- Eötvös Loránd University, Budapest, Hungary
According to our database1,
László Lovász
authored at least 146 papers
between 1972 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on id.loc.gov
-
on d-nb.info
-
on cs.elte.hu
-
on isni.org
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
2023
2021
2019
2016
2013
Random Struct. Algorithms, 2013
2012
Eur. J. Oper. Res., 2012
Colloquium Publications 60, American Mathematical Society, ISBN: 978-0-8218-9085-1, 2012
2011
Electron. J. Comb., 2011
2010
Proceedings of the LLL Algorithm - Survey and Applications, 2010
2009
2008
Proceedings of the Algorithmic Learning Theory, 19th International Conference, 2008
2007
Random Struct. Algorithms, 2007
J. ACM, 2007
Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding.
Distributed Comput., 2007
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007
2006
Simulated annealing in convex bodies and an <i>O</i><sup>*</sup>(<i>n</i><sup>4</sup>) volume algorithm.
J. Comput. Syst. Sci., 2006
Eur. J. Comb., 2006
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006
Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006
2005
Review of the book by Alexander Schrijver: Combinatorial Optimization: Polyhedra and Efficiency.
Oper. Res. Lett., 2005
2004
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004
2003
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003
2002
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002
2001
J. Comb. Theory B, 2001
2000
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000
1999
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999
1998
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998
1997
Random Struct. Algorithms, 1997
1996
1995
Discret. Comput. Geom., 1995
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995
1994
1993
Random Struct. Algorithms, 1993
J. Comput. Syst. Sci., 1993
Proceedings of the Combinatorial Optimization, 1993
Combinatorial problems and exercises (2. ed.).
North-Holland, ISBN: 978-0-444-81504-0, 1993
1992
Two-Prover One-Round Proof Systems: Their Power and Their Problems (Extended Abstract)
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992
1991
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991
1990
The Mixing Rate of Markov Chains, an Isoperimetric Inequality, and Computing the Volume
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990
Proceedings of the Polyhedral Combinatorics, 1990
1989
Discret. Math., 1989
Faster Algorithms for Hard Problems.
Proceedings of the Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28, 1989
1988
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988
Algorithms and Combinatorics 2, Springer, ISBN: 978-3-642-97881-4, 1988
1987
1986
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1986
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1986
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986
Algorithmic theory of numbers, graphs and convexity.
CBMS-NSF regional conference series in applied mathematics 50, SIAM, ISBN: 978-0-89871-203-2, 1986
1985
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985
1984
Corrigendum to our paper "The ellipsoid method and its consequences in combinatorial optimization".
Comb., 1984
Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984
1983
1982
Proceedings of the Mathematical Programming The State of the Art, 1982
1981
Proceedings of the Fundamentals of Computation Theory, 1981
1980
1979
Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979
On determinants, matchings, and random algorithms.
Proceedings of the Fundamentals of Computation Theory, 1979
1978
1977
1976
1975
1972