default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID5th FCT 1985: Cottbus, Germany
- Lothar Budach:
Fundamentals of Computation Theory, FCT '85, Cottbus, GDR, September 9-13, 1985. Lecture Notes in Computer Science 199, Springer 1985, ISBN 3-540-15689-5 - Maris Alberts:
Space complexity of alternating Turing machines. 1-7 - Hajnal Andréka, Irène Guessarian, István Németi:
A unifying theorem for algebraic semantics and dynamic logics. 8-17 - José L. Balcázar, Josep Díaz, Joaquim Gabarró:
On some "non-uniform" complexity measures. 18-27 - Frank Bauernöppel
, Hermann Jung:
Fast parallel vertex colouring. 28-35 - Danièle Beauquier:
Muller automata and bi-infinite words. 36-43 - Joffroy Beauquier, Loÿs Thimonier:
On formal languages, probabilities, paging and decoding algorithms. 44-52 - Andreas Brandstädt, Dieter Kratsch:
On the restriction of some NP-complete graph problems to permutation graphs. 53-62 - Alexander L. Chistov:
Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic. 63-69 - Bogdan S. Chlebus:
Algorithms solving path systems. 70-79 - Max Dauchet, Sophie Tison:
Decidability of confluence for ground term rewriting systems. 80-89 - Paul E. Dunne:
Lower bounds on the complexity of 1-time only branching programs. 90-99 - Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
On coordinated rewriting. 100-111 - Philippe Flajolet:
Elements of a general theory of combinatorial structures. 112-127 - Marie-Paule Flé, Gérard Roucairol:
A language theoretic approach to serialization problem in concurrent systems. 128-145 - Gudmund Skovbjerg Frandsen:
Logic programming and substitutions. 146-158 - Thomas Gundermann:
A lower bound on the oscillation complexity of context-free languages. 159-166 - Hermann Jung:
Depth efficient transformations of arithmetic into Boolean circuits. 167-174 - Rainer Kemp:
Free cost measures of trees. 175-190 - A. D. Korshunov:
Discrete extremal problems on covering. 191-207 - Václav Koubek, Jana Krsnakova:
Parallel algorithms for connected components in a graph. 208-217 - Ivan Kramosil:
Statistical testing of finite sequences based on algorithmic complexity. 218-226 - Klaus Kriegel, Stephan Waack:
Lower bounds for Boolean formulae of depth 3 and the topology of the n-cube (preliminary version). 227-233 - Mirko Krivánek, Jaroslav Morávek:
Clustering to minimize the sum of volumes of convex hulls of clusters is NP-complete. 234-241 - Mirko Krivánek, Jaroslav Morávek:
Linear comparison complexity of the n-cube membership problem. 242-248 - Klaus-Jörn Lange, Emo Welzl:
String grammars with disconnecting. 249-256 - Jan van Leeuwen, Jirí Wiedermann:
Array processing machines. 257-268 - Christos Levcopoulos:
A fast heuristic for covering polygons by rectangles. 269-278 - G. S. Makanin:
On the decidability of the theory of free groups (in Russian) = К Вопросу О Раэрещимости Теории Свободной Группы. 279-284 - Stuart W. Margolis, Jean-Eric Pin:
Products of group languages. 285-299 - Burkhard Monien:
The complexity of embedding graphs into binary trees. 300-309 - M. A. Nait Abdallah:
On some topological properties of logic programs. 310-319 - Evelyn Nelson:
Recent results on continuous ordered algebras. 320-330 - R. G. Nigmatullin:
Are lower bounds on the complexity lower bounds for universal circuits. 331-340 - John H. Reif:
Probabilistic algorithms in group theory. 341-350 - Christophe Reutenauer:
Recent results on codes. 351-360 - Louis E. Rosier, Hsu-Chun Yen:
A multiparameter analysis of the boundedness problem for vector addition systems. 361-370 - Brigitte Rozoy:
About two-way transducers. 371-379 - Wojciech Rytter:
Parallel time O(log n) recognition of unambiguous CFLs. 380-389 - Horst Sachs:
On colour critical graphs. 390-401 - Patrice Séébold:
Generalized Thue-Morse sequences. 402-411 - Detlef Seese:
Tree-partite graphs and the complexity of algorithms. 412-421 - Helmut Seidl:
A quadratic regularity test for non-deleting macro S grammars. 422-430 - Andrzej Tarlecki, Martin Wirsing:
Continuous abstract data types: basic machinery and results. 431-441 - Valery A. Vardanian:
On the length of single dynamic tests for monotone Boolean functions. 442-449 - Gérard Viennot:
Enumerative combinatorics and algebraic languages. 450-464 - Lutz Voelkel:
On several kinds of space-bounded on-line multicounter automata. 465-473 - Heiko Vogler:
Iterated linear control and iterated one-turn pushdowns. 474-483 - Gerd Wechsung:
On the Boolean closure of NP. 485-493 - Ingo Wegener:
The critical complexity of all (monotone) Boolean functions and monotone graph properties. 494-502 - Th. Zink:
Degeneration of Shimura surfaces and a problem in coding theory. 503-511 - Solomon Passy, Tinko Tinchev:
Quantifiers in combinatory PDL: completeness, definability, incompleteness. 512-519 - Pierpaolo Degano, Rocco De Nicola, Ugo Montanari:
Partial ordering derivations for CCS. 520-533 - Kurt Mehlhorn, Klaus Simon:
Intersecting two polyhedra one of which is convex. 534-542
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-11-20 00:13 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:
