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 [2]	Hilfe

Suche: Series=LNCS AND Volume=980

• Regular versus irregular problems and algorithms
  T. Gautier, J.L. Roch, G. Villard
  Lecture Notes in Computer Science 980, 1995, pp. 1-25
• Algorithmic skeletons for adaptive multigrid methods
  George Horatiu Botorog, Herbert Kuchen
  Lecture Notes in Computer Science 980, 1995, pp. 27-41
• Run-time techniques for parallelizing sparse matrix problems
  M. Ujaldon, S.D. Sharma, J. Saltz, E.L. Zapata
  Lecture Notes in Computer Science 980, 1995, pp. 43-57
• Fast execution of irregularly structured programs with low communication frequency on the hypercube
  Vincenzo Auletta, Alberto Negro, Vittorio Scarano
  Lecture Notes in Computer Science 980, 1995, pp. 59-73
• Run-time parallelization of irregular DOACROSS loops
  V. Prasad Krothapalli, Thulasiraman Jeyaraman, Mark Giesbrecht
  Lecture Notes in Computer Science 980, 1995, pp. 75-80
• Instruction scheduling and global register allocation for SIMD multiprocessors
  Benjamin Hao, David Pearson
  Lecture Notes in Computer Science 980, 1995, pp. 81-86
• General bounds for the assignment of irregular dependency graphs
  Sathiamoorthy Manoharan
  Lecture Notes in Computer Science 980, 1995, pp. 87-98
• A new scheme for dynamic processor assignment for irregular problems
  Ranjan k Sen
  Lecture Notes in Computer Science 980, 1995, pp. 99-113
• An efficient mean field annealing formulation for mapping unstructured domains to hypercubes
  Cevdet Aykanat, İsmail Haritaoğlu
  Lecture Notes in Computer Science 980, 1995, pp. 115-120
• Partitioning & mapping of unstructured meshes to parallel machine topologies
  C. Walshaw, M. Cross, M.G. Everett, S. Johnson, K. McManus
  Lecture Notes in Computer Science 980, 1995, pp. 121-126
• Integrating software pipelining and graph scheduling for iterative scientific computations
  Cong Fu, Tao Yang, Apostolos Gerasoulis
  Lecture Notes in Computer Science 980, 1995, pp. 127-141
• Approximation algorithms for time constrained scheduling
  Klaus Jansen, Sabine öhring
  Lecture Notes in Computer Science 980, 1995, pp. 143-157
• On the scope of applicability of the ETF algorithm
  Cristina Boeres, George Chochia, Peter Thanisch
  Lecture Notes in Computer Science 980, 1995, pp. 159-164
• Optimal mapping neighbourhood-constrained systems
  Felipe M.G. França, Luerbio Faria
  Lecture Notes in Computer Science 980, 1995, pp. 165-170
• Parallel processing in DNA analysis
  Charles R. Cantor, Takeshi Sano, Natalia E. Broude, Cassandra L. Smith
  Lecture Notes in Computer Science 980, 1995, pp. 171-185
• Solving computational fluid dynamics problems on unstructured grids with distributed parallel processing
  P.W. Grant, M.F. Webster, X. Zhang
  Lecture Notes in Computer Science 980, 1995, pp. 187-197
• Parallel decomposition of unstructured FEM-meshes
  Ralf Diekmann, Derk Meyer, Burkhard Monien
  Lecture Notes in Computer Science 980, 1995, pp. 199-215
• Massively parallel approximation of irregular triangular meshes with G^1 parametric surfaces
  Miguel Angel García
  Lecture Notes in Computer Science 980, 1995, pp. 217-230
• Distributed symbolic computation with DTS
  T. Bubeck, M. Hiller, W. Küchlin, W. Rosenstiel
  Lecture Notes in Computer Science 980, 1995, pp. 231-248
• A parallel processing paradigm for irregular applications
  A. Das, L.E. Moser, P.M. Melliar-Smith
  Lecture Notes in Computer Science 980, 1995, pp. 249-254
• Load balancing strategies for a parallel system of particles
  Serge Miguet, Jean-Marc Pierson
  Lecture Notes in Computer Science 980, 1995, pp. 255-260
• A reconfigurable parallel algorithm for sparse Cholesky factorization
  A. Benaini, D. Laiymani, G.R. Perrin
  Lecture Notes in Computer Science 980, 1995, pp. 261-274
• Adapted wavelet analysis on moderate parallel distributed memory MIMD architectures
  Andreas Uhl
  Lecture Notes in Computer Science 980, 1995, pp. 275-283
• A new parallel approach to the constrained two-dimensional cutting stock problem
  Stefan Tschöke, Norbert Holthöfer
  Lecture Notes in Computer Science 980, 1995, pp. 285-300
• Using the ProSet-Linda prototyping language for investigating MIMD algorithms for model matching in 3-D computer vision
  W. Hasselbring, R.B. Fisher
  Lecture Notes in Computer Science 980, 1995, pp. 301-315