Geodesic

Sommaire du Fascicule no. 1

ICTCS 09 Foreword
p. 1-2
Idealized coinductive type systems for imperative object-oriented programs
p. 3-33
Enumerated type semantics for the calculus of looping sequences
p. 35-58
Hopcroft's algorithm and tree-like automata
p. 59-75
Consensual languages and matching finite-state computations
p. 77-97
An introduction to quantum annealing
p. 99-116
The compositional construction of Markov processes II
p. 117-142
Extending the lambda-calculus with unbind and rebind
p. 143-162
Strategies to scan pictures with automata based on Wang tiles
p. 163-180

Sommaire du Fascicule no. 2

An improved derandomized approximation algorithm for the max-controlled set problem
p. 181-196
On the parameterized complexity of approximate counting
p. 197-223
Unique decipherability in the additive monoid of sets of numbers
p. 225-234
Normalization of edit sequences for text synchronization
p. 235-248
Advice Complexity and Barely Random Algorithms
p. 249-267

Sommaire du Fascicule no. 3

Deciding knowledge in security protocols under some e-voting theories
p. 269-299
The Fibonacci automorphism of free Burnside groups
p. 301-309
Locally catenative sequences and Turtle graphics
p. 311-330
A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation
p. 331-346
Construction of tree automata from regular expressions
p. 347-370

Sommaire du Fascicule no. 4

In memoriam: Philippe Flajolet, the father of analytic combinatorics
p. 371-373
The cyclicity problem for the images of Q-rational series
p. 375-381
Some problems in automata theory which depend on the models of set theory
p. 383-397
Square-root rule of two-dimensional bandwidth problem
p. 399-411
CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store
p. 413-448
Recursive algorithm for parity games requires exponential time
p. 449-457
Closure properties of hyper-minimized automata
p. 459-466
Corrigendum: On multiperiodic words
p. 467-469