| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | László Lovász, Katalin Vesztergombi |
Nondeterministic graph property testing  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | László Lovász, Balázs Szegedy |
Random graphons and a weak Positivstellensatz for graphs. |
Journal of Graph Theory |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeev Arora, László Lovász, Ilan Newman, Yuval Rabani, Yuri Rabinovich, Santosh Vempala |
Local Versus Global Properties of Metric Spaces. |
SIAM J. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász, Balázs Szegedy |
Finitely forcible graphons. |
J. Comb. Theory, Ser. B |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász, Jaroslav Nesetril, Patrice Ossona de Mendez, Alexander Schrijver |
Preface. |
Eur. J. Comb. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Borgs, Jennifer T. Chayes, László Lovász, Vera T. Sós, Katalin Vesztergombi |
Limits of randomly grown graph sequences. |
Eur. J. Comb. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász |
Subgraph Densities in Signed Graphons and the Local Simonovits-Sidorenko Conjecture. |
Electr. J. Comb. |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ross J. Kang, László Lovász, Tobias Müller, Edward R. Scheinerman |
Dot Product Representations of Planar Graphs. |
Electr. J. Comb. |
2011 |
DBLP BibTeX RDF |
|
| 1 | László Lovász, Alexander Schrijver |
Dual graph homomorphism functions. |
J. Comb. Theory, Ser. A |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Beveridge, László Lovász |
Exit Frequency Matrices for Finite Markov Chains. |
Combinatorics, Probability & Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász, Alexander Schrijver |
Semidefinite Functions on Categories. |
Electr. J. Comb. |
2009 |
DBLP BibTeX RDF |
|
| 1 | László Lovász, Balázs Szegedy |
Contractors and connectors of graph algebras. |
Journal of Graph Theory |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász, Vera T. Sós |
Generalized quasirandom graphs. |
J. Comb. Theory, Ser. B |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász, Alexander Schrijver |
Graph parameters and semigroup functions. |
Eur. J. Comb. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász |
Some Mathematics behind Graph Property Testing. |
ALT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász |
Some Mathematics Behind Graph Property Testing. |
Discovery Science |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász, Santosh Vempala |
The geometry of logconcave functions and sampling algorithms. |
Random Struct. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
J. ACM |
2007 |
DBLP DOI BibTeX RDF |
confluent flow, routing, Approximation algorithms, network flow, tight bounds |
| 1 | Kamal Jain, László Lovász, Philip A. Chou |
Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding. |
Distributed Computing |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász |
Approximating Graphs by Graphs and Functions (Abstract). |
FCT |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász, Balázs Szegedy |
Limits of dense graph sequences. |
J. Comb. Theory, Ser. B |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász, Michael E. Saks |
A localization inequality for set functions. |
J. Comb. Theory, Ser. A |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász |
Normal hypergraphs and the perfect graph conjecture. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeev Arora, Béla Bollobás, László Lovász, Iannis Tourlakis |
Proving Integrality Gaps without Knowing the Linear Program. |
Theory of Computing |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász |
The rank of connection matrices and the dimension of graph algebras. |
Eur. J. Comb. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Itai Benjamini, Gady Kozma, László Lovász, D. A. N. Romik, Gábor Tardos |
Waiting for a Bat to Fly By (in Polynomial Time). |
Combinatorics, Probability & Computing |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ravi Kannan, László Lovász, Ravi Montenegro |
Blocking Conductance and Mixing in Random Walks. |
Combinatorics, Probability & Computing |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicholas J. A. Harvey, Richard E. Ladner, László Lovász, Tami Tamir |
Semi-matchings for bipartite graphs and load balancing. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász, Santosh Vempala |
Simulated annealing in convex bodies and an O*(n4) volume algorithm. |
J. Comput. Syst. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász, Santosh Vempala |
Hit-and-Run from a Corner. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeev Arora, László Lovász, Ilan Newman, Yuval Rabani, Yuri Rabinovich, Santosh Vempala |
Local versus global properties of metric spaces. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász, Santosh Vempala |
Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Borgs, Jennifer T. Chayes, László Lovász, Vera T. Sós, Balázs Szegedy, Katalin Vesztergombi |
Graph limits and parameter testing. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
convergence of graphs, distance of graphs, graph limit, property testing, graph homomorphism |
| 1 | László Lovász |
Review of the book by Alexander Schrijver: Combinatorial Optimization: Polyhedra and Efficiency. |
Oper. Res. Lett. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Kamal Jain, László Lovász, Philip A. Chou |
Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding. |
PODC |
2005 |
DBLP DOI BibTeX RDF |
Azuma, security, peer-to-peer, network, multicast, coding, overlay, inequalities, file distribution |
| 1 | Uriel Feige, László Lovász, Prasad Tetali |
Approximating Min Sum Set Cover. |
Algorithmica |
2004 |
DBLP DOI BibTeX RDF |
Threshhold, NP-hardness, Greedy algorithm, Randomized rounding |
| 1 | Jiangzhuo Chen, Robert D. Kleinberg, László Lovász, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta |
(Almost) tight bounds and existence theorems for confluent flows. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
confluent flow, routing, approximation algorithms, network flow, tight bounds |
| 1 | László Lovász, Santosh Vempala |
Hit-and-run from a corner. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
sampling, random walks, isoperimetric inequalities |
| 1 | Nicholas J. A. Harvey, Richard E. Ladner, László Lovász, Tami Tamir |
Semi-matchings for Bipartite Graphs and Load Balancing. |
WADS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász, Santosh Vempala |
Logconcave Functions: Geometry and Efficient Sampling Algorithms |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász, Santosh Vempala |
Simulated Annealing in Convex Bodies and an 0*(n4) Volume Algorithm. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász, Neal E. Young |
Lecture Notes on Evasiveness of Graph Properties |
CoRR |
2002 |
DBLP BibTeX RDF |
|
| 1 | Uriel Feige, László Lovász, Prasad Tetali |
Approximating Min-sum Set Cover. |
APPROX |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Itai Benjamini, László Lovász |
Global Information from Local Observation. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeev Arora, Béla Bollobás, László Lovász |
Proving Integrality Gaps without Knowing the Linear Program. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, László Lovász |
Unextendible Product Bases. |
J. Comb. Theory, Ser. A |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász |
Steinitz Representations of Polyhedra and the Colin de Verdie`re Number. |
J. Comb. Theory, Ser. B |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász |
Energy of Convex Sets, Shortest Paths, and Resistance. |
J. Comb. Theory, Ser. A |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lipták, László Lovász |
Critical Facets of the Stable Set Polytope. |
Combinatorica |
2001 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) Classes: 05C69, 90C57 |
| 1 | Jeff Kahn, Jeong Han Kim, László Lovász, Van H. Vu |
The Cover Time, the Blanket Time, and the Matthews Bound. |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
blanket time, Matthews bound, Matthews bounds, deterministic-polynomial time algorithm, computational complexity, approximation algorithm, graph theory, graph, theorem proving, random walk, deterministic algorithms, approximation theory, stationary distribution, cover time |
| 1 | Fang Chen, László Lovász, Igor Pak |
Lifting Markov Chains to Speed up Mixing. |
STOC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász, Ravi Kannan |
Faster Mixing via Average Conductance. |
STOC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász, Peter Winkler |
Reversal of Markov Chains and the Forget Time. |
Combinatorics, Probability & Computing |
1998 |
DBLP BibTeX RDF |
|
| 1 | Andreas Brieden, Peter Gritzmann, Ravi Kannan, Victor Klee, László Lovász, Miklós Simonovits |
Approximation of Diameters: Randomization Doesn't Help. |
FOCS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász |
The Membership Problem in Jump Systems. |
J. Comb. Theory, Ser. B |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Ravi Kannan, László Lovász, Miklós Simonovits |
Random walks and an O*(n5) volume algorithm for convex bodies. |
Random Struct. Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Kotlov, László Lovász, Santosh Vempala |
The Colin de Verdière Number and Sphere Representations of a Graph. |
Combinatorica |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász, János Pach, Mario Szegedy |
On Conway's Thrackle Conjecture. |
Discrete & Computational Geometry |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Uriel Feige, Shafi Goldwasser, László Lovász, Shmuel Safra, Mario Szegedy |
Interactive Proofs and the Hardness of Approximating Cliques. |
J. ACM |
1996 |
DBLP DOI BibTeX RDF |
independent set in a graph, multilinearity testing np-completeness, hardness of approximation, probabilistically checkable proofs |
| 1 | László Lovász, Peter Winkler |
Exact Mixing in an Unknown Markov Chain. |
Electr. J. Comb. |
1995 |
DBLP BibTeX RDF |
|
| 1 | Ravi Kannan, László Lovász, Miklós Simonovits |
Isoperimetric Problems for Convex Bodies and a Localization Lemama. |
Discrete & Computational Geometry |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász, Moni Naor, Ilan Newman, Avi Wigderson |
Search Problems in the Decision Tree Model. |
SIAM J. Discrete Math. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász, János Pach, Mario Szegedy |
On Conway's Thrackle Conjecture. |
Symposium on Computational Geometry |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász, Peter Winkler |
Efficient stopping rules for Markov chains. |
STOC |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász, Ákos Seress |
The Cocycle Lattice of Binary Matroids . |
Eur. J. Comb. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász, Miklós Simonovits |
Random Walks in a Convex Body and an Improved Volume Algorithm. |
Random Struct. Algorithms |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Judit Csima, László Lovász |
Dating to Marriage. |
Discrete Applied Mathematics |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász, Michael E. Saks |
Communication Complexity and Combinatorial Lattice Theory. |
J. Comput. Syst. Sci. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Narendra Karmarkar, Richard M. Karp, Richard J. Lipton, László Lovász, Michael Luby |
A Monte-Carlo Algorithm for Estimating the Permanent. |
SIAM J. Comput. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász |
Combinatorial problems and exercises (2. ed.). |
|
1993 |
RDF |
|
| 1 | Imre Bárány, Roger Howe, László Lovász |
On integer points in polyhedra: a lower bound. |
Combinatorica |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Judit Csima, László Lovász |
A matching algorithm for regular bipartite graphs. |
Discrete Applied Mathematics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász, Miklós Simonovits |
On the Randomized Complexity of Volume and Diameter |
FOCS |
1992 |
DBLP DOI BibTeX RDF |
unit ball, randomized complexity, mixing rate, Markov chains, random walks, diameter, volume, convex polytopes, convex body |
| 1 | Anders Björner, László Lovász, Andrew Chi-Chih Yao |
Linear Decision Trees: Volume Estimates and Topological Bounds |
STOC |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Uriel Feige, László Lovász |
Two-Prover One-Round Proof Systems: Their Power and Their Problems (Extended Abstract) |
STOC |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász, Moni Naor, Ilan Newman, Avi Wigderson |
Search Problems in the Decision Tree Model (Preliminary Version) |
FOCS |
1991 |
DBLP DOI BibTeX RDF |
Boolean decision tree model, CNF search, complexities, randomness, search problems, determinism, nondeterminism |
| 1 | Uriel Feige, Shafi Goldwasser, László Lovász, Shmuel Safra, Mario Szegedy |
Approximating Clique is Almost NP-Complete (Preliminary Version) |
FOCS |
1991 |
DBLP DOI BibTeX RDF |
approximation procedures, approximating clique, almost NP-complete, computational complexity, graph |
| 1 | Imre Bárány, Zoltán Füredi, László Lovász |
On the number of halving planes. |
Combinatorica |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Imre Csiszár, János Körner, László Lovász, Katalin Marton, Gábor Simonyi |
Entropy splitting for antiblocking corners and perfect graphs. |
Combinatorica |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász, Miklós Simonovits |
The Mixing Rate of Markov Chains, an Isoperimetric Inequality, and Computing the Volume |
FOCS |
1990 |
DBLP DOI BibTeX RDF |
mixing rate, Markov chains, running-time, conductance, convex body, convex body, isoperimetric inequality, time-reversible |
| 1 | László Lovász, Michael E. Saks, William T. Trotter |
An on-line graph coloring algorithm with sublinear performance ratio. |
Discrete Mathematics |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernhard Korte, László Lovász |
The intersection of matroids and antimatroids. |
Discrete Mathematics |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, László Lovász, Katalin Vesztergombi |
On the Graph of Large Distance. |
Discrete & Computational Geometry |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Imre Bárány, Zoltán Füredi, László Lovász |
On the Number of Halving Planes. |
Symposium on Computational Geometry |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász |
Faster Algorithms for Hard Problems. |
IFIP Congress |
1989 |
DBLP BibTeX RDF |
|
| 1 | Nathan Linial, László Lovász, Avi Wigderson |
Rubber bands, convex embeddings and graph connectivity. |
Combinatorica |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász, Michael E. Saks |
Lattices, Möbius Functions and Communication Complexity |
FOCS |
1988 |
DBLP DOI BibTeX RDF |
combinatorial lattice theory, mobius functions, lattices, communications complexity, graph connectivity |
| 1 | László Lovász |
Matching structure and the matching lattice. |
J. Comb. Theory, Ser. B |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas W. M. Dress, László Lovász |
On some combinatorial properties of algebraic matroids. |
Combinatorica |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grötschel, László Lovász, Alexander Schrijver |
Relaxations of vertex packing. |
J. Comb. Theory, Ser. B |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernhard Korte, László Lovász |
Non-interval greedoids and the transposition property. |
Discrete Mathematics |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Faigle, László Lovász, Rainer Schrader, György Turán |
Searching in Trees, Series-Parallel and Interval Orders. |
SIAM J. Comput. |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathan Linial, László Lovász, Avi Wigderson |
A Physical Interpretation of Graph Connectivity, and Its Algorithmic Applications |
FOCS |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Ravi Kannan, László Lovász |
Covering Minima and Lattice Point Free Convex Bodies. |
FSTTCS |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász |
Connectivity Algorithms Using Rubber-bands. |
FSTTCS |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernhard Korte, László Lovász |
Polymatroid greedoids. |
J. Comb. Theory, Ser. B |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász |
Vertex Packing Algorithms. |
ICALP |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | László Lovász |
Computing ears and branchings in parallel |
FOCS |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grötschel, László Lovász, Alexander Schrijver |
Corrigendum to our paper "The ellipsoid method and its consequences in combinatorial optimization". |
Combinatorica |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Ravindran Kannan, Arjen K. Lenstra, László Lovász |
Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers |
STOC |
1984 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")