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

• On the relationship between a procedure and its data
  Armin Cremers, Thomas N. Hibbard
  Lecture Notes in Computer Science 45, 1976, pp. 250-254
• On the relativization of deterministic and nondeterministic complexity classes
  M. Dekhtyar
  Lecture Notes in Computer Science 45, 1976, pp. 255-259
• The metric properties on the semigroups and the languages
  Alexandru Dincȃ
  Lecture Notes in Computer Science 45, 1976, pp. 260-264
• A lower bound of 1/2n^2 on linear search programs for the knapsack problem
  David Dobkin, Richard J. Lipton
  Lecture Notes in Computer Science 45, 1976, pp. 265-269
• The direct product of automata and quasi-automata
  W. Dörfler
  Lecture Notes in Computer Science 45, 1976, pp. 270-276
• An axiomatic approach to information structures
  H.-D. Ehrich
  Lecture Notes in Computer Science 45, 1976, pp. 277-283
• Parallelism of manipulations in multidimensional information structures
  Hartmut Ehrig, Hans-Jörg Kreowski
  Lecture Notes in Computer Science 45, 1976, pp. 284-293
• On strict interpretations of grammar forms
  Seymour Ginsburg, Otto Mayer
  Lecture Notes in Computer Science 45, 1976, pp. 294-298
• A hierarchy of context-sensitive languages
  Irina Gorun
  Lecture Notes in Computer Science 45, 1976, pp. 299-303
• On consecutive storage of records
  Janusz Górski
  Lecture Notes in Computer Science 45, 1976, pp. 304-310
• A remark on equivalence of Mazurkiewicz's finite - Control algorithms over nets
  M. Grabowski
  Lecture Notes in Computer Science 45, 1976, pp. 311-316
• Microprogram - Oriented model of the controlled structure
  I. Hansen, J. Leszczyƚowski
  Lecture Notes in Computer Science 45, 1976, pp. 317-322
• Relations between programs with different storage requirements
  M.D. Harrison
  Lecture Notes in Computer Science 45, 1976, pp. 323-329
• An algebraic approach to data types, program verification, and program synthesis
  Friedrich W. von Henke
  Lecture Notes in Computer Science 45, 1976, pp. 330-336
• About three equational classes of languages built up by shuffle operations
  Matthias Höpner, Manfred Opp
  Lecture Notes in Computer Science 45, 1976, pp. 337-344
• A machine independent description of complexity classes, definable by nondeterministic as well as deterministic Turing machines with primitiv recursive tape or time bounds
  H. Huwig
  Lecture Notes in Computer Science 45, 1976, pp. 345-351
• Schemes with recursion on higher types
  Klaus Indermark
  Lecture Notes in Computer Science 45, 1976, pp. 352-358
• Constructing iterative version of a system of recursive procedures
  Jacek Irlik
  Lecture Notes in Computer Science 45, 1976, pp. 359-363
• A method using a set-theoretical formalism to describe the semantics of programming languages
  Walter Issel
  Lecture Notes in Computer Science 45, 1976, pp. 364-371
• The cubic search method
  Romuald Jagielski
  Lecture Notes in Computer Science 45, 1976, pp. 372-376
• Vectors of coroutines
  Ryszard Janicki
  Lecture Notes in Computer Science 45, 1976, pp. 377-384
• One - One degrees of Turing machines decision problems
  Joanna Jȩdrzejowicz
  Lecture Notes in Computer Science 45, 1976, pp. 385-389
• Heuristic representation of state-space by finite automaton
  Jozef Kelemen
  Lecture Notes in Computer Science 45, 1976, pp. 390-394
• Semigroup characterizations of some language varieties
  Robert Knast
  Lecture Notes in Computer Science 45, 1976, pp. 395-403
• On memory requirements of Strassen's algorithms
  Antoni Kreczmar
  Lecture Notes in Computer Science 45, 1976, pp. 404-407