Springer-verlag

This book constitutes the refereed proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS 2004, held in Montpellier, France, in March 2004. The 54 revised full papers presented together with two invited contributions were carefully reviewed and selected from more than 200 submissions. The papers are organized in topical sections on structural complexity, graph algorithms, quantum computing, satisfiability - constraint satisfaction problems, scheduling, algorithms, networks, automata theory and words, path algorithms, cryptography, logic and formal languages, game theory and complexity, and algorithmic information.

21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings

STACS 2004

Dieter van Melkebeek

This book is based on the author's Ph.D. thesis which was selected as the winning thesis of the 1999 ACM Doctoral Dissertation Competition. Dieter van Melkebeek did his Ph.D. work at the University of Chicago with Lance Fortnow as thesis advisor. This work studies some central issues in computational complexity: the relative power of time, space, and randomness in computing and verification. The author develops techniques for separating complexity classes by isolating structural differences between their complete problems. He presents several approaches based on such diverse concepts as density, redundancy, and frequency of occurrence.

Randomness and Completeness in Computational Complexity

Wolfgang Bertram

The geometry of Jordan and Lie structures tries to answer the following question: what is the integrated, or geometric, version of real Jordan algebras, - triple systems and - pairs? Lie theory shows the way one has to go: Lie groups and symmetric spaces are the geometric version of Lie algebras and Lie triple systems. It turns out that both geometries are closely related via a functor between them, called the Jordan-Lie functor, which is constructed in this book. The reader is not assumed to have any knowledge of Jordan theory; the text can serve as a self-contained introduction to (real finite-dimensional) Jordan theory.

The Geometry of Jordan and Lie Structures

Claudia Linnhoff-Popien

USM 2000$ (2000 : Munich, Allemagne)

USM 2000 Staff

This book constitutes the refereed proceedings of the Third International IFIP/GI Working Conference on Trends Towards a Universal Service Market, USM 2000, held in Munich, Germany in September 2000. The 28 revised full papers presented together with three invited papers were carefully reviewed and selected from numerous submissions. The papers are organized in topical sections on electronic auctions and trading, Internet-based service markets, quality of service, mobile and distributed services, middleware architectures, service management, mobile agents and applications, and trends in data- and telecommunications.

Third International IFIP/GI Working Conference, USM 2000 Munich, Germany, September 12-14, 2000 Proceedings

Trends in Distributed Systems: Towards a Universal Service Market

S.E. Ahmed

Bayesian and such approaches to inference have a number of points of close contact, especially from an asymptotic point of view. Both emphasize the construction of interval estimates of unknown parameters. In this volume, researchers present recent work on several aspects of Bayesian, likelihood and empirical Bayes methods, presented at a workshop held in Montreal, Canada. The goal of the workshop was to explore the linkages among the methods, and to suggest new directions for research in the theory of inference.

Springer-verlag

Books

Your next favorite book is out there