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