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

• On embedding 2-dimensional toroidal grids into de Bruijn graphs with clocked congestion one
  Thomas Andreae, Michael Nölle, Christof Rempel, Gerald Schreiber
  Lecture Notes in Computer Science 1120, 1996, pp. 316-327
• N-cube string matching algorithm with long texts
  Fouzia Moussouni, Christian Lavault
  Lecture Notes in Computer Science 1120, 1996, pp. 328-340
• Combinatorics for multiprocessor scheduling optimization and other contexts in computer architecture
  Håkan Lennerstad, Lars Lundberg
  Lecture Notes in Computer Science 1120, 1996, pp. 341-347
• Some applications of combinatorial optimization in parallel computing
  Reinhardt Euler, Laurent Lemarchand
  Lecture Notes in Computer Science 1120, 1996, pp. 348-366
• On the parallel complexity of the alternating Hamiltonian cycle problem
  E. Bampis, Y. Manoussakis, I. Milis
  Lecture Notes in Computer Science 1120, 1996, pp. 367-377
• Threshold graphs and synchronization protocols
  Rossella Petreschi, Andrea Sterbini
  Lecture Notes in Computer Science 1120, 1996, pp. 378-395
• Task assignment in distributed systems using network flow methods
  Ioannis Milis
  Lecture Notes in Computer Science 1120, 1996, pp. 396-405
• Distributed rerouting in DCS mesh networks
  Dritan Nace, Jacques Carlier
  Lecture Notes in Computer Science 1120, 1996, pp. 406-415