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

• Efficient parallel triconnectivity in logarithmic time (extended abstract)
  V. Ramachandran, U. Vishkin
  Lecture Notes in Computer Science 319, 1988, pp. 33-42
• Subtree isomorphism is in random NC
  P.B. Gibbons, D. Soroker, R.M. Karp, G.L. Miller
  Lecture Notes in Computer Science 319, 1988, pp. 43-52
• All graphs have cycle separators and planar directed depth-first search is in DNC (preliminary version)
  M. Kao
  Lecture Notes in Computer Science 319, 1988, pp. 53-63
• On some languages in NC^1 (extended abstract)
  O.H. Ibarra, T. Jiang, B. Ravikumar, J.H. Chang
  Lecture Notes in Computer Science 319, 1988, pp. 64-73
• O(\log n) parallel time finite field inversion
  B.E. Litow, G.I. Davida
  Lecture Notes in Computer Science 319, 1988, pp. 74-80
• Deterministic parallel list ranking
  R.J. Anderson, G.L. Miller
  Lecture Notes in Computer Science 319, 1988, pp. 81-90
• Optimal parallel algorithms for expression tree evaluation and list ranking
  R. Cole, U. Vishkin
  Lecture Notes in Computer Science 319, 1988, pp. 91-100
• Optimal parallel evaluation of tree-structured computations by raking (extended abstract)
  S.R. Kosaraju, A.L. Delcher
  Lecture Notes in Computer Science 319, 1988, pp. 101-110
• On finding lowest common ancestors: Simplification and parallelization (extended abstract)
  Baruch Schieber, U. Vishkin
  Lecture Notes in Computer Science 319, 1988, pp. 111-123
• A scheduling problem arising from loop parallelization on MIMD machines
  R.J. Anderson, A.A. Munshi, B. Simons
  Lecture Notes in Computer Science 319, 1988, pp. 124-133
• Scheduling dags to minimize time and communication
  C.H. Papadimitriou, F. Afrati, G. Papageorgiou
  Lecture Notes in Computer Science 319, 1988, pp. 134-138
• Computing a perfect matching in a line graph
  J. Naor
  Lecture Notes in Computer Science 319, 1988, pp. 139-148
• Separation pair detection
  D. Fussell, R. Thurimella
  Lecture Notes in Computer Science 319, 1988, pp. 149-159
• Graph Embeddings 1988: Recent breakthroughs, new directions
  A.L. Rosenberg
  Lecture Notes in Computer Science 319, 1988, pp. 160-169
• Simulating binary trees on hypercubes
  B. Monien, I.H. Sudborough
  Lecture Notes in Computer Science 319, 1988, pp. 170-180
• Embedding rectangular grids into square grids
  J.A. Ellis
  Lecture Notes in Computer Science 319, 1988, pp. 181-190
• Efficient reconfiguration of VLSI arrays (extended abstract)
  B. Codenotti, R. Tamassia
  Lecture Notes in Computer Science 319, 1988, pp. 191-200
• Embedding grids into hypercubes
  S. Bettayeb, I.H. Sudborough, Z. Miller
  Lecture Notes in Computer Science 319, 1988, pp. 201-211
• Compaction on the torus
  K. Mehlhorn, W. Rülling
  Lecture Notes in Computer Science 319, 1988, pp. 212-225
• Channel routing with short wires
  M. Kaufmann, I.G. Tollis
  Lecture Notes in Computer Science 319, 1988, pp. 226-236
• Simple three-layer channel routing algorithms
  T. Gonzalez, S.-Q. Zheng
  Lecture Notes in Computer Science 319, 1988, pp. 237-246
• Applying the classification theorem for finite simple groups to minimize pin count in uniform permutation architectures (extended abstract)
  L. Finkelstein, D. Kleitman, T. Leighton
  Lecture Notes in Computer Science 319, 1988, pp. 247-256
• Input sensitive VLSI layouts for graphs of arbitrary degree
  D.D. Sherlekar, J. JáJá
  Lecture Notes in Computer Science 319, 1988, pp. 268-277
• Fast self-reduction algorithms for combinatorial problems of VLSI design
  Michael R. Fellows, Michael A. Langston
  Lecture Notes in Computer Science 319, 1988, pp. 278-287
• Regular structures and testing: RCC-Adders (extended abstract)
  B. Becker, U. Sparmann
  Lecture Notes in Computer Science 319, 1988, pp. 288-300