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

• Parallel mesh generation
  Lutz Laemmer, Michael Burghardt
  Lecture Notes in Computer Science 1253, 1997, pp. 1-12
• Efficient massively parallel Quicksort
  Peter Sanders, Thomas Hansch
  Lecture Notes in Computer Science 1253, 1997, pp. 13-24
• Practical parallel list ranking
  Jop F. Sibeyn, Frank Guillaume, Tillmann Seidel
  Lecture Notes in Computer Science 1253, 1997, pp. 25-36
• On computing all maximal cliques distributedley
  Fábio Protti, Felipe M.G. França, Jayme Luiz Szwarcfiter
  Lecture Notes in Computer Science 1253, 1997, pp. 37-48
• A probabilistic model for best-first search B&B algorithms
  F. Argüello, N. Guil, J. López, M. Amor, E.L. Zapata
  Lecture Notes in Computer Science 1253, 1997, pp. 49-60
• Programming irregular parallel appplications in Cilk
  Charles E. Leiserson
  Lecture Notes in Computer Science 1253, 1997, pp. 61-71
• A variant of the biconjugate gradient method suitable for massively parallel computing
  H. Martin Bücker, Manfred Sauren
  Lecture Notes in Computer Science 1253, 1997, pp. 72-79
• Efficient implementation of the improved quasi-minimal residual method on massively distributed memory computers
  Tianruo Yang, Hai-Xiang Lin
  Lecture Notes in Computer Science 1253, 1997, pp. 80-92
• Programming with shared data abstractions
  Simon Dobson, Don Goodeve
  Lecture Notes in Computer Science 1253, 1997, pp. 93-102
• EXPLORER: Supporting run-time parallelization of DO-ACROSS loops on general networks of workstations
  Yung-Lin Liu, Chung-Ta King
  Lecture Notes in Computer Science 1253, 1997, pp. 103-110
• Engineering diffusive load balancing algorithms using experiments
  Ralf Diekmann, S. Muthukrishnan, Madhu V. Nayakkankuppam
  Lecture Notes in Computer Science 1253, 1997, pp. 111-122
• Comparative study of static scheduling with task duplication for distributed systems
  Gyung-Leen Park, Behrooz Shirazi, Jeff Marquis
  Lecture Notes in Computer Science 1253, 1997, pp. 123-134
• A new approximation algorithm for the register allocation problem
  Klaus Jansen
  Lecture Notes in Computer Science 1253, 1997, pp. 135-146
• A parallel approximation algorithm for resource constrained scheduling and bin packing
  Anand Srivastav, Peter Stangier
  Lecture Notes in Computer Science 1253, 1997, pp. 147-158
• Virtual data space - A universal load balancing scheme
  Thomas Decker
  Lecture Notes in Computer Science 1253, 1997, pp. 159-166
• Improving cache performance through tiling and data alignment
  Preeti Ranjan Panda, Hiroshi Nakamura, Nikil D. Dutt, Alexandru Nicolau
  Lecture Notes in Computer Science 1253, 1997, pp. 167-185
• A support for non-uniform parallel loops and its application to a flame simulation code
  Salvatore Orlando, Raffaele Perego
  Lecture Notes in Computer Science 1253, 1997, pp. 186-197
• Performance optimization of combined variable-cost computations and I/O
  Sorin G. Nastea, Tarek El-Ghazawi, Ophir Frieder
  Lecture Notes in Computer Science 1253, 1997, pp. 198-206
• Parallel shared-memory state-space exploration in stochastic modeling
  Susann C. Allmaier, Graham Horton
  Lecture Notes in Computer Science 1253, 1997, pp. 207-218
• Parallel software caches
  Arno Formella, Jörg Keller
  Lecture Notes in Computer Science 1253, 1997, pp. 219-232
• Communication efficient parallel searching
  Armin Bäumker, Friedhelm Meyer auf der Heide
  Lecture Notes in Computer Science 1253, 1997, pp. 233-254
• Parallel sparse Cholesky factorization
  Burkhard Monien, Jürgen Schulze
  Lecture Notes in Computer Science 1253, 1997, pp. 255-272
• Unstructured graph partitioning for sparse linear system solving
  Jean Michel, François Pellegrini, Jean Roman
  Lecture Notes in Computer Science 1253, 1997, pp. 273-286