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

• Algorithmic skeletons for adaptive multigrid methods
  George Horatiu Botorog, Herbert Kuchen
  Lecture Notes in Computer Science 980, 1995, pp. 27-41
• Fast execution of irregularly structured programs with low communication frequency on the hypercube
  Vincenzo Auletta, Alberto Negro, Vittorio Scarano
  Lecture Notes in Computer Science 980, 1995, pp. 59-73
• An efficient mean field annealing formulation for mapping unstructured domains to hypercubes
  Cevdet Aykanat, İsmail Haritaoğlu
  Lecture Notes in Computer Science 980, 1995, pp. 115-120
• On the scope of applicability of the ETF algorithm
  Cristina Boeres, George Chochia, Peter Thanisch
  Lecture Notes in Computer Science 980, 1995, pp. 159-164
• Parallel processing in DNA analysis
  Charles R. Cantor, Takeshi Sano, Natalia E. Broude, Cassandra L. Smith
  Lecture Notes in Computer Science 980, 1995, pp. 171-185
• Distributed symbolic computation with DTS
  T. Bubeck, M. Hiller, W. Küchlin, W. Rosenstiel
  Lecture Notes in Computer Science 980, 1995, pp. 231-248
• A reconfigurable parallel algorithm for sparse Cholesky factorization
  A. Benaini, D. Laiymani, G.R. Perrin
  Lecture Notes in Computer Science 980, 1995, pp. 261-274
• A parallel formulation for general branch-and bound algorithms
  Ricardo Corrêa
  Lecture Notes in Computer Science 980, 1995, pp. 395-409
• Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model
  Armin Bäumker, Wolfgang Dittrich, Friedhelm Meyer auf der Heide
  Lecture Notes in Computer Science 979, 1995, pp. 17-30
• Optimal parallel shortest paths in small treewidth digraphs
  Shiva Chaudhuri, Christos D. Zaroliagis
  Lecture Notes in Computer Science 979, 1995, pp. 31-45
• Fast deterministic simulation of computations on faulty parallel machines
  Bogdan S. Chlebus, Leszek Ga̧ieniec, Andrzej Pelc
  Lecture Notes in Computer Science 979, 1995, pp. 89-101
• Average circuit depth and average communication complexity
  Bruno Codenotti, Peter Gemmell, Janos Simon
  Lecture Notes in Computer Science 979, 1995, pp. 102-112
• A geometric approach to betweenness
  Benny Chor, Madhu Sudan
  Lecture Notes in Computer Science 979, 1995, pp. 227-237
• Geometric pattern matching in d-dimensional space
  L. Paul Chew, Dorit Dor, Alon Efrat, Klara Kedem
  Lecture Notes in Computer Science 979, 1995, pp. 264-279
• External-memory algorithms for processing line segments in geographic information systems
  Lars Arge, Darren Erik Vengroff, Jeffrey Scott Vitter
  Lecture Notes in Computer Science 979, 1995, pp. 295-310
• Optimized binary search and text retrieval
  Eduardo Fernandes Barbosa, Gonzalo Navarro, Ricardo Baeza-Yates, Chris Perleberg, Nivio Ziviani
  Lecture Notes in Computer Science 979, 1995, pp. 311-326
• Self-simulation for the Passive Optical Star Model
  P. Berthomé, Th. Duboux, T. Hagerup, I. Newman, A. Schuster
  Lecture Notes in Computer Science 979, 1995, pp. 369-380
• The centroid of points with approximate weights
  Marshall Bern, David Eppstein, Leonidas Guibas, John Hershberger, Subhash Suri, Jan Wolter
  Lecture Notes in Computer Science 979, 1995, pp. 460-472
• Efficient dynamic-resharing "Verifiable Secret Sharing" against mobile adversary
  Noga Alon, Zvi Galil, Moti Yung
  Lecture Notes in Computer Science 979, 1995, pp. 523-537
• Adaptive video on demand
  Sudhanshu Aggarwal, Juan A. Garay, Amir Herzberg
  Lecture Notes in Computer Science 979, 1995, pp. 538-553
• Complete solving of linear diophantine equations and inequations without adding variables
  Farid Ajili, Evelyne Contejean
  Lecture Notes in Computer Science 976, 1995, pp. 1-17
• Dynamic variable ordering in CSPs
  Fahiem Bacchus, Paul van Run
  Lecture Notes in Computer Science 976, 1995, pp. 258-275
• On the forward checking algorithm
  Fahiem Bacchus, Adam Grove
  Lecture Notes in Computer Science 976, 1995, pp. 292-309
• Guarded constructive disjunction: Angel or demon?
  Christian Codognet, Philippe Codognet
  Lecture Notes in Computer Science 976, 1995, pp. 345-361
• On the combination of symbolic constraints, solution domains, and constraint solvers
  Franz Baader, Klaus U. Schulz
  Lecture Notes in Computer Science 976, 1995, pp. 380-397