Katalog der Deutschen Nationalbibliothek

Go to:

Knowledge Web

Person
Person
László Lovász
Source
Európa Pont
Wikimedia Commons
CC BY 2.0

Person

László Lovász (1948-)

Mathematiker

Name

László Lovász

Time

1948- (Date of birth and death)

Place

Budapest (Geburtsort)
Ungarn
USA

Gender

männlich

Academic degree

Prof. Dr.

Profession

Mathematiker (characteristic profession)
Hochschullehrer

Variant

L. Lovász

Related

Eötvös Loránd Tudományegyetem
Kombinatorik (Thema)
Graphentheorie (Thema)
Wolf-Preis (Auszeichung) (1999)

Topic

Personen zu Mathematik

Further information

Ungar. Mathematiker, lebte zeitw. in den USA, wo er von 1993 bis 2000 als Professor an der Yale University und von 1999 bis 2006 für Microsoft Research arbeitete, seit 2006 Direktor des Mathematischen Institutes der Loránd-Eötvös-Universität (ELTE) in Budapest

Source

LCAuth
Homepage: https://web.cs.elte.hu/~lovasz (Stand: 11.08.2020)

Record type

Person

GND-Identifier

108767337

Record ID

108767337

Involved in

show all

Erdős centennial

Erdős Centennial

Diskrete Mathematik

Diskrete Mathematik

Convex quadrilaterals and k-sets

Discrete mathematics : elementary and beyond

Discrete Mathematics : Elementary and Beyond

Isoperimetric problems for convex bodies and a localization lemma

Combinatorial optimization

Geometric algorithms and combinatorial optimization

Chip-Firing Games on Directed Graphs

Greedoids

Greedoids

On the graph of large distances

Communication complexity : a survey

Geometric algorithms and combinatorial optimization

The complexity of communication

The complexity of communication

Examples and algorithmic properties of greedoids

Examples and algorithmic properties of greedoids

Covering minima and lattice point free convex bodies

On the graph of large distances

On the graph of large distances

The intersection of matroids and antimatroids

The intersection of matroids and antimatroids

A note on selectors and greedoids

An algorithmic theory of numbers graphs and convexity

Greedoids - a structural framework for the greedy algorithm

Greedoids and linear objective functions

Homomorphisms and Ramsey properties of antimatroids

Homomorphisms and Ramsey properties of antimatroids

On submodularity in greedoids and a counterexample

On submodularity in greedoids and a counterexample

Polyhedral results for antimatroids

Polyhedral results for antimatroids

Polymatroid greedoids

Shelling structures, convexity and a happy end

Algorithmic aspects of some notions in classical mathematics

Basis graphs of greedoids and two-connectivity

Homotopy properties of greedoids

On some combinatorial properties of algebraic matroids

Relaxations of vertex packing

Relaxations of vertex packing

Some algorithmic problems on lattices

The ellipsoid method and its consequences in combinatorial optimization

Corrigendium.

The mathematical notion of complexity

Greedoids and linear objective functions

Polymatroid greedoids

Relation between subclasses of greedoids

Shelling structures, convexity and a happy end

Structural properties of greedoids

A note on selectors and greedoids

Mathematical structures underlying greedy algorithms

The ellipsoid method and its consequences in combinatorial optimization

[Hauptbd.].

The ellipsoid method and its consequences in combinatorial optimization

[Hauptbd.].

Kombinatorik

On the eigenvalues of trees

The ellipsoid method and its consequences in combinatorial optimization

Topic of

show all

Mathematics of László Lovász

Between mathematics and computer science

Building bridges
Please note

The beta version does not yet contain all functions and information of the DNB portal catalogue. If you are missing information or want to order a medium, please visit the page in the DNB portal catalogue via the following link:

DNB portal