|
|
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. |
STACS |
2006 |
DBLP DOI BibTeX RDF |
|
63 | Jaikumar Radhakrishnan, Amnon Ta-Shma |
Tight Bounds for Depth-two Superconcentrators. |
FOCS |
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. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
39 | Chen Yuan 0003, Haibin Kan |
Smaller Bound of Superconcentrator. |
IEICE Trans. Inf. Syst. |
2012 |
DBLP DOI BibTeX RDF |
|
39 | Roy Meshulam |
A Geometric Construction of a Superconcentrator of Depth 2. |
Theor. Comput. Sci. |
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. |
Inf. Process. Lett. |
1981 |
DBLP DOI BibTeX RDF |
|
26 | Avi Wigderson, David Zuckerman |
Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications. |
Comb. |
1999 |
DBLP DOI BibTeX RDF |
|
26 | Shimon Even, Ami Litman |
A Unified Scheme for Routing in Expander Based Networks. |
CIAC |
1994 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #8 of 8 (100 per page; Change: )
|
|