Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=53

• Optimal RASP programs for arbitrarily complex 0-1 valued functions
  Sándor Horváth
  Lecture Notes in Computer Science 53, 1977, pp. 297-302
• The expressive power of intensional logic in the semantics of programming languages
  T.M.V. Janssen, P. van Emde Boas
  Lecture Notes in Computer Science 53, 1977, pp. 303-311
• On the complexity of equivalent transformations in programming languages
  Max I. Kanovic̑
  Lecture Notes in Computer Science 53, 1977, pp. 312-314
• Schematology in a multi-language optimizer
  V.N. Kasyanov, S.B. Pokrovsky
  Lecture Notes in Computer Science 53, 1977, pp. 315-323
• Decidability (undecidability) of equivalence of Minsky machines with components consisting of at most seven (eight) instructions
  Ivan Korec
  Lecture Notes in Computer Science 53, 1977, pp. 324-332
• A top-down no backtrack parsing of general context-free languages
  Jaroslav Král
  Lecture Notes in Computer Science 53, 1977, pp. 333-341
• A probabilistic restriction of branching plans
  Ivan Kramosil
  Lecture Notes in Computer Science 53, 1977, pp. 342-349
• Reducing operators for normed general formal systems
  Manfred Kudlek, Miroslav Novotný
  Lecture Notes in Computer Science 53, 1977, pp. 350-358
• Invariant properties of informational bulks
  L.A. Levin, V.V. V'jugin
  Lecture Notes in Computer Science 53, 1977, pp. 359-364
• Two decidability results for deterministic pushdown automata
  Matti Linna
  Lecture Notes in Computer Science 53, 1977, pp. 365-373
• On the logic of incomplete information
  Witold, Jr. Lipski
  Lecture Notes in Computer Science 53, 1977, pp. 374-381
• Measures of ambiguity in the analysis of complex systems
  Aldo De Luca, Settimo Termini
  Lecture Notes in Computer Science 53, 1977, pp. 382-389
• Two-level meta-controlled substitution grammars
  R. Meersman, G. Rozenberg
  Lecture Notes in Computer Science 53, 1977, pp. 390-397
• A calculus to build up correct programs
  P.A. Miglioli, M. Ornaghi
  Lecture Notes in Computer Science 53, 1977, pp. 398-409
• Another approach for proving program correctness
  Peter A. Ng, Sung Y. Bang
  Lecture Notes in Computer Science 53, 1977, pp. 410-419
• Cover results and normal forms
  Anton Nijholt
  Lecture Notes in Computer Science 53, 1977, pp. 420-429
• On a deterministic subclass of context-free languages
  Jan Peckel
  Lecture Notes in Computer Science 53, 1977, pp. 430-434
• Exponential optimization for the LLP(k) parsing method
  Jan Pittl
  Lecture Notes in Computer Science 53, 1977, pp. 435-442
• The medial axis of a simple polygon
  F.P. Preparata
  Lecture Notes in Computer Science 53, 1977, pp. 443-450
• Semantics and proof rules for coroutine hierarchies in block-structured programming languages
  Peter Raulefs
  Lecture Notes in Computer Science 53, 1977, pp. 451-459
• Acceptors for iteration languages
  G. Rozenberg, D. Vermeir
  Lecture Notes in Computer Science 53, 1977, pp. 460-464
• How good is the adversary lower bound ?
  Peter Ruz̑ic̑ka, Juraj Wiedermann
  Lecture Notes in Computer Science 53, 1977, pp. 465-474
• Total correctness for procedures
  Stefan Sokoƚowski
  Lecture Notes in Computer Science 53, 1977, pp. 475-483
• A model for retrieval systems and some mathematical problems behind
  Ján S̑turc
  Lecture Notes in Computer Science 53, 1977, pp. 484-492
• Time and tape bounded auxiliary pushdown automata
  I.H. Sudborough
  Lecture Notes in Computer Science 53, 1977, pp. 493-503