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 Volume=2400

• Parallel convex hull computation by generalised regular sampling
  Alexandre Tiskin
  Lecture Notes in Computer Science 2400, 2002, pp. 392-399
• Parallel algorithms for fast Fourier transformation using PowerList, ParList and PList theories
  Virginia Niculescu
  Lecture Notes in Computer Science 2400, 2002, pp. 400-403
• A branch and bound algorithm for capacitated minimum spanning tree problem
  Jun Han, Graham McMahon, Stephen Sugden
  Lecture Notes in Computer Science 2400, 2002, pp. 404-407
• Perfect load balancing for demand-driven parallel ray tracing
  Tomas Plachetka
  Lecture Notes in Computer Science 2400, 2002, pp. 410-419
• Parallel controlled conspiracy number search
  U. Lorenz
  Lecture Notes in Computer Science 2400, 2002, pp. 420-430
• A parallel solution in texture analysis employing a massively parallel processor
  Andreas I. Svolos, Charalambos Konstantopoulos, Christos Kaklamanis
  Lecture Notes in Computer Science 2400, 2002, pp. 431-435
• Stochastic simulation of a marine host-parasite system using a hybrid MPI/OpenMP programming
  Michel Langlais, Guillaume Latu, Jean Roman, Patrick Silan
  Lecture Notes in Computer Science 2400, 2002, pp. 436-446
• Optimization of fire propagation model inputs: A grand challenge application on metacomputers
  Baker Abdalhaq, Ana Cortés, Tomás Margalef, Emilio Luque
  Lecture Notes in Computer Science 2400, 2002, pp. 447-451
• Parallel numerical solution of the Boltzmann equation for atomic layer deposition
  Samuel G. Webster, Matthias K. Gobbert, Jeam-François Remacle, Timothy S. Cale
  Lecture Notes in Computer Science 2400, 2002, pp. 452-456
• Independent hashing as confidence mechanism for value predictors in microprocessors
  Veerle Desmet, Bart Goeman, Koen De Bosschere
  Lecture Notes in Computer Science 2400, 2002, pp. 458-467
• Exploiting the prefetching effect provided by executing mispredicted load instructions
  Resit Sendag, David J. Lilja, Steven R. Kunkel
  Lecture Notes in Computer Science 2400, 2002, pp. 468-480
• Increasing instruction-level parallelism with instruction precomputation
  Joshua J. Yi, Resit Sendag, David J. Lilja
  Lecture Notes in Computer Science 2400, 2002, pp. 481-485
• Runtime association of software prefetch control to memory access instructions
  Chi-Hung Chi, JunLi Yuan
  Lecture Notes in Computer Science 2400, 2002, pp. 486-489
• Realizing high IPC using time-tagged resource-flow computing
  Augustus Uht, Alireza Khalafi, David Morano, Marcos de Alba, David Kaeli
  Lecture Notes in Computer Science 2400, 2002, pp. 490-499
• A register file architecture and compilation scheme for clustered ILP processors
  Krishna Kailas, Manoj Franklin, Kemal Ebcioğlu
  Lecture Notes in Computer Science 2400, 2002, pp. 500-511
• A comparative study of redundancy in trace caches
  Hans Vandierendonck, Alex Ramírez, Koen De Bosschere, Mateo Valero
  Lecture Notes in Computer Science 2400, 2002, pp. 512-516
• Speeding up target address generation using a self-indexed FTB
  Juan C. Moure, Dolores I. Rexachs, Emilio Luque
  Lecture Notes in Computer Science 2400, 2002, pp. 517-521
• Real PRAM programming
  Wolfgang J. Paul, Peter Bach, Michael Bosch, Jörg Fischer, Cédric Lichtenau, Jochen Röhrig
  Lecture Notes in Computer Science 2400, 2002, pp. 522-531
• In-memory parallelism for database workloads
  Pedro Trancoso
  Lecture Notes in Computer Science 2400, 2002, pp. 532-542
• Enforcing cache coherence at data sharing boundaries without global control: A hardware-software approach
  H Sarojadevi, S.K. Nandy, S. Balakrishnan
  Lecture Notes in Computer Science 2400, 2002, pp. 543-546
• CODAS project: A demand-data driven reconfigurable architecture
  Lorenzo Verdoscia
  Lecture Notes in Computer Science 2400, 2002, pp. 547-550
• A self-stabilizing token-based k-out-of-l exclusion algorithm
  Ajoy K. Datta, Rachid Hadid, Vincent Villain
  Lecture Notes in Computer Science 2400, 2002, pp. 553-562
• An algorithm for ensuring fairness and liveness in non-deterministic systems based on multiparty interactions
  David Ruiz, Rafael Corchuelo, José A. Pérez, Miguel Toro
  Lecture Notes in Computer Science 2400, 2002, pp. 563-572
• On obtaining global information in a peer-to-peer fully distributed environment
  Mark Jelasity, Mike Preuß
  Lecture Notes in Computer Science 2400, 2002, pp. 573-577
• A fault-tolerant sequencer for timed asynchronous systems
  Roberto Baldoni, Carlo Marchetti, Sara Tucci Piergiovanni
  Lecture Notes in Computer Science 2400, 2002, pp. 578-588