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

• On-line resource management with applications to routing and scheduling
  Stefano Leonardi, Alberto Marchetti-Spaccamela
  Lecture Notes in Computer Science 944, 1995, pp. 303-314
• Alternation in simple devices
  H. Petersen
  Lecture Notes in Computer Science 944, 1995, pp. 315-323
• Hybrid automata with finite bisimulations
  Thomas A. Henzinger
  Lecture Notes in Computer Science 944, 1995, pp. 324-335
• Generalized Sturmian languages
  Luis-Miguel Lopez, Philippe Narbel
  Lecture Notes in Computer Science 944, 1995, pp. 336-347
• Polynomial closure and unambiguous product
  Jean-Eric Pin, Pascal Weil
  Lecture Notes in Computer Science 944, 1995, pp. 348-359
• Lower bounds on algebraic random access machines
  Amir M. Ben-Amram, Zvi Galil
  Lecture Notes in Computer Science 944, 1995, pp. 360-371
• Improved deterministic PRAM simulation on the mesh
  Andrea Pietracaprina, Geppino Pucci
  Lecture Notes in Computer Science 944, 1995, pp. 372-383
• On optimal polynomial time approximations: P-levelability vs.~\Delta-levelability
  Klaus Ambos-Spies
  Lecture Notes in Computer Science 944, 1995, pp. 384-392
• Weakly useful sequences
  Stephen A. Fenner, Jack H. Lutz, Elvira Mayordomo
  Lecture Notes in Computer Science 944, 1995, pp. 393-404
• Graph connectivity, monadic NP and built-in relations of moderate degree
  Thomas Schwentick
  Lecture Notes in Computer Science 944, 1995, pp. 405-416
• The expressive power of clocks
  Thomas A. Henzinger, Peter W. Kopke, Howard Wong-Toi
  Lecture Notes in Computer Science 944, 1995, pp. 417-428
• Grammar systems: A grammatical approach to distribution and cooperation
  Gheorghe Păn
  Lecture Notes in Computer Science 944, 1995, pp. 429-443
• Compactness of systems of equations in semigroups
  T. Harju, J. Karhumäki, W. Plandowski
  Lecture Notes in Computer Science 944, 1995, pp. 444-454
• Sensing versus nonsensing automata
  Pavol D̑uris̑, Zvi Galil
  Lecture Notes in Computer Science 944, 1995, pp. 455-463
• New upper bounds for generalized intersection searching problems
  Panayiotis Bozanis, Nectarios Kitsios, Christos Makris, Athanasios Tsakalidis
  Lecture Notes in Computer Science 944, 1995, pp. 464-474
• OKFDDs versus OBDDs and OFDDs
  Bernd Becker, Rolf Drechsler, Michael Theobald
  Lecture Notes in Computer Science 944, 1995, pp. 475-486
• Bicriteria network design problems
  M.V. Marathe, R. Ravi, R. Sundaram, S.S. Ravi, D.J. Rosenkrantz, H.B. Hunt III
  Lecture Notes in Computer Science 944, 1995, pp. 487-498
• On determining optimal strategies in pursuit games in the plane
  Ngọc-Minh Lê
  Lecture Notes in Computer Science 944, 1995, pp. 499-510
• Extension orderings
  Albert Rubio
  Lecture Notes in Computer Science 944, 1995, pp. 511-522
• The pushdown method to optimize chain logic programs
  Sergio Greco, Domenico Saccà amd Carlo Zaniolo
  Lecture Notes in Computer Science 944, 1995, pp. 523-534
• Automatic synthesis of real time systems
  Jrgen H. Andersen, Kåre J. Kristoffersen, Kim G. Larsen, Jesper Niedermann
  Lecture Notes in Computer Science 944, 1995, pp. 535-546
• Self-correcting for function fields of finite transcendental degree
  Manuel Blum, Bruno Codenotti, Peter Gemmell, Troy Shahoumian
  Lecture Notes in Computer Science 944, 1995, pp. 547-557
• Measure, category and learning theory
  Lance Fortnow, Rūsiņs̑ Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl Smith, Frank Stephan
  Lecture Notes in Computer Science 944, 1995, pp. 558-569
• A characterization of the existence of energies for neural networks
  Michel Cosnard, Eric Goles
  Lecture Notes in Computer Science 944, 1995, pp. 570-580
• Variable-length codes for error correction
  Jürgensen H., S. Konstantinidis
  Lecture Notes in Computer Science 944, 1995, pp. 581-592