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

• A new algorithm for wiring layouts
  I.G. Tollis
  Lecture Notes in Computer Science 319, 1988, pp. 257-267
• 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
• Parallel simulation and test of VLSI array logic
  P. Bose
  Lecture Notes in Computer Science 319, 1988, pp. 301-311
• Universal hashing in VLSI
  Martin Fürer
  Lecture Notes in Computer Science 319, 1988, pp. 312-318
• Converting affine recurrence equations to quasi-uniform recurrence equations
  Y. Yaacoby, P.R. Cappello
  Lecture Notes in Computer Science 319, 1988, pp. 319-328
• Better computing on the anonymous ring (extended abstract)
  H. Attiya, M. Snir
  Lecture Notes in Computer Science 319, 1988, pp. 329-338
• Network complexity of sorting and graph problems and simulating CRCW PRAMs by interconnection networks (preliminary version)
  A. Aggarwal, M.-D.A. Huang
  Lecture Notes in Computer Science 319, 1988, pp. 339-350
• Analysis of a distributed scheduler for communication networks
  Y. Malka, S. Moran, S. Zaks
  Lecture Notes in Computer Science 319, 1988, pp. 351-360
• Weighted distributed match-making (preliminary version)
  E. Kranakis, P. Vitányi
  Lecture Notes in Computer Science 319, 1988, pp. 361-368
• A tradeoff between information and communication in broadcast protocols
  B. Awerbuch, O. Goldreich, R. Vainish, D. Peleg
  Lecture Notes in Computer Science 319, 1988, pp. 369-379
• Families of consensus algorithms
  A. Bar-Noy, D. Dolev
  Lecture Notes in Computer Science 319, 1988, pp. 380-390
• Uniform self-stabilizing rings
  J.E. Burns, J. Pachl
  Lecture Notes in Computer Science 319, 1988, pp. 391-400
• The complexity of selection resolution, conflict resolution and maximum finding on multiple access channels
  C.U. Martel, T.P. Vayda
  Lecture Notes in Computer Science 319, 1988, pp. 401-410
• Optimal routing algorithms for mesh-connected processor arrays (extended abstract)
  D. Krizanc, S. Rajasekaran, T. Tsantilas
  Lecture Notes in Computer Science 319, 1988, pp. 411-422
• Routing and sorting on mesh-connected arrays (extended abstract)
  M. Kunde
  Lecture Notes in Computer Science 319, 1988, pp. 423-433
• Time lower bounds for parallel sorting on a mesh-connected processor array
  Y. Han, Y. Igarashi
  Lecture Notes in Computer Science 319, 1988, pp. 434-443
• A correction network for N-sorters
  M. Schimmler, C. Starke
  Lecture Notes in Computer Science 319, 1988, pp. 444-455
• Cubesort: An optimal sorting algorithm for feasible parallel computers
  R. Cypher, J.L.C. Sanz
  Lecture Notes in Computer Science 319, 1988, pp. 456-464
• A 4d channel router for a two layer diagonal model
  E. Lodi, F. Luccio, L. Pagli
  Lecture Notes in Computer Science 319, 1988, pp. 465-476