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

• Efficient two-dimensional searching
  Gaston H. Gonnet
  Lecture Notes in Computer Science 621, 1992, pp. 317
• Direct bulk-synchronous parallel algorithms
  Alexandros V. Gerbessiotis, Leslie G. Valiant
  Lecture Notes in Computer Science 621, 1992, pp. 1-18
• Memory limited inductive inference machines
  Rūsiņs̆ Freivalds, Carl H. Smith
  Lecture Notes in Computer Science 621, 1992, pp. 19-29
• Retrieval of scattered information by EREW, CREW and CRCW PRAMs
  Faith Fich, Miroslaw Kowaluk, Krzysztof Loryś, Miroslaw Kutyƚowski, Prabhakar Ragde
  Lecture Notes in Computer Science 621, 1992, pp. 30-41
• On small depth threshold circuits
  Alexander A. Razborov
  Lecture Notes in Computer Science 621, 1992, pp. 42-52
• An elementary approach to some analytic asymptotics
  Nicholas Pippenger
  Lecture Notes in Computer Science 621, 1992, pp. 53-61
• An optimal parallel algorithm for computing a near-optimal order of matrix multiplications
  Artur Czumaj
  Lecture Notes in Computer Science 621, 1992, pp. 62-72
• Generating sparse 2-spanners
  Guy Kortsarz, David Peleg
  Lecture Notes in Computer Science 621, 1992, pp. 73-82
• Low-diameter graph decomposition is in NC
  Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg
  Lecture Notes in Computer Science 621, 1992, pp. 83-93
• Parallel algorithm for cograph recognition with applications
  Xin He
  Lecture Notes in Computer Science 621, 1992, pp. 94-105
• Parallel algorithms for all minimum link paths and link center problems
  Subir Kumar Ghosh, Anil Maheshwari
  Lecture Notes in Computer Science 621, 1992, pp. 106-117
• Optimal multi-packet routing on the torus
  Michael Kaufmann, Jop F. Sibeyn
  Lecture Notes in Computer Science 621, 1992, pp. 118-129
• Parallel algorithms for priority queue operations
  Maria Cristina Pinotti, Geppino Pucci
  Lecture Notes in Computer Science 621, 1992, pp. 130-139
• Heap construction in the parallel comparison tree model
  Paul F. Dietz
  Lecture Notes in Computer Science 621, 1992, pp. 140-150
• Efficient rebalancing of chromatic search trees
  Joan Boyar, Kim S. Larsen
  Lecture Notes in Computer Science 621, 1992, pp. 151-164
• The complexity of scheduling problems with communication delays for trees
  Andreas Jakoby, Rüdiger Reischuk
  Lecture Notes in Computer Science 621, 1992, pp. 165-177
• The list update problem and the retrieval of sets
  Fabrizio d'Amore, Vincenzo Liberatore
  Lecture Notes in Computer Science 621, 1992, pp. 178-191
• GKD-trees: Binary trees that combine multi-dimensional data handling, node size and fringe reorganization
  Walter Cunto, Vicente Yriarte
  Lecture Notes in Computer Science 621, 1992, pp. 192-211
• Fractional cascading simplified
  Sandeep Sen
  Lecture Notes in Computer Science 621, 1992, pp. 212-220
• Dynamic 2- and 3-connectivity on planar graphs
  Dora Giammarresi, Giuseppe F. Italiano
  Lecture Notes in Computer Science 621, 1992, pp. 221-232
• Fully dynamic 2-edge-connectivity in planar graphs
  John Hershberger, Monika Rauch, Subhash Suri
  Lecture Notes in Computer Science 621, 1992, pp. 233-244
• Non-interfering network flows
  C. McDiarmid, B. Reed, A. Schrijver, B. Shepherd
  Lecture Notes in Computer Science 621, 1992, pp. 245-257
• Triangulating planar graphs while minimizing the maximum degree
  Goos Kant, Hans L. Bodlaender
  Lecture Notes in Computer Science 621, 1992, pp. 258-271
• How to draw a series-parallel digraph
  P. Bertolazzi, R.F. Cohen, G. Di Battista, R. Tamassia, I.G. Tollis
  Lecture Notes in Computer Science 621, 1992, pp. 272-283
• Coloring random graphs
  Martin Fürer, C.R. Subramanian
  Lecture Notes in Computer Science 621, 1992, pp. 284-291