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 YEAR=1991

• Mapping systolic algorithms on distributed memory computers
  P. Clauss
  Lecture Notes in Computer Science 487, 1991, pp. 402-411
• Multicomputers UNIX based on CHORUS
  B. Herrmann, L. Philippe
  Lecture Notes in Computer Science 487, 1991, pp. 440-449
• The architecture of the European MIMD supercomputer GENESIS
  U. Bruening, W.K. Giloi, W. Schröder-Preikschat
  Lecture Notes in Computer Science 487, 1991, pp. 450-462
• Fault-tolerant gossiping on hypercube multicomputers
  P. Fraigniaud
  Lecture Notes in Computer Science 487, 1991, pp. 463-472
• Architecture, implementation and system software of K2
  M. Annaratone, G. zur Bonsen, M. Fillo, M. Halbherr, R. Rühl, P. Steiner, M. Viredaz
  Lecture Notes in Computer Science 487, 1991, pp. 473-484
• DAMP - A dynamic reconfigurable multiprocessor system with a distributed switching network
  A. Bauch, R. Braam, E. Maehle
  Lecture Notes in Computer Science 487, 1991, pp. 495-504
• On the complexity of some coloring games
  Hans L. Bodlaender
  Lecture Notes in Computer Science 484, 1991, pp. 30-40
• A generalized best-first search method in graphs
  Ulrich Huckenbeck, Detlev Ruland
  Lecture Notes in Computer Science 484, 1991, pp. 41-60
• Induced subgraph isomorphism for cographs is NP-complete
  Peter Damaschke
  Lecture Notes in Computer Science 484, 1991, pp. 72-78
• Recognizing binary Hamming graphs in O(n^2\log n) time
  Franz Aurenhammer, Johann Hagauer
  Lecture Notes in Computer Science 484, 1991, pp. 90-98
• Bounds on the quality of approximate solutions to the group Steiner problem
  Edmund Ihler
  Lecture Notes in Computer Science 484, 1991, pp. 109-118
• Two polynomial problems in PLA folding
  Claudio Arbib
  Lecture Notes in Computer Science 484, 1991, pp. 119-129
• The VLSI layout problem in various embedding models
  Michael Formann, Frank Wagner
  Lecture Notes in Computer Science 484, 1991, pp. 130-139
• On complexity of a message-routing strategy for multicomputer systems
  Hyeong-Ah Choi, Abdol-Hossein Esfahanian
  Lecture Notes in Computer Science 484, 1991, pp. 170-181
• Diagnosis of t/s-diagnosable systems
  A. Das, K. Thulasiraman
  Lecture Notes in Computer Science 484, 1991, pp. 193-205
• Deciding 1-solvability of distributed task is NP-hard
  Ofer Biran, Shlomo Moran, Shmuel Zaks
  Lecture Notes in Computer Science 484, 1991, pp. 206-220
• Remarks on some concurrency measures
  Michel Habib, Michel Morvan, Jean-Xavier Rampon
  Lecture Notes in Computer Science 484, 1991, pp. 221-238
• On the rectilinear art gallery problem - algorithmic aspects
  Frank Hoffmann, Michael Kaufmann
  Lecture Notes in Computer Science 484, 1991, pp. 239-250
• Separation problems and circular arc systems
  Paul Fischer, Hans Ulrich Simon
  Lecture Notes in Computer Science 484, 1991, pp. 251-259
• On the transition graphs of automata and grammars
  Didier Caucal, Roland Monfort
  Lecture Notes in Computer Science 484, 1991, pp. 311-337
• Executable higher-order algebraic specifications
  Jean-Pierre Jouannaud
  Lecture Notes in Computer Science 480, 1991, pp. 16-25
• Rational relations with bounded delay
  Christiane Frougny, Jacques Sakarovitch
  Lecture Notes in Computer Science 480, 1991, pp. 50-63
• On aperiodic trace languages
  Giovanna Guaiana, Antonio Restivo, Sergio Salemi
  Lecture Notes in Computer Science 480, 1991, pp. 76-88
• Recognizable and rational languages of finite and infinite traces
  Paul Gastin
  Lecture Notes in Computer Science 480, 1991, pp. 89-104
• On the concatenation of infinite traces
  Volker Diekert
  Lecture Notes in Computer Science 480, 1991, pp. 105-117