Luca Aceto

Ivan Damgaard

Leslie Ann Goldberg

Magnus M. Halldorsson

Anna Ingolfsdottir

Igor Walukiewicz

ICALP 2008, the 35th edition of the International Colloquium on Automata, Languages and Programming, was held in Reykjavik, Iceland, July 7–11, 2008. ICALP is a series of annual conferences of the European Association for Th- reticalComputer Science(EATCS) which ?rsttook placein 1972.This year,the ICALP program consisted of the established Track A (focusing on algorithms, automata,complexityandgames)andTrackB(focusing onlogic,semanticsand theory of programming), and of the recently introduced Track C (focusing on security and cryptography foundations). In response to the call for papers, the Program Committees received 477 submissions, the highest ever: 269 for Track A, 122 for TrackB and 86 for Track C. Out of these, 126 papers were selected for inclusion in the scienti?c program: 70 papers for Track A, 32 for Track B and 24 for Track C. The selection was made by the Program Committees based on originality, quality, and relevance to theoretical computer science. The quality of the manuscripts was very high indeed, and many deserving papers could not be selected. ICALP 2008 consisted of ?ve invited lectures and the contributed papers.

35th International Colloquium, ICALP 2008 Reykjavik, Iceland, July 7-11, 2008 Proceedings

Automata, Languages and Programming

The two-volume set LNCS 5125 and LNCS 5126 constitutes the refereed proceedings of the 35th International Colloquium on Automata, Languages and Programming, ICALP 2008, held in Reykjavik, Iceland, in July 2008. The 126 revised full papers presented together with 4 invited lectures were carefully reviewed and selected from a total of 407 submissions. The papers are grouped in three major tracks on algorithms, automata, complexity and games, on logic, semantics, and theory of programming, and on security and cryptography foundations. LNCS 5126 contains 56 contributions of track B and track C selected from 208 submissions and 2 invited lectures. The papers for track B are organized in topical sections on bounds, distributed computation, real-time and probabilistic systems, logic and complexity, words and trees, nonstandard models of computation, reasoning about computation, and verification. The papers of track C cover topics in security and cryptography such as theory, secure computation, two-party protocols and zero-knowledge, encryption with special properties/quantum cryptography, various types of hashing, as well as public-key cryptography and authentication.

35th International Colloquium, ICALP 2008 Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II

Klaus Jansen

José D.P. Rolim

R. Ravi

This book constitutes the joint refereed proceedings of the 14th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2011, and the 15th International Workshop on Randomization and Computation, RANDOM 2011, held in Princeton, New Jersey, USA, in August 2011. The volume presents 29 revised full papers of the APPROX 2011 workshop, selected from 66 submissions, and 29 revised full papers of the RANDOM 2011 workshop, selected from 64 submissions. They were carefully reviewed and selected for inclusion in the book. In addition two abstracts of invited talks are included. APPROX focuses on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM is concerned with applications of randomness to computational and combinatorial problems.

14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011, Proceedings

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

University of Warwick. Dept. of Computer Science

Paul W. Goldberg

Cynthia A. Phillips

Gregory B. Sorkin

Abstract: "There has been much recent algorithmic work on the problem of reconstructing the evolutionary history of biological species. Computer virus specialists are interested in finding the evolutionary history of computer viruses -- a virus is often written using code fragments from one or more other viruses, which are its immediate ancestors. A phylogeny for a collection of computer viruses is a directed acyclic graph whose nodes are the viruses and whose edges map ancestors to descendants and satisfy the property that each code fragment is 'invented' only once. To provide a simple explanation for the data, we consider the problem of constructing such a phylogeny with a minimum number of edges. In general this optimization problem is NP-complete; some associated approximation problems are also hard, but others are easy. When tree solutions exist, they can be constructed and randomly sampled in polynomial time."

Constructing Computer Virus Phylogenies

35th International Colloquium, ICALP 2008 Reykjavik, Iceland, July 7-11, 2008, Proceedings

Leslie Ann Goldberg

About

Books

Join the club