Some remarks on multihead automata
Space-efficient parallel merging
Spécialisation de la suite de Sturm et sous-résultants (I)
Speeding up the computations on an elliptic curve using addition-subtraction chains
Statistics and computability
Stochastic bottleneck transportation problem with flexible supply and demand quantity
We consider the following bottleneck transportation problem with both random and fuzzy factors. There exist supply points with flexible supply quantity and demand points with flexible demand quantity. For each supply-demand point pair, the transportation time is an independent positive random variable according to a normal distribution. Satisfaction degrees about the supply and demand quantity are attached to each supply and each demand point, respectively. They are denoted by membership functions...
Storing the Subdivision of a Polyhedral Surface.
Straight-line drawings of binary trees with linear area and arbitrary aspect ratio.
Streckenförmigkeit - eine weitere Verallgemeinerung der Sternförmigkeit
Studying graph - stability to apprehend relative hardness of constructive-non-constructive approximation
Summaries of articles published in this issue
Sur la complexité du principe de Tarski-Seidenberg
Sur la complexité du principe de Tarski-Seidenberg
Sur la complexité d'un problème de codage