8. FCT 1991:
Gosen near Berlin,
Germany
Lothar Budach (Ed.):
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 BibTeX
@proceedings{DBLP:conf/fct/1991,
editor = {Lothar Budach},
title = {Fundamentals of Computation Theory, 8th International Symposium,
FCT '91, Gosen, Germany, September 9-13, 1991, Proceedings},
booktitle = {FCT},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {529},
year = {1991},
isbn = {3-540-54458-5},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Invited Lectures
Communications
- Christel Baier, Mila E. Majster-Cederbaum:
The Consistency of a Noninterleaving and an Interleaving Model for Full TCSP.
105-120 BibTeX
- Bernd Bank, Teresa Krick, Reinhard Mandel, Pablo Solernó:
A Gemometrical Bound for Integer Programming with Polynomial Constraints.
121-125 BibTeX
- Elena Barcucci, Renzo Pinzani, E. Rodella, Renzo Sprugnoli:
A Characterization of Binary Search Networks.
126-135 BibTeX
- 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.
136-145 BibTeX
- Luca Breveglieri, Claudio Citrini, Stefano Crespi-Reghizzi:
Deterministic Dequeue Automata and LL(1) Parsing of Breadth-Depth Grammars.
146-156 BibTeX
- Danilo Bruschi, Giovanni Pighizzini:
The Complexity of Computing Maximal Word Functions.
157-167 BibTeX
- Gerhard Buntrock, Birgit Jenner, Klaus-Jörn Lange, Peter Rossmanith:
Unambiguity and Fewness for Logarithmic Space.
168-179 BibTeX
- Marc Chardin:
Differential Resultants and Subresultants.
180-189 BibTeX
- Bogdan S. Chlebus, Imrich Vrto:
Unifying Binary-Search Trees and Permutations.
190-199 BibTeX
- Jürgen Dassow, Klaus-Jörn Lange:
Computational Calculus and Hardest Languages of Automata with Abstract Storages.
200-209 BibTeX
- Emanuela Fachini, Angelo Monti, Margherita Napoli, Domenico Parente:
Systolic Y-Tree Automata: Closure Properties and Decision Problems.
210-219 BibTeX
- Hans Dietmar Gröger:
A New Partition Lemma for Planar Graphs and Its Application to Circuit Complexity.
220-229 BibTeX
- Thomas Hofmeister, Walter Hohberg, Susanne Köhling:
Some Notes on Threshold Circuits, and Multiplication in Depth 4.
230-239 BibTeX
- Juraj Hromkovic:
Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear Separators (Extended Abstract).
240-247 BibTeX
- Oscar H. Ibarra, Nicholas Q. Trân:
On Space-bounded Synchronized Alternating Turing Machines.
248-257 BibTeX
- Antoine Joux, Jacques Stern:
Improving the Critical Density of the Lagarias-Odlyzko Attack Against Subset Sum Problems.
258-264 BibTeX
- Stasys Jukna:
Optimal versus Stable in Boolean Formulae.
265-274 BibTeX
- Michael Kaib:
The Gauß Lattice Basis Reduction Algorithm Succeeds With Any Norm.
275-286 BibTeX
- Janis Kaneps:
Regularity of One-Letter Languages Acceptable by 2-Way Finite Probabilistic Automata.
287-296 BibTeX
- Peter M. W. Knijnenburg, Joost N. Kok:
On the Semantics of Atomized Statements - the Parallel-Choice Option (Extended Abstract).
297-306 BibTeX
- Emmanuel Kounalis, Michaël Rusinowitch:
Automatic Proof Methods for Algebraic Specifications.
307-317 BibTeX
- Dieter Kratsch, Lane A. Hemachandra:
On the Complexity of Graph Reconstruction.
318-328 BibTeX
- Christos Levcopoulos, Ola Petersson:
An Optimal Adaptive In-place Sorting Algorithm.
329-338 BibTeX
- Guy Louchard, Claire Kenyon, René Schott:
Data Structures Maxima.
339-349 BibTeX
- Conrado Martinez:
Average-case Analysis of Equality of Binary Trees Under the BST Probability Model.
350-359 BibTeX
- Jean Neraud:
On the Subsets of Rank Two in a Free Monoid: A Fast Decision Algorithm (Extended Abstract).
360-369 BibTeX
- Wojciech Plandowski, Wojciech Rytter, Tomasz Szymacha:
Exact Analysis of Three Tree Contraction Algorithms.
370-379 BibTeX
- Kai Salomaa, Sheng Yu:
Degrees of Nondeterminism for Pushdown Automata.
380-389 BibTeX
- Heiko Schröder, Ondrej Sýkora, Imrich Vrto:
Optimal Embedding of a Toroidal Array in a Linear Array.
390-394 BibTeX
- Dietmar Uhlig:
Boolean Functions with a Large Number of Subfunctions and Small Complexity and Depth.
395-404 BibTeX
- Radhakrishna S. Valiveti, B. John Oommen, Jack R. Zgierski:
Adaptive Linear List Reorganization for a System Processing Set Queries.
405-414 BibTeX
- Egon Wanke:
On the Decidability of Integer Subgraph Problems on Context-Free Graph Languages.
415-426 BibTeX
Copyright © Sat May 16 23:11:57 2009
by Michael Ley (ley@uni-trier.de)