|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 10 occurrences of 10 keywords
|
|
|
Results
Found 16 publication records. Showing 16 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
71 | Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci |
Area-Universal Circuits with Constant Slowdown. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ARVLSI ![In: 18th Conference on Advanced Research in VLSI (ARVLSI '99), 21-24 March 1999, Atlanta, GA, USA, pp. 89-98, 1999, IEEE Computer Society, 0-7695-0056-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
50 | Paul Bay, Gianfranco Bilardi |
Deterministic On-Line Routing on Area-Universal Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 42(3), pp. 614-640, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
area-universal, general purpose, fat-tree |
40 | David Eppstein, Elena Mumford, Bettina Speckmann, Kevin Verbeek |
Area-universal rectangular layouts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009, pp. 267-276, 2009, ACM, 978-1-60558-501-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
rectangular layouts |
33 | Paul Bay, Gianfranco Bilardi |
Deterministic On-Line Routing on Area-Universal Networks (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume I, pp. 297-306, 1990, IEEE Computer Society, 0-8186-2082-X. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
partial permutations, deterministic online routing, area-universal networks, pruned butterfly, sorting fat-tree, polylogarithmic slowdown, routing, randomization, precomputation |
19 | Ronald I. Greenberg, Hyeong-Cheol Oh |
Universal Wormhole Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 8(3), pp. 254-262, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
area-universal networks, fat-tree interconnection network, Wormhole routing, packet routing, greedy routing, randomized routing |
19 | Christos Kaklamanis, Danny Krizanc, Satish Rao |
Universal Emulations with Sublogarithmic Slowdown ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 341-350, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
arbitrary bounded degree networks, universal emulations, sublogarithmic slowdown, bounded degree networks, area-universal network, VLSI layout area, N-node network, sublogarithmic bounds, hypercube, butterfly |
13 | William S. Evans, Stefan Felsner, Linda Kleist, Stephen G. Kobourov |
On Area-Universal Quadrangulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Algorithms Appl. ![In: J. Graph Algorithms Appl. 25(1), pp. 171-193, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Yi-Jun Chang, Hsu-Chun Yen |
Area-universal drawings of biconnected outerplane graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 118, pp. 1-5, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Jiun-Jie Wang, Xin He |
A Polynomial Time Algorithm for Finding Area-Universal Rectangular Layouts ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1302.3672, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
13 | David Eppstein, Elena Mumford, Bettina Speckmann, Kevin Verbeek |
Area-Universal and Constrained Rectangular Layouts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 41(3), pp. 537-564, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
13 | |
Area-Universal Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Parallel Computing ![In: Encyclopedia of Parallel Computing, pp. 71, 2011, Springer, 978-0-387-09765-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
13 | David Eppstein, Elena Mumford, Bettina Speckmann, Kevin Verbeek |
Area-Universal Rectangular Layouts ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0901.3924, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
13 | Gianfranco Bilardi, Shiva Chaudhuri, Devdatt P. Dubhashi, Kurt Mehlhorn |
A Lower Bound for Area-Universal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 51(2), pp. 101-105, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
13 | Sivan Toledo |
Competitive Fault-Tolerance in Area-Universal Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '92, San Diego, CA, USA, June 29 - July 1, 1992, pp. 236-246, 1992, ACM, 0-89791-483-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
13 | Paul Bay |
Area-Universal Interconnection Networks for VLSI Parallel Computers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
1992 |
RDF |
|
6 | Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci |
Implementing Shared Memory on Mult-Dimensional Meshes and on the Fat-Tree (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '95, Third Annual European Symposium, Corfu, Greece, September 25-27, 1995, Proceedings, pp. 60-74, 1995, Springer, 3-540-60313-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #16 of 16 (100 per page; Change: )
|
|