|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 4 occurrences of 4 keywords
|
|
|
Results
Found 8 publication records. Showing 8 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
106 | Chinmoy Dutta, Jaikumar Radhakrishnan |
Tradeoffs in Depth-Two Superconcentrators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings, pp. 372-383, 2006, Springer, 978-3-540-32301-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
63 | Jaikumar Radhakrishnan, Amnon Ta-Shma |
Tight Bounds for Depth-two Superconcentrators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 585-594, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
depth-two superconcentrators, optimal bounds, disperser graphs, entropy loss, superconcentrator, entropy, directed graphs, directed graph, edges, tight bounds |
39 | Yuan Li |
Secret Sharing on Superconcentrator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2302.04482, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
39 | Chen Yuan 0003, Haibin Kan |
Smaller Bound of Superconcentrator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Inf. Syst. ![In: IEICE Trans. Inf. Syst. 95-D(9), pp. 2339-2342, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
39 | Roy Meshulam |
A Geometric Construction of a Superconcentrator of Depth 2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 32, pp. 215-219, 1984. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
39 | Manuel Blum 0001, Richard M. Karp, Oliver Vornberger, Christos H. Papadimitriou, Mihalis Yannakakis |
The Complexity of Testing Whether a Graph is a Superconcentrator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 13(4/5), pp. 164-167, 1981. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
26 | Avi Wigderson, David Zuckerman |
Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 19(1), pp. 125-138, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
26 | Shimon Even, Ami Litman |
A Unified Scheme for Routing in Expander Based Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, Second Italian Conference, CIAC '94, Rome, Italy, February 23-25, 1994, Proceedings, pp. 125-135, 1994, Springer, 3-540-57811-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #8 of 8 (100 per page; Change: )
|
|