|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 20 occurrences of 17 keywords
|
|
|
Results
Found 6 publication records. Showing 6 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
68 | Frank Thomson Leighton, Bruce M. Maggs |
Fast Algorithms for Routing Around Faults in Multibutterflies and Randomly-Wired Splitter Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 41(5), pp. 578-587, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
fault routing algorithms, packet permutations routing, multibutterflies, randomly-wired splitter networks, algorithms, computational complexity, fault tolerant computing, multiprocessor interconnection networks, switching network, deterministic, shared-memory machine |
68 | Frank Thomson Leighton, Bruce M. Maggs |
Expanders Might Be Practical: Fast Algorithms for Routing Around Faults on Multibutterflies ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 384-389, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
multibutterflies, routing packets, robust, switching network, distributed-memory machine, high-bandwidth |
37 | Bruce M. Maggs, Berthold Vöcking |
Improved Routing and Sorting on Multibutterflies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 28(4), pp. 438-437, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Ellipsoid method, Computational complexity, Linear programming, Polynomial-time algorithms, Symbolic computation, Algebraic numbers |
37 | Bruce M. Maggs, Berthold Vöcking |
Improved Routing and Sorting on Multibutterflies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, El Paso, Texas, USA, May 4-6, 1997, pp. 517-530, 1997, ACM, 0-89791-888-6. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
37 | Kevin J. Rappoport |
On the Slowdown of Efficient Simulations of Multibutterflies on Butterflies and Butterfly-Derived Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '96, Padua, Italy, June 24-26, 1996, pp. 176-182, 1996, ACM, 0-89791-809-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
31 | Friedhelm Meyer auf der Heide, Christian Scheideler |
Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 370-379, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
online protocols, deterministic protocol, arbitrary permutations, r-replicated s-ary Multibutterflies, multiprocessor interconnection networks, deterministic routing, arbitrary networks, bounded buffers |
Displaying result #1 - #6 of 6 (100 per page; Change: )
|
|