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 [1]	Hilfe

Suche: Series=LNCS AND Volume=1900

• Database replication using epidemic communication
  JoAnne Holliday, Divyakant Agrawal, Amr El Abbadi
  Lecture Notes in Computer Science 1900, 2000, pp. 427-434
• Evaluating the coordination overhead of replica maintenance in a cluster of databases
  Klemens Böhm, Torsten Grabs, Uwe Röhm, Hans-Jörg Schek
  Lecture Notes in Computer Science 1900, 2000, pp. 435-444
• A communication infrastructure for a distributed RDBMS
  Michael Stillger, Dieter Scheffner, Johann-Christoph Freytag
  Lecture Notes in Computer Science 1900, 2000, pp. 445-450
• Distribution, replication, parallelism, and efficiency issues in a large-scale online/real-time information system for foreign exchange trading
  Peter Peinl
  Lecture Notes in Computer Science 1900, 2000, pp. 451-454
• Positive linear programming extensions: Parallel complexity and applications
  Pavlos S. Efraimidis, Paul G. Spirakis
  Lecture Notes in Computer Science 1900, 2000, pp. 456-460
• Parallel shortest path for arbitrary graphs
  Ulrich Meyer, Peter Sanders
  Lecture Notes in Computer Science 1900, 2000, pp. 461-470
• Periodic correction networks
  Marcin Kik
  Lecture Notes in Computer Science 1900, 2000, pp. 471-478
• En efficient algorithm for parallel 3D reconstruction of asymmetric objects from electron micrographs
  Robert E. Lynch, Hong Lin, Dan C. Marinescu
  Lecture Notes in Computer Science 1900, 2000, pp. 481-490
• Fast cloth simulation with parallel computers
  Sergio Romero, Luis F. Romero, Emilio L. Zapata
  Lecture Notes in Computer Science 1900, 2000, pp. 491-499
• The input, preparation, and distribution of data for parallel GIS operations
  Gordon J. Darling, Terence M. Sloan, Connor Mulholland
  Lecture Notes in Computer Science 1900, 2000, pp. 500-505
• Study of the load balancing in the parallel training for automatic speech recognition
  El Mostafa Daoudi, Pierre Manneback, Abdelouafi Meziane, Yahya Ould Mohamed El Hadj
  Lecture Notes in Computer Science 1900, 2000, pp. 506-510
• Pfortran and co-array Fortran as tools for parallelization of a large-scale scientific application
  Piotr Baƚa, Terry W. Clark
  Lecture Notes in Computer Science 1900, 2000, pp. 511-518
• Sparse matrix structure for dynamic parallelisation efficiency
  Markus Ast, Cristina Barrado, José Cela, Rolf Fischer, Jesús Labarta, Óscar Laborda, Hartmut Manz, Uwe Schulz
  Lecture Notes in Computer Science 1900, 2000, pp. 519-526
• A multi-color inverse iteration for a high performance real symmetric eigensolver
  Ken Naono, Yusaku Yamamoto, Mitsuyoshi Igai, Hiroyuki Hirayama, Nobuhiro Ioki
  Lecture Notes in Computer Science 1900, 2000, pp. 527-531
• Parallel implementation of Fast Hartley Transform (FHT) in multiprocessor systems
  Felicia Ionescu, Andrei Jalba, Mihail Ionescu
  Lecture Notes in Computer Science 1900, 2000, pp. 532-535
• Coherency behavior on DSM: A case study
  Jean-Thomas Acquaviva, William Jalby
  Lecture Notes in Computer Science 1900, 2000, pp. 539-544
• Hardware migratable channels
  David May, Henk Muller, Shondip Sen
  Lecture Notes in Computer Science 1900, 2000, pp. 545-549
• Reducing the replacement overhead on COMA protocols for workstation-based architectures
  Diego R. Llanos Ferraris, Benjamín Sahelices Fernández, Agustín De Dios Hernández
  Lecture Notes in Computer Science 1900, 2000, pp. 550-557
• Cache injection: A novel technique for tolerating memory latency in bus-based SMPs
  Aleksandar Milenkovic, Veljko Milutinovic
  Lecture Notes in Computer Science 1900, 2000, pp. 558-566
• Adaptive proxies: Handling widely-shared data in shared-memory multiprocessors
  Sarah A.M. Talbot, Paul H.J. Kelly
  Lecture Notes in Computer Science 1900, 2000, pp. 567-572
• A combinatorial characterization of properties preserved by antitokens
  Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas
  Lecture Notes in Computer Science 1900, 2000, pp. 575-582
• Searching with mobile agents in networks with liars
  Nicolas Hanusse, Evangelos Kranakis, Danny Krizanc
  Lecture Notes in Computer Science 1900, 2000, pp. 583-590
• Complete exchange algorithms for meshes and tori using a systematic approach
  Luis Díaz de Cerio, Miguel Valero-García, Antonio González
  Lecture Notes in Computer Science 1900, 2000, pp. 591-594
• Algorithms for routing AGVs on a mesh topology
  Ling Qiu, Wen-Jing Hsu
  Lecture Notes in Computer Science 1900, 2000, pp. 595-599
• Self-stabilizing protocol for shortest path tree for multi-cast routing in mobile networks
  Sandeep K.S. Gupta, Abdelmadjid Bouabdallah, Pradip K. Srimani
  Lecture Notes in Computer Science 1900, 2000, pp. 600-604