IANDC
2008
13 years 4 months ago
2008
Search games are attractive for their correspondence with classical width parameters. For instance, the invisible search number (a.k.a. node search number) of a graph is equal to
IANDC
2008
13 years 4 months ago
2008
IANDC
2008
13 years 4 months ago
2008
In this paper, we study sixteen communication primitives, arising from the combination of four useful programming features: synchronism (synchronous vs asynchronous primitives), a...
IANDC
2008
13 years 4 months ago
2008
IANDC
2008
13 years 4 months ago
2008
We are interested in the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we t...
IANDC
2008
13 years 4 months ago
2008
Recently automated deduction tools have proved to be very effective for detecting attacks on cryptographic protocols. These analysis can be improved, for finding more subtle weakn...
IANDC
2008
13 years 4 months ago
2008
Today's software systems communicate over the Internet using standard protocols that have been heavily scrutinized, providing some assurance of resistance to malicious attack...
IANDC
2008
13 years 4 months ago
2008
We consider preemptive offline and online scheduling on identical machines and uniformly related machines in the hierarchical model, with the goal of minimizing the makespan. In t...
IANDC
2008
13 years 4 months ago
2008
Abstract. Unfortunately the class of transformations computed by nondeleting and linear extended top-down tree transducers [Graehl, Knight: Training Tree Transducers. HLT-NAACL 200...