Lovász, László 1948
Overview
Works:  179 works in 705 publications in 4 languages and 9,970 library holdings 

Genres:  Conference papers and proceedings Handbooks and manuals Biography Documentary films Biographical films Nonfiction films Film adaptations 
Roles:  Author, Editor, Honoree, Other 
Classifications:  QA164, 511.6 
Publication Timeline
.
Most widely held works about
László Lovász
 Building bridges : between mathematics and computer science by Martin Grötschel( )
Most widely held works by
László Lovász
Discrete mathematics : elementary and beyond by
László Lovász(
)
26 editions published between 1999 and 2006 in English and held by 1,259 WorldCat member libraries worldwide
"This book is aimed at undergraduate mathematics and computer science students interested in developing a feeling for what mathematics is all about, where mathematics can be helpful, and what kinds of questions mathematicians work on. The authors discuss a number of selected results and methods of discrete mathematics, mostly from the areas of combinatorics and graph theory, with a little number theory, probability, and combinatorial geometry. Wherever possible, the authors use proofs and problem solving to help students understand the solutions to problems. In addition, there are numerous examples, figures, and exercises spread throughout the book."Jacket
26 editions published between 1999 and 2006 in English and held by 1,259 WorldCat member libraries worldwide
"This book is aimed at undergraduate mathematics and computer science students interested in developing a feeling for what mathematics is all about, where mathematics can be helpful, and what kinds of questions mathematicians work on. The authors discuss a number of selected results and methods of discrete mathematics, mostly from the areas of combinatorics and graph theory, with a little number theory, probability, and combinatorial geometry. Wherever possible, the authors use proofs and problem solving to help students understand the solutions to problems. In addition, there are numerous examples, figures, and exercises spread throughout the book."Jacket
Combinatorial problems and exercises by
László Lovász(
Book
)
65 editions published between 1978 and 2014 in English and Dutch and held by 1,048 WorldCat member libraries worldwide
Basic enumeration; The sieve; Permutations; Two classical enumeration problems in graph theory; Connectivity; Factors of graphs; Extremal problems for graphs; Spectra of graphs; Automorphism of graphs; Hypergraphs; Ramsey theory
65 editions published between 1978 and 2014 in English and Dutch and held by 1,048 WorldCat member libraries worldwide
Basic enumeration; The sieve; Permutations; Two classical enumeration problems in graph theory; Connectivity; Factors of graphs; Extremal problems for graphs; Spectra of graphs; Automorphism of graphs; Hypergraphs; Ramsey theory
Geometric algorithms and combinatorial optimization by
Martin Grötschel(
Book
)
33 editions published between 1980 and 1994 in English and German and held by 719 WorldCat member libraries worldwide
Since the publication of the first edition of our book, geometric algorithms and combinatorial optimization have kept growing at the same fast pace as before. Nevertheless, we do not feel that the ongoing research has made this book outdated. Rather, it seems that many of the new results build on the models, algorithms, and theorems presented here. For instance, the celebrated DyerFriezeKannan algorithm for approximating the volume of a convex body is based on the oracle model of convex bodies and uses the ellipsoid method as a preprocessing technique. The polynomial time equivalence of optimization, separation, and membership has become a commonly employed tool in the study of the complexity of combinatorial optimization problems and in the newly developing field of computational convexity. Implementations of the basis reduction algorithm can be found in various computer algebra software systems. On the other hand, several of the open problems discussed in the first edition are still unsolved. For example, there are still no combinatorial polynomial time algorithms known for minimizing a submodular function or finding a maximum clique in a perfect graph. Moreover, despite the success of the interior point methods for the solution of explicitly given linear programs there is still no method known that solves implicitly given linear programs, such as those described in this book, and that is both practically and theoretically efficient. In particular, it is not known how to adapt interior point methods to such linear programs
33 editions published between 1980 and 1994 in English and German and held by 719 WorldCat member libraries worldwide
Since the publication of the first edition of our book, geometric algorithms and combinatorial optimization have kept growing at the same fast pace as before. Nevertheless, we do not feel that the ongoing research has made this book outdated. Rather, it seems that many of the new results build on the models, algorithms, and theorems presented here. For instance, the celebrated DyerFriezeKannan algorithm for approximating the volume of a convex body is based on the oracle model of convex bodies and uses the ellipsoid method as a preprocessing technique. The polynomial time equivalence of optimization, separation, and membership has become a commonly employed tool in the study of the complexity of combinatorial optimization problems and in the newly developing field of computational convexity. Implementations of the basis reduction algorithm can be found in various computer algebra software systems. On the other hand, several of the open problems discussed in the first edition are still unsolved. For example, there are still no combinatorial polynomial time algorithms known for minimizing a submodular function or finding a maximum clique in a perfect graph. Moreover, despite the success of the interior point methods for the solution of explicitly given linear programs there is still no method known that solves implicitly given linear programs, such as those described in this book, and that is both practically and theoretically efficient. In particular, it is not known how to adapt interior point methods to such linear programs
Matching theory by
László Lovász(
Book
)
41 editions published between 1986 and 2012 in English and Undetermined and held by 702 WorldCat member libraries worldwide
This book surveys matching theory, with an emphasis on connections with other areas of mathematics and on the role matching theory has played, and continues to play, in the development of some of these areas. Besides basic results on the existence of matchings and on the matching structure of graphs, the impact of matching theory is discussed by providing crucial special cases and nontrivial examples on matroid theory, algorithms, and polyhedral combinatorics. The new Appendix outlines how the theory and applications of matching theory have continued to develop since the book was first publish
41 editions published between 1986 and 2012 in English and Undetermined and held by 702 WorldCat member libraries worldwide
This book surveys matching theory, with an emphasis on connections with other areas of mathematics and on the role matching theory has played, and continues to play, in the development of some of these areas. Besides basic results on the existence of matchings and on the matching structure of graphs, the impact of matching theory is discussed by providing crucial special cases and nontrivial examples on matroid theory, algorithms, and polyhedral combinatorics. The new Appendix outlines how the theory and applications of matching theory have continued to develop since the book was first publish
Handbook of combinatorics by
Ronald L Graham(
Book
)
15 editions published between 1995 and 2003 in English and Italian and held by 552 WorldCat member libraries worldwide
15 editions published between 1995 and 2003 in English and Italian and held by 552 WorldCat member libraries worldwide
An algorithmic theory of numbers, graphs, and convexity by
László Lovász(
Book
)
20 editions published between 1986 and 1995 in English and German and held by 510 WorldCat member libraries worldwide
A study of how complexity questions in computing interact with classical mathematics in the numerical analysis of issues in algorithm design. Algorithmic designers concerned with linear and nonlinear combinatorial optimization will find this volume especially useful. Two algorithms are studied in detail: the ellipsoid method and the simultaneous diophantine approximation method. Although both were developed to study, on a theoretical level, the feasibility of computing some specialized problems in polynomial time, they appear to have practical applications. The book first describes use of the simultaneous diophantine method to develop sophisticated rounding procedures. Then a model is described to compute upper and lower bounds on various measures of convex bodies. Use of the two algorithms is brought together by the author in a study of polyhedra with rational vertices. The book closes with some applications of the results to combinatorial optimization
20 editions published between 1986 and 1995 in English and German and held by 510 WorldCat member libraries worldwide
A study of how complexity questions in computing interact with classical mathematics in the numerical analysis of issues in algorithm design. Algorithmic designers concerned with linear and nonlinear combinatorial optimization will find this volume especially useful. Two algorithms are studied in detail: the ellipsoid method and the simultaneous diophantine approximation method. Although both were developed to study, on a theoretical level, the feasibility of computing some specialized problems in polynomial time, they appear to have practical applications. The book first describes use of the simultaneous diophantine method to develop sophisticated rounding procedures. Then a model is described to compute upper and lower bounds on various measures of convex bodies. Use of the two algorithms is brought together by the author in a study of polyhedra with rational vertices. The book closes with some applications of the results to combinatorial optimization
Horizons of combinatorics by
G Fejes Tóth(
)
10 editions published in 2008 in English and Undetermined and held by 494 WorldCat member libraries worldwide
Hungarian mathematics has always been known for discrete mathematics, including combinatorial number theory, set theory and recently random structures, and combinatorial geometry as well. The recent volume contains high level surveys on these topics with authors mostly being invited speakers for the conference Horizons of Combinatorics held in Balatonalmadi, Hungary in 2006. The collection gives a very good overview of recent trends and results in a large part of combinatorics and related topics, and offers an interesting reading for experienced specialists as well as to young researchers and students
10 editions published in 2008 in English and Undetermined and held by 494 WorldCat member libraries worldwide
Hungarian mathematics has always been known for discrete mathematics, including combinatorial number theory, set theory and recently random structures, and combinatorial geometry as well. The recent volume contains high level surveys on these topics with authors mostly being invited speakers for the conference Horizons of Combinatorics held in Balatonalmadi, Hungary in 2006. The collection gives a very good overview of recent trends and results in a large part of combinatorics and related topics, and offers an interesting reading for experienced specialists as well as to young researchers and students
Research trends in combinatorial optimization : Bonn 2008 by
William Cook(
)
16 editions published between 2008 and 2009 in English and held by 480 WorldCat member libraries worldwide
This book, written by leading experts in combinatorial optimization, features indepth surveys of current research areas in combinatorial optimization in the broad sense, ranging from applied graph theory to mathematical programming. It also contains numerous new results and shows many interesting current research directions. This book will be indispensible for any researcher in combinatorial optimization
16 editions published between 2008 and 2009 in English and held by 480 WorldCat member libraries worldwide
This book, written by leading experts in combinatorial optimization, features indepth surveys of current research areas in combinatorial optimization in the broad sense, ranging from applied graph theory to mathematical programming. It also contains numerous new results and shows many interesting current research directions. This book will be indispensible for any researcher in combinatorial optimization
More sets, graphs, and numbers : a salute to Vera Sós and András Hajnal by
Ervin Győri(
)
14 editions published between 2006 and 2014 in English and held by 474 WorldCat member libraries worldwide
Discrete mathematics, including (combinatorial) number theory and set theory has always been a stronghold of Hungarian mathematics. The present volume honouring Vera Sos and Andras Hajnal contains survey articles (with classical theorems and stateoftheart results) and cutting edge expository research papers with new theorems and proofs in the area of the classical Hungarian subjects, like extremal combinatorics, colorings, combinatorial number theory, etc. The open problems and the latest results in the papers inspire further research
14 editions published between 2006 and 2014 in English and held by 474 WorldCat member libraries worldwide
Discrete mathematics, including (combinatorial) number theory and set theory has always been a stronghold of Hungarian mathematics. The present volume honouring Vera Sos and Andras Hajnal contains survey articles (with classical theorems and stateoftheart results) and cutting edge expository research papers with new theorems and proofs in the area of the classical Hungarian subjects, like extremal combinatorics, colorings, combinatorial number theory, etc. The open problems and the latest results in the papers inspire further research
Large networks and graph limits by
László Lovász(
Book
)
17 editions published between 2012 and 2013 in English and held by 342 WorldCat member libraries worldwide
"Recently, it became apparent that a large number of the most interesting structures and phenomena of the world can be described by networks. Developing a mathematical theory of very large networks is an important challenge. This book describes one recent approach to this theory, the limit theory of graphs, which has emerged over the last decade. The theory has rich connections with other approaches to the study of large networks, such as "property testing" in computer science and regularity partition in graph theory. It has several applications in extremal graph theory, including the exact formulations and partial answers to very general questions, such as which problems in extremal graph theory are decidable. It also has less obvious connections with other parts of mathematics (classical and nonclassical, like probability theory, measure theory, tensor algebras, and semidefinite optimization). This book explains many of these connections, first at an informal level to emphasize the need to apply more advanced mathematical methods, and then gives an exact development of the algebraic theory of graph homomorphisms and of the analytic theory of graph limits." Publisher description
17 editions published between 2012 and 2013 in English and held by 342 WorldCat member libraries worldwide
"Recently, it became apparent that a large number of the most interesting structures and phenomena of the world can be described by networks. Developing a mathematical theory of very large networks is an important challenge. This book describes one recent approach to this theory, the limit theory of graphs, which has emerged over the last decade. The theory has rich connections with other approaches to the study of large networks, such as "property testing" in computer science and regularity partition in graph theory. It has several applications in extremal graph theory, including the exact formulations and partial answers to very general questions, such as which problems in extremal graph theory are decidable. It also has less obvious connections with other parts of mathematics (classical and nonclassical, like probability theory, measure theory, tensor algebras, and semidefinite optimization). This book explains many of these connections, first at an informal level to emphasize the need to apply more advanced mathematical methods, and then gives an exact development of the algebraic theory of graph homomorphisms and of the analytic theory of graph limits." Publisher description
Erdős centennial by
László Lovász(
)
9 editions published in 2013 in English and held by 330 WorldCat member libraries worldwide
"Paul Erdős was one of the most influential mathematicians of the twentieth century, whose work in number theory, combinatorics, set theory, analysis, and other branches of mathematics has determined the development of large areas of these fields. In 1999, a conference was organized to survey his work, his contributions to mathematics, and the farreaching impact of his work on many branches of mathematics. On the 100th anniversary of his birth, this volume undertakes the almost impossible task to describe the ways in which problems raised by him and topics initiated by him (indeed, whole branches of mathematics) continue to flourish. Written by outstanding researchers in these areas, these papers include extensive surveys of classical results as well as of new developments."Page [4] of cover
9 editions published in 2013 in English and held by 330 WorldCat member libraries worldwide
"Paul Erdős was one of the most influential mathematicians of the twentieth century, whose work in number theory, combinatorics, set theory, analysis, and other branches of mathematics has determined the development of large areas of these fields. In 1999, a conference was organized to survey his work, his contributions to mathematics, and the farreaching impact of his work on many branches of mathematics. On the 100th anniversary of his birth, this volume undertakes the almost impossible task to describe the ways in which problems raised by him and topics initiated by him (indeed, whole branches of mathematics) continue to flourish. Written by outstanding researchers in these areas, these papers include extensive surveys of classical results as well as of new developments."Page [4] of cover
Greedoids by
B. H Korte(
Book
)
18 editions published between 1991 and 2013 in English and held by 329 WorldCat member libraries worldwide
With the advent of computers, algorithmic principles play an ever increasing role in mathematics. Algorithms have to exploit the structure of the underlying mathematical object, and properties exploited by algorithms are often closely tied to classical structural analysis in mathematics. This connection between algorithms and structure is in particular apparent in discrete mathematics, where proofs are often constructive, and can be turned into algorithms more directly. The principle of greediness plays a fundamental role both in the design of continuous algorithms (where it is called the steepest descent or gradient method) and of discrete algorithms. The discrete structure most closely related to greediness is a matroid; in fact, matroids may be characterized axiomatically as those independence systems for which the greedy solution is optimal for certain optimization problems (e.g. linear objective functions, bottleneck functions). This book is an attempt to unify different approaches and to lead the reader from fundamental results in matroid theory to the current borderline of open research problems. The monograph begins by reviewing classical concepts from matroid theory and extending them to greedoids. It then proceeds to the discussion of subclasses like interval greedoids, antimatroids or convex geometries, greedoids on partially ordered sets and greedoid intersections. Emphasis is placed on optimization problems in greedois. An algorithmic characterization of greedoids in terms of the greedy algorithm is derived, the behaviour with respect to linear functions is investigated, the shortest path problem for graphs is extended to a class of greedoids, linear descriptions of antimatroid polyhedra and complexity results are given and the RadoHall theorem on transversals is generalized. The selfcontained volume which assumes only a basic familarity with combinatorial optimization ends with a chapter on topological results in connection with greedoids
18 editions published between 1991 and 2013 in English and held by 329 WorldCat member libraries worldwide
With the advent of computers, algorithmic principles play an ever increasing role in mathematics. Algorithms have to exploit the structure of the underlying mathematical object, and properties exploited by algorithms are often closely tied to classical structural analysis in mathematics. This connection between algorithms and structure is in particular apparent in discrete mathematics, where proofs are often constructive, and can be turned into algorithms more directly. The principle of greediness plays a fundamental role both in the design of continuous algorithms (where it is called the steepest descent or gradient method) and of discrete algorithms. The discrete structure most closely related to greediness is a matroid; in fact, matroids may be characterized axiomatically as those independence systems for which the greedy solution is optimal for certain optimization problems (e.g. linear objective functions, bottleneck functions). This book is an attempt to unify different approaches and to lead the reader from fundamental results in matroid theory to the current borderline of open research problems. The monograph begins by reviewing classical concepts from matroid theory and extending them to greedoids. It then proceeds to the discussion of subclasses like interval greedoids, antimatroids or convex geometries, greedoids on partially ordered sets and greedoid intersections. Emphasis is placed on optimization problems in greedois. An algorithmic characterization of greedoids in terms of the greedy algorithm is derived, the behaviour with respect to linear functions is investigated, the shortest path problem for graphs is extended to a class of greedoids, linear descriptions of antimatroid polyhedra and complexity results are given and the RadoHall theorem on transversals is generalized. The selfcontained volume which assumes only a basic familarity with combinatorial optimization ends with a chapter on topological results in connection with greedoids
Algebraic methods in graph theory by Conference on Algebraic Methods in Graph Theory(
Book
)
26 editions published in 1981 in English and Undetermined and held by 245 WorldCat member libraries worldwide
26 editions published in 1981 in English and Undetermined and held by 245 WorldCat member libraries worldwide
Theory of algorithms(
Book
)
15 editions published between 1985 and 1986 in English and Dutch and held by 237 WorldCat member libraries worldwide
15 editions published between 1985 and 1986 in English and Dutch and held by 237 WorldCat member libraries worldwide
Finite and infinite sets by Hungarian Combinatorial Colloquium(
Book
)
13 editions published in 1984 in English and held by 218 WorldCat member libraries worldwide
Colloquia Mathematica Societatis Jânos Bolyai, 37: Finite and Infinite Sets, Vol. I focuses on the principles, operations, and approaches involved in finite and infinite sets. The selection first elaborates on essential chains and squares, cellular automata in trees, almost disjoint families of countable sets, and application of Lovasz local lemma. Discussions focus on deleting operations, number of all and selfdual Echains, transversality of Echains and Esquares, and binary Echains and Esquares. The text then elaborates on induced subgraphs, inverse extremal digraph problems, two Sperne
13 editions published in 1984 in English and held by 218 WorldCat member libraries worldwide
Colloquia Mathematica Societatis Jânos Bolyai, 37: Finite and Infinite Sets, Vol. I focuses on the principles, operations, and approaches involved in finite and infinite sets. The selection first elaborates on essential chains and squares, cellular automata in trees, almost disjoint families of countable sets, and application of Lovasz local lemma. Discussions focus on deleting operations, number of all and selfdual Echains, transversality of Echains and Esquares, and binary Echains and Esquares. The text then elaborates on induced subgraphs, inverse extremal digraph problems, two Sperne
N is a number : a portrait of Paul Erdős by
George Paul Csicsery(
Visual
)
1 edition published in 2004 in English and held by 206 WorldCat member libraries worldwide
A documentary filmed in England, Hungary, Poland and the United States over a period of four years presenting mathematician Paul Erdős's mathematical quest in its personal and philosophical dimensions, and the tragic historical events that molded his life
1 edition published in 2004 in English and held by 206 WorldCat member libraries worldwide
A documentary filmed in England, Hungary, Poland and the United States over a period of four years presenting mathematician Paul Erdős's mathematical quest in its personal and philosophical dimensions, and the tragic historical events that molded his life
Matroid theory(
Book
)
14 editions published in 1985 in English and Undetermined and held by 185 WorldCat member libraries worldwide
14 editions published in 1985 in English and Undetermined and held by 185 WorldCat member libraries worldwide
Combinatorial optimization by
William Cook(
Book
)
12 editions published in 1995 in English and held by 178 WorldCat member libraries worldwide
This book grew out of the fourth Special Year at DIMACS, which was devoted to the subject of combinatorial optimization. During the special year, a number of workshops, small and large, dealt with various aspects of this theme. Organizers of the workshops and selected participants were asked to write surveys about the hottest results and ideas in their fields. Therefore, this book is not a set of conference proceedings but rather a carefully refereed collection of invited survey articles written by outstanding researchers. Aimed at researchers in discrete mathematics, operations research, and
12 editions published in 1995 in English and held by 178 WorldCat member libraries worldwide
This book grew out of the fourth Special Year at DIMACS, which was devoted to the subject of combinatorial optimization. During the special year, a number of workshops, small and large, dealt with various aspects of this theme. Organizers of the workshops and selected participants were asked to write surveys about the hottest results and ideas in their fields. Therefore, this book is not a set of conference proceedings but rather a carefully refereed collection of invited survey articles written by outstanding researchers. Aimed at researchers in discrete mathematics, operations research, and
Diskrete Mathematik by
László Lovász(
Book
)
5 editions published in 2005 in German and held by 156 WorldCat member libraries worldwide
Die diskrete Mathematik ist im Begriff, zu einem der wichtigsten Gebiete der mathematischen Forschung zu werden mit Anwendungen in der Kryptographie, der linearen Programmierung, der Kodierungstheorie und Informatik. Dieses Buch richtet sich an Studenten der Mathematik und Informatik, die ein Gefühl dafür entwickeln möchten, worum es in der Mathematik geht, wobei Mathematik hilfreich sein kann, und mit welcher Art Fragen sich Mathematiker auseinandersetzen. Die Autoren stellen eine Anzahl ausgewählter Ergebnisse und Methoden der diskreten Mathematik vor, hauptsächlich aus den Bereichen Kombinatorik und Graphentheorie, teilweise aber auch aus der Zahlentheorie, der Wahrscheinlichkeitsrechnung und der kombinatorischen Geometrie. Wo immer es möglich war, haben die Autoren Beweise und Problemlösungen verwendet, um den Studenten zu helfen, die Lösungen der Fragestellungen zu verstehen. Zusätzlich ist eine Vielzahl von Beispielen, Bildern und Übungsaufgaben über das Buch verteilt. László Lovász ist einer der Leiter der theoretischen Forschungsabteilung der Microsoft Corporation. Er hat 1999 den WolfPreis sowie den GödelPreis für die beste wissenschaftliche Veröffentlichung in der Informatik erhalten. József Pelikán ist Professor am Institut für Algebra und Zahlentheorie der Eötvös Loránd Universität in Budapest. Katalin Vesztergombi ist Senior Lecturer am Fachbereich Mathematik der Universität von Washington in Seattle
5 editions published in 2005 in German and held by 156 WorldCat member libraries worldwide
Die diskrete Mathematik ist im Begriff, zu einem der wichtigsten Gebiete der mathematischen Forschung zu werden mit Anwendungen in der Kryptographie, der linearen Programmierung, der Kodierungstheorie und Informatik. Dieses Buch richtet sich an Studenten der Mathematik und Informatik, die ein Gefühl dafür entwickeln möchten, worum es in der Mathematik geht, wobei Mathematik hilfreich sein kann, und mit welcher Art Fragen sich Mathematiker auseinandersetzen. Die Autoren stellen eine Anzahl ausgewählter Ergebnisse und Methoden der diskreten Mathematik vor, hauptsächlich aus den Bereichen Kombinatorik und Graphentheorie, teilweise aber auch aus der Zahlentheorie, der Wahrscheinlichkeitsrechnung und der kombinatorischen Geometrie. Wo immer es möglich war, haben die Autoren Beweise und Problemlösungen verwendet, um den Studenten zu helfen, die Lösungen der Fragestellungen zu verstehen. Zusätzlich ist eine Vielzahl von Beispielen, Bildern und Übungsaufgaben über das Buch verteilt. László Lovász ist einer der Leiter der theoretischen Forschungsabteilung der Microsoft Corporation. Er hat 1999 den WolfPreis sowie den GödelPreis für die beste wissenschaftliche Veröffentlichung in der Informatik erhalten. József Pelikán ist Professor am Institut für Algebra und Zahlentheorie der Eötvös Loránd Universität in Budapest. Katalin Vesztergombi ist Senior Lecturer am Fachbereich Mathematik der Universität von Washington in Seattle
Combinatorics by
Hungarian Colloquium on Combinatorics(
Book
)
12 editions published in 1988 in English and held by 136 WorldCat member libraries worldwide
12 editions published in 1988 in English and held by 136 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Grötschel, Martin Other Author Editor
 Pelikán, J. (József)
 Sós, Vera T. Other Editor
 Katona, G. Editor
 Vsztergombi, K. (Katalin)
 Győri, Ervin 1954 Author Editor
 Graham, Ronald L. 1935 Other Author Editor
 Hajnal, A. Other Author Editor
 Korte, B. H. (Bernhard H.) 1938 Author Editor
 Schrijver, A.
Useful Links
Associated Subjects
Algebra Algebra, Abstract Algorithms Combinatorial analysis Combinatorial geometry Combinatorial optimization Computational complexity Computer programming Computer science Computer scienceMathematics Convex domains Distribution (Probability theory) Economics Electronic data processing Erdős, Paul, Geometry of numbers Graph theory Greedoids Hoffman, Paul, Hungary Influence (Literary, artistic, etc.) Jewish mathematicians Logic, Symbolic and mathematical Lovász, László, Machine translating Matching theory Mathematical optimization Mathematical statistics Mathematicians Mathematics MathematicsPhilosophy Matroids Number theory Operations research Programming (Mathematics) Ramsey theory Random graphs Set theory
Covers
Alternative Names
Lāslo Lovāss
László Lovász
László Lovász Hongaars wiskundige
László Lovász Hungarian mathematician
László Lovász matemático húngaro
László Lovász matematico ungherese
László Lovász mathématicien hongrois
László Lovász ungarischer Mathematiker
László Lovász ungersk datavetare och matematiker
Lovász, L.
Lovász, L. 1948
Lovász, L. (László)
Lovász, L. (László), 1948
Lovász, László
Lovasz, Laszlo 1948
Ласло Ловас
Ласло Ловас венгерский математик, известный работами по комбинаторике
Ласло Ловас угорський математик
Ловас, Ласло
לסלו לובאס
לסלו לובאס מתמטיקאי הונגרי
لاسلو لوواس ریاضیدان و دانشمند علوم کامپیوتر اهل مجارستان
লাসলো লোভাশ
লাসলো লোভাশ হাঙ্গেরীয় গণিতবিদ
로바스 라슬로
ラースロー・ロヴァース
ロバシュ, ラオス
ロバース, ラスロウ
拉兹洛·洛瓦兹
Languages