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

• Optimal gossip in store-and-forward noncombining 2-D tori
  Michal S̑och, Pavel Tvrdík
  Lecture Notes in Computer Science 1300, 1997, pp. 234-241
• Cutwidth of the mesh of d-ary trees
  Imrich Vrt'o
  Lecture Notes in Computer Science 1300, 1997, pp. 242-245
• Embedding and emulation results for static multichannel mesh of optical buses
  Ville Leppänen
  Lecture Notes in Computer Science 1300, 1997, pp. 246-249
• Routing on asynchronous processor networks
  Efstratios Karaivazoglou, Friedhelm Meyer auf der Heide
  Lecture Notes in Computer Science 1300, 1997, pp. 250-257
• The complexity of shortest path and dilation bounded interval routing
  R. Král̑ovic̑, P. Ruz̑ic̑ka, D. S̑tefankovic̑
  Lecture Notes in Computer Science 1300, 1997, pp. 258-265
• Finding a pair on a mesh with multiple broadcasting is hard
  Peter Damaschke
  Lecture Notes in Computer Science 1300, 1997, pp. 266-271
• Routing on the PADAM: Degrees of optimality
  Bogdan S. Chlebus, Artur Czumaj, Jop F. Sibeyn
  Lecture Notes in Computer Science 1300, 1997, pp. 272-279
• Workshop 03: Automatic parallelization and high-performance compilers
  Yves Robert
  Lecture Notes in Computer Science 1300, 1997, pp. 283-284
• Handling memory cache policy with integer points countings
  Philippe Clauss
  Lecture Notes in Computer Science 1300, 1997, pp. 285-293
• A graphical tool for automatic parallelization and scheduling of programs on multiprocessors
  Yu-Kwong Kwok, Ishfaq Ahmad, Min-You Wu, Wei Shu
  Lecture Notes in Computer Science 1300, 1997, pp. 294-301
• Identifying critical loads in real programs for decoupled VSM systems
  He Zhu, Ian Watson
  Lecture Notes in Computer Science 1300, 1997, pp. 302-305
• Runtime interprocedural data placement optimisation for lazy parallel libraries
  Olav Beckman, Paul H.J. Kelly
  Lecture Notes in Computer Science 1300, 1997, pp. 306-309
• A technique for mapping sparse matrix computations into regular processor arrays
  Roman Wyrzykowski, Juri Kanevski
  Lecture Notes in Computer Science 1300, 1997, pp. 310-317
• A relational approach to the compilation of sparse matrix programs
  Vladimir Kotlyar, Keshav Pingali, Paul Stodghill
  Lecture Notes in Computer Science 1300, 1997, pp. 318-327
• Solutions to the communication minimization problem for affine recurrence equations
  Vincent Loechner, Catherine Mongenet
  Lecture Notes in Computer Science 1300, 1997, pp. 328-337
• Dependence-free clustering of shift-invariant data structures
  Matthias Besch, Hans Werner Pohl
  Lecture Notes in Computer Science 1300, 1997, pp. 338-341
• Experiences in analyzing data dependences for programs with pointers and structures
  W. Amme, E. Zehendner
  Lecture Notes in Computer Science 1300, 1997, pp. 342-346
• Applicability of program comprehension to sparse matrix computations
  Christoph W. Kess̈ler
  Lecture Notes in Computer Science 1300, 1997, pp. 347-351
• Hamiltonian recurrence for ILP
  Cristina Barrado, Jesús Labarta
  Lecture Notes in Computer Science 1300, 1997, pp. 352-355
• Optimizing storage size for static control programs in automatic parallelizers
  Vincent Lefebvre, Paul Feautrier
  Lecture Notes in Computer Science 1300, 1997, pp. 356-363
• Optimal distribution assignment placement
  Jens Knoop, Eduard Mehofer
  Lecture Notes in Computer Science 1300, 1997, pp. 364-373
• Workshop 04+08+13: Parallel and distributed algorithms
  Keith Marzullo, Cynthia Phillips
  Lecture Notes in Computer Science 1300, 1997, pp. 377-378
• Parallel merge sort on concurrent-read owner-write PRAM
  David C. Lin, Patrick W. Dymond, Xiaotie Deng
  Lecture Notes in Computer Science 1300, 1997, pp. 379-383
• Feasible models of computation: Three-dimensionality and energy consumption
  Peter Sanders, Roland Vollmar, Thomas Worsch
  Lecture Notes in Computer Science 1300, 1997, pp. 384-388
• Sample sort on meshes
  Jop F. Sibeyn
  Lecture Notes in Computer Science 1300, 1997, pp. 389-398