
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
The papers in this volume were presented at the Fourth Italian Conference on Algorithms and Complexity (CIAC 2000). The conference took place on March 1-3, 2000, in Rome (Italy), at the conference center of the University of Rome "La Sapienza". This conference was born in 1990 as a national meeting to be held every three years for Italian researchers in algorithms, data structures, complexity, and parallel and distributed computing. Due to a signi cant participation of foreign reaserchers, starting from the second conference, CIAC evolved into an international conference. In response to the call for papers for CIAC 2000, there were 41 subm- sions, from which the program committee selected 21 papers for presentation at the conference. Each paper was evaluated by at least three program committee members. In addition to the selected papers, the organizing committee invited Giorgio Ausiello, Narsingh Deo, Walter Ruzzo, and Shmuel Zaks to give plenary lectures at the conference. We wish to express our appreciation to all the authors of the submitted papers, to the program committee members and the referees, to the organizing committee, and to the plenary lecturers who accepted our invitation.
This volume presents research papers from the Fourth Italian Conference on Algorithms and Complexity (CIAC 2000). The conference, held in Rome from March 1-3, 2000, served as a platform for Italian and international researchers in algorithms, data structures, complexity, and parallel and distributed computing. The program committee selected 21 papers from 41 submissions after rigorous evaluation by at least three members. In addition to the presented papers, the conference featured plenary lectures by Giorgio Ausiello, Narsingh Deo, Walter Ruzzo, and Shmuel Zaks.
The Authority Perspective: This collection represents a snapshot of research presented at a specialized academic conference, indicating a focus on technical depth and theoretical advancements within the fields of algorithms and complexity. The selection process, involving peer review by multiple committee members, suggests a high standard for the included papers. The presence of invited plenary lectures from established researchers further underscores the conference's academic rigor and its role in disseminating current work in the field.
Page Count:
315
Publication Date:
2000-01-01
ISBN-10:
3540671595
No comments yet. Be the first to share your thoughts!