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

• On space-bounded synchronized alternating Turing machines
  Oscar H. Ibarra, Nicholas Q. Trân
  Lecture Notes in Computer Science 529, 1991, pp. 248-257
• Improving the critical density of the Lagarias-Odlyzko attack against subset sum problems
  Antoine Joux, Jacques Stern
  Lecture Notes in Computer Science 529, 1991, pp. 258-264
• Optimal versus stable in Boolean formulae
  Stasys Jukna
  Lecture Notes in Computer Science 529, 1991, pp. 265-274
• The Gauß lattice basis reduction algorithm succeeds with any norm
  Michael Kaib
  Lecture Notes in Computer Science 529, 1991, pp. 275-286
• Regularity of one-letter languages acceptable by 2-way finite probabilistic automata
  Jānis Kaņeps
  Lecture Notes in Computer Science 529, 1991, pp. 287-296
• On the semantics of atomized statements - the parallel-choice option
  Peter Knijnenburg, Joost N. Kok
  Lecture Notes in Computer Science 529, 1991, pp. 297-306
• Automatic proof methods for algebraic specifications
  Emmanuel Kounalis, Michaël Rusinowitch
  Lecture Notes in Computer Science 529, 1991, pp. 307-317
• On the complexity of graph reconstruction
  Dieter Kratsch, Lane A. Hemachandra
  Lecture Notes in Computer Science 529, 1991, pp. 318-328
• An optimal adaptive in-place sorting algorithm
  Christos Levcopoulos, Ola Petersson
  Lecture Notes in Computer Science 529, 1991, pp. 329-338
• Data structures maxima
  Guy Louchard, Claire Kenyon, René Schott
  Lecture Notes in Computer Science 529, 1991, pp. 339-349
• Average-case analysis of equality of binary trees under the BST probability model
  C. Martínez
  Lecture Notes in Computer Science 529, 1991, pp. 350-359
• On the subsets of rank two in a free monoid: A fast decision algorithm
  Jean Neraud
  Lecture Notes in Computer Science 529, 1991, pp. 360-369
• Exact analysis of three tree contraction algorithms
  Wojciech Plandowski, Wojciech Rytter, Tomasz Szymacha
  Lecture Notes in Computer Science 529, 1991, pp. 370-379
• Degrees of nondeterminism for pushdown automata
  Kai Salomaa, Sheng Yu
  Lecture Notes in Computer Science 529, 1991, pp. 380-389
• Optimal embedding of a toroidal array in a linear array
  Heiko Schröder, Ondrej Sýkora, Imrich Vrt̆o
  Lecture Notes in Computer Science 529, 1991, pp. 390-394
• Boolean functions with a large number of subfunctions and small complexity and depth
  Dietmar Uhlig
  Lecture Notes in Computer Science 529, 1991, pp. 395-404
• Adaptive linear list reorganization for a system processing set queries
  R.S. Valiveti, B.J. Oommen, J.R. Zgierski
  Lecture Notes in Computer Science 529, 1991, pp. 405-414
• On the decidability of integer subgraph problems on context-free graph languages
  Egon Wanke
  Lecture Notes in Computer Science 529, 1991, pp. 415-426