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 [1]	Hilfe

Suche: Series=LNCS AND Volume=452

• On checking versus evaluation of multiple queries
  W.I. Gasarch, L.A. Hemachandra, A. Hoene
  Lecture Notes in Computer Science 452, 1990, pp. 261-268
• Generalized Kolmogorov complexity in relativized separations
  R. Gavaldà, L. Torenvliet, O. Watanabe, J.L. Balcázar
  Lecture Notes in Computer Science 452, 1990, pp. 269-276
• A first-order logic for partial recursive functions
  A. Gavilanes-Franco
  Lecture Notes in Computer Science 452, 1990, pp. 277-284
• Speed-up theorem without tape compression
  V. Geffert
  Lecture Notes in Computer Science 452, 1990, pp. 285-291
• On possibilities of one-way synchronized and alternating automata
  D. Geidmanis
  Lecture Notes in Computer Science 452, 1990, pp. 292-299
• Unrestricted resolution versus N-resolution
  A. Goerdt
  Lecture Notes in Computer Science 452, 1990, pp. 300-305
• Quality criteria for partial order semantics of place/transition-nets
  R. Gold, W. Vogler
  Lecture Notes in Computer Science 452, 1990, pp. 306-312
• Tree-stack automata
  W. Golubski, W.-M. Lippe
  Lecture Notes in Computer Science 452, 1990, pp. 313-321
• Specification and verification of higher order processes
  M.R. Hansen, Z. Chao-Chen
  Lecture Notes in Computer Science 452, 1990, pp. 322-328
• The membership problem for context-free chain code picture languages
  F. Hinz
  Lecture Notes in Computer Science 452, 1990, pp. 329-336
• Optimum algorithms for dissemination of information in some interconnection networks
  J. Hromkovic̑, C.-D. Jeschke, B. Monien
  Lecture Notes in Computer Science 452, 1990, pp. 337-346
• A hierarchy of compositional models of I/O-automata
  B. Jonsson
  Lecture Notes in Computer Science 452, 1990, pp. 347-354
• Minimal nontrivial space complexity of probabilistic one-way Turing machines
  J. Kaņeps, R. Freivalds
  Lecture Notes in Computer Science 452, 1990, pp. 355-361
• On the complexity of genuinely polynomial computation
  M. Karpinski, F. Meyer auf der Heide
  Lecture Notes in Computer Science 452, 1990, pp. 362-368
• Pumping lemmas for tree languages generated by rewrite systems
  E. Kounalis
  Lecture Notes in Computer Science 452, 1990, pp. 369-377
• Vector language: Simple description of hard instances
  M. Kowaluk, K.W. Wagner
  Lecture Notes in Computer Science 452, 1990, pp. 378-384
• Separating \oplus L from L, NL, co-NL and AL (= P) for oblivious Turing machines of linear access time
  M. Krause
  Lecture Notes in Computer Science 452, 1990, pp. 385-391
• The use of graphs of elliptical influence in visual hierarchical clustering
  M. Kȓivánek
  Lecture Notes in Computer Science 452, 1990, pp. 392-398
• Characterizing unambiguous augmented pushdown automata by circuits
  K.-J. Lange, P. Rossmanith
  Lecture Notes in Computer Science 452, 1990, pp. 399-406
• Rational \omega-transductions
  M. Latteux, E. Timmerman
  Lecture Notes in Computer Science 452, 1990, pp. 407-415
• Splitsort - An adaptive sorting algorithm
  Ch. Levcopoulos, O. Petersson
  Lecture Notes in Computer Science 452, 1990, pp. 416-422
• Equational calculi for many-sorted algebras with empty carrier sets
  V. Manca, A. Salibra
  Lecture Notes in Computer Science 452, 1990, pp. 423-429
• Semi-commutation and deterministic Petri nets
  E. Ochmański
  Lecture Notes in Computer Science 452, 1990, pp. 430-438
• Internal labellings in Lambda-Calculus
  M. Parigot
  Lecture Notes in Computer Science 452, 1990, pp. 439-445
• A sup-preserving completion of ordered partial algebras
  A. Pasztor
  Lecture Notes in Computer Science 452, 1990, pp. 446-456