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

• A pointer-free data structure for merging heaps and min-max heaps
  G. Gambosi, E. Nardelli, M. Talamo
  Lecture Notes in Computer Science 372, 1989, pp. 405-422
• Structured operational semantics and bisimulation as a congruence
  J.F. Groote, F. Vaandrager
  Lecture Notes in Computer Science 372, 1989, pp. 423-438
• Parallel retrievel of scattered information
  T. Hagerup, M. Nowak
  Lecture Notes in Computer Science 372, 1989, pp. 439-450
• Tensor rank is NP-complete
  J. Håstad
  Lecture Notes in Computer Science 372, 1989, pp. 451-460
• The complexity of nonlinear separable optimization
  D.S. Hochbaum, J.G. Shanthikumar
  Lecture Notes in Computer Science 372, 1989, pp. 461-472
• General methods for the analysis of the maximal size of dynamic data structures
  C.M. Kenyon-Mathieu, J.S. Vitter
  Lecture Notes in Computer Science 372, 1989, pp. 473-487
• How to share concurrent asynchronous wait-free variables
  M. Li, P.M.B. Vitanyi
  Lecture Notes in Computer Science 372, 1989, pp. 488-505
• A new approach to formal language theory by Kolmogorov complexity
  M. Li, P.M.B. Vitanyi
  Lecture Notes in Computer Science 372, 1989, pp. 506-520
• Dynamic algorithms in D.E. Knuth's model: A probabilistic analysis
  G. Louchard, B. Randrianarimanana, R. Schott
  Lecture Notes in Computer Science 372, 1989, pp. 521-533
• Completing the temporal picture
  Z. Manna, A. Pnueli
  Lecture Notes in Computer Science 372, 1989, pp. 534-558
• Lower bounds for computations with the floor operation
  Y. Mansour, B. Schieber, P. Tiwari
  Lecture Notes in Computer Science 372, 1989, pp. 559-573
• Programming, transforming and proving with function abstractions and memories
  I. Mason, C. Talcott
  Lecture Notes in Computer Science 372, 1989, pp. 574-588
• Automata theory meets circuit complexity
  P. McKenzie, D. Thérien
  Lecture Notes in Computer Science 372, 1989, pp. 589-602
• Two versus one index register and modifiable versus non-modifiable programs
  K. Mehlhorn, W.J. Paul
  Lecture Notes in Computer Science 372, 1989, pp. 603-609
• Shortest paths without a map
  C.H. Papadimitriou, M. Yannakakis
  Lecture Notes in Computer Science 372, 1989, pp. 610-620
• Modular system design applying graph grammars techniques
  F. Parisi-Presicce
  Lecture Notes in Computer Science 372, 1989, pp. 621-636
• Partial commutations
  D. Perrin
  Lecture Notes in Computer Science 372, 1989, pp. 637-651
• On the synthesis of an asynchronous reactive module
  A. Pnueli, R. Rosner
  Lecture Notes in Computer Science 372, 1989, pp. 652-671
• The complexity of controlled selection
  K. Pruhs, U. Manber
  Lecture Notes in Computer Science 372, 1989, pp. 672-686
• Memory versus randomization in on-line algorithms
  P. Raghavan, M. Snir
  Lecture Notes in Computer Science 372, 1989, pp. 687-703
• Syntactic control of interference, Part 2
  J.C. Reynolds
  Lecture Notes in Computer Science 372, 1989, pp. 704-722
• Characteristic formulae
  B. Steffen
  Lecture Notes in Computer Science 372, 1989, pp. 723-732
• A combinatorial technique for separating counting complexity classes
  J. Toran
  Lecture Notes in Computer Science 372, 1989, pp. 733-744
• Horn programs and semicomputable relations on abstract structures
  J.V. Tucker, J.I. Zucker
  Lecture Notes in Computer Science 372, 1989, pp. 745-760
• A note on model checking the modal \mu-calculus
  G. Winskel
  Lecture Notes in Computer Science 372, 1989, pp. 761-772