Rossella Petreschi

Pierluigi Crescenzi

Maurizio Bonuccelli

The papers in this volume were presented at the Second Italian Conference onAlgorithms and Complexity, held in February 1994 in Rome. This biannual conference series is intended to present research contributions in theory and applications of sequential, parallel, and distributed algorithms, data structures, and computational complexity. The volume contains four invited presentations and 14 regular presentations selected from 32 submissions, each of which was evaluated by at least four program committee members. The invited presentations are by J. Hartmanis and S. Chari, A. Garg and R. Tamassia, S.C. Sahinalp and U. Vishkin, and M. Yannakakis.

Second Italian Conference, CIAC '94, Rome, Italy, February 23 - 25, 1994. Proceedings

Algorithms and Complexity

Mohammad Kaykobad

This book constitutes the proceedings of the 10th International Workshop on Algorithms and Computation, WALCOM 2016, held in Kathmandu, Nepal, in March 2016. The 27 full papers presented together with 4 invited talks were carefully reviewed and selected from 68 submissions. The papers cover a wide range of topics such as approximation algorithms, computational complexity, computational geometry, data structures, graph algorithms, graph coloring, graph exploration, and online algorithms.

10th International Workshop, WALCOM 2016, Kathmandu, Nepal, March 29-31, 2016, Proceedings

WALCOM: Algorithms and Computation

Giorgio Ausiello

To examine, analyze, and manipulate a problem to the point of designing an algorithm for solving it is an exercise of fundamental value in many fields. With so many everyday activities governed by algorithmic principles, the power, precision, reliability and speed of execution demanded by users have transformed the design and construction of algorithms from a creative, artisanal activity into a full-fledged science in its own right. This book is aimed at all those who exploit the results of this new science, as designers and as consumers. The first chapter is an overview of the related history, demonstrating the long development of ideas such as recursion and more recent formalizations such as computability. The second chapter shows how the design of algorithms requires appropriate techniques and sophisticated organization of data. In the subsequent chapters the contributing authors present examples from diverse areas – such as routing and networking problems, Web search, information security, auctions and games, complexity and randomness, and the life sciences – that show how algorithmic thinking offers practical solutions and also deepens domain knowledge. The contributing authors are top-class researchers with considerable academic and industrial experience; they are also excellent educators and communicators and they draw on this experience with enthusiasm and humor. This book is an excellent introduction to an intriguing domain and it will be enjoyed by undergraduate and postgraduate students in computer science, engineering, and mathematics, and more broadly by all those engaged with algorithmic thinking.

Rossella Petreschi

Books

Your next favorite book is out there