|
|
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. |
ARVLSI |
1999 |
DBLP DOI BibTeX RDF |
|
50 | Paul Bay, Gianfranco Bilardi |
Deterministic On-Line Routing on Area-Universal Networks. |
J. ACM |
1995 |
DBLP DOI BibTeX RDF |
area-universal, general purpose, fat-tree |
40 | David Eppstein, Elena Mumford, Bettina Speckmann, Kevin Verbeek |
Area-universal rectangular layouts. |
SCG |
2009 |
DBLP DOI BibTeX RDF |
rectangular layouts |
33 | Paul Bay, Gianfranco Bilardi |
Deterministic On-Line Routing on Area-Universal Networks (Extended Abstract) |
FOCS |
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. |
IEEE Trans. Parallel Distributed Syst. |
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 |
FOCS |
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. |
J. Graph Algorithms Appl. |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Yi-Jun Chang, Hsu-Chun Yen |
Area-universal drawings of biconnected outerplane graphs. |
Inf. Process. Lett. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Jiun-Jie Wang, Xin He |
A Polynomial Time Algorithm for Finding Area-Universal Rectangular Layouts |
CoRR |
2013 |
DBLP BibTeX RDF |
|
13 | David Eppstein, Elena Mumford, Bettina Speckmann, Kevin Verbeek |
Area-Universal and Constrained Rectangular Layouts. |
SIAM J. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
13 | |
Area-Universal Networks. |
Encyclopedia of Parallel Computing |
2011 |
DBLP DOI BibTeX RDF |
|
13 | David Eppstein, Elena Mumford, Bettina Speckmann, Kevin Verbeek |
Area-Universal Rectangular Layouts |
CoRR |
2009 |
DBLP BibTeX RDF |
|
13 | Gianfranco Bilardi, Shiva Chaudhuri, Devdatt P. Dubhashi, Kurt Mehlhorn |
A Lower Bound for Area-Universal Graphs. |
Inf. Process. Lett. |
1994 |
DBLP DOI BibTeX RDF |
|
13 | Sivan Toledo |
Competitive Fault-Tolerance in Area-Universal Networks. |
SPAA |
1992 |
DBLP DOI BibTeX RDF |
|
13 | Paul Bay |
Area-Universal Interconnection Networks for VLSI Parallel Computers. |
|
1992 |
RDF |
|
6 | Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci |
Implementing Shared Memory on Mult-Dimensional Meshes and on the Fat-Tree (Extended Abstract). |
ESA |
1995 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #16 of 16 (100 per page; Change: )
|
|