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

• On word equations and Makanin's algorithms
  H. Abdulrab, J.-P. Pécuchet
  Lecture Notes in Computer Science 380, 1989, pp. 1-12
• Complexity classes with complete problems between P and NP-C
  C. Àlvarez, J. Díaz, J. Torán
  Lecture Notes in Computer Science 380, 1989, pp. 13-24
• Interpretations of synchronous flowchart schemes
  M. Bartha
  Lecture Notes in Computer Science 380, 1989, pp. 25-34
• Generalized Boolean hierarchies and Boolean hierarchies over RP
  A. Bertoni, D. Bruschi, D. Joseph, M. Sitharam, P. Young
  Lecture Notes in Computer Science 380, 1989, pp. 35-46
• The equational logic of iterative processes
  S.L. Bloom
  Lecture Notes in Computer Science 380, 1989, pp. 47-57
• The distributed bit complexity of the ring: from the anonymous to the non-anonymous case
  H.L. Bodlaender, S. Moran, M.K. Warmuth
  Lecture Notes in Computer Science 380, 1989, pp. 58-67
• The jump number problem for biconvex graphs and rectangle covers of rectangular regions
  A. Brandstädt
  Lecture Notes in Computer Science 380, 1989, pp. 68-77
• Recent developments in the design of asynchronous circuits
  J.A. Brzozowski, J.C. Ebergen
  Lecture Notes in Computer Science 380, 1989, pp. 78-94
• New simulations between CRCW PRAMs
  B.S. Chlebus, K. Diks, T. Hagerup, T. Radzik
  Lecture Notes in Computer Science 380, 1989, pp. 95-105
• About connections between syntactical and computational complexity
  J.-L. Coquidé, M. Dauchet, S. Tison
  Lecture Notes in Computer Science 380, 1989, pp. 105-115
• Completeness in approximation classes
  P. Crescenzi, A. Panconesi
  Lecture Notes in Computer Science 380, 1989, pp. 116-126
• Separating completely complexity classes related to polynomial size \Omega-decision trees
  C. Damm, Ch. Meinel
  Lecture Notes in Computer Science 380, 1989, pp. 127-136
• On product hierarchies of automata
  P. Dömösi, Z. ésik, B. Imreh
  Lecture Notes in Computer Science 380, 1989, pp. 137-144
• On the communication complexity of planarity
  P. Durivs, P. Pudlák
  Lecture Notes in Computer Science 380, 1989, pp. 145-147
• Context-free NCE graph grammars
  J. Engelfriet
  Lecture Notes in Computer Science 380, 1989, pp. 148-161
• Dynamic data structures with finite population: a combinatorial analysis
  J. Françon, B. Randrianarimanana, R. Schott
  Lecture Notes in Computer Science 380, 1989, pp. 162-174
• Iterated deterministic top-down look-ahead
  Z. Fülöp, S. Vágvölgyi
  Lecture Notes in Computer Science 380, 1989, pp. 175-184
• Using generating functions to compute concurrency
  D. Geniet, L. Thimonier
  Lecture Notes in Computer Science 380, 1989, pp. 185-196
• A logic for nondeterministic functional programs
  A. Gil-Luezas
  Lecture Notes in Computer Science 380, 1989, pp. 197-208
• Decision problems and Coxeter groups
  B. Graw
  Lecture Notes in Computer Science 380, 1989, pp. 209-223
• Complexity of formula classes in first order logic with functions
  E. Grädel
  Lecture Notes in Computer Science 380, 1989, pp. 224-233
• Normal and sinkless Petri nets
  R.R. Howell, L.E. Rosier, Hsu-Chun Yen
  Lecture Notes in Computer Science 380, 1989, pp. 234-243
• Descriptive and computational complexity
  N. Immerman
  Lecture Notes in Computer Science 380, 1989, pp. 244-245
• The effect of null-chains on the complexity of contact schemes
  S.P. Jukna
  Lecture Notes in Computer Science 380, 1989, pp. 246-256
• Monte-Carlo inference and its relations to reliable frequency identification
  E. Kinber, T. Zeugmann
  Lecture Notes in Computer Science 380, 1989, pp. 257-266