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

• On Boolean vs.\ modular arithmetic for circuits and communication protocols
  Carsten Damm
  Lecture Notes in Computer Science 1450, 1998, pp. 780-788
• Communication complexity and lower bounds on multilective computations
  Juraj Hromkovic̑
  Lecture Notes in Computer Science 1450, 1998, pp. 789-797
• A finite hierarchy of the recursively enumerable real numbers
  Klaus Weihrauch, Xizhong Zheng
  Lecture Notes in Computer Science 1450, 1998, pp. 798-806
• One guess one-way cellular arrays
  Thomas Buchholz, Andreas Klein, Martin Kutrib
  Lecture Notes in Computer Science 1450, 1998, pp. 807-815
• Topological definitions of chaos applied to cellular automata dynamics
  Gianpiero Cattaneo, Luciano Margara
  Lecture Notes in Computer Science 1450, 1998, pp. 816-824
• Characterization of sensitive linear cellular automata with respect to the counting distance
  Giovanni Manzini
  Lecture Notes in Computer Science 1450, 1998, pp. 825-833
• Additive cellular automata over Z_p and the bottom of (CA,\leq)
  Jacques Mazoyer, Ivan Rapaport
  Lecture Notes in Computer Science 1450, 1998, pp. 834-843