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

• Non-cancellative Boolean circuits: A generalization of monotone Boolean circuits
  Rimli Sengupta, H. Venkateswaran
  Lecture Notes in Computer Science 1180, 1996, pp. 298-309
• Limitations of the QRQW and EREW PRAM models
  Mirosƚaw Kutyƚowski, Krzysztof Loryś
  Lecture Notes in Computer Science 1180, 1996, pp. 310-321
• Pinpointing computation with modular queries in the Boolean hierarchy
  Manindra Agrawal, Richard Beigel, Thomas Thierauf
  Lecture Notes in Computer Science 1180, 1996, pp. 322-334
• Characterization of principal type of normal forms in an intersection type system
  Emilie Sayag, Michel Mauny
  Lecture Notes in Computer Science 1180, 1996, pp. 335-346
• Correcting type errors in the Curry system
  Millind Gandhe, G. Venkatesh, Amitabha Sanyal
  Lecture Notes in Computer Science 1180, 1996, pp. 347-358
• Immediate fixpoints and their use in groundness analysis
  Harald Sndergaard
  Lecture Notes in Computer Science 1180, 1996, pp. 359-370
• Graph types for monadic mobile processes
  Nabuko Yoshida
  Lecture Notes in Computer Science 1180, 1996, pp. 371-386