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 [2]	Hilfe

Suche: Series=LNCS AND YEAR=1986

• Diogenes, circa 1986
  A.L. Rosenberg
  Lecture Notes in Computer Science 227, 1986, pp. 96-107
• Non sequential computation and laws of nature
  P.M.B. Vitányi
  Lecture Notes in Computer Science 227, 1986, pp. 108-120
• Linear algorithms for two CMOS layout problems
  R. Müller, T. Lengauer
  Lecture Notes in Computer Science 227, 1986, pp. 121-132
• Some new results on a restricted channel routing problem
  E. Lodi, L. Pagli
  Lecture Notes in Computer Science 227, 1986, pp. 133-143
• Efficient modular designs of TSC checkers for M-out-of-2M codes
  A.M. Paschalis, D. Nikolos, C. Halatsis
  Lecture Notes in Computer Science 227, 1986, pp. 144-155
• VLSI algorithms and pipelined architectures for solving structured linear systems
  I.-C. Jou, Yu-Hen Hu, T.M. Parng
  Lecture Notes in Computer Science 227, 1986, pp. 156-165
• A high performance single-chip VLSI signal processor architecture
  N. Kanopoulos, P.N. Marinos
  Lecture Notes in Computer Science 227, 1986, pp. 166-179
• Exploiting hierarchy in VLSI design
  T. Lengauer
  Lecture Notes in Computer Science 227, 1986, pp. 180-193
• A polynomial algorithm for recognizing images of polyhedra
  L.M. Kirousis
  Lecture Notes in Computer Science 227, 1986, pp. 194-204
• Parallel tree techniques and code optimization
  E. Dekel, S. Ntafos, S.T. Peng
  Lecture Notes in Computer Science 227, 1986, pp. 205-216
• AT^2-optimal Galois field multiplier for VLSI
  M. Fürer, K. Mehlhorn
  Lecture Notes in Computer Science 227, 1986, pp. 217-225
• Linear and book embeddings of graphs
  M. Yannakakis
  Lecture Notes in Computer Science 227, 1986, pp. 226-235
• Efficient parallel evaluation of straight-line code and arithmetic circuits
  G.L. Miller, E. Kaltofen, V. Ramachandran
  Lecture Notes in Computer Science 227, 1986, pp. 236-245
• A logarithmic boolean time algorithm for parallel polynomial division
  D. Bini, V. Pan
  Lecture Notes in Computer Science 227, 1986, pp. 246-251
• A polynomial algorithm for recognizing small cutwidth in hypergraphs
  Z. Miller, I.H. Sudbourough
  Lecture Notes in Computer Science 227, 1986, pp. 252-260
• A generalized topological sorting problem
  T. Hagerup, W. Rülling
  Lecture Notes in Computer Science 227, 1986, pp. 261-270
• Combinational static CMOS networks
  J.A. Brzozowski, M. Yoeli
  Lecture Notes in Computer Science 227, 1986, pp. 271-282
• Fast and efficient parallel linear programming and linear least squares computations
  V. Pan, J. Reif
  Lecture Notes in Computer Science 227, 1986, pp. 283-295
• On the time required to sum n semigroup elements on a parallel machine with simultaneous writes
  I. Parberry
  Lecture Notes in Computer Science 227, 1986, pp. 296-304
• A comparative study of concurrency control methods in B-trees
  A. Biliris
  Lecture Notes in Computer Science 227, 1986, pp. 305-316
• Generalized river routing -- algorithms and performance bounds
  J.R.S. Blair, E.L. Lloyd
  Lecture Notes in Computer Science 227, 1986, pp. 317-328
• With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy
  J. Cai
  Lecture Notes in Computer Science 223, 1986, pp. 104
• A note on one-way functions and polynomial time isomorphisms
  K. Ko, T. Long, D. Du
  Lecture Notes in Computer Science 223, 1986, pp. 196
• The complexity of optimization problems
  M. Krentel
  Lecture Notes in Computer Science 223, 1986, pp. 218
• The complexity of sparse sets in P
  E. Allender
  Lecture Notes in Computer Science 223, 1986, pp. 1-11