Afonso Ferreira – författare

Efficient parallel solutions have been found to many problems. Some of them can be obtained automatically from sequential programs, using compilers. However, there is a large class of problems - irregular problems - that lack efficient solutions. IRREGULAR 94 - a workshop organized in Geneva - addressed the problems associated with the derivation of efficient solutions to irregular problems. This work is based on the workshop, draws on the contributions of outstanding scientists to present research in irregular problems, covering aspects ranging from scientific computing, discrete optimization, and automatic extraction of parallelism.

The Symposium on Theoretical Aspects of Computer Science (STACS) is held annually, alternating between France and Germany. The STACS meetings are organized jointly by the Special Interest Group for Theoretical Computer S- ence of the Gesellschaft fu r Informatik (GI) in Germany and the Maison de l'Informatique et des Math ematiques Discr etes (MIMD) in France. STACS2001 was the 18th in this series, held in Dresden, February 15-17, 2001. PreviousSTACS symposia took placein Paris(1984),Saarbr. ucken(1985), Orsay(1986),Passau(1987),Bordeaux(1988),Paderborn(1989),Rouen(1990), Hamburg(1991),Cachan(1992),Wu rzburg(1993),Caen(1994),Mu nchen(1995), Grenoble (1996), Lub .. eck (1997), Paris (1998), Trier (1999), and Lille (2000). It may be worth noting that in 2001 the symposium was held in one of the new states of reunited Germany for the r st time. The proceedings of all of these symposia have been published in the Lecture Notes in Computer Science series of Springer{Verlag. STACS has become one of the most important annual meetings in Europe for the theoretical computer science community.It covers a wide range of topics in the area of foundations of computer science: algorithms and data structures, automata and formallanguages,computationaland structuralcomplexity, logic, veri cation, and current challenges. This year, 153 submissions were received, mostly in electronic form, from more than 30 countries, with a fair portion from non{European countries. We would like to thank Jochen Bern who designed the electronic submission procedure which performed marvelously and was of great help to the program committee.

The Symposium on Theoretical Aspects of Computer Science (STACS) has - come one of the most important annual meetings in Europe for the theoretical computer science community. It covers a wide range of topics in the area of - undationsofcomputerscience:algorithmsanddatastructures,automataand formal languages, computational and structural complexity, logic, veri?cation, and current challenges. STACS 2002, the 19th in this series, was held in Antibes - Juan les Pins, on the French Riviera, March 14-16, 2002. Previous STACS symposia took place in Paris (1984), Saarbruc .. ken (1985), Orsay (1986), Passau (1987), Bordeaux (1988), Paderborn (1989), Rouen (1990), Hamburg (1991), Cachan (1992), Wurzburg .. (1993), Caen (1994), Munc .. hen (1995), Grenoble (1996), Lub .. eck (1997), Paris, (1998), Trier (1999), Lille (2000), and Dresden (2001). The proceedings of all these symposia have been published in the Lecture Notes in Computer Science series of Springer-Verlag. STACS 2002 received 209 submissions from 30 countries, one of the highest numbers of submissions ever, for a European conference on theoretical computer science.They were dispatched to the Program Committee members, and - derwent a thorough review process, where more than 900 reports were written. These reports then served as guidance to the Program Committee, which met on November 16-17, 2001, at the INRIA Sophia Antipolis (near Antibes), France, in order to select the conference program.

This volume presents the proceedings of the First Canada-France Conference on Parallel Computing; despite its name, this conference was open to full international contribution and participation, as shown by the list of contributing authors.This volume consists of in total 22 full papers, either invited or accepted and revised after a thorough reviewing process. All together the papers provide a highly competent perspective on research in parallel algorithms and complexity, interconnection networks and distributed computing, algorithms for unstructured problems, and structured communications from the point of view of parallel and distributed computing.

This book presents the proceedings of the Second International Workshop on Parallel Algorithms for Irregularly Structured Problems, IRREGULAR '95, held in Lyon, France in September 1995. This workshop series addresses issues related to deriving efficient parallel solutions to irregularly structured problems and aims at fostering cooperation between practitioners and theoreticians in the field.Besides three invited papers, 20 full papers and eight short contributions are presented, all selected during a highly competitive refereeing process; the volume is organized in sections on programming methods and compiling techniques, mapping and scheduling, applications, and optimization.

This book constitutes the refereed proceedings of the 4th International Symposium on Solving Irregularly Structured Problems in Parallel, IRREGULAR'97, held in Paderborn, Germany, in June 1997.The 18 revised full papers presented were carefully selected by the program committee for inclusion in the volume; also included are full papers by the five invited speakers. Among the topics covered are discrete algorithms, randomized methods and approximation algorithms, implementations, programming environments, systems and applications, and scheduling and load balancing.