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

• Semilinear real-time systolic trellis automata
  I. Korec
  Lecture Notes in Computer Science 380, 1989, pp. 267-276
• Inducibility of the composition of frontier-to-root tree transformations
  T. Kovács
  Lecture Notes in Computer Science 380, 1989, pp. 277-286
• On oblivious branching programs of linear length
  M. Krause, S. Waack
  Lecture Notes in Computer Science 380, 1989, pp. 287-296
• Some time-space bounds for one-tape deterministic Turing machines
  M. Liśkiewicz, K. Loryś
  Lecture Notes in Computer Science 380, 1989, pp. 297-307
• Rank of rational finitely generated w-languages
  I. Litovsky
  Lecture Notes in Computer Science 380, 1989, pp. 308-317
• Extensional properties of sets of time bounded complexity
  W. Maass, T.A. Slaman
  Lecture Notes in Computer Science 380, 1989, pp. 318-326
• Learning under uniform distribution
  A. Marchetti-Spaccamela, M. Protasi
  Lecture Notes in Computer Science 380, 1989, pp. 327-338
• An extended framework for default reasoning
  M.A. Nait Abdallah
  Lecture Notes in Computer Science 380, 1989, pp. 339-348
• Logic programming of some mathematical paradoxes
  M.A. Nait Abdallah
  Lecture Notes in Computer Science 380, 1989, pp. 349-361
• Analysis of compact 0-complete trees: a new access method to large databases
  R. Orlandic, J.L. Pfaltz
  Lecture Notes in Computer Science 380, 1989, pp. 362-371
• Representation of recursively enumerable languages using alternating finite tree recognizers
  K. Salomaa
  Lecture Notes in Computer Science 380, 1989, pp. 372-383
• About a family of binary morphisms which stationary words are Sturmian
  P. Séébold
  Lecture Notes in Computer Science 380, 1989, pp. 384-394
• On the finite degree of ambiguity of finite tree automata
  H. Seidl
  Lecture Notes in Computer Science 380, 1989, pp. 395-404
• Approximation algorithms for channel assignment in cellular radio networks
  H.U. Simon
  Lecture Notes in Computer Science 380, 1989, pp. 405-415
• The Borel hierarchy is infinite in the class of regular sets of trees
  J. Skurczyński
  Lecture Notes in Computer Science 380, 1989, pp. 416-423
• Parallel general prefix computations with geometric, algebraic and other applications
  F. Springsteel, I. Stojmenović
  Lecture Notes in Computer Science 380, 1989, pp. 424-433
• Kolmogorov complexity and Hausdorff dimension
  L. Staiger
  Lecture Notes in Computer Science 380, 1989, pp. 434-443
• Tree language problems in pattern recognition theory
  M. Steinby
  Lecture Notes in Computer Science 380, 1989, pp. 444-450
• The computational complexity of cellular automata
  K. Sutner
  Lecture Notes in Computer Science 380, 1989, pp. 451-459
• On restricted Boolean circuits
  Gy. Turán
  Lecture Notes in Computer Science 380, 1989, pp. 460-469
• The complexity of connectivity problems on context-free graph languages
  E. Wanke
  Lecture Notes in Computer Science 380, 1989, pp. 470-479
• Constructivity, computability, and computational complexity in analysis
  K. Weihrauch
  Lecture Notes in Computer Science 380, 1989, pp. 480-493