Peter Widmayer – författare

This book constitutes the refereed proceedings of the 7th International Conference on Combinatorial Optimization and Applications, COCOA 2013, held in Chengdu, China, in December 2013. The papers feature original research in the areas of combinatorial optimization and its applications.

This book constitutes the refereed proceedings of the 7th International Conference, FUN 2014, held in July 2014 in Lipari Island, Sicily, Italy.The 29 revised full papers were carefully reviewed and selected from 49 submissions. They feature a large variety of topics in the field of the use, design and analysis of algorithms and data structures, focusing on results that provide amusing, witty but nonetheless original and scientifically profound contributions to the area. In particular, algorithmic questions rooted in biology, cryptography, game theory, graphs, the internet, robotics and mobility, combinatorics, geometry, stringology, as well as space-conscious, randomized, parallel, distributed algorithms and their visualization are addressed.

This book constitutes the refereed conference proceedings of the 9th International Conference on Algorithms and Complexity, CIAC 2015, held in Paris, France, in May 2015. The 30 revised full papers presented were carefully reviewed and selected from 93 submissions and are presented together with 2 invited papers.

This volume contains the contributions of the 29th International Colloquium on Automata, Languages, and Programming (ICALP) held July8-13, 2002 in M'alaga, Spain. The diversityand the qualityof the scienti?c program of ICALP 2002 serve as evidence that theoretical computer science with all its aspects continues to be a vibrant ?eld and is increasinglyturning into a valuable and abundant source of ideas and concepts for other research disciplines and app- cations. ICALP has been the main annual scienti?c event of the European Assoc- tion for Theoretical Computer Science (EATCS) for almost thirtyyears, making ICALP one of the best-established conferences in theoretical computer science and EATCS one of the world's largest and oldest theoretical computer science organizations. To re?ect the two parts of the EATCS journal Theoretical Computer Science (TCS), ICALP's technical program is split into two parts: while track A is - voted to algorithms, automata, complexity, and games, track B focuses on logic, semantics, and theoryof programming.

This volume constitutes the proceedings of the International Workshop on Advanced Research in Geographic Information Systems, IGIS 194, held in Ascona, Switzerland in February/March 1994. The 28 carefully refereed and revised papers address all current aspects of GIS research and their advanced applications to spatial and environmental data engineering. Among the topics covered are GIS theory, spatial databases, spatial data structures, environmental modelling and control, data modelling, object-orientation, pattern recognition, and optimization. In addition, software and non-commercial as well as commercial GIS are analyzsed.

This tutorial survey brings together two lines of research and development whose interaction promises to have significant practical impact on the area of spatial information processing in the near future: geographic information systems (GIS) and geometric computation or, more particularly, geometric algorithms and spatial data structures. In nine uniformly structured and coherent chapters, the authors present a unique survey ranging from the history and basic characteristics to current issues of precision and robustness of geometric computing. This textbook is ideally suited for advanced courses on GIS and applied geometric algorithms. Research and design professionals active in the area will find it valuable as a state-of-the-art survey.

The 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'99) celebrated the anniversaryof the workshop series at the Centro Stefano Franscini on Monte Verit'a, Ascona, Switzerland, from June 17 to 19, 1999. It was organized byETH Zurich, sponsored byETH, the Centro Stefano Franscini, the Swiss National Science Foundation, and Swissphone. The workshop looks back on a remarkable tradition of a quarter century, with predecessors organized at various places in Europe. WG'99 has been an insp- ing mix of questions from theoryand practice, and of 74 young scientists and established researchers from all over the world, including Bangladesh, Belgium, Canada, the Czech Republic, France, Germany, Israel, Italy, Japan, Korea, the Netherlands, Russia, the Slovak Republic, Spain, Sweden, Switzerland, the UK, and the USA. Four invited lectures re?ect the history, theory, practice and this year's s- ting. Hartmut Noltemeier as the onlyone of four founding members of the WG series who served on the program committee throughout the entire historyof WG talked about past achievements and future challenges of WG and of the ?eld.Susanne Albers lectured on the theoryof online algorithms. Thomas Lengauer presented practical packing problems from the textile and car manufacturing industries, as well as their solutions. A workshop held at the Centro Stefano Franscini traditionallyo?ers a talk that is open to the general (Italian speaking) public - Nicola Santoro delivered this Stefano Franscini talk byreporting on computer science, school, and community, as seen from the eye of the storm.

This book constitutes the refereed proceedings of the 4th International Symposium on Stochastic Algorithms: Foundations and Applications, SAGA 2007. The nine revised full papers and five invited papers presented were carefully selected for inclusion in the book. The contributed papers included in this volume cover both theoretical as well as applied aspects of stochastic computations with a special focus on investigating the power of randomization in algorithmics.

This volume constitutes the refereed proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science, MFCS 2012, held in Bratislava, Slovakia, in August 2012. The 63 revised full papers presented together with 8 invited talks were carefully reviewed and selected from 162 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence.

Dieses Buch gibt eine Einführung in Pascal, die auch für Anfänger ohne Informatikkenntnisse verständlich ist. Auf diesem Wege werden die Grundsätze zum Schreiben guter Pascal-Programme illustriert, da es nicht ausreicht, lediglich den Formalisierungsprozess zu erklären, der sich mit dem Programmieren verbindet.