- Jean Néraud
:
On the Subsets of Rank Two in a Free Monoid: A Fast Decision Algorithm (Extended Abstract). FCT 1991: 360-369 - Wojciech Plandowski, Wojciech Rytter, Tomasz Szymacha:
Exact Analysis of Three Tree Contraction Algorithms. FCT 1991: 370-379 - Alexander A. Razborov:
Lower Bounds for Deterministic and Nondeterministic Branching Programs. FCT 1991: 47-60 - Rüdiger Reischuk:
Graph Theoretical Methods for the Design of Parallel Algorithms. FCT 1991: 61-67 - Kai Salomaa, Sheng Yu:
Degrees of Nondeterminism for Pushdown Automata. FCT 1991: 380-389 - Claus-Peter Schnorr, M. Euchner:
Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems. FCT 1991: 68-85 - Heiko Schröder, Ondrej Sýkora, Imrich Vrto:
Optimal Embedding of a Toroidal Array in a Linear Array. FCT 1991: 390-394 - Joseph F. Traub:
Information-Based Complexity: Recent Results and Open Problems. FCT 1991: 86-88 - György Turán:
A Survey of Some Aspects of Computational Learning Theory (Extended Abstract). FCT 1991: 89-103 - Dietmar Uhlig:
Boolean Functions with a Large Number of Subfunctions and Small Complexity and Depth. FCT 1991: 395-404 - Radhakrishna S. Valiveti, B. John Oommen, Jack R. Zgierski:
Adaptive Linear List Reorganization for a System Processing Set Queries. FCT 1991: 405-414 - Egon Wanke:
On the Decidability of Integer Subgraph Problems on Context-Free Graph Languages. FCT 1991: 415-426 - Andrew Chi-Chih Yao:
Recent Progress in Circuit and Communication Complexity (Abstract). FCT 1991: 104 - Lothar Budach:
Fundamentals of Computation Theory, 8th International Symposium, FCT '91, Gosen, Germany, September 9-13, 1991, Proceedings. Lecture Notes in Computer Science 529, Springer 1991, ISBN 3-540-54458-5 [contents]
