- INFORMATION AND COMPLEXITY (HOW TO MEASURE THEM?)
- Global Information from Local Observation Itai Benjamini L. Lovasz
- Limits of dense graph sequences Laszlo Lovasz and Balazs Szegedy
- BOLYAI SOCIETY MATHEMATICAL STUDIES, 2
- The cover time, the blanket time, and the Matthews bound J. Kahn # J. H. Kim + L. Lovasz # V. H. Vu
- Complexity of Algorithms Lecture Notes, Spring 1999
- Bibliography [1] D. J. Aldous and J. Fill: Reversible Markov Chains and Random Walks on Graphs (book
- A Correction: Orthogonal Representations and Connectivity of L. Lovasz # , M. Saks + , A. Schrijver #
- Reversal of Markov Chains and the Forget Time Laszlo Lovasz 1 and Peter Winkler 2
- On the behaviour of Colin de Verdi`ere's invariant under clique sums
- Gyakorlo feladatok. 1. Legyen x olyan 0-1 sorozat, mely nem tartalmaz 3 0-t egymasutan.
- CHESSBOARD COMPLEXES AND MATCHING COMPLEXES A. Bjorner, L. Lovasz, S.T. Vrecica, R.T. Zivaljevic
- Random Structures and Alg. 4, 359412. RANDOM WALKS IN A CONVEX BODY
- Graph homomorphisms: definitions Laszlo Lovasz
- Kuratowski tetelenek bizonyitasa Eloado: Lovasz Laszlo
- Fast Mixing in a Markov Chain Laszlo Lovasz and Peter Winkler
- Chip-firing games on graphs A. Bjorner
- Semidefinite programs and combinatorial optimization
- Bonyolultsagelmelet zarthelyi megoldasok December 14, 2006
- Grafok homomorfizmusai Hazi feladatok -3. sorozat
- Extremal Problems for Discrepancy L. Lovasz and K. Vesztergombi
- Published in: Graph Theory and Combinatorial Biology (Balatonlelle, 1996), Bolyai Soc. Math. Stud. 7,
- Efficient Stopping Rules for Markov Chains (EXTENDED ABSTRACT)
- Algoritmusok Bonyolultsga Egyetemi Jegyzet
- Rubber bands, convex embeddings and connectivity
- Faster Mixing via average Conductance Laszlo Lovasz # and Ravi Kannan +
- The membership problem in jump systems L'aszl'o Lov'asz
- REFLECTION POSITIVITY, RANK CONNECTIVITY, AND HOMOMORPHISM OF GRAPHS
- Graph homomorphisms: Open problems Laszlo Lovasz
- Discrete and Continuous: Two sides of the same?
- Simulated Annealing in Convex Bodies ) Volume Algorithm
- Grafok homomorfizmusai Bibliografia
- Copyright c #1998 John Wiley & Sons.
- Energy of convex sets, shortest paths and resistance
- The Colin de Verdi`ere number and sphere representations of a graph
- THE CHROMATIC NUMBER OF THE GRAPH
- Graph limits and parameter testing Christian Borgs
- Unextendible Product Bases L. Lovasz
- Building Scalable and Robust Peer-to-Peer Overlay Networks for Broadcasting using Network Coding
- Mixing Times L'aszl'o Lov'asz and Peter Winkler
- Geometric Graph Theory Laszlo Lovasz, Katalin Vesztergombi and Gabor Lippner
- RANDOM WALKS AND AN O ALGORITHM FOR CONVEX BODIES
- Approximate Counting and Quantum Computation M. Bordewich
- Published in: Surveys in Combinatorics, 1995 (ed. P. Rowlinson), London Math. Soc. Lecture Notes Series
- Discrete Localization and Correlation Inequalities for Set Functions
- Facets With Fixed Defect of the Stable Set Laszlo Liptak Laszlo Lovasz
- Testing properties of graphs and functions Laszlo Lovasz
- Mixing of Random Walks and Other Diffusions on a Graph
- Trends in Mathematics: How they could Change Education?
- Discrete Com ut Geom 4 :541-549 (1989) On the Gra h of Large Distances
- Szemeredi's Lemma for the Analyst Laszlo Lovasz and Balazs Szegedy
- This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
- Chip-firing games on directed graphs Anders Bjorner
- COLLOQUIA MATHEMATICA SOCIETATIS JAN05 BOLYAI 10. INFINITE AND FINITE SETS, KESZTHELY (HUNGARY), 1973 .
- Lifting Markov Chains to Speed up Mixing Department of Mathematics
- Contractors and connectors of graph algebras Laszlo Lovasz and Balazs Szegedy
- The Geometry of Logconcave Functions ) Sampling Algorithm 1
- Grafok homomorfizmusai Bibliografia
- Curriculum Vitae Laszlo Lovasz
- The rank of connection matrices and the dimension of graph algebras
- Connection matrices Laszlo Lovasz
- The graph theoretic moment problem Laszlo Lovasz
- Hit-and-Run is Fast and Fun 1 Laszlo Lovasz2
- Approximating Min-sum Set Cover 1 Uriel Feige 2
- Matrix cones, projection representations, and stable set polyhedra
- Convex Quadrilaterals and k-Sets Laszlo Lovasz1
- WAITING FOR A BAT TO FLY BY (IN POLYNOMIAL TIME) ITAI BENJAMINI, GADY KOZMA, LASZLO LOVASZ, DAN ROMIK,
- Act a Mathematics Academiae Scientiarum Hungaricae Tomes 22 ( 1-2), (1971), pp . 227-231
- Reprinted from JouRNAL o1 COMBINATORIAL THEORY Vol. 13, No. 3, December 1972 All Rights Reserved by Academic Press, New York and London Printed in Belgium
- Studia Scientianan Mathematicarum Hungarica 8 (1973) 165-168 . INDEPENDENT SETS IN CRITICAL CHROMATIC GRAPHS
- Dissection Graphs of Planar Point Sets P. ERDS, L. LOVSZ, A. SIMMONS and E . G. STRAUSt
- Published in: Bol. Soc. Braz. Mat. 20 (1989), 8799. Singular spaces of matrices
- Entropy splitting for antiblocking pairs
- Published in: Europ. J. Comb. 14 (1993), 241250. The cocycle lattice of binary matroids
- Published in: Linear Alg. Appl., Vol 226228, pp. 553567. The cocycle lattice of binary matroids, II
- THE RANK AND SIZE OF GRAPHS Andrew Kotlov and Laszlo Lovasz
- Interactive Proofs and the Hardness of Approximating Cliques
- On Conway's Thrackle Conjecture Laszlo Lovasz
- Counting Graph Homomorphisms Christian Borgs
- Discrete Analytic Functions: An Exposition
- August 1988 Computers, algorithms and mathematics
- FEATURES OF COMPUTER LANGUAGE: COMMUNICATION OF COMPUTERS AND ITS COMPLEXITY
- INTERACTIVE PROOFS: A NEW LOOK AT PASSWORDS, PROOFS, AND REFEREEING
- Veletlen strukturak es alkalmazasaik Eloado: Lovasz Laszlo
- Geometric Representations of Laszlo Lovasz
- The volume of convex bodies in high Laszlo Lovasz
- Eigenvalues of graphs Laszlo Lovasz
- The Colin de Verdi`ere number of a graph Laszlo Lovasz,
- Background material Geometric Graph Theory
- Published in: Proc. 24th ACM Symp. on Theory of Computing (1992), 170177.
- Published as: Stable sets and polynomials, Discrete Math. 124 (1994), 137153. STABLE SETS AND POLYNOMIALS
- 1. Hazi feladat Beadas: November 7.
- Grafok homomorfizmusai 4. Hazi feladat
- Topological Methods in Combinatorics Laszlo Lovasz
- Subgraph densities in signed graphons and the local Sidorenko conjecture
- Limits of dense graph sequences Laszlo Lovasz and Balazs Szegedy
- Where to Start a Geometric Random Walk? Laszlo Lovasz1
- Semidefinite functions on categories Laszlo Lovasz
- Grafok homomorfizmusai 2. Hazi feladat
- One Mathematics Laszlo Lovasz
- Discrete Mathematics Lecture Notes, Yale University, Spring 1999
- Generalized quasirandom graphs Laszlo Lovasz
- Periodica Mathematica Hungarica Vol . 9 (4), (1978), pp. 269-276 MENGERIAN THEOREMS FOR PATHS OF
- Cones of matrices and setfunctions, and 0-1 optimization
- Isoperimetric Problems for Convex Bodies and a Localization Lemma
- ORTHOGONAL REPRESENTATIONS AND CONNECTIVITY OF GRAPHS
- Geometric representations of Laszlo Lovasz
- Hitandrun mixes fast Laszlo Lovasz
- Limits of compact decorated graphs Laszlo Lovasz
- Publications of Laszlo Lovasz 1. Lovasz L., Pelikan J., Vesztergombi K.: Kombinatorika, Tankonyvkiado, Budapest, 1977 (German
- A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable
- Dual graph homomorphism functions Laszlo Lovasz and Alexander Schrijver
- Critical Facets of the Stable Set Polytope
- Steinitz representations and the Colin de Verdi`ere number
- On the number of complete subgraphs of a graph II L LOVASZ and m. SIMONOVITS (Budapest)
- the edacs from lJ' I. h db'N(E F) L t 0' w lIC oes not elong to El> is by one smaller then I 0' o' e us prove the validity of the statement!
- The Chromatic Number of Kneser Hypergraphs Author(s): N. Alon, P. Frankl, L. Lovsz
