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

• Solving discrete-time periodic Riccati equations on a cluster
  Peter Benner, Rafael Mayo, Enrique S. Quintana-Ortí, Vincente Hernández
  Lecture Notes in Computer Science 1900, 2000, pp. 824-828
• A parallel optimization scheme for parameter estimation in motor vehicle dynamics
  Torsten Butz, Oskar von Stryk, Thiess̈-Magnus Wolter
  Lecture Notes in Computer Science 1900, 2000, pp. 829-834
• A parallel implementation of a potential reduction algorithm for box-constrained quadratic programming
  Marco D'Appuzzo, Marina Marino, Panos M. Pardalos, Gerardo Toraldo
  Lecture Notes in Computer Science 1900, 2000, pp. 839-848
• Experimental evaluation of hot-potato routing algorithms on 2-dimensional processor arrays
  Constantinos Bartzis, Ioannis Caragiannis, Christos Kaklamanis, Ioannis Vergados
  Lecture Notes in Computer Science 1900, 2000, pp. 877-881
• A new reliability model for interconnection networks
  Vicente Chirivella, Rosa Alcover
  Lecture Notes in Computer Science 1900, 2000, pp. 909-917
• Optimal broadcasting in even tori with dynamic faults
  Stefan Dobrev, Imrich Vrt'o
  Lecture Notes in Computer Science 1900, 2000, pp. 927-930
• Probability-based fault-tolerant routing in hypercubes
  Jehad Al-Sadi, Khaled Day, Mohamed Ould-Khaoua
  Lecture Notes in Computer Science 1900, 2000, pp. 935-938
• BitValue inference: Detecting and exploiting narrow bitwidth computations
  Mihai Budiu, Majd Sakr, Kip Walker, Seth C. Goldstein
  Lecture Notes in Computer Science 1900, 2000, pp. 969-979
• General matrix-matrix multiplication using SIMD features of the PIII
  Douglas Aberdeen, Jonathan Baxter
  Lecture Notes in Computer Science 1900, 2000, pp. 980-983
• Cache remapping to improve the performance of tiled algorithms
  Kristof E. Beyls, Erik H. D'Hollander
  Lecture Notes in Computer Science 1900, 2000, pp. 998-1007
• Compiling multithreaded Java bytecode for distributed execution
  Gabriel Antoniu, Luc Bougé, Philip Hatcher, Mark MacBeth, Keith McGuigan, Raymond Namyst
  Lecture Notes in Computer Science 1900, 2000, pp. 1039-1052
• A more expressive monitor for concurrent Java programming
  Hsin-Ta Chiao, Chi-Houng Wu, Shyan-Ming Yuan
  Lecture Notes in Computer Science 1900, 2000, pp. 1053-1060
• An object-oriented software framework for large-scale networked virtual environments
  Frédéric Dang Tran, Anne Gérodolle
  Lecture Notes in Computer Science 1900, 2000, pp. 1061-1070
• A distributed storage system for a video-on demand server
  Alice Bonhomme, Loïc Prylli
  Lecture Notes in Computer Science 1900, 2000, pp. 1110-1114
• Encouraging the unexpected: Cluster management for OS and systems research
  Ronan Cunniffe, Brian A. Coghlan
  Lecture Notes in Computer Science 1900, 2000, pp. 1143-1147
• SKElib: Parallel programming with skeletons in C
  Marco Danelutto, Massimiliano Stigliani
  Lecture Notes in Computer Science 1900, 2000, pp. 1175-1184
• A clustering approach for improving network performance in hetrogeneous systems
  Vicente Arnau, Juan M. Orduña, Salvador Moreno, Rodrigo Valero, Aurelio Ruiz
  Lecture Notes in Computer Science 1900, 2000, pp. 1206-1209
• Request sequencing: Optimizing communication for the grid
  Dorian C. Arnold, Dieter Bachmann, Jack Dongarra
  Lecture Notes in Computer Science 1900, 2000, pp. 1213-1222
• Logging RAID - An approach to fast, reliable, and low-cost disk arrays
  Ying Chen, Windsor W. Hsu, Honesty C. Young
  Lecture Notes in Computer Science 1900, 2000, pp. 1302-1311
• Pseudovectorization, SMP, and message passing on the Hitachi SR8000-F1
  Mathias Brehm, Reinhold Bader, Helmut Heller, Ralf Ebner
  Lecture Notes in Computer Science 1900, 2000, pp. 1351-1361
• Region analysis and a \pi -calculus with groups
  Silvano Dal Zilio, Andrew D. Gordon
  Lecture Notes in Computer Science 1893, 2000, pp. 1-20
• Abstract data types in computer algebra
  James H. Davenport
  Lecture Notes in Computer Science 1893, 2000, pp. 21-35
• What do we learn from experimental algorithmics?
  Camil Demetrescu, Giuseppe F. Italiano
  Lecture Notes in Computer Science 1893, 2000, pp. 36-51
• On the lower bounds for one-way quantum automata
  Farid Ablayev, Aida Gainutdinova
  Lecture Notes in Computer Science 1893, 2000, pp. 132-140
• Axiomatizing fully complete models for ML polymorphic types
  Samson Abramsky, Marina Lenisa
  Lecture Notes in Computer Science 1893, 2000, pp. 141-151