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

• Allocating independent tasks to parallel processors: An experimental study
  Torben Hagerup
  Lecture Notes in Computer Science 1117, 1996, pp. 1-33
• Parallel implementation of an adaptive scheme for 3D unstructured grids on the SP2
  Leonid Oliker, Rupak Biswas, Roger C. Strawn
  Lecture Notes in Computer Science 1117, 1996, pp. 35-47
• Solution of large, sparse, irregular systems on a massively parallel computer
  Will Dearholt, Steven Castillo, Gary Hennigan
  Lecture Notes in Computer Science 1117, 1996, pp. 49-62
• Parallel implementation of a sparse approximate inverse preconditioner
  Vaibhav Deshpande, Marcus J. Grote, Peter Messmer, William Sawyer
  Lecture Notes in Computer Science 1117, 1996, pp. 63-74
• Decomposing irregularly sparse matrices for parallel matrix-vector multiplication
  Ümit V. Çatalyürek, Cevdet Aykanat
  Lecture Notes in Computer Science 1117, 1996, pp. 75-86
• Dynamic spectral partitioning
  Horst D. Simon, Andrew Sohn
  Lecture Notes in Computer Science 1117, 1996, pp. 87-87
• Fast distributed genetic algorithms for partitioning uniform grids
  Ioannis T. Christou, Robert R. Meyer
  Lecture Notes in Computer Science 1117, 1996, pp. 89-103
• Towards efficient unstructured multigrid preprocessing
  Susan E. Dorward, Lesley R. Matheson, Robert E. Tarjan
  Lecture Notes in Computer Science 1117, 1996, pp. 105-118
• Domain decomposition for particle methods on the sphere
  Ömer Eğecioğlu, Ashok Srinivasan
  Lecture Notes in Computer Science 1117, 1996, pp. 119-130
• Coordination of distributed/parallel multiple-grid domain decomposition
  C.T.H. Everaars, F. Arbab
  Lecture Notes in Computer Science 1117, 1996, pp. 131-144
• Systems support for irregular parallel applications
  Kathy Yelick
  Lecture Notes in Computer Science 1117, 1996, pp. 145-145
• Distributed object oriented data structures and algorithms for VLSI CAD
  John A. Chandy, Steven Parkes, Prithviraj Banerjee
  Lecture Notes in Computer Science 1117, 1996, pp. 147-158
• Parallel progressive radiosity with adaptive meshing
  Yizhou Yu, Oscar H. Ibarra, Tao Yang
  Lecture Notes in Computer Science 1117, 1996, pp. 159-170
• Lineal feature extraction by parallel stick growing
  Galen C. Hunt, Randal C. Nelson
  Lecture Notes in Computer Science 1117, 1996, pp. 171-182
• A simple parallel algorithm for the single-source shortest path problem on planar digraphs
  Jesper L. Träff, Christos D. Zaroliagis
  Lecture Notes in Computer Science 1117, 1996, pp. 183-194
• A regular VLSI array for an irregular algorithm
  Florent de Dinechin, Doran K. Wilde, Sanjay Rajopadhye, Rumen Andonov
  Lecture Notes in Computer Science 1117, 1996, pp. 195-200
• Digital libraries and spatial information processing
  Terence R. Smith
  Lecture Notes in Computer Science 1117, 1996, pp. 201-201
• Flexible communication mechanisms for dynamic structured applications
  Stephen J. Fink, Scott B. Baden, Scott R. Kohn
  Lecture Notes in Computer Science 1117, 1996, pp. 203-215
• Multi-message multicasting
  Teofilo F. Gonzalez
  Lecture Notes in Computer Science 1117, 1996, pp. 217-228
• Synchronization as a strategy for designing efficient parallel algorithms
  Claude G. Diderich, Marc Gengler
  Lecture Notes in Computer Science 1117, 1996, pp. 229-236
• Supporting dynamic data and processor repartitioning for irregular applications
  José E. Moreira, Kalluri Eswar, Ravi B. Konuru, Vijay K. Naik
  Lecture Notes in Computer Science 1117, 1996, pp. 237-248
• Simple quantitative experiments with a sparse compiler
  Aart J.C. Bik, Harry A.G. Wijshoff
  Lecture Notes in Computer Science 1117, 1996, pp. 249-262
• Using algorithmic skeletons with dynamic data structures
  George Horatiu Botorog, Herbert Kuchen
  Lecture Notes in Computer Science 1117, 1996, pp. 263-276
• An interface design for general parallel branch-and-bound algorithms
  Yuji Shinano, Masahiro Higaki, Ryuichi Hirabayashi
  Lecture Notes in Computer Science 1117, 1996, pp. 277-284
• Support for irregular computation in high performance Fortran
  Rob Schreiber
  Lecture Notes in Computer Science 1117, 1996, pp. 285-285