The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

László Lovász: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Romas Aleliunas, Richard M. Karp, Richard J. Lipton, László Lovász, Charles Rackoff
    Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems [Citation Graph (1, 0)][DBLP]
    FOCS, 1979, pp:218-223 [Conf]
  2. Uriel Feige, László Lovász, Prasad Tetali
    Approximating Min-sum Set Cover. [Citation Graph (0, 0)][DBLP]
    APPROX, 2002, pp:94-107 [Conf]
  3. Imre Bárány, Zoltán Füredi, László Lovász
    On the Number of Halving Planes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:140-144 [Conf]
  4. László Lovász, János Pach, Mario Szegedy
    On Conway's Thrackle Conjecture. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:147-151 [Conf]
  5. Bernhard Korte, László Lovász
    Mathematical Structures Underlying Greedy Algorithms. [Citation Graph (0, 0)][DBLP]
    FCT, 1981, pp:205-209 [Conf]
  6. László Lovász
    On determinants, matchings, and random algorithms. [Citation Graph (0, 0)][DBLP]
    FCT, 1979, pp:565-574 [Conf]
  7. Sanjeev Arora, Béla Bollobás, László Lovász
    Proving Integrality Gaps without Knowing the Linear Program. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:313-322 [Conf]
  8. Itai Benjamini, László Lovász
    Global Information from Local Observation. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:701-710 [Conf]
  9. Andreas Brieden, Peter Gritzmann, Ravi Kannan, Victor Klee, László Lovász, Miklós Simonovits
    Approximation of Diameters: Randomization Doesn't Help. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:244-251 [Conf]
  10. Uriel Feige, Shafi Goldwasser, László Lovász, Shmuel Safra, Mario Szegedy
    Approximating Clique is Almost NP-Complete (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:2-12 [Conf]
  11. Jeff Kahn, Jeong Han Kim, László Lovász, Van H. Vu
    The Cover Time, the Blanket Time, and the Matthews Bound. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:467-475 [Conf]
  12. Nathan Linial, László Lovász, Avi Wigderson
    A Physical Interpretation of Graph Connectivity, and Its Algorithmic Applications [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:39-48 [Conf]
  13. László Lovász
    Computing ears and branchings in parallel [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:464-467 [Conf]
  14. László Lovász, Moni Naor, Ilan Newman, Avi Wigderson
    Search Problems in the Decision Tree Model (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:576-585 [Conf]
  15. László Lovász, Michael E. Saks
    Lattices, Möbius Functions and Communication Complexity [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:81-90 [Conf]
  16. László Lovász, Miklós Simonovits
    The Mixing Rate of Markov Chains, an Isoperimetric Inequality, and Computing the Volume [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:346-354 [Conf]
  17. László Lovász, Miklós Simonovits
    On the Randomized Complexity of Volume and Diameter [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:482-491 [Conf]
  18. László Lovász, Santosh Vempala
    Simulated Annealing in Convex Bodies and an 0*(n4) Volume Algorithm. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:650-0 [Conf]
  19. László Lovász, Santosh Vempala
    Logconcave Functions: Geometry and Efficient Sampling Algorithms [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:640-649 [Conf]
  20. László Lovász, Santosh Vempala
    Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:57-68 [Conf]
  21. Ravi Kannan, László Lovász
    Covering Minima and Lattice Point Free Convex Bodies. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:193-213 [Conf]
  22. László Lovász
    Connectivity Algorithms Using Rubber-bands. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:394-411 [Conf]
  23. László Lovász
    Vertex Packing Algorithms. [Citation Graph (0, 0)][DBLP]
    ICALP, 1985, pp:1-14 [Conf]
  24. László Lovász
    Faster Algorithms for Hard Problems. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1989, pp:135-141 [Conf]
  25. Kamal Jain, László Lovász, Philip A. Chou
    Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding. [Citation Graph (0, 0)][DBLP]
    PODC, 2005, pp:51-59 [Conf]
  26. Sanjeev Arora, László Lovász, Ilan Newman, Yuval Rabani, Yuri Rabinovich, Santosh Vempala
    Local versus global properties of metric spaces. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:41-50 [Conf]
  27. Christian Borgs, Jennifer T. Chayes, László Lovász, Vera T. Sós, Balázs Szegedy, Katalin Vesztergombi
    Graph limits and parameter testing. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:261-270 [Conf]
  28. Anders Björner, László Lovász, Andrew Chi-Chih Yao
    Linear Decision Trees: Volume Estimates and Topological Bounds [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:170-177 [Conf]
  29. Jiangzhuo Chen, Robert D. Kleinberg, László Lovász, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta
    (Almost) tight bounds and existence theorems for confluent flows. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:529-538 [Conf]
  30. Fang Chen, László Lovász, Igor Pak
    Lifting Markov Chains to Speed up Mixing. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:275-281 [Conf]
  31. Uriel Feige, László Lovász
    Two-Prover One-Round Proof Systems: Their Power and Their Problems (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:733-744 [Conf]
  32. Ravindran Kannan, Arjen K. Lenstra, László Lovász
    Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:191-200 [Conf]
  33. László Lovász, Ravi Kannan
    Faster Mixing via Average Conductance. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:282-287 [Conf]
  34. László Lovász, Santosh Vempala
    Hit-and-run from a corner. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:310-314 [Conf]
  35. László Lovász, Peter Winkler
    Efficient stopping rules for Markov chains. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:76-82 [Conf]
  36. Nicholas J. A. Harvey, Richard E. Ladner, László Lovász, Tami Tamir
    Semi-matchings for Bipartite Graphs and Load Balancing. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:294-308 [Conf]
  37. Uriel Feige, László Lovász, Prasad Tetali
    Approximating Min Sum Set Cover. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:40, n:4, pp:219-234 [Journal]
  38. Imre Bárány, Zoltán Füredi, László Lovász
    On the number of halving planes. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1990, v:10, n:2, pp:175-183 [Journal]
  39. Imre Bárány, Roger Howe, László Lovász
    On integer points in polyhedra: a lower bound. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1992, v:12, n:2, pp:135-142 [Journal]
  40. Imre Csiszár, János Körner, László Lovász, Katalin Marton, Gábor Simonyi
    Entropy splitting for antiblocking corners and perfect graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1990, v:10, n:1, pp:27-40 [Journal]
  41. J. A. Bondy, László Lovász
    Cycles through specified vertices of a graph. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1981, v:1, n:2, pp:117-140 [Journal]
  42. Andreas W. M. Dress, László Lovász
    On some combinatorial properties of algebraic matroids. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1987, v:7, n:1, pp:39-48 [Journal]
  43. J. Edmonds, László Lovász, William R. Pulleyblank
    Brick decompositions and the matching rank of graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1982, v:2, n:3, pp:247-274 [Journal]
  44. Martin Grötschel, László Lovász, Alexander Schrijver
    The ellipsoid method and its consequences in combinatorial optimization. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1981, v:1, n:2, pp:169-197 [Journal]
  45. Martin Grötschel, László Lovász, Alexander Schrijver
    Corrigendum to our paper "The ellipsoid method and its consequences in combinatorial optimization". [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:4, pp:291-295 [Journal]
  46. Bernhard Korte, László Lovász
    Structural properties of greedoids. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1983, v:3, n:3, pp:359-374 [Journal]
  47. Andrew Kotlov, László Lovász, Santosh Vempala
    The Colin de Verdière Number and Sphere Representations of a Graph. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1997, v:17, n:4, pp:483-521 [Journal]
  48. Nathan Linial, László Lovász, Avi Wigderson
    Rubber bands, convex embeddings and graph connectivity. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1988, v:8, n:1, pp:91-102 [Journal]
  49. László Lipták, László Lovász
    Critical Facets of the Stable Set Polytope. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2001, v:21, n:1, pp:61-88 [Journal]
  50. László Lovász
    Tibor Gallai. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1982, v:2, n:3, pp:203-205 [Journal]
  51. László Lovász
    Ear-decompositions of matching covered graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1983, v:3, n:1, pp:105-117 [Journal]
  52. László Lovász, Peter Winkler
    Exact Mixing in an Unknown Markov Chain. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1995, v:2, n:, pp:- [Journal]
  53. László Lovász, Neal E. Young
    Lecture Notes on Evasiveness of Graph Properties [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  54. László Lovász, Peter Winkler
    Reversal of Markov Chains and the Forget Time. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:2, pp:189-204 [Journal]
  55. Judit Csima, László Lovász
    Dating to Marriage. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:41, n:3, pp:269-270 [Journal]
  56. Paul Erdös, László Lovász, Katalin Vesztergombi
    On the Graph of Large Distance. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:541-549 [Journal]
  57. Ravi Kannan, László Lovász, Miklós Simonovits
    Isoperimetric Problems for Convex Bodies and a Localization Lemama. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:13, n:, pp:541-559 [Journal]
  58. László Lovász, János Pach, Mario Szegedy
    On Conway's Thrackle Conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1997, v:18, n:4, pp:369-376 [Journal]
  59. László Lovász
    Normal hypergraphs and the perfect graph conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:867-875 [Journal]
  60. László Lovász
    The rank of connection matrices and the dimension of graph algebras. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:6, pp:962-970 [Journal]
  61. László Lovász, Ákos Seress
    The Cocycle Lattice of Binary Matroids . [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1993, v:14, n:3, pp:241-250 [Journal]
  62. Uriel Feige, Shafi Goldwasser, László Lovász, Shmuel Safra, Mario Szegedy
    Interactive Proofs and the Hardness of Approximating Cliques. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1996, v:43, n:2, pp:268-292 [Journal]
  63. Nicholas J. A. Harvey, Richard E. Ladner, László Lovász, Tami Tamir
    Semi-matchings for bipartite graphs and load balancing. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2006, v:59, n:1, pp:53-78 [Journal]
  64. László Lovász, Michael E. Saks
    Communication Complexity and Combinatorial Lattice Theory. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1993, v:47, n:2, pp:322-349 [Journal]
  65. László Lovász, Santosh Vempala
    Simulated annealing in convex bodies and an O*(n4) volume algorithm. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:2, pp:392-417 [Journal]
  66. Noga Alon, László Lovász
    Unextendible Product Bases. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2001, v:95, n:1, pp:169-179 [Journal]
  67. Martin Grötschel, László Lovász, Alexander Schrijver
    Relaxations of vertex packing. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1986, v:40, n:3, pp:330-343 [Journal]
  68. Bernhard Korte, László Lovász
    Polymatroid greedoids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:38, n:1, pp:41-72 [Journal]
  69. László Lovász
    Energy of Convex Sets, Shortest Paths, and Resistance. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2001, v:94, n:2, pp:363-382 [Journal]
  70. László Lovász
    Steinitz Representations of Polyhedra and the Colin de Verdie`re Number. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:82, n:2, pp:223-236 [Journal]
  71. László Lovász
    Kneser's Conjecture, Chromatic Number, and Homotopy. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1978, v:25, n:3, pp:319-324 [Journal]
  72. László Lovász
    Matching structure and the matching lattice. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1987, v:43, n:2, pp:187-222 [Journal]
  73. László Lovász
    The Membership Problem in Jump Systems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1997, v:70, n:1, pp:45-66 [Journal]
  74. László Lovász, Michael E. Saks
    A localization inequality for set functions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2006, v:113, n:4, pp:726-735 [Journal]
  75. László Lovász, Balázs Szegedy
    Limits of dense graph sequences. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:6, pp:933-957 [Journal]
  76. László Lovász, Jaroslav Nesetril, Ales Pultr
    On a product dimension of graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1980, v:29, n:1, pp:47-67 [Journal]
  77. László Lovász
    Matroid matching and some applications. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1980, v:28, n:2, pp:208-236 [Journal]
  78. László Lovász, Michael D. Plummer
    On minimal elementary bipartite graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1977, v:23, n:1, pp:127-138 [Journal]
  79. László Lovász
    On two minimax theorems in graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1976, v:21, n:2, pp:96-103 [Journal]
  80. László Lovász
    Review of the book by Alexander Schrijver: Combinatorial Optimization: Polyhedra and Efficiency. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:4, pp:437-440 [Journal]
  81. Ravi Kannan, László Lovász, Miklós Simonovits
    Random walks and an O*(n5) volume algorithm for convex bodies. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:11, n:1, pp:1-50 [Journal]
  82. László Lovász, Miklós Simonovits
    Random Walks in a Convex Body and an Improved Volume Algorithm. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1993, v:4, n:4, pp:359-412 [Journal]
  83. Ulrich Faigle, László Lovász, Rainer Schrader, György Turán
    Searching in Trees, Series-Parallel and Interval Orders. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:4, pp:1075-1084 [Journal]
  84. Narendra Karmarkar, Richard M. Karp, Richard J. Lipton, László Lovász, Michael Luby
    A Monte-Carlo Algorithm for Estimating the Permanent. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:2, pp:284-293 [Journal]
  85. László Lovász, Santosh Vempala
    Hit-and-Run from a Corner. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:4, pp:985-1005 [Journal]
  86. László Lovász, Moni Naor, Ilan Newman, Avi Wigderson
    Search Problems in the Decision Tree Model. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1995, v:8, n:1, pp:119-132 [Journal]
  87. László Lovász
    Approximating Graphs by Graphs and Functions (Abstract). [Citation Graph (0, 0)][DBLP]
    FCT, 2007, pp:38- [Conf]
  88. Kamal Jain, László Lovász, Philip A. Chou
    Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2007, v:19, n:4, pp:301-311 [Journal]
  89. Bernhard Korte, László Lovász
    Non-interval greedoids and the transposition property. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:59, n:3, pp:297-314 [Journal]
  90. Bernhard Korte, László Lovász
    The intersection of matroids and antimatroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:73, n:1-2, pp:143-157 [Journal]
  91. László Lovász, Michael E. Saks, William T. Trotter
    An on-line graph coloring algorithm with sublinear performance ratio. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:75, n:1-3, pp:319-325 [Journal]
  92. Jiangzhuo Chen, Robert D. Kleinberg, László Lovász, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta
    (Almost) Tight bounds and existence theorems for single-commodity confluent flows. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2007, v:54, n:4, pp:- [Journal]

  93. Some Mathematics behind Graph Property Testing. [Citation Graph (, )][DBLP]


  94. Some Mathematics Behind Graph Property Testing. [Citation Graph (, )][DBLP]


  95. Waiting for a Bat to Fly By (in Polynomial Time). [Citation Graph (, )][DBLP]


  96. Blocking Conductance and Mixing in Random Walks. [Citation Graph (, )][DBLP]


  97. A matching algorithm for regular bipartite graphs. [Citation Graph (, )][DBLP]


  98. Graph parameters and semigroup functions. [Citation Graph (, )][DBLP]


Search in 0.039secs, Finished in 0.045secs
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