The SCEAS System
Navigation Menu

Conferences in DBLP

Mathematical Foundations of Computer Science (MFCS) (mfcs)
1984 (conf/mfcs/1984)

  1. José L. Balcázar
    Separating, Strongly Separating, and Collapsing Relativized Complexity Classes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:1-16 [Conf]
  2. Alexander L. Chistov, Dima Grigoriev
    Complexity of Quantifier Elimination in the Theory of Algebraically Closed Fields. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:17-31 [Conf]
  3. Jozef Gruska
    Systolic Automata - Power, Characterizations, Nonhomogeneity. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:32-49 [Conf]
  4. Christoph M. Hoffmann
    A Note on Unique Decipherability. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:50-63 [Conf]
  5. Günter Hotz
    Outline of an Algebraic Language Theory. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:64-79 [Conf]
  6. Matthias Jantzen
    Thue Systems and the Church-Rosser Property. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:80-95 [Conf]
  7. Giuseppe Longo
    Limits, Higher Type Computability and Type-Free Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:96-114 [Conf]
  8. Antoni W. Mazurkiewicz
    Traces, Histories, Graphs: Instances of a Process Monoid. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:115-133 [Conf]
  9. Dominique Perrin
    Recent Results on Automata and Infinite Words. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:134-148 [Conf]
  10. Franco P. Preparata
    VLSI Algorithms and Architectures. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:149-161 [Conf]
  11. Alexei L. Semenov
    Decidability of Monadic Theories. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:162-175 [Conf]
  12. J. Albert
    On the Ehrenfeucht Conjecture on Test Sets and Its Dual Version. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:176-184 [Conf]
  13. José L. Balcázar, Ronald V. Book, Uwe Schöning
    Sparse Oracles, Lowness, and Highness. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:185-193 [Conf]
  14. Joffroy Beauquier, Loÿs Thimonier
    Computability of Probabilistic Parameters for Some Classes of Formal Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:194-204 [Conf]
  15. Franz-Josef Brandenburg
    A Truely Morphic Characterization of Recursively Enumerable Sets. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:205-213 [Conf]
  16. Manfred Broy
    On the Herbrand Kleene Universe for Nondeterministic Computations. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:214-222 [Conf]
  17. Hans-Dieter Burkhard
    An Investigation of Controls for Concurrent Systems by Abstract Control Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:223-231 [Conf]
  18. Anton Cerný
    On Generalized Words of Thue-Morse. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:232-239 [Conf]
  19. Marek Chrobak
    Nondeterminism Is Essential for Two-Way Counter Machines. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:240-244 [Conf]
  20. Gerardo Costa, Colin Stirling
    Weak and Strong Fairness in CCS. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:245-254 [Conf]
  21. Robert P. Daley, Carl H. Smith
    On the Complexity of Inductive Inference (Preliminary Report). [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:255-264 [Conf]
  22. Herbert Edelsbrunner, Emo Welzl
    Monotone Edge Sequences in Line Arrangements and Applications (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:265-272 [Conf]
  23. Patrice Enjalbert, Max Michel
    Many-Sorted Temporal Logic for Multi-Processes Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:273-281 [Conf]
  24. Z. Habasinski
    Process Logics: Two Decidability Results. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:282-290 [Conf]
  25. Armin Hemmerling, Klaus Kriegel
    On Searching of Special Cases of Mazes and Finite Embedded Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:291-300 [Conf]
  26. Matthew Hennessy, Colin Stirling
    The Power of the Future Perfect in Program Logics. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:301-311 [Conf]
  27. Juraj Hromkovic
    Hierarchy of Reversal and Zerotesting Bounded Multicounter Machines. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:312-321 [Conf]
  28. Juraj Hromkovic
    On the Power of Alternation in Finite Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:322-329 [Conf]
  29. Oscar H. Ibarra, Louis E. Rosier
    The Equivalence Problem and Correctness Formulas for a Simple Class of Programs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:330-338 [Conf]
  30. Jerzy W. Jaromczyk
    Lower Bounds for Polygon Simplicity Testing and Other Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:339-347 [Conf]
  31. Max I. Kanovic
    A Uniform Independence of Invariant Sentences. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:348-354 [Conf]
  32. Juhani Karhumäki, H. C. M. Kleijn
    On the Equivalence of Compositions of Morphisms and Inverse Morphisms on Regular Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:355-363 [Conf]
  33. Wojciech Kowalczyk
    Some Connections between Representability of Complexity Classes and the Power of Formal Systems of Reasoning. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:364-369 [Conf]
  34. Ludek Kucera
    Finding a Maximum Flow in /S, T/-Planar Network in Linear Expected Time. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:370-377 [Conf]
  35. Klaus-Jörn Lange
    Nondeterministic Logspace Reductions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:378-388 [Conf]
  36. Arjen K. Lenstra
    Factoring Multivariate Polynomials over Algebraic Number Fields. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:389-396 [Conf]
  37. Giuseppe Longo, Eugenio Moggi
    Gödel Numberings, Principal Morphisms, Combinatory Algebras: A Category-theoretic Characterization of Functional Completeness. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:397-406 [Conf]
  38. Aldo de Luca, Antonio Restivo
    Representations lf Integers and Language Theory. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:407-415 [Conf]
  39. Jaroslav Morávek, Pavel Pudlák
    New Lower Bound for Polyhedral Membership Problem with an Application to Linear Programming. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:416-424 [Conf]
  40. A. Sh. Nepomnjashchaja
    Decidability of the Equivalence Problem for Synchronous Deterministic Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:425-432 [Conf]
  41. Rocco De Nicola
    Models and Operators for Nondeterministic Processes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:433-442 [Conf]
  42. B. John Oommen
    Algorithms for String Editing which Permit Arbitrarily Complex Editing Constraints. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:443-451 [Conf]
  43. Pekka Orponen, Uwe Schöning
    The Structure of Polynomial Complexity Cores (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:452-458 [Conf]
  44. Thomas Ottmann, Peter Widmayer
    Solving Visibility Problems by Using Skeleton Structures. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:459-470 [Conf]
  45. Axel Poigné
    Another Look at Parameterization Using Algebras with Subsorts. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:471-479 [Conf]
  46. Pavel Pudlák
    A Lower Bound on Complexity of Branching Programs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:480-489 [Conf]
  47. Jan Reiterman, Vera Trnková
    From Dynamic Algebras to Test Algebras. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:490-497 [Conf]
  48. J. M. Robson
    Combinatorial Games with Exponential Space Complete Decision Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:498-506 [Conf]
  49. Wojciech Rytter
    Fast Recognition of Pushdown Automaton and Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:507-515 [Conf]
  50. Peter H. Starke
    Multiprocessor Systems and Their Concurrency. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:516-525 [Conf]
  51. Andrzej Tarlecki
    Free Constructions in Algebraic Institutions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:526-534 [Conf]
  52. Jerzy Tiuryn, Pawel Urzyczyn
    Remarks on Comparing Expressive Power of Logics of Programs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:535-543 [Conf]
  53. K. Wagner
    The Complexity of Problems Concerning Graphs with Regularities (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:544-552 [Conf]
  54. Ingo Wegener
    On the Complexity of Slice Functions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:553-561 [Conf]
  55. Stanislav Zák
    An Exponential Lower Bound for One-Time-Only Branching Programs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:562-566 [Conf]
  56. Michael Sipser
    A Topological View of Some Problems in Complexity Theory. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:567-572 [Conf]
  57. Ryszard Danecki
    Propositional Dynamic Logic with Strong Loop Predicate. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:573-581 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002