Welcome to our book review site go-pdf.online!
You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Fete of Combinatorics and Computer Science
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.
The Radiant Past
Communism, once heralded as the "radiant future" of all humanity, has now become part of Eastern Europe's past. What does the record say about the legacy of communism as an organizational system? Michael Burawoy and Janos Lukacs consider this question from the standpoint of the Hungarian working class. Between 1983 and 1990 the authors carried out intensive studies in two core Hungarian industries, machine building and steel production, to produce the first extended participant-observation study of work and politics in state socialism. "A fascinating and engagingly written eyewitness report on proletarian life in the waning years of goulash communism. . . . A richly rewarding book, one that ...
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
This book constitutes the joint refereed proceedings of the 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2008 and the 12th International Workshop on Randomization and Computation, RANDOM 2008, held in Boston, MA, USA, in August 2008. The 20 revised full papers of the APPROX 2008 workshop were carefully reviewed and selected from 42 submissions and focus on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM 2008 is concerned with applications of randomness to computational and combinatorial problems and accounts for 27 revised full papers, also diligently reviewed and selected out of 52 workshop submissions.
