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

• Workshop 05+15 - Distributed systems and databases
  Lionel Brunie, Ernst Mayr
  Lecture Notes in Computer Science 1470, 1998, pp. 503-504
• Virtual time synchronization in distributed database systems using a cluster of workstations
  Azzedine Boukerche, Timothy E. LeMaster, Sajal K. Das, Ajoy Datta
  Lecture Notes in Computer Science 1470, 1998, pp. 534-538
• Mutual exclusion between neighboring nodes in a tree that stabilizes using read/write atomicity
  Gheorghe Antonoiu, Pradip K. Srimani
  Lecture Notes in Computer Science 1470, 1998, pp. 545-553
• Active ports: A performance-oriented operating system support to fast LAN communications
  G. Chiola, G. Ciaccio
  Lecture Notes in Computer Science 1470, 1998, pp. 620-624
• A tracing protocol for optimizing data parallel irregular computations
  Thomas Brandes, Cécile Germain
  Lecture Notes in Computer Science 1470, 1998, pp. 629-638
• Contribution to better handling of irregular problems in HPF2
  Thomas Brandes, Frédéric Brégier, Marie Christine Counilh, Jean Roman
  Lecture Notes in Computer Science 1470, 1998, pp. 639-649
• OpenMP and HPF: Integrating two paradigms
  Barbara Chapman, Piyush Mehrotra
  Lecture Notes in Computer Science 1470, 1998, pp. 650-658
• Towards a Java environment for SPMD programming
  Bryan Carpenter, Guansong Zhang, Geoffrey Fox, Xiaoming Li, Xinying Li, Yuhong Wen
  Lecture Notes in Computer Science 1470, 1998, pp. 659-668
• Workshop 7+20 - Numerical and symbolic algorithms
  Maurice Clint, Wolfgang Küchlin
  Lecture Notes in Computer Science 1470, 1998, pp. 747-750
• A parallel solver for extreme eigenpairs
  Leonardo Borges, Suely Oliveira
  Lecture Notes in Computer Science 1470, 1998, pp. 763-770
• Parallel solvers for large eigenvalue problems originating from Maxwell's equations
  Peter Arbenz, Roman Geus
  Lecture Notes in Computer Science 1470, 1998, pp. 771-779
• 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
• Parallel solutions of simple indexed recurrence equations
  Yosi Ben-Asher, Gady Haber
  Lecture Notes in Computer Science 1470, 1998, pp. 933-939
• A performance study of two-phase I/O
  Phillip M. Dickens, Rajeev Thakur
  Lecture Notes in Computer Science 1470, 1998, pp. 959-965
• Adaptive routing based on deadlock recovery
  Nidhi Agrawal, C.P. Ravikumar
  Lecture Notes in Computer Science 1470, 1998, pp. 981-988
• Interval routing & layered cross product: Compact routing schemes for butterflies, mesh of trees and fat trees
  Tiziana Calamoneri, Miriam di Ianni
  Lecture Notes in Computer Science 1470, 1998, pp. 1029-1039
• Shared control - Supporting control parallelism using a SIMD-like architecture
  Nael B. Abu-Ghazaleh, Philip A. Wilsey
  Lecture Notes in Computer Science 1470, 1998, pp. 1089-1099
• Parallel crew scheduling in PAROS
  Panayiotis Alefragis, Christos Goumopoulos, Efthymios Housos, Peter Sanders, Tuomo Takkula, Dag Wedelin
  Lecture Notes in Computer Science 1470, 1998, pp. 1104-1113
• OCEANS: Optimising compilers for embedded applicatioNS
  Michel Barreteau, François Bodin, Peter Brinkhaus, Zbigniew Chamski, Henri-Pierre Charles, Christine Eisenbeis, John Gurd, Jan Hoogerbrugge, Ping Hu, William Jalby, Peter M.W. Knijnenburg, Michael O'Boyle, Erven Rohou, Rizos Sakellariou, André Seznec, Elena A. Stöhr, Menno Treffers, Harry A.G. Wijshoff
  Lecture Notes in Computer Science 1470, 1998, pp. 1123-1130
• Car-pooling as a data structuring device: The soft heap
  Bernard Chazelle
  Lecture Notes in Computer Science 1461, 1998, pp. 35-42
• Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property
  Phil Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter
  Lecture Notes in Computer Science 1461, 1998, pp. 43-54
• Longest common subsequence from fragments via sparse dynamic programming
  Brenda S. Baker, Raffaele Giancarlo
  Lecture Notes in Computer Science 1461, 1998, pp. 79-90
• Complexity estimates depending on condition and round-off error
  Felipe Cucker, Steve Smale
  Lecture Notes in Computer Science 1461, 1998, pp. 115-126
• A probabilistic zero-test for expressions involving roots of rational numbers
  Johannes Blömer
  Lecture Notes in Computer Science 1461, 1998, pp. 151-162