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

• Using a general-purpose numerical library to parallelize an industrial application: Design of high-performance lasers
  Ida de Bono, Daniela di Serafino, Eric Ducloux
  Lecture Notes in Computer Science 1470, 1998, pp. 812-820
• Fast parallel Hermite normal form computation of matrices over F[x]
  Clemens Wagner
  Lecture Notes in Computer Science 1470, 1998, pp. 821-830
• Optimising parallel logic programming systems for scalable machines
  Vítor Santos Costa, Ricardo Bianchini
  Lecture Notes in Computer Science 1470, 1998, pp. 831-841
• Experiments with binding schemes in LOGFLOW
  Zsolt Németh, Péter Kacsuk
  Lecture Notes in Computer Science 1470, 1998, pp. 842-845
• Experimental implementation of parallel TRAM on massively parallel computer
  Kazuhiro Ogata, Hiromichi Hirata, Shigenori Ioroi, Kokichi Futatsugi
  Lecture Notes in Computer Science 1470, 1998, pp. 846-851
• Parallel temporal tableaux
  R.I. Scott, M.D. Fisher, J.A. Keane
  Lecture Notes in Computer Science 1470, 1998, pp. 852-861
• Workshop 10+17+21+22 - Theory and algorithms for parallel computation
  Bill McColl, David Walker
  Lecture Notes in Computer Science 1470, 1998, pp. 863-864
• BSP, LogP, and oblivious programs
  Jörn Eisenbiegler, Welf Löwe, Wolf Zimmermann
  Lecture Notes in Computer Science 1470, 1998, pp. 865-874
• Parallel computation on interval graphs using PC clusters: Algorithms and experiments
  A. Ferreira, I. Guérin Lassous, K. Marcus, A. Rau-Chaplin
  Lecture Notes in Computer Science 1470, 1998, pp. 875-886
• Adaptable distributed shared memory: A formal definition
  Jordi Bataller, José M. Bernabéu-Aubán
  Lecture Notes in Computer Science 1470, 1998, pp. 887-891
• Parameterized parallel complexity
  Marco Cesati, Miriam di Ianni
  Lecture Notes in Computer Science 1470, 1998, pp. 892-896
• Asynchronous (time-warp) versus synchronous (event-horizon) simulation time advance in BSP
  Mauricio Marín
  Lecture Notes in Computer Science 1470, 1998, pp. 897-905
• Scalable sharing methods can support a simple performance model
  Jonathan Nash
  Lecture Notes in Computer Science 1470, 1998, pp. 906-915
• Long operand arithmetic on instruction systolic computer architectures and its application in RSA cryptography
  Bertil Schmidt, Manfred Schimmler, Heiko Schröder
  Lecture Notes in Computer Science 1470, 1998, pp. 916-922
• Hardware cache optimization for parallel multimedia applications
  C. Kulkarni, F. Catthoor, H. de Man
  Lecture Notes in Computer Science 1470, 1998, pp. 923-932
• Parallel solutions of simple indexed recurrence equations
  Yosi Ben-Asher, Gady Haber
  Lecture Notes in Computer Science 1470, 1998, pp. 933-939
• Scheduling fork graphs under LogP with an unbounded number of processors
  Iskander Kort, Denis Trystram
  Lecture Notes in Computer Science 1470, 1998, pp. 940-943
• A data layout strategy for parallel Web servers
  Jörg Jensch, Reinhard Lüling, Norbert Sensen
  Lecture Notes in Computer Science 1470, 1998, pp. 944-952
• ViPIOS: The Vienna parallel input/output system
  Erich Schikuta, Thomas Fuerle, Helmut Wanek
  Lecture Notes in Computer Science 1470, 1998, pp. 953-958
• A performance study of two-phase I/O
  Phillip M. Dickens, Rajeev Thakur
  Lecture Notes in Computer Science 1470, 1998, pp. 959-965
• Workshop 13+14 - Architectures and networks
  Kieran Herley, David Snelling
  Lecture Notes in Computer Science 1470, 1998, pp. 967-969
• Predictable communication on unpredictable networks: Implementing BSP over TCP/IP
  Stephen R. Donaldson, Jonathan M.D. Hill, David B. Skillicorn
  Lecture Notes in Computer Science 1470, 1998, pp. 970-980
• Adaptive routing based on deadlock recovery
  Nidhi Agrawal, C.P. Ravikumar
  Lecture Notes in Computer Science 1470, 1998, pp. 981-988
• On the optimal network for multicomputers: Torus or hypercube?
  Mohamed Ould-Khaoua
  Lecture Notes in Computer Science 1470, 1998, pp. 989-992
• Constant thinning protocol for routing h-relations in complete networks
  Anssi Kautonen, Ville Leppänen, Martti Penttonen
  Lecture Notes in Computer Science 1470, 1998, pp. 993-998