This volume honours the eminent mathematicians Vera Sos and Andras Hajnal. The book includes survey articles reviewing classical theorems, as well as new, state-of-the-art results. Also presented are 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 are sure to inspire further research.

This book collects survey papers in the fields of entropy, search and complexity, summarizing the latest developments in their respective areas. More than half of the papers belong to search theory which lies on the borderline of mathematics and computer science, information theory and combinatorics, respectively. The book will be useful to experienced researchers as well as young scientists and students both in mathematics and computer science.

This volume collects together research and survey papers written by invited speakers of the conference celebrating the 70th birthday of Laszlo Lovasz. The topics covered include classical subjects such as extremal graph theory, coding theory, design theory, applications of linear algebra and combinatorial optimization, as well as recent trends such as extensions of graph limits, online or statistical versions of classical combinatorial problems, and new methods of derandomization. Laszlo Lovasz is one of the pioneers in the interplay between discrete and continuous mathematics, and is a master at establishing unexpected connections, "building bridges" between seemingly distant fields. His invariably elegant and powerful ideas have produced new subfields in many areas, and his outstanding scientific work has defined and shaped many research directions in the last 50 years. The 14 contributions presented in this volume, all of which are connected to Laszlo Lovasz's areas of research, offer an excellent overview of the state of the art of combinatorics and related topics and will be of interest to experienced specialists as well as young researchers.

Discrete Mathematics and theoretical computer science are closely linked research areas with strong impacts on applications and various other scientific disciplines. Both fields deeply cross fertilize each other. One of the persons who particularly contributed to building bridges between these and many other areas is László Lovász, whose outstanding scientific work has defined and shaped many research directions in the past 40 years. A number of friends and colleagues, all top authorities in their fields of expertise gathered at the two conferences in August 2008 in Hungary, celebrating Lovász' 60th birthday. It was a real fete of combinatorics and computer science. Some of these plenary speakers submitted their research or survey papers prior to the conferences. These are included in the volume "Building Bridges". The other speakers were able to finish their contribution only later, these are collected in the present volume.

This volume honours the eminent mathematicians Vera Sos and Andras Hajnal. The book includes survey articles reviewing classical theorems, as well as new, state-of-the-art results. Also presented are 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 are sure to inspire further research.

This is the second volume of the procedings of the second European Congress of Mathematics. Volume I presents the speeches delivered at the Congress, the list of lectures, and short summaries of the achievements of the prize winners. Together with volume II it contains a collection of contributions by the invited lecturers. Finally, volume II also presents reports on some of the Round Table discussions. This two-volume set thus gives an overview of the state of the art in many fields of mathematics and is therefore of interest to every professional mathematician. Contributors: Vol. I: N. Alon, L. Ambrosio, K. Astala, R. Benedetti, Ch. Bessenrodt, F. Bethuel, P. Bjorstad, E. Bolthausen, J. Bricmont, A. Kupiainen, D. Burago, L. Caporaso, U. Dierkes, I. Dynnikov, L.H. Eliasson, W.T. Gowers, H. Hedenmalm, A. Huber, J. Kaczorowski, J. Kollar, D.O. Kramkov, A.N. Shiryaev, C. Lescop, R. Marz. Vol. II: J. Matousek, D. McDuff, A.S. Merkurjev, V. Milman, St. Muller, T. Nowicki, E. Olivieri, E. Scoppola, V.P. Platonov, J. Poeschel, L. Polterovich , L. Pyber, N. Simanyi, J.P. Solovej, A. Stipsicz, G. Tardos, J.-P. Tignol, A.P. Veselov, E. Zuazua.

This book collects survey papers in the fields of entropy, search and complexity, summarizing the latest developments in their respective areas. More than half of the papers belong to search theory which lies on the borderline of mathematics and computer science, information theory and combinatorics, respectively. The book will be useful to experienced researchers as well as young scientists and students both in mathematics and computer science.

Hungarian mathematics has always been known for discrete mathematics, including combinatorial number theory, set theory and recently random structures, and combinatorial geometry. 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 an overview of recent trends and results in a large part of combinatorics and related topics.

  This book constitutes the thoroughly refereed post-proceedings of the Second International Workshop on Semantics in Databases, held in Dagstuhl Castle, Germany, in January 2001. The 10 revised full papers presented together with an introduction by the volume editors were carefully selected during two rounds of reviewing. Among the aspects of database semantics discussed are semantic constraints, paraconsistency, logic foundations of databases, ER modeling, type hierarchies, null values, consistency enforcement, logic-based pattern languages, and semantic classification of queries. Among the classes of databases dealt with are deductive databases, relational databases, distributed information systems, and tree-structured data.

This volume collects together research and survey papers written by invited speakers of the conference celebrating the 70th birthday of Laszlo Lovasz. The topics covered include classical subjects such as extremal graph theory, coding theory, design theory, applications of linear algebra and combinatorial optimization, as well as recent trends such as extensions of graph limits, online or statistical versions of classical combinatorial problems, and new methods of derandomization. Laszlo Lovasz is one of the pioneers in the interplay between discrete and continuous mathematics, and is a master at establishing unexpected connections, "building bridges" between seemingly distant fields. His invariably elegant and powerful ideas have produced new subfields in many areas, and his outstanding scientific work has defined and shaped many research directions in the last 50 years. The 14 contributions presented in this volume, all of which are connected to Laszlo Lovasz's areas of research, offer an excellent overview of the state of the art of combinatorics and related topics and will be of interest to experienced specialists as well as young researchers.

Discrete mathematics and theoretical computer science are closely linked research areas with strong impacts on applications and various other scientific disciplines. Both fields deeply cross fertilize each other. One of the persons who particularly contributed to building bridges between these and many other areas is Laszlo Lovasz, a scholar whose outstanding scientific work has defined and shaped many research directions in the last 40 years. A number of friends and colleagues, all top authorities in their fields of expertise and all invited plenary speakers at one of two conferences in August 2008 in Hungary, both celebrating Lovasz's 60th birthday, have contributed their latest research papers to this volume. This collection of articles offers an excellent view on the state of combinatorics and related topics and will be of interest for experienced specialists as well as young researchers.