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 YEAR=1998

• Diameter determination on restricted graph families
  Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul
  Lecture Notes in Computer Science 1517, 1998, pp. 192-202
• Domination and Steiner tree problems on graphs with few P_4s
  Luitpold Babel, Stephan Olariu
  Lecture Notes in Computer Science 1517, 1998, pp. 337-350
• Minimum fill-in and treewidth for graphs modularly decomposable into chordal graphs
  Elias Dahlhaus
  Lecture Notes in Computer Science 1517, 1998, pp. 351-358
• Random number generation and simulation on vector and parallel computers
  Richard P. Brent
  Lecture Notes in Computer Science 1470, 1998, pp. 1-20
• Very distributed media stories: Presence, time, imagination
  Glorianna Davenport
  Lecture Notes in Computer Science 1470, 1998, pp. 47-54
• Achieving portability and efficiency through automatic optimisation: An investigation in parallel image processing
  D. Crookes, P.J. Morrow, T.J. Brown, G. McAleese, D. Roantree, I.T.A. Spence
  Lecture Notes in Computer Science 1470, 1998, pp. 102-112
• EDPEPPS: A toolset for the design and performance evaluation of parallel applications
  T. Delaitre, M.J. Zemerly, P. Vekariya, G.R. Justo, J. Bourgeois, F. Schinkmann, F. Spies, S. Randoux, S.C. Winter
  Lecture Notes in Computer Science 1470, 1998, pp. 113-125
• Verifying a performance estimator for parallel DBMSs
  E.W. Dempster, N.T. Tomov, J. Lü, C.S. Pua, M.H. Williams, A. Burger, H. Taylor, P. Broughton
  Lecture Notes in Computer Science 1470, 1998, pp. 126-135
• Generating parallel applications of spatial interaction models
  John Davy, Wissal Essah
  Lecture Notes in Computer Science 1470, 1998, pp. 136-145
• A graphical tool for the visualization and animation of communicating sequential processes
  Ali E. Abdallah
  Lecture Notes in Computer Science 1470, 1998, pp. 165-172
• Communication pre-evaluation in HPF
  Pierre Boulet, Xavier Redon
  Lecture Notes in Computer Science 1470, 1998, pp. 263-272
• Optimizing load balance and communication on parallel computers with distributed shared memory
  Rudolf Berrendorf
  Lecture Notes in Computer Science 1470, 1998, pp. 299-306
• Experimental studies in load balancing
  Azzedine Boukerche, Sajal K. Das
  Lecture Notes in Computer Science 1470, 1998, pp. 318-321
• Static scheduling using task replication for LogP and BSP models
  Cristina Boeres, Vinod E.F. Rebello, David B. Skillicorn
  Lecture Notes in Computer Science 1470, 1998, pp. 337-346
• Aspect ratio for mesh partitioning
  Ralf Diekmann, Robert Preis, Frank Schlimbach, Chris Walshaw
  Lecture Notes in Computer Science 1470, 1998, pp. 347-351
• A competitive symmetrical transfer policy for load sharing
  Konstantinos Antonis, John Garofalakis, Paul Spirakis
  Lecture Notes in Computer Science 1470, 1998, pp. 352-355
• A lower bound for dynamic scheduling of data parallel programs
  Fabricio Alves Barbosa da Silva, Luis Miguel Campos, Isaac D. Scherson
  Lecture Notes in Computer Science 1470, 1998, pp. 367-372
• A general modular specification for distributed schedulers
  Gerson G.H. Cavalheiro, Yves Denneulin, Jean-Louis Roch
  Lecture Notes in Computer Science 1470, 1998, pp. 373-376
• Feedback guided dynamic loop scheduling: Algorithms and experiments
  J. Mark Bull
  Lecture Notes in Computer Science 1470, 1998, pp. 377-382
• Load balancing for problems with good bisectors, and applications in finite element simulations
  Stefan Bischof, Ralf Ebner, Thomas Erlebach
  Lecture Notes in Computer Science 1470, 1998, pp. 383-389
• Evaluation of process migration for parallel heterogeneous workstation clusters
  M.A.R. Dantas
  Lecture Notes in Computer Science 1470, 1998, pp. 397-400
• Using alternative schedules for fault tolerance in parallel programs on a network of workstations
  Dibyendu Das
  Lecture Notes in Computer Science 1470, 1998, pp. 401-404
• Workshop 04 - Automatic parallelisation and high-performance compilers
  Jean-François Collard
  Lecture Notes in Computer Science 1470, 1998, pp. 411-412
• Data distribution at run-time: Re-using execution plans
  Olav Beckmann, Paul H.J. Kelly
  Lecture Notes in Computer Science 1470, 1998, pp. 413-421
• Optimal orthogonal tiling
  Rumen Andonov, Sanjay Rajopadhye, Nicola Yanev
  Lecture Notes in Computer Science 1470, 1998, pp. 480-490