default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8th FCT 1991: Gosen near Berlin, Germany
- 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
Invited Lectures
- Eric Allender
, Vivek Gore:
On Strong Separations from AC0 (Extended Abstract). 1-15 - Johannes A. Buchmann:
Number Theoretic Algorithms and Cryptology. 16-21 - Jin-yi Cai:
Computations Over Infinite Groups. 22-32 - Stefan Heinrich:
Efficiency of Monte Carlo Algorithms in Numerical Analysis. 33-44 - Marek Karpinski:
Approximation Algorithms for Counting Problems in Finite Fields. 45-46 - Alexander A. Razborov:
Lower Bounds for Deterministic and Nondeterministic Branching Programs. 47-60 - Rüdiger Reischuk:
Graph Theoretical Methods for the Design of Parallel Algorithms. 61-67 - Claus-Peter Schnorr, M. Euchner:
Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems. 68-85 - Joseph F. Traub:
Information-Based Complexity: Recent Results and Open Problems. 86-88 - György Turán:
A Survey of Some Aspects of Computational Learning Theory (Extended Abstract). 89-103 - Andrew Chi-Chih Yao:
Recent Progress in Circuit and Communication Complexity (Abstract). 104
Communications
- Christel Baier, Mila E. Majster-Cederbaum:
The Consistency of a Noninterleaving and an Interleaving Model for Full TCSP. 105-120 - Bernd Bank, Teresa Krick, Reinhard Mandel, Pablo Solernó:
A Gemometrical Bound for Integer Programming with Polynomial Constraints. 121-125 - Elena Barcucci, Renzo Pinzani, E. Rodella, Renzo Sprugnoli:
A Characterization of Binary Search Networks. 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. 136-145 - Luca Breveglieri, Claudio Citrini, Stefano Crespi-Reghizzi:
Deterministic Dequeue Automata and LL(1) Parsing of Breadth-Depth Grammars. 146-156 - Danilo Bruschi, Giovanni Pighizzini:
The Complexity of Computing Maximal Word Functions. 157-167 - Gerhard Buntrock, Birgit Jenner, Klaus-Jörn Lange, Peter Rossmanith:
Unambiguity and Fewness for Logarithmic Space. 168-179 - Marc Chardin:
Differential Resultants and Subresultants. 180-189 - Bogdan S. Chlebus, Imrich Vrto:
Unifying Binary-Search Trees and Permutations. 190-199 - Jürgen Dassow, Klaus-Jörn Lange:
Computational Calculus and Hardest Languages of Automata with Abstract Storages. 200-209 - Emanuela Fachini, Angelo Monti, Margherita Napoli, Domenico Parente:
Systolic Y-Tree Automata: Closure Properties and Decision Problems. 210-219 - Hans Dietmar Gröger:
A New Partition Lemma for Planar Graphs and Its Application to Circuit Complexity. 220-229 - Thomas Hofmeister, Walter Hohberg, Susanne Köhling:
Some Notes on Threshold Circuits, and Multiplication in Depth 4. 230-239 - Juraj Hromkovic:
Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear Separators (Extended Abstract). 240-247 - Oscar H. Ibarra, Nicholas Q. Trân:
On Space-bounded Synchronized Alternating Turing Machines. 248-257 - Antoine Joux, Jacques Stern:
Improving the Critical Density of the Lagarias-Odlyzko Attack Against Subset Sum Problems. 258-264 - Stasys Jukna:
Optimal versus Stable in Boolean Formulae. 265-274 - Michael Kaib:
The Gauß Lattice Basis Reduction Algorithm Succeeds With Any Norm. 275-286 - Janis Kaneps:
Regularity of One-Letter Languages Acceptable by 2-Way Finite Probabilistic Automata. 287-296 - Peter M. W. Knijnenburg, Joost N. Kok:
On the Semantics of Atomized Statements - the Parallel-Choice Option (Extended Abstract). 297-306 - Emmanuel Kounalis, Michaël Rusinowitch:
Automatic Proof Methods for Algebraic Specifications. 307-317 - Dieter Kratsch, Lane A. Hemachandra:
On the Complexity of Graph Reconstruction. 318-328 - Christos Levcopoulos, Ola Petersson:
An Optimal Adaptive In-place Sorting Algorithm. 329-338 - Guy Louchard, Claire Kenyon, René Schott:
Data Structures Maxima. 339-349 - Conrado Martinez:
Average-case Analysis of Equality of Binary Trees Under the BST Probability Model. 350-359 - Jean Néraud:
On the Subsets of Rank Two in a Free Monoid: A Fast Decision Algorithm (Extended Abstract). 360-369 - Wojciech Plandowski, Wojciech Rytter, Tomasz Szymacha:
Exact Analysis of Three Tree Contraction Algorithms. 370-379 - Kai Salomaa, Sheng Yu:
Degrees of Nondeterminism for Pushdown Automata. 380-389 - Heiko Schröder, Ondrej Sýkora, Imrich Vrto:
Optimal Embedding of a Toroidal Array in a Linear Array. 390-394 - Dietmar Uhlig:
Boolean Functions with a Large Number of Subfunctions and Small Complexity and Depth. 395-404 - Radhakrishna S. Valiveti, B. John Oommen, Jack R. Zgierski:
Adaptive Linear List Reorganization for a System Processing Set Queries. 405-414 - Egon Wanke:
On the Decidability of Integer Subgraph Problems on Context-Free Graph Languages. 415-426
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-03-11 19:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
