Volume 180,
Numbers 1-2,
10 June 1997
- Marina Madonia, Stefano Varricchio:
Some Decisional Problems on Rational Relations.
1-15
- Vikraman Arvind, N. V. Vinodchandran:
Solvable Black-Box Group Problems are Low for PP.
17-45
- Kazuhisa Hosaka, Yasuhiko Takenaga, T. Kaneda, Shuzo Yajima:
Size of Ordered Binary Decision Diagrams Representing Threshold Functions.
47-60
- Frédérique Bassino:
Nonnegative Companion Matrices and Star-Height of N-Rational Series.
61-80
- Emmanuelle Garel:
Séparateurs dans les mots infinis engendrés par morphismes.
81-113
- Marie-France Sagot, Alain Viari, Henry Soldano:
Multiple Sequence Comparison - A Peptide Matching Approach.
115-137
- Hiroaki Yamamoto:
On the Power of Alternation on Reversal-Bounded Alternating Turing Machines with a Restriction.
139-154
- Zhixiang Chen, Steven Homer:
Learning Counting Functions with Queries.
155-168
- Hong Shen, Weifa Liang:
Efficient Enumeration of all Minimal Separators in a Graph.
169-180
- Carl Pomerance, John Michael Robson, Jeffrey Shallit:
Automaticity II: Descriptional Complexity in the Unary Case.
181-201
- Vitus J. Leung:
The Undecidability of the Unrestricted Modified Edit Distance.
203-215
- Dima Grigoriev:
Testing Shift-Equivalence of Polynomials by Deterministic, Probabilistic and Quantum Machines.
217-228
- Martín Matamala:
Alternation on Cellular Automata.
229-241
- Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim:
Optimal Bounds for the Approximation of Boolean Functions and Some Applications.
243-268
- Vassilis Giakoumakis, Jean-Marie Vanherpe:
On Extended P4-Reducible and Extended P4-Sparse Graphs.
269-286
- Bruno Codenotti, Biswa N. Datta, Karabi Datta, Mauro Leoncini:
Parallel Algorithms for Certain Matrix Computations.
287-308
- Marek Karpinski, Lawrence L. Larmore, Wojciech Rytter:
Correctness of Constructing Optimal Alphabetic Trees Revisited.
309-324
- Pierre Péladeau, Howard Straubing, Denis Thérien:
Finite Semigroup Varieties Defined by Programs.
325-339
Short Notes
Copyright © Fri Mar 12 17:33:09 2010
by Michael Ley (ley@uni-trier.de)
