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

• Porting a molecular dynamics application on a low-cost cluster of personal computers running GAMMA
  G. Ciaccio, V. di Martino
  Lecture Notes in Computer Science 1388, 1998, pp. 524-533
• Optimal communication performance on fast Ethernet with GAMMA
  Giuseppe Ciaccio
  Lecture Notes in Computer Science 1388, 1998, pp. 534-548
• MPI on NT: A preliminary evaluation of the available environments
  Mark Baker, Geoffrey Fox
  Lecture Notes in Computer Science 1388, 1998, pp. 549-563
• The QCD abacus: A cellular automata formulation for continuous gauge symmetries
  Richard C. Brower
  Lecture Notes in Computer Science 1388, 1998, pp. 584-584
• Affordable fault tolerance through adaptation
  Ilwoo Chang, Matti A. Hiltunen, Richard D. Schlichting
  Lecture Notes in Computer Science 1388, 1998, pp. 585-603
• Fault-tolerant broadcasting in toroidal networks
  Bader Almohammad, Bella Bose
  Lecture Notes in Computer Science 1388, 1998, pp. 681-692
• Performance analysis of a fault-tolerant scheme for location management of mobile hosts
  Saad Biaz, Nitin H. Vaidya
  Lecture Notes in Computer Science 1388, 1998, pp. 756-769
• On the automatic validation of parameterized Unity programs
  J.-P. Bodeveix, M. Filali
  Lecture Notes in Computer Science 1388, 1998, pp. 807-819
• Tailoring UNITY to distributed program design
  Michel Charpentier, Mamoun Filali, Philippe Mauran, Gérard Padiou, Philippe Quéinnec
  Lecture Notes in Computer Science 1388, 1998, pp. 820-832
• A cottage industry of software publishing: Implications for theories of composition
  K. Mani Chandy, Paolo A.G. Sivilotti, Joseph R. Kiniry
  Lecture Notes in Computer Science 1388, 1998, pp. 890-899
• Partial rearrangements of space-shared FPGAs
  Oliver Diessel, Hossam ElGindy
  Lecture Notes in Computer Science 1388, 1998, pp. 913-918
• A chip search problem on binary numbers
  Peter Damaschke
  Lecture Notes in Computer Science 1380, 1998, pp. 11-22
• Super-state automata and rational trees
  Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin
  Lecture Notes in Computer Science 1380, 1998, pp. 42-52
• An Eilenberg theorem for words on countable ordinals
  Nicolas Bedon, Olivier Carton
  Lecture Notes in Computer Science 1380, 1998, pp. 53-64
• Short and smooth polygonal paths
  James Abello, Emden Gansner
  Lecture Notes in Computer Science 1380, 1998, pp. 151-162
• Quantum cryptanalysis of hash and claw-free functions
  Gilles Brassard, Peter Hyer, Alain Tapp
  Lecture Notes in Computer Science 1380, 1998, pp. 163-169
• Batch verification with applications to cryptography and checking
  Mihir Bellare, Juan A. Garay, Tal Rabin
  Lecture Notes in Computer Science 1380, 1998, pp. 170-191
• Spectral techniques in graph algorithms
  Noga Alon
  Lecture Notes in Computer Science 1380, 1998, pp. 206-215
• A linear time algorithm to recognize clustered planar graphs and its parallelization
  Elias Dahlhaus
  Lecture Notes in Computer Science 1380, 1998, pp. 239-248
• Dynamic packet routing on arrays with bounded buffers
  Andrei Z. Broder, Alan M. Frieze, Eli Upfal
  Lecture Notes in Computer Science 1380, 1998, pp. 273-281
• The geometry of browsing
  Richard Beigel, Egemen Tanin
  Lecture Notes in Computer Science 1380, 1998, pp. 331-340
• Fast two-dimensional approximate pattern matching
  Ricardo Baeza-Yates, Gonzalo Navarro
  Lecture Notes in Computer Science 1380, 1998, pp. 341-351
• Simplifying the modal Mu-calculus alternation hierarchy
  J.C. Bradfield
  Lecture Notes in Computer Science 1373, 1998, pp. 39-49
• The complexity of propositional linear temporal logics in simple cases
  S. Demri, Ph. Schnoebelen
  Lecture Notes in Computer Science 1373, 1998, pp. 61-72
• Searching constant width mazes captures the AC^0 hierarchy
  David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum
  Lecture Notes in Computer Science 1373, 1998, pp. 73-83