Geodesic

Sommaire du Fascicule no. 1

Unification of Higher-order Patterns modulo Simple Syntactic Equational Theories
Permutations avoiding an increasing number of length-increasing forbidden subsequences
Ordered Vertex Partitioning
Improved inclusion-exclusion identities via closure operators
Avoiding maximal parabolic subgroups of S_k
Sums of Digits, Overlaps, and Palindromes

Sommaire du Fascicule no. 2

The First-Order Theory of Ordering Constraints over Feature Trees
Oriented Multicast Routing Applied to Network Level Agent Search
Linear time recognition of P4-indifference graphs
A permutations representation that knows what "Eulerian" means
P_4-Colorings and P_4-Bipartite Graphs
Analysis of Transmissions Scheduling with Packet Fragmentation
Minimum Eccentricity Multicast Trees
Defect Effect of Bi-infinite Words in the Two-element Case
Simple Equational Specifications of Rational Arithmetic
Asymptotic normality of recursive algorithms via martingale difference arrays
On a hierarchy of Boolean functions hard to compute in constant depth
A note on representations of the finite Heisenberg group and sums of greatest common divisors
Cubic Cayley graphs with small diameter.
Paths of specified length in random k-partite graphs
Finite Automata with Generalized Acceptance Criteria
Benders decomposition for local access network design with two technologies
A Degree-Decreasing Lemma for (MOD_q-MOD_p) Circuits
An Approximate L^p Difference Algorithm for Massive Data Streams
An Efficient Algorithm for the Maximum Distance Problem
The topological entropy of iterated piecewise affine maps is uncomputable
Overlap-free symmetric D0L words