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

• Models, languages, and compiler technology for high performance computers
  Thomas Cheatham
  Lecture Notes in Computer Science 841, 1994, pp. 3-26
• On NC-real complexity classes for additive circuits and their relations with NC
  Michel Cosnard, Martín Matamala
  Lecture Notes in Computer Science 841, 1994, pp. 27-37
• E-complete sets do not have optimal polynomial time approximations
  Pavol D̑uris̑, José D.P. Rolim
  Lecture Notes in Computer Science 841, 1994, pp. 38-51
• Solving polynomial fixed point equations
  Stephen L. Bloom, Zoltán Ésik
  Lecture Notes in Computer Science 841, 1994, pp. 52-67
• Capturing complexity classes with Lindström quantifiers
  J.A. Makowsky
  Lecture Notes in Computer Science 841, 1994, pp. 68-71
• Communication throughput of interconnection networks
  Burkhard Monien, Ralf Diekmann, Reinhard Lüling
  Lecture Notes in Computer Science 841, 1994, pp. 72-86
• Intuitive counterexamples for constructive fallacies
  James Lipton, Michael J. O'Donnell
  Lecture Notes in Computer Science 841, 1994, pp. 87-111
• Algebraic methods in the compositional analysis of logic programs
  Fernando Orejas, Elvira Pino, Hartmut Ehrig
  Lecture Notes in Computer Science 841, 1994, pp. 112-126
• Longest common subsequences
  Mike Paterson, Vlado Danc̑ík
  Lecture Notes in Computer Science 841, 1994, pp. 127-142
• Towards DNA sequencing chips
  Pavel A. Pevzner, Robert J. Lipshutz
  Lecture Notes in Computer Science 841, 1994, pp. 143-158
• On-line scheduling of parallel jobs
  Jiȓí Sgall
  Lecture Notes in Computer Science 841, 1994, pp. 159-176
• Stable bistructure models of PCF
  Glynn Winskel
  Lecture Notes in Computer Science 841, 1994, pp. 177-200
• A competitive analysis of the list update problem with lookahead
  Susanne Albers
  Lecture Notes in Computer Science 841, 1994, pp. 201-210
• May and must convergency in concurrent \lambda-calculus
  F. Alessi, M. Dezani-Ciancaglini, U. de'Liguoro
  Lecture Notes in Computer Science 841, 1994, pp. 211-220
• Genericity and measure for exponential time
  Klaus Ambos-Spies, Hans-Christian Neis, Sebastiaan A. Terwijn
  Lecture Notes in Computer Science 841, 1994, pp. 221-232
• Analysis of bounded disorder
  Ricardo A. Baeza-Yates
  Lecture Notes in Computer Science 841, 1994, pp. 233-244
• On languages accepted with simultaneous complexity bounds and their ranking problem
  Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini
  Lecture Notes in Computer Science 841, 1994, pp. 245-255
• A proof system for asynchronously communicating deterministic processes
  F.S. de Boer, M. van Hulst
  Lecture Notes in Computer Science 841, 1994, pp. 256-265
• Embedding complete binary trees into star networks
  A. Bouabdallah, M.C. Heydemann, J. Opatrny, D. Sotteau
  Lecture Notes in Computer Science 841, 1994, pp. 266-275
• Inductive counting below Logspace
  Carsten Damm, Markus Holzer
  Lecture Notes in Computer Science 841, 1994, pp. 276-285
• Decision problems for edge grammars
  Jürgen Dassow
  Lecture Notes in Computer Science 841, 1994, pp. 286-295
• "The Big Sweep": On the power of the wavefront approach to Voronoi diagrams
  Frank Dehne, Rolf Klein
  Lecture Notes in Computer Science 841, 1994, pp. 296-305
• Reliable minimum finding comparator networks
  Piotr Denejko, Krzysztof Diks, Andrzej Pelc, Marek Piotrów
  Lecture Notes in Computer Science 841, 1994, pp. 306-315
• On parallel complexity of maximum f-matching and the degree sequence problem
  Anders Dessmark, Andrzej Lingas, Oscar Garrido
  Lecture Notes in Computer Science 841, 1994, pp. 316-325
• A comparison of two lower bound methods for communication complexity
  Martin Dietzfelbinger, Juraj Hromkovic̑, Georg Schnitger
  Lecture Notes in Computer Science 841, 1994, pp. 326-335