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

• Low communication parallel multigrid - A fine level approach
  Marcus Mohr
  Lecture Notes in Computer Science 1900, 2000, pp. 806-814
• Parallelizing an unstructured grid generator with a space-filling curve approach
  Jörn Behrens, Jens Zimmermann
  Lecture Notes in Computer Science 1900, 2000, pp. 815-823
• 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
• Sliding-window compression on the hypercube
  Charalampos Konstantopoulos, Andreas Svolos, Christos Kaklamanis
  Lecture Notes in Computer Science 1900, 2000, pp. 835-838
• 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
• NEPHEW: Applying a toolset for the efficient deployment of a medical image application on SCI-based clusters
  Wolfgang Karl, Martin Schulz, Martin Völk, Sibylle Ziegler
  Lecture Notes in Computer Science 1900, 2000, pp. 851-860
• SEEDS: Airport management database system
  Tomás̑ Hrúz, Martin Bec̑ka, Antonello Pasquarelli
  Lecture Notes in Computer Science 1900, 2000, pp. 861-868
• HIPERTRANS: High performance transport network modelling and simulation
  Stephen E. Ijaha, Stephen C. Winter, Nasser Kalantery
  Lecture Notes in Computer Science 1900, 2000, pp. 869-874
• 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
• Improving the up*/down* routing scheme for networks of workstations
  José Carlos Sancho, Antonio Robles
  Lecture Notes in Computer Science 1900, 2000, pp. 882-889
• Deadlock avoidance for wormhole based switches
  Ingebjrg Theiss, Olav Lysne
  Lecture Notes in Computer Science 1900, 2000, pp. 890-899
• An analytical model of adaptive wormhole routing with deadlock recovery
  Mohamed Ould-Khaoua, Ahmad Khonsari
  Lecture Notes in Computer Science 1900, 2000, pp. 900-903
• Analysis of pipelined circuit switching in cube networks
  Geyong Min, Mohamed Ould-Khaoua
  Lecture Notes in Computer Science 1900, 2000, pp. 904-908
• A new reliability model for interconnection networks
  Vicente Chirivella, Rosa Alcover
  Lecture Notes in Computer Science 1900, 2000, pp. 909-917
• A bandwidth latency tradeoff for broadcast and reduction
  Peter Sanders, Jop F. Sibeyn
  Lecture Notes in Computer Science 1900, 2000, pp. 918-926
• Optimal broadcasting in even tori with dynamic faults
  Stefan Dobrev, Imrich Vrt'o
  Lecture Notes in Computer Science 1900, 2000, pp. 927-930
• Broadcasting in all-port wormhole 3-D meshes of trees
  Petr Salinger, Pavel Tvrdík
  Lecture Notes in Computer Science 1900, 2000, pp. 931-934
• 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
• On the performance of fetch engines running DSS workloads
  Carlos Navarro, Alex Ramírez, Josep-L. Larriba-Pey, Mateo Valero
  Lecture Notes in Computer Science 1900, 2000, pp. 940-949
• Cost-efficient branch target buffers
  Jan Hoogerbrugge
  Lecture Notes in Computer Science 1900, 2000, pp. 950-959
• Two-level address storage and address prediction
  Enric Morancho, José María Llabería, Àngel Olivé
  Lecture Notes in Computer Science 1900, 2000, pp. 960-964
• Hashed addressed caches for embedded pointer based codes
  Marian Stanca, Stamatis Vassiliadis, Sorin Cotofana, Henk Corporaal
  Lecture Notes in Computer Science 1900, 2000, pp. 965-968
• 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