Algorithms and Complexity
Tiziana Calamoneri (Editor), Guiseppe F. Italiano (Editor), Irene FinocchiBooks.org participates in affiliate programs including Bookshop.org and the Amazon Services LLC Associates Program. We may earn a commission from qualifying purchases made through links on this page, at no additional cost to you.
Overview
Here are the refereed proceedings of the 6th Italian Conference on Algorithms and Computation, CIAC 2006. The 33 revised full papers presented together with 3 invited papers address such topics as sequential, parallel and distributed algorithms, data structures, approximation algorithms, randomized algorithms, on-line algorithms, graph algorithms, analysis of algorithms, algorithm engineering, algorithmic game theory, computational biology, computational complexity, communication networks, computational geometry, cryptography, discrete optimization, graph drawing, mathematical programming, and quantum algorithms.
Synopsis
This book constitutes the refereed proceedings of the 6th Italian Conference on Algorithms and Computation, CIAC 2006, held in Rome, Italy, in May 2006.
The 33 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 80 submissions. Among the topics addressed are sequential, parallel and distributed algorithms, data structures, approximation algorithms, randomized algorithms, on-line algorithms, graph algorithms, analysis of algorithms, algorithm engineering, algorithmic game theory, computational biology, computational complexity, communication networks, computational geometry, cryptography, discrete optimization, graph drawing, mathematical programming, and quantum algorithms.