- 1991
- Eric Allender
, Vivek Gore:
On Strong Separations from AC0 (Extended Abstract). FCT 1991: 1-15 - Christel Baier, Mila E. Majster-Cederbaum:
The Consistency of a Noninterleaving and an Interleaving Model for Full TCSP. FCT 1991: 105-120 - Bernd Bank, Teresa Krick, Reinhard Mandel, Pablo Solernó:
A Gemometrical Bound for Integer Programming with Polynomial Constraints. FCT 1991: 121-125 - Elena Barcucci, Renzo Pinzani, E. Rodella, Renzo Sprugnoli:
A Characterization of Binary Search Networks. FCT 1991: 126-135 - Danièle Beauquier, Maurice Nivat, Damian Niwinski:
About the Effect of the Number of Successful Paths in an Infinite Tree on the Recognizability by a Finite Automaton with Büchi Conditions. FCT 1991: 136-145 - Luca Breveglieri, Claudio Citrini, Stefano Crespi-Reghizzi:
Deterministic Dequeue Automata and LL(1) Parsing of Breadth-Depth Grammars. FCT 1991: 146-156 - Danilo Bruschi, Giovanni Pighizzini:
The Complexity of Computing Maximal Word Functions. FCT 1991: 157-167 - Johannes A. Buchmann:
Number Theoretic Algorithms and Cryptology. FCT 1991: 16-21 - Gerhard Buntrock, Birgit Jenner, Klaus-Jörn Lange, Peter Rossmanith:
Unambiguity and Fewness for Logarithmic Space. FCT 1991: 168-179 - Jin-yi Cai:
Computations Over Infinite Groups. FCT 1991: 22-32 - Marc Chardin:
Differential Resultants and Subresultants. FCT 1991: 180-189 - Bogdan S. Chlebus, Imrich Vrto:
Unifying Binary-Search Trees and Permutations. FCT 1991: 190-199 - Jürgen Dassow, Klaus-Jörn Lange:
Computational Calculus and Hardest Languages of Automata with Abstract Storages. FCT 1991: 200-209 - Emanuela Fachini, Angelo Monti, Margherita Napoli, Domenico Parente:
Systolic Y-Tree Automata: Closure Properties and Decision Problems. FCT 1991: 210-219 - Hans Dietmar Gröger:
A New Partition Lemma for Planar Graphs and Its Application to Circuit Complexity. FCT 1991: 220-229 - Stefan Heinrich:
Efficiency of Monte Carlo Algorithms in Numerical Analysis. FCT 1991: 33-44 - Thomas Hofmeister, Walter Hohberg, Susanne Köhling:
Some Notes on Threshold Circuits, and Multiplication in Depth 4. FCT 1991: 230-239 - Juraj Hromkovic:
Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear Separators (Extended Abstract). FCT 1991: 240-247 - Oscar H. Ibarra, Nicholas Q. Trân:
On Space-bounded Synchronized Alternating Turing Machines. FCT 1991: 248-257 - Antoine Joux, Jacques Stern:
Improving the Critical Density of the Lagarias-Odlyzko Attack Against Subset Sum Problems. FCT 1991: 258-264 - Stasys Jukna:
Optimal versus Stable in Boolean Formulae. FCT 1991: 265-274 - Michael Kaib:
The Gauß Lattice Basis Reduction Algorithm Succeeds With Any Norm. FCT 1991: 275-286 - Janis Kaneps:
Regularity of One-Letter Languages Acceptable by 2-Way Finite Probabilistic Automata. FCT 1991: 287-296 - Marek Karpinski:
Approximation Algorithms for Counting Problems in Finite Fields. FCT 1991: 45-46 - Peter M. W. Knijnenburg, Joost N. Kok:
On the Semantics of Atomized Statements - the Parallel-Choice Option (Extended Abstract). FCT 1991: 297-306 - Emmanuel Kounalis, Michaël Rusinowitch:
Automatic Proof Methods for Algebraic Specifications. FCT 1991: 307-317 - Dieter Kratsch, Lane A. Hemachandra:
On the Complexity of Graph Reconstruction. FCT 1991: 318-328 - Christos Levcopoulos, Ola Petersson:
An Optimal Adaptive In-place Sorting Algorithm. FCT 1991: 329-338 - Guy Louchard, Claire Kenyon, René Schott:
Data Structures Maxima. FCT 1991: 339-349 - Conrado Martinez:
Average-case Analysis of Equality of Binary Trees Under the BST Probability Model. FCT 1991: 350-359
