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

• Algebraic constructions of efficient broadcast networks
  Michael J. Dinneen, Michael R. Fellows, Vance Faber
  Lecture Notes in Computer Science 539, 1991, pp. 152-158
• Some constructions in rings of differential polynomials
  Giovanni Gallo, Bhubaneswar Mishra, François Ollivier
  Lecture Notes in Computer Science 539, 1991, pp. 171-182
• Concurrent error detection in sequential circuits using convolutional codes
  Lawrence P. Holmquist, L.L. Kinney
  Lecture Notes in Computer Science 539, 1991, pp. 183-194
• On strong separations from AC^0
  Eric Allender, Vivek Gore
  Lecture Notes in Computer Science 529, 1991, pp. 1-15
• Number theoretic algorithms and cryptology
  Johannes Buchmann
  Lecture Notes in Computer Science 529, 1991, pp. 16-21
• Computations over infinite groups
  Jin-yi Cai
  Lecture Notes in Computer Science 529, 1991, pp. 22-32
• Efficiency of Monte Carlo algorithms in numerical analysis
  Stefan Heinrich
  Lecture Notes in Computer Science 529, 1991, pp. 33-44
• Approximation algorithms for counting problems in finite fields
  Marek Karpinski
  Lecture Notes in Computer Science 529, 1991, pp. 45-46
• The consistency of a nointerleaving and an interleaving model for full TCSP
  Christel Baier, Mila E. Majster-Cederbaum
  Lecture Notes in Computer Science 529, 1991, pp. 105-120
• A geometrical bound for integer programming with polynomial constraints
  Bernd Bank, Teresa Krick, Reinhard Mandel, Pablo Solernó
  Lecture Notes in Computer Science 529, 1991, pp. 121-125
• A characterization of binary search networks
  E. Barcucci, R. Pinzani, E. Rodella, R. Sprugnoli
  Lecture Notes in Computer Science 529, 1991, pp. 126-135
• About the effect of the number of successful paths in an infinite tree on the recognizability by a finite automaton with Büchi conditions
  D. Beauqier, M. Nivat, D. Niwiński
  Lecture Notes in Computer Science 529, 1991, pp. 136-145
• Deterministic dequeue automata and LL(1) parsing of breadth-depth grammars
  Luca Breveglieri, Claudio Citrini, Stefano Crespi Reghizzi
  Lecture Notes in Computer Science 529, 1991, pp. 146-156
• The complexity of computing maximal word functions
  Danilo Bruschi, Giovanni Pighizzini
  Lecture Notes in Computer Science 529, 1991, pp. 157-167
• Unambiguity and fewness for logarithmic space
  Gerhard Buntrock, Birgit Jenner, Klaus-Jörn Lange, Peter Rossmanith
  Lecture Notes in Computer Science 529, 1991, pp. 168-179
• Differential resultants and subresultants
  Marc Chardin
  Lecture Notes in Computer Science 529, 1991, pp. 180-189
• Unifying binary-search trees and permutations
  Bogdan S. Chlebus, Imrich Vrt̆o
  Lecture Notes in Computer Science 529, 1991, pp. 190-199
• Computational complexity and hardest languages of automata with abstract storages
  Jürgen Dassow, Klaus-Jörn Lange
  Lecture Notes in Computer Science 529, 1991, pp. 200-209
• Systolic Y-tree automata: Closure properties and decision problems
  E. Fachini, A. Monti, M. Napoli, D. Parente
  Lecture Notes in Computer Science 529, 1991, pp. 210-219
• A new partition lemma for planar graphs and its application to circuit complexity
  Hans Dietmar Gröger
  Lecture Notes in Computer Science 529, 1991, pp. 220-229
• Some notes on threshold circuits, and multiplication in depth 4
  Thomas Hofmeister, Walter Hohberg, Susanne Köhling
  Lecture Notes in Computer Science 529, 1991, pp. 230-239
• Nonlinear lower bounds on the number of processors of circuits with sublinear separators
  Juraj Hromkovic̑
  Lecture Notes in Computer Science 529, 1991, pp. 240-247
• 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