Geodesic

Sommaire du Fascicule no. 1

Relationships among PL, #L, and the determinant
p. 1-21
UET flow shop scheduling with delays
p. 23-30
A category theory approach to conceptual data modeling
p. 31-79
Separating words with machines and groups
p. 81-86

Sommaire du Fascicule no. 2

Preface
ITA
p. 89-90
Bounded queries to arbitrary sets
p. 91-100
Complexity classes between Θ k P and Δ k P
p. 101-121
On the robustness of ALMOST-ℛ
p. 123-133
On sets bounded truth-table reducible to P-selective sets
p. 135-154
Monotonous and randomized reductions to sparse sets
p. 155-179

Sommaire du Fascicule no. 3

A more efficient notion of zigzag stability
p. 181-194
A note concerning the limit distribution of the quicksort algorithm
p. 195-207
The closure under division and a characterization of the recognizable 𝒵-subsets
p. 209-230
Incorporating an implicit time dimension into the relational model and algebra
p. 231-260
Opérateurs de mise en mémoire et types ∀-positifs
p. 261-293

Sommaire du Fascicule no. 4

A Markovian concurrency measure
p. 295-304
Average case analysis of fully dynamic reachability for directed graphs
p. 305-318
Algorithme de Bareiss, algorithme des sous-résultants
p. 319-347
On free inverse monoid languages
p. 349-378

Sommaire du Fascicule no. 5

Decomposing a k-valued transducer into k unambiguous ones
p. 379-413
One-rule semi-Thue systems with loops of length one, two or three
p. 415-429
On the distributed decision-making complexity of the minimum vertex cover problem
p. 431-441
On the Horton-Strahler number for random tries
p. 443-456
On semidirect and two-sided semidirect products of finite 𝒥trivial monoids
p. 457-482

Sommaire du Fascicule no. 6

On codes having no finite completion
p. 483-493
Les automates circulaires biaisés vérifient la conjecture de Černý
p. 495-505
Digital search trees with keys of variable length
p. 507-520
Efficient string matching on packed texts
p. 521-544
On the average minimal prefix-length of the generalized semi-Dycklanguage
p. 545-561