Algorithms and complexity

Algorithms and complexity

by Italian Conference on Algorithms and Complexity (4th 2000 Rome

Book 1767 of Lecture notes in computer science --

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

Discuss Algorithms and complexity with other readers

Join or start a book club for Algorithms and complexity on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Frequently asked questions

How do I join a book club for Algorithms and complexity?

Sign up free on Readfeed, then browse public clubs or start your own club with Algorithms and complexity as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Algorithms and complexity with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Algorithms and complexity with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.