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

• 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
• 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
• Programming with shared data abstractions
  Simon Dobson, Don Goodeve
  Lecture Notes in Computer Science 1253, 1997, pp. 93-102
• Engineering diffusive load balancing algorithms using experiments
  Ralf Diekmann, S. Muthukrishnan, Madhu V. Nayakkankuppam
  Lecture Notes in Computer Science 1253, 1997, pp. 111-122
• Virtual data space - A universal load balancing scheme
  Thomas Decker
  Lecture Notes in Computer Science 1253, 1997, pp. 159-166
• Parallel shared-memory state-space exploration in stochastic modeling
  Susann C. Allmaier, Graham Horton
  Lecture Notes in Computer Science 1253, 1997, pp. 207-218
• Communication efficient parallel searching
  Armin Bäumker, Friedhelm Meyer auf der Heide
  Lecture Notes in Computer Science 1253, 1997, pp. 233-254
• Time processes for time Petri nets
  Tuomas Aura, Johan Lilius
  Lecture Notes in Computer Science 1248, 1997, pp. 136-155
• Analysis of Petri nets with a dynamic priority method
  Falko Bause
  Lecture Notes in Computer Science 1248, 1997, pp. 215-234
• Teaching coloured Petri nets - A gentle introduction to formal methods in a distributed systems course
  Sren Christensen, Kjeld H. Mortensen
  Lecture Notes in Computer Science 1248, 1997, pp. 290-309
• Fault detection in telecommunication networks based on a Petri net representation of alarm propagation
  Renée Boubour, Claude Jard
  Lecture Notes in Computer Science 1248, 1997, pp. 367-386
• Analysing Bang & Olufsen's BeoLink audio/video system using coloured Petri nets
  Sren Christensen, Jens Bæk Jrgensen
  Lecture Notes in Computer Science 1248, 1997, pp. 387-406
• Orthogonal transformations for coloured Petri nets
  Eike Best, Thomas Thielke
  Lecture Notes in Computer Science 1248, 1997, pp. 447-466
• Cross-loop reuse analysis and its application to cache optimizations
  Keith Cooper, Ken Kennedy, Nathaniel McIntosh
  Lecture Notes in Computer Science 1239, 1997, pp. 1-19
• Data distribution and loop parallelization for shared-memory multiprocessors
  Eduard Ayguadé, Jordi Garcia, M. Luz Grande, Jesús Labarta
  Lecture Notes in Computer Science 1239, 1997, pp. 41-55
• Exact versus approximate array region analyses
  Béatrice Creusillet, François Irigoin
  Lecture Notes in Computer Science 1239, 1997, pp. 86-100
• Initial results for glacial variable analysis
  Tito Autrey, Michael Wolfe
  Lecture Notes in Computer Science 1239, 1997, pp. 120-134
• Determining asynchronous pipeline execution times
  Val Donaldson, Jeanne Ferrante
  Lecture Notes in Computer Science 1239, 1997, pp. 154-174
• Integrating program optimizations and transformations with the scheduling of instruction level parallelism
  David A. Berson, Pohua Chang, Rajiv Gupta, Mary Lou Soffa
  Lecture Notes in Computer Science 1239, 1997, pp. 207-221
• Bidirectional scheduling: A new global code scheduling approach
  Pohua Chang, Dong-yuan Chen, Yong-fong Lee, Youfeng Wu, Utpal Banerjee
  Lecture Notes in Computer Science 1239, 1997, pp. 222-230
• Lock coarsening: Eliminating lock overhead in automatically parallelized object-based programs
  Pedro Diniz, Martin Rinard
  Lecture Notes in Computer Science 1239, 1997, pp. 285-299
• Communication-minimal partitioning of parallel loops and data arrays for cache-coherent distributed-memory multiprocessors
  Rajeev Barua, David Kranz, Anant Agarwal
  Lecture Notes in Computer Science 1239, 1997, pp. 350-368
• HPF on fine-grain distributed shared memory: Early experience
  Satish Chandra, James R. Larus
  Lecture Notes in Computer Science 1239, 1997, pp. 450-465
• Simple qualitative experiments with a sparse compiler
  Aart J.C. Bik, Harry A.G. Wijshoff
  Lecture Notes in Computer Science 1239, 1997, pp. 466-480
• Factor-join:A unique approach to compiling array languages for parallel machines
  Bradford L. Chamberlain, Sung-Eun Choi, E. Christopher Lewis, Calvin Lin, Lawrence Snyder, W. Derrick Weathersby
  Lecture Notes in Computer Science 1239, 1997, pp. 481-500