VLSI Algorithms and Architectures: 3rd Aegean Workshop on Computing, AWOC 88. Corfu, Greece, June 28 - July 1, 1988. Proceedings: Lecture Notes in Computer Science, cartea 319
Editat de John H. Reifen Limba Engleză Paperback – 12 iul 1988
Din seria Lecture Notes in Computer Science
- 20% Preț: 1043.63 lei
- 20% Preț: 334.61 lei
- 20% Preț: 336.22 lei
- 20% Preț: 445.69 lei
- 20% Preț: 238.01 lei
- 20% Preț: 334.61 lei
- 20% Preț: 438.69 lei
- Preț: 442.03 lei
- 20% Preț: 337.87 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 634.41 lei
- 17% Preț: 427.22 lei
- 20% Preț: 643.99 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1057.10 lei
- 20% Preț: 581.55 lei
- Preț: 374.84 lei
- 20% Preț: 331.36 lei
- 15% Preț: 431.22 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1390.89 lei
- 20% Preț: 1007.16 lei
- 20% Preț: 569.54 lei
- 20% Preț: 575.48 lei
- 20% Preț: 573.59 lei
- 20% Preț: 750.35 lei
- 15% Preț: 570.71 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 347.59 lei
- 20% Preț: 576.02 lei
- Preț: 404.00 lei
- 20% Preț: 586.43 lei
- 20% Preț: 750.35 lei
- 20% Preț: 812.01 lei
- 20% Preț: 649.49 lei
- 20% Preț: 344.34 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 638.91 lei
Preț vechi: 751.66 lei
-15% Nou
Puncte Express: 958
Preț estimativ în valută:
122.31€ • 125.79$ • 101.47£
122.31€ • 125.79$ • 101.47£
Carte tipărită la comandă
Livrare economică 19 februarie-05 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780387968186
ISBN-10: 0387968180
Pagini: 480
Ilustrații: XII, 480 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.68 kg
Ediția:1988
Editura: Springer
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:New York, NY, United States
ISBN-10: 0387968180
Pagini: 480
Ilustrații: XII, 480 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.68 kg
Ediția:1988
Editura: Springer
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:New York, NY, United States
Public țintă
ResearchCuprins
Parallel algorithms for evaluating sequences of set-manipulation operations.- Fast parallel and sequential algorithms for edge-coloring planar graphs.- Optimal parallel algorithms on planar graphs.- Efficient parallel triconnectivity in logarithmic time.- Subtree isomorphism is in random NC.- All graphs have cycle separators and planar directed depth-first search is in DNC.- On some languages in NC.- O(log(n)) parallel time finite field inversion.- Deterministic parallel list ranking.- Optimal parallel algorithms for expression tree evaluation and list ranking.- Optimal parallel evaluation of tree-structured computations by raking (extended abstract).- On finding lowest common ancestors: Simplification and parallelization.- A scheduling problem arising from loop parallelization on MIMD machines.- Scheduling dags to minimize time and communication.- Computing a perfect matching in a line graph.- Separation pair detection.- Graph embeddings 1988: Recent breakthroughs, new directions.- Simulating binary trees on hypercubes.- Embedding rectangular grids into square grids.- Efficient reconfiguration of VLSI arrays.- Embedding grids into hypercubes.- Compaction on the torus.- Channel routing with short wires.- Simple three-layer channel routing algorithms.- Applying the classification theorem for finite simple groups to minimize pin count in uniform permutation architectures.- A new algorithm for wiring layouts.- Input sensitive VLSI layouts for graphs of arbitrary degree.- Fast self-reduction algorithms for combinatorial problems of VLSI design.- Regular structures and testing: RCC-adders.- Parallel simulation and test of VLSI array logic.- Universal hashing in VLSI.- Converting affine recurrence equations to quasi-uniform recurrence equations.- Better computing on the anonymous ring.- Network complexity of sorting and graph problems and simulating CRCW PRAMS by interconnection networks.- Analysis of a distributed scheduler for communication networks.- Weighted distributed match-making.- A tradeoff between information and communication in broadcast protocols.- Families of consensus algorithms.- Uniform self-stabilizing rings.- The complexity of selection resolution, conflict resolution and maximum finding on multiple access channels.- Optimal routing algorithms for mesh-connected processor arrays.- Routing and sorting on mesh-connected arrays.- Time lower bounds for parallel sorting on a mesh-connected processor array.- A correction network for N-sorters.- Cubesort: An optimal sorting algorithm for feasible parallel computers.- A 4d channel router for a two layer diagonal model.