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

• A quantum jump in computer science
  Gilles Brassard
  Lecture Notes in Computer Science 1000, 1995, pp. 1-14
• Artificial life and real world computing
  Luc Steels, Mario Tokoro
  Lecture Notes in Computer Science 1000, 1995, pp. 15-28
• Recurrent neural networks
  Hava T. Siegelmann
  Lecture Notes in Computer Science 1000, 1995, pp. 29-45
• Scalable computing
  W.F. McColl
  Lecture Notes in Computer Science 1000, 1995, pp. 46-61
• Efficient use of parallel and distributed systems: From theory to practice
  Burkhard Monien, Ralf Diekmann, Rainer Feldmann, Ralf Klasing, Reinhard Lüling, Knut Menzel, Thomas Römke, Ulf-Peter Schroeder
  Lecture Notes in Computer Science 1000, 1995, pp. 62-77
• Experimental validation of models of parallel computation
  Lawrence Snyder
  Lecture Notes in Computer Science 1000, 1995, pp. 78-100
• Quo vadetis, parallel machine models?
  Jiȓí Wiedermann
  Lecture Notes in Computer Science 1000, 1995, pp. 101-114
• Templates for linear algebra problems
  Zhaojun Bai, David Day, James Demmel, Jack Dongarra, Ming Gu, Axel Ruhe, Henk van der Vorst
  Lecture Notes in Computer Science 1000, 1995, pp. 115-140
• The ART behind IDEAS
  Thomas Beth, Andreas Klappenecker, Torsten Minkwitz, Armin Nückel
  Lecture Notes in Computer Science 1000, 1995, pp. 141-158
• Algorithmic number theory and its relationship to computational complexity
  Leonard M. Adleman
  Lecture Notes in Computer Science 1000, 1995, pp. 159-171
• Edge-coloring algorithms
  Shin-ichi Nakano, Xiao Zhou, Takao Nishizeki
  Lecture Notes in Computer Science 1000, 1995, pp. 172-183
• Towards a computational theory of genome rearrangements
  Sridhar Hannenhalli, Pavel A. Pevzner
  Lecture Notes in Computer Science 1000, 1995, pp. 184-202
• Algebraic topology and distributed computing - A primer
  Maurice Herlihy, Sergio Rajsbaum
  Lecture Notes in Computer Science 1000, 1995, pp. 203-217
• Differential BBDs
  Anuchit Anuchitanukul, Zohar Manna, Tomás E. Uribe
  Lecture Notes in Computer Science 1000, 1995, pp. 218-233
• Algorithmic techniques for geometric optimization
  Pankaj K. Agarwal, Micha Sharir
  Lecture Notes in Computer Science 1000, 1995, pp. 234-253
• All the needles in a haystack: Can exhaustive search overcome combinatorial chaos?
  Jürg Nievergelt, Ralph Gasser, Fabian Mäser, Christoph Wirth
  Lecture Notes in Computer Science 1000, 1995, pp. 254-274
• Fundamental limitations on search algorithms: Evolutionary computing in perspective
  Nicholas J. Radcliffe, Patrick D. Surry
  Lecture Notes in Computer Science 1000, 1995, pp. 275-291
• Mathematical system models as a basis of software engineering
  Manfred Broy
  Lecture Notes in Computer Science 1000, 1995, pp. 292-306
• Formulations and formalisms in software architecture
  Mary Shaw, David Garlan
  Lecture Notes in Computer Science 1000, 1995, pp. 307-323
• The Oz programming model
  Gert Smolka
  Lecture Notes in Computer Science 1000, 1995, pp. 324-343
• Standard generalized markup language: Mathematical and philosophical issues
  Derick Wood
  Lecture Notes in Computer Science 1000, 1995, pp. 344-365
• Avoiding the undefined by underspecification
  David Gries, Fred B. Schneider
  Lecture Notes in Computer Science 1000, 1995, pp. 366-373
• Towards a theory of recursive structures
  David Harel
  Lecture Notes in Computer Science 1000, 1995, pp. 374-391
• Chu spaces and their interpretation as concurrent objects
  Vaughan Pratt
  Lecture Notes in Computer Science 1000, 1995, pp. 392-405
• Abstracting unification: A key step in the design of logic program analyses
  Maurice Bruynooghe, Michael Codish, Anne Mulkers
  Lecture Notes in Computer Science 1000, 1995, pp. 406-425