This book constitutes the refereed proceedings of the 4th International Workshop on Experimental and Efficient Algorithms, WEA 2005, held in Santorini Island, Greece in May 2005. The 47 revised full papers and 7 revised short papers presented together with extended abstracts of 3 invited talks were carefully reviewed and selected from 176 submissions. The book is devoted to the design, analysis, implementation, experimental evaluation, and engineering of efficient algorithms. Among the application areas addressed are most fields applying advanced algorithmic techniques, such as combinatorial optimization, approximation, graph theory, discrete mathematics, scheduling, searching, sorting, string matching, coding, networking, data mining, data analysis, etc.

In the last decade parallel computing has been put forward as the only computational answer to the increasing computational needs arising from very large and complex fluid dynamic problems. Considerable efforts are being made to use parallel computers efficiently to solve several fluid dynamic problems originating in aerospace, climate modelling and environmental applications.Parallel CFD Conferences are international and aim to increase discussion among researchers worldwide.Topics covered in this particular book include typical CFD areas such as turbulence, Navier-Stokes and Euler solvers, reactive flows, with a good balance between both university and industrial applications. In addition, other applications making extensive use of CFD such as climate modelling and environmental applications are also included.Anyone involved in the challenging field of Parallel Computational Fluid Dynamics will find this volume useful in their daily work.

This book constitutes the refereed proceedings of the 8th International Conference on High-Performance Computing and Networking, HPCN Europe 2000, held in Amsterdam, The Netherlands, in May 2000. The 52 revised full papers presented together with 34 revised posters were carefully reviewed for inclusion in the book. The papers are organized in sections on problem solving environments, metacomputing, load balancing, numerical parallel algorithms, virtual enterprises and virtual laboratories, cooperation coordination, Web-based tools for tele-working, monitoring and performance, low-level algorithms, Java in HPCN, cluster computing, data analysis, and applications in a variety of fields.

I wish to welcome all of you to the International Symposium on High Perf- mance Computing 2000 (ISHPC 2000) in the megalopolis of Tokyo. After having two great successes with ISHPC’97 (Fukuoka, November 1997) and ISHPC’99 (Kyoto, May 1999), many people have requested that the symposium would be held in the capital of Japan and we have agreed. I am very pleased to serve as Conference Chair at a time when high p- formance computing (HPC) has a signi?cant in?uence on computer science and technology. In particular, HPC has had and will continue to have a signi?cant - pact on the advanced technologies of the “IT” revolution. The many conferences and symposiums that are held on the subject around the world are an indication of the importance of this area and the interest of the research community. One of the goals of this symposium is to provide a forum for the discussion of all aspects of HPC (from system architecture to real applications) in a more informal and personal fashion. Today we are delighted to have this symposium, which includes excellent invited talks, tutorials and workshops, as well as high quality technical papers.

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...

Summary: This work combines selected papers from a July 2008 workshop held in Cetraro, Italy, with invited papers by international contributors. Material is in sections on algorithms and scheduling, architectures, GRID technologies, cloud technologies, information processing and applications, and HPC and GRID infrastructures for e-science. B&w maps, images, and screenshots are used to illustrate topics such as nondeterministic coordination using S-Net, cloud computing for on-demand grid resource provisioning, grid computing for financial applications, and the evolution of research and education networks and their essential role in modern science. There is no subject index. The book's readership includes computer scientists, IT engineers, and managers interested in the future development of grids, clouds, and large-scale computing. Gentzsch is affiliated with the DEISA Project and Open Grid Forum, Germany.

The abstracts and papers in this volume were presented at the Fifth Annual International Computing and Combinatorics Conference (COCOON ’99), which was held in Tokyo, Japan from July 26 to 28, 1999. The topics cover most aspects of theoretical computer science and combinatorics pertaining to computing. In response to the call for papers, 88 high-quality extended abstracts were submitted internationally, of which 46 were selected for presentation by the p- gram committee. Every submitted paper was reviewed by at least three program committee members. Many of these papers represent reports on continuing - search, and it is expected that most of them will appear in a more polished and complete form in scienti c journals. In addition to the regular papers, this v- ume contains abstracts of two invited plenary talks by Prabhakar Raghavan and Seinosuke Toda. The conference also included a special talk by Kurt Mehlhorn on LEDA (Library of E cient Data types and Algorithms). The Hao Wang Award (inaugurated at COCOON ’97) is given to honor the paper judged by the program committee to have the greatest scienti c merit. The recipients of the Hao Wang Award 1999 were Hiroshi Nagamochi and Tos- hide Ibaraki for their paper \An Approximation for Finding a Smallest 2-Edge- Connected Subgraph Containing a Speci ed Spanning Tree".

This book constitutes the refereed proceedings of the Third International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM'99, held jointly with the Second International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX'99, in Berkeley, California in August 1999. The volume presents 24 revised full papers selected from 44 submissions and four invited contributions. The papers present a wealth of new results and document the state-of-the-art in the areas covered by the workshop.