Tight Bounds For Oblivious Routing In The Hypercube PDF Books

Download Tight Bounds For Oblivious Routing In The Hypercube PDF books. Access full book title Tight Bounds For Oblivious Routing In The Hypercube by Harvard University. Center for Research in Computing Technology, the book also available in format PDF, EPUB, and Mobi Format, to read online books or download Tight Bounds For Oblivious Routing In The Hypercube full books, Click Get Books for free access, and save it on your Kindle device, PC, phones or tablets.

Tight Bounds For Oblivious Routing In The Hypercube

Tight Bounds For Oblivious Routing In The Hypercube
Author: Harvard University. Center for Research in Computing Technology
Publisher:
ISBN:
Size: 50.16 MB
Format: PDF
View: 2955
Get Books

Abstract: "We prove that in any N-node communications network with maximum degree d, any deterministic oblivious algorithm for routing an arbitrary permutation requires [Omega]([formula]) parallel communication steps. This is an improvement of a result by Borodin and Hopcroft. For the N-node hypercube, in particular, we show a matching upper bound by exhibiting a deterministic oblivious algorithm that routes any permutation in O([formula]) time. The best previously known upper bound was O([formula]). Our algorithm could be practical for small N (up to about 2[superscript 14] nodes)."
Tight Bounds for Oblivious Routing in the Hypercube
Language: un
Pages: 16
Authors: Harvard University. Center for Research in Computing Technology, C. Kaklamanis, D. Krizanc, Athanasios M. Tsantilas
Categories: Packet switching (Data transmission)
Type: BOOK - Published: 1989 - Publisher:
Abstract: "We prove that in any N-node communications network with maximum degree d, any deterministic oblivious algorithm for routing an arbitrary permutation requires [Omega]([formula]) parallel communication steps. This is an improvement of a result by Borodin and Hopcroft. For the N-node hypercube, in particular, we show a matching upper bound
SPAA
Language: en
Pages:
Authors: Harvard University. Center for Research in Computing Technology, C. Kaklamanis, D. Krizanc, Athanasios M. Tsantilas
Categories: Computer algorithms
Type: BOOK - Published: 2002 - Publisher:
Books about SPAA
SPAA '95
Language: en
Pages: 308
Authors: Harvard University. Center for Research in Computing Technology, C. Kaklamanis, D. Krizanc, Athanasios M. Tsantilas
Categories: Computer algorithms
Type: BOOK - Published: 1995 - Publisher:
Books about SPAA '95
43rd Annual IEEE Symposium on Foundations of Computer Science
Language: en
Pages: 813
Authors: IEEE Computer Society. Technical Committee on Mathematical Foundations of Computing
Categories: Computers
Type: BOOK - Published: 2002 - Publisher: IEEE
Collects the 77 papers presented during the November 2002 symposium on the mathematical foundations of computing. Among the topics are abstract combinatorial programs and efficient property testers, a lower bound for testing 3-colorability in bounded degree graphs, a spectral algorithm for learning
Mathematical Theory and Computational Practice
Language: en
Pages: 510
Authors: Klaus Ambos-Spies, Benedikt Löwe, Wolfgang Merkle
Categories: Computers
Type: BOOK - Published: 2009-07-15 - Publisher: Springer Science & Business Media
This book constitutes the proceedings of the 5th Conference on Computability in Europe, CiE 2009, held in Heidelberg, Germany, during July 19-24, 2009. The 34 papers presented together with 17 invited lectures were carefully reviewed and selected from 100 submissions. The aims of the conference is to advance our theoretical
Parallel Systems And Algorithms: Pasa '96 - Proceedings Of The 4th Workshop
Language: en
Pages: 340
Authors: Mayr Ernst W, Hopfeld F, Maehle E
Categories: Computers
Type: BOOK - Published: 1997-02-20 - Publisher: World Scientific
The PASA Workshops aim to build a bridge between theory and practice in the area of parallel systems and algorithms. Practical problems which require theoretical investigations as well as the applicability of theoretical approaches and results to practice are discussed. A particularly important aspect is the communication and exchange of
Proceedings of the 4th Workshop on PASA '96, Parallel Systems & Algorithms, Research Center Jülich, Germany, 10-12 April 1996
Language: en
Pages: 342
Authors: Ernst W. Mayr
Categories: COMPUTERS
Type: BOOK - Published: 1997 - Publisher: World Scientific
Books about Proceedings of the 4th Workshop on PASA '96, Parallel Systems & Algorithms, Research Center Jülich, Germany, 10-12 April 1996
Algorithms and Data Structures
Language: en
Pages: 633
Authors: Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro, Sue Whitesides
Categories: Computers
Type: BOOK - Published: 1993-07-28 - Publisher: Springer Science & Business Media
The papers in this volume were presented at the Third Workshop on Algorithmsand Data Structures (WADS '93), held in Montreal, Canada, August 1993. The volume opens with five invited presentations: "Computing the all-pairs longest chains in the plane" by M.J. Atallah and D.Z. Chen, "Towards a better understanding of pure
Graph Algorithms and Applications 2
Language: en
Pages: 521
Authors: Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis
Categories: Computers
Type: BOOK - Published: 2004 - Publisher: World Scientific
This book contains Volumes 4 and 5 of the Journal of Graph Algorithms and Applications (JGAA). The first book of this series, Graph Algorithms and Applications I, published in March 2002, contains Volumes 1-3 of JGAA. JGAA is a peer-reviewed scientific journal devoted to the publication of high-quality research papers
Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, Chicago, Illinois, May 2-4, 1988
Language: en
Pages: 553
Authors: Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis
Categories: Computable functions
Type: BOOK - Published: 1988 - Publisher: Association for Computing Machinery (ACM)
Books about Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, Chicago, Illinois, May 2-4, 1988