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

• Graphical calculi for interaction
  Robin Milner
  Lecture Notes in Computer Science 1256, 1997, pp. 1-1
• NP-completeness: A retrospective
  Christos H. Papadimitriou
  Lecture Notes in Computer Science 1256, 1997, pp. 2-6
• The LEDA platform for combinatorial and geometric computing
  Kurt Mehlhorn, Stefan Näher, Christian Uhrig
  Lecture Notes in Computer Science 1256, 1997, pp. 7-16
• The Wadge-Wagner hierarchy of \omega-rational sets
  Olivier Carton, Dominique Perrin
  Lecture Notes in Computer Science 1256, 1997, pp. 17-35
• From chaotic iteration to constraint propagation
  Krzysztof R. Apt
  Lecture Notes in Computer Science 1256, 1997, pp. 36-55
• DNA^2DNA computations: A potential ``Killer App''
  Laura F. Landweber, Richard J. Lipton
  Lecture Notes in Computer Science 1256, 1997, pp. 56-64
• Tilings and quasiperiodicity
  Bruno Durand
  Lecture Notes in Computer Science 1256, 1997, pp. 65-75
• Enumerative sequences of leaves in rational trees
  Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin
  Lecture Notes in Computer Science 1256, 1997, pp. 76-86
• A completion algorithm for codes with bounded synchronization delay
  Véronique Bruyère
  Lecture Notes in Computer Science 1256, 1997, pp. 87-97
• The expressibility of languages and relations by word equations
  Juhani Karhumäki, Wojciech Plandowski, Filippo Mignosi
  Lecture Notes in Computer Science 1256, 1997, pp. 98-109
• Finite loops recognize exactly the regular open languages
  Martin Beaudry, François Lemieux, Denis Thérien
  Lecture Notes in Computer Science 1256, 1997, pp. 110-120
• An abstract data type for real numbers
  Pietro di Gianantonio
  Lecture Notes in Computer Science 1256, 1997, pp. 121-131
• Recursive computational depth
  James I. Lathrop, Jack H. Lutz
  Lecture Notes in Computer Science 1256, 1997, pp. 132-142
• Some bounds on the computational power of piecewise constant derivative systems
  Olivier Bournez
  Lecture Notes in Computer Science 1256, 1997, pp. 143-153
• Monadic simultaneous rigid E-unification and related problems
  Yuri Gurevich, Andrei Voronkov
  Lecture Notes in Computer Science 1256, 1997, pp. 154-165
• Computability on the probability measures on the Borel sets of the unit interval
  Klaus Weihrauch
  Lecture Notes in Computer Science 1256, 1997, pp. 166-176
• Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs
  Alexander E. Andreev, Andrea E.F. Clementi, José D.P. Rolim
  Lecture Notes in Computer Science 1256, 1997, pp. 177-187
• Results on resource-bounded measure
  Harry Buhrman, Stephen Fenner, Lance Fortnow
  Lecture Notes in Computer Science 1256, 1997, pp. 188-194
• Randomization and nondeterminism are comparable for oredered read-once branching programs
  Farid Ablayev
  Lecture Notes in Computer Science 1256, 1997, pp. 195-202
• Checking properties of polynomials
  Bruno Codenotti, Funda Ergün, Peter Gemell, S. Ravi Kumar
  Lecture Notes in Computer Science 1256, 1997, pp. 203-213
• Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP
  Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
  Lecture Notes in Computer Science 1256, 1997, pp. 214-224
• Game theoretic analysis of call-by-value computation
  Kohei Honda, Nobuko Yoshida
  Lecture Notes in Computer Science 1256, 1997, pp. 225-236
• On modular properties of higher order extensional lambda caluli
  Roberto di Cosmo, Neil Ghani
  Lecture Notes in Computer Science 1256, 1997, pp. 237-247
• On explicit substitutions and names
  Eike Ritter, Valeria de Paiva
  Lecture Notes in Computer Science 1256, 1997, pp. 248-258
• On the dynamics of sharing graphs
  Andrea Asperti, Cosimo Laneve
  Lecture Notes in Computer Science 1256, 1997, pp. 259-269