The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Giorgio Ausiello
    On the Structure and Properties of NP-Complete Problems and Their Associated Optimization Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:1-16 [Conf]
  2. Andrzej Blikle
    A Comparative Review of Some Program Verification Methods. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:17-33 [Conf]
  3. Luc Boasson
    Classification of the Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:34-43 [Conf]
  4. Calvin C. Elgot
    Finite Automaton from a Flowchart Scheme Point of View. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:44-51 [Conf]
  5. Erwin Engeler
    A New Type of Models of Computation. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:52-58 [Conf]
  6. Andrei P. Ershov, V. E. Itkin
    Correctness of Mixed Computation in Algol-Like Programs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:59-77 [Conf]
  7. Ferenc Gécseg, Péter E.-Tóth
    Algebra and Logic in Theoretical Computer Science. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:78-92 [Conf]
  8. Boleslaw Z. Kacewicz, Henryk Wozniakowski
    A Survey of Recent Problems and Results in Analytic Computational Complexity. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:93-107 [Conf]
  9. Hermann A. Maurer, Thomas Ottmann
    Tree-Structures for Set Manipulation Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:108-121 [Conf]
  10. Andrzej Salwicki
    Applied Algorithmic Logic. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:122-134 [Conf]
  11. Claus-Peter Schnorr
    Improved Lower Bounds on the Number of Multiplications/Divisions Which Are Necessary to Evaluate Polynomials. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:135-147 [Conf]
  12. Boris A. Trakhtenbrot
    Frequency Algorithms and Computations. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:148-161 [Conf]
  13. Leslie G. Valiant
    Graph-Theoretic Arguments in Low-Level Complexity. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:162-176 [Conf]
  14. Gerd Wechsung
    Properties of Complexity Classes: A Short Survey. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:177-191 [Conf]
  15. Jesse B. Wright, Eric G. Wagner, James W. Thatcher
    A Uniform Approach to Inductive Posets and Inductive Closure. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:192-212 [Conf]
  16. Valery N. Agafonov
    Generalized Probabilistic Grammars. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:213-221 [Conf]
  17. Giorgio Ausiello, Alessandro D'Atri, Marco Gaudiano, Marco Protasi
    Classes of Structurally Isomorphic {NP}-Optimization Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:222-230 [Conf]
  18. Jean-Michel Autebert
    Pushdown-Automata and Families of Languages Generating Cylinders. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:231-239 [Conf]
  19. J. W. de Bakker
    Semantics of Infinite Processes Using Generalized Trees. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:240-246 [Conf]
  20. Václav Benda, Kamila Bendová
    Characterization of Recognizable Families by Means of Regular Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:247-252 [Conf]
  21. Alberto Bertoni, Giancarlo Mauri, Mauro Torelli
    An Algebraic Approach to Problem Solution and Problem Semantics. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:253-262 [Conf]
  22. Anton Cerný
    Complexity and Minimality of Context-Free Grammars and Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:263-271 [Conf]
  23. Michal Chytil
    Comparison of the Active Visiting and the Crossing Complexities. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:272-281 [Conf]
  24. Petr Hájek
    Arithmetical Complexity of Some Problems in Computer Science. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:282-287 [Conf]
  25. Friedrich W. von Henke
    Formal Transformations and the Development of Programs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:288-296 [Conf]
  26. Sándor Horváth
    Optimal RAS Programs for Arbitrarily Complex 0-1 Valued Functions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:297-302 [Conf]
  27. Theo M. V. Janssen, Peter van Emde Boas
    The Expressive Power of Intensional Logic in the Semantics of Programming Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:303-311 [Conf]
  28. Max I. Kanovic
    On the Complexity of Equivalent Transformations in Programming Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:312-314 [Conf]
  29. Victor N. Kasyanov, Sergei B. Pokrovsky
    Schematology in a Multi-Language Optimizer. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:315-323 [Conf]
  30. Ivan Korec
    Decidability (Undecidability) of Equivalence of Minsky Machines with Components Consisting of at Most Seven (Eight) Instructions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:324-332 [Conf]
  31. Jaroslav Král
    A Top-Down No Backtrack Parsing of General Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:333-341 [Conf]
  32. Ivan Kramosil
    A Probabilistic Restriction of Branching Plans. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:342-349 [Conf]
  33. Manfred Kudlek, Miroslav Novotný
    Reducing Operators for Normed General Formal Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:350-358 [Conf]
  34. Leonid A. Levin, V. V. V'jugin
    Invariant Properties of Informational Bulks. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:359-364 [Conf]
  35. Matti Linna
    Two Decidability Results for Deterministic Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:365-373 [Conf]
  36. Witold Lipski Jr.
    On the Logic of Incomplete Transformation. [Citation Graph (4, 0)][DBLP]
    MFCS, 1977, pp:374-381 [Conf]
  37. Aldo de Luca, Settimo Termini
    Measures of Ambiguity in the Analysis of Complex Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:382-389 [Conf]
  38. Robert Meersman, Grzegorz Rozenberg
    Two-Level Meta-Controlled Substitution Grammars. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:390-397 [Conf]
  39. Pierangelo Miglioli, Mario Ornaghi
    A Calculus to Build Up Correct Programs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:398-409 [Conf]
  40. Peter A. Ng, Sung Y. Bang
    Another Approach for Proving Program Correctness. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:410-419 [Conf]
  41. Anton Nijholt
    Cover Results and Normal Forms. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:420-429 [Conf]
  42. Jan Peckel
    On a Deterministic Subclass of Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:430-434 [Conf]
  43. Jan Pittl
    Exponential Optimization for the {LLP($k$)} Parsing Method. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:435-442 [Conf]
  44. Franco P. Preparata
    The Medial Axis of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:443-450 [Conf]
  45. Peter Raulefs
    Semantics and Proof Rules for Coroutine Hierarchies in Block-Structured Programming Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:451-459 [Conf]
  46. Grzegorz Rozenberg, Dirk Vermeir
    Acceptors for Iteration Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:460-464 [Conf]
  47. Peter Ruzicka, Juraj Wiedermann
    How Good Is the Adversary Lower Bound? [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:465-474 [Conf]
  48. Stefan Sokolowski
    Total Correctness for Procedures. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:475-483 [Conf]
  49. Ján Sturc
    A Model for Retrieval Systems and Some Mathematical Problems Behind. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:484-492 [Conf]
  50. Ivan Hal Sudborough
    Time and Tape Bounded Auxiliary Pushdown Automata. [Citation Graph (1, 0)][DBLP]
    MFCS, 1977, pp:493-503 [Conf]
  51. Ondrej Sýkora
    A Fast Non-Commutative Algorithm for Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:504-512 [Conf]
  52. Jerzy Tiuryn
    Fixed-Points and Algebras with Infinitely Long Expressions, I. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:513-522 [Conf]
  53. Vera Trnková, Jirí Adámek
    On Languages, Accepted by Machines in the Category of Sets. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:523-531 [Conf]
  54. Mars K. Valiev
    Real Time Computations with Restrictions on Tape Alphabet. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:532-536 [Conf]
  55. Victor Vianu
    The Bodnarchuk Metric Space of Languages and the Topology of the Learning Space. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:537-542 [Conf]
  56. Klaus W. Wagner, Gerd Wechsung
    Complexity Hierarchies of Oracles. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:543-548 [Conf]
  57. Horst Wedde, Józef Winkowski
    Determining Processes by Violations. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:549-559 [Conf]
  58. Reinhold Weicker
    The Influence of the Machine Model on the Time Complexity of Context-Free Language Recognition. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:560-569 [Conf]
  59. Klaus Weihrauch
    A Generalized Computability Thesis (Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:570- [Conf]
  60. Rolf Wiehagen
    Identification of Formal Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:571-579 [Conf]
  61. Joseph A. Goguen, José Meseguer
    Correctness of Recursive Flow Diagram Programs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:580-595 [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