ThisvolumecontainsthepaperspresentedattheFirstInternationalSymposium on Algorithmic Game Theory (SAGT 2008) held from April 30 to May 2 in Paderborn, Germany. The purpose of SAGT is to bring together researchers from computer science, economics and mathematics to present and discuss original research at the intersection of algorithms and game theory. It is intended to cover all important areas of algorithmic game theory, such as: solution concepts in game theory; game classes (e. g., bimatrix, potential, Bayesian); exact and appro- mate computation of equilibria; convergence and learning in games; complexity classesingametheory;algorithmicaspectsof?xed-pointtheorems;mechanisms, incentives and coalitions; cost-sharing algorithms and analysis; computational aspects of market equilibria; computational problems in economics, ?nance, - cision theory and pricing; auction algorithms and analysis; price of anarchy and its relatives; representations of games and their complexity; economic aspects of distributed computing and the Internet; network formation on the Internet; congestion, routing and network design games; game-theoretic approaches to networking problems; Byzantine game theory. There were 60 submissions. Each submission was reviewed by three P- gramme Committee members. The committee decided to accept 28 papers. The programme also included three invited talks from outstanding researchers ChristosPapadimitriou, NobelMemorialPrizewinnerReinhardSeltenandPaul Spirakis. We would like to thank all the Programme Committee members and the external reviewers who assisted them in their work. The members of the Organizing Committee as well as the developer of the EasyChair conference system deserve our gratitude for their contributions throughout the preparations.

This book constitutes the refereed proceedings of the 8th European Conference on Parallel Computing, Euro-Par 2002, held in Paderborn, Germany in August 2002.The 67 revised full papers and 55 research note papers presented together with 6 invited papers were carefully reviewed and selected from 265 submissions. The papers presented give a unique survey of the state of the art in parallel computing research, ranging from algorithms, software, hardware and application in various fields.

This book constitutes the refereed proceedings of the 8th International Conference on High Performance Computing, HiPC 2001, held in Hyderabad, India, in December 2001.The 29 revised full papers presented together with 5 keynote papers and 3 invited papers were carefully reviewed and selected from 108 submissions. The papers are organized in topical sections on algorithms, applications, architecture, systems software, communications networks, and challenges in networking.

This volume constitutes the refereed proceedings of the 23rd International Colloquium on Automata, Languages and Programming (ICALP '96), held at Paderborn, Germany, in July 1996. ICALP is an annual conference sponsored by the European Association on Theoretical Computer Science (EATCS).
The proceedings contain 52 refereed papers selected from 172 submissions and 4 invited papers. The papers cover the whole range of theoretical computer science; they are organized in sections on: Process Theory; Fairness, Domination, and the u-Calculus; Logic and Algebra; Languages and Processes; Algebraic Complexity; Graph Algorithms; Automata; Complexity Theory; Combinatorics on Words; Algorithms; Lower Bounds; Data Structures...

Research in the field of parallel computer architectures and parallel algorithms has been very successful in recent years, and further progress isto be expected. On the other hand, the question of basic principles of the architecture of universal parallel computers and their realizations is still wide open. The answer to this question must be regarded as mostimportant for the further development of parallel computing and especially for user acceptance. The First Heinz Nixdorf Symposium brought together leading experts in the field of parallel computing and its applications to discuss the state of the art, promising directions of research, and future perspectives. It was the first in a series of Heinz Nixdorf Symposia, intended to cover varying subjects from the research spectrum of the Heinz Nixdorf Institute of the University of Paderborn. This volume presents the proceedings of the symposium, which was held in Paderborn in November 1992. The contributions are grouped into four parts: parallel computation models and simulations, existing parallel machines, communication and programming paradigms, and parallel algorithms.

Algorithms are a central concept in computer science. The German Science Foundation (DFG) started a special joint initiative on data structures and efficient algorithms in 1986 with the aim of encouraging collaborative research on algorithms. For a period of five years about a dozen projects were funded with an emphasis on algorithms and data structures for geometric problems, on the one hand, and parallel and distributed algorithms, on the other. This volume contains 18 papers that are intended to give an impression of the achievements of this joint research initiative. The first group of papers addresses research on fundamental data structures, computational geometry, graph algorithms, computer graphics, and spatial databases. The second group of papers centers on the following problems: the design of parallel architectures and routing strategies, simulation of parallel machines, and the design of distributed algorithms for solving difficult problems.

This volume contains the proceedings of ICALP '91, the 18th annual summer conference sponsored by the European Association for Theoretical Computer Science (EATCS). ICALP stands for International Colloquium on Automata, Languages, and Programming, and this conference series covers all important areas of theoretical computer science, such as: computability, automata, formal languages, data types and structures, theory of databases and knowledge bases, semantics of programming languages, program specification, transformation and verification, foundations of logic and functional programming, theory of logical design and layout, parallel and distributed computation, theory of concurrency, symbolic and algebraic computation, term rewriting systems, computational geometry, cryptography, and theory of robotics.

This volume contains the presentations of the Sixth Symposium on Theoretical Aspects of Computer Science (STACS 89) held at the University of Paderborn, February 16-18, 1989. In addition to papers presented in the regular program the volume contains abstracts of software systems demonstrations which were included in this conference series in order to show applications of research results in theoretical computer science. The papers are grouped into the following thematic sections: computational geometry, automata theory and formal languages, semantics of programming languages, parallel algorithms, graph algorithms, complexity, structures, fault tolerance, completeness, distributed computing and concurrency.