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=379

• Complexity of decision problems under incomplete information
  W. Kowalczyk
  Lecture Notes in Computer Science 379, 1989, pp. 331-337
• On the nature of TELLUS (a typed equational logic look over uniform specification)
  V. Manca, A. Salibra, G. Scollo
  Lecture Notes in Computer Science 379, 1989, pp. 338-349
• Switching graphs and their complexity
  Ch. Meinel
  Lecture Notes in Computer Science 379, 1989, pp. 350-359
• Pomset semantics for true concurrency with synchronization and recursion (extended abstract)
  J.-J.Ch. Meyer, E.P. de Vink
  Lecture Notes in Computer Science 379, 1989, pp. 360-369
• Oracle branching programs and logspace versus \P (extended abstract)
  D.A. Mix Barrington, P. McKenzie
  Lecture Notes in Computer Science 379, 1989, pp. 370-379
• Generalizing singly-linked list reorganizing heuristics for doubly-linked lists
  D.T.H. Ng, B.J. Oommen
  Lecture Notes in Computer Science 379, 1989, pp. 380-389
• Area complexity of merging
  V. Palko, O. Sýkora, I. Vrt̑o
  Lecture Notes in Computer Science 379, 1989, pp. 390-396
• Logically defined subsets of N^k
  P. Péladeau
  Lecture Notes in Computer Science 379, 1989, pp. 397-407
• An extended Herbrand theorem for first-order theories with equality interpreted in partial algebras
  U. Petermann
  Lecture Notes in Computer Science 379, 1989, pp. 408-417
• Characterization of recognizable trace languages by distributed automata
  A. Petit
  Lecture Notes in Computer Science 379, 1989, pp. 418-430
• Knuth-Morris-Pratt algorithm: An analysis
  M. Regnier
  Lecture Notes in Computer Science 379, 1989, pp. 431-444
• Pushdown automata on infinite trees and \omega-Kleene closure of context-free tree sets
  A. Saoudi
  Lecture Notes in Computer Science 379, 1989, pp. 445-457
• An imperative type hierarchy with partial products
  E.M. Schmidt, M.I. Schwartzbach
  Lecture Notes in Computer Science 379, 1989, pp. 458-470
• A coloring algorithm for interval graphs
  M. Ślusarek
  Lecture Notes in Computer Science 379, 1989, pp. 471-480
• Finite constants: characterizations of a new decidable set of constants
  B. Steffen, J. Knoop
  Lecture Notes in Computer Science 379, 1989, pp. 481-491
• Optimal data flow analysis via observational equivalence
  B. Steffen
  Lecture Notes in Computer Science 379, 1989, pp. 492-502
• One more method for proving lower bounds on the formula complexity of boolean functions
  V.A. Stetsenko
  Lecture Notes in Computer Science 379, 1989, pp. 503-510
• The Hoare-like verification system for a language with an exception handling mechanism
  D. Szczepańska
  Lecture Notes in Computer Science 379, 1989, pp. 511-522
• On the lengths of values in a finite transducer
  A. Weber
  Lecture Notes in Computer Science 379, 1989, pp. 523-533
• On varieties of languages closed under products with counter
  P. Weil
  Lecture Notes in Computer Science 379, 1989, pp. 534-544
• On the computational efficiency of symmetric neural networks
  J. Wiedermann
  Lecture Notes in Computer Science 379, 1989, pp. 545-552
• Constructive aspects of the \omega-rule: application to proof systems in computer science and algorithmic logic
  S. Yoccoz
  Lecture Notes in Computer Science 379, 1989, pp. 553-565
• How to define functionals on free structures in typed lambda-calculus
  M. Zaionc
  Lecture Notes in Computer Science 379, 1989, pp. 566-576
• Concurrency, modularity and synchronization
  A. Mazurkiewicz
  Lecture Notes in Computer Science 379, 1989, pp. 577-598
• On comparing probabilistic and deterministic automata complexity of languages
  F.M. Ablayev
  Lecture Notes in Computer Science 379, 1989, pp. 599-605