|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 54 occurrences of 36 keywords
|
|
|
Results
Found 48 publication records. Showing 48 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
109 | Eli Ben-Sasson, Swastik Kopparty |
Affine dispersers from subspace polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 65-74, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
randomness, extractors |
109 | Ariel Gabizon, Ronen Shaltiel |
Increasing the Output Length of Zero-Error Dispersers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings, pp. 430-443, 2008, Springer, 978-3-540-85362-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
90 | Ziv Bar-Yossef, Luca Trevisan, Omer Reingold, Ronen Shaltiel |
Streaming Computation of Combinatorial Objects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 17th Annual IEEE Conference on Computational Complexity, Montréal, Québec, Canada, May 21-24, 2002, pp. 165-174, 2002, IEEE Computer Society, 0-7695-1468-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
error-correcting codes, extractors, dispersers, streaming computation, universal hash functions, online computation |
76 | Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson |
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 1-10, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
dispersers condenser, constructions, extractors, explicit, ramsey graphs |
61 | David Zuckerman |
Linear degree extractors and the inapproximability of max clique and chromatic number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 681-690, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
approximation, NP-hard, clique, extractor, pseudorandom, disperser, chromatic number, explicit construction |
61 | Noam Nisan |
Extracting Randomness: How and Why A survey. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996, pp. 44-58, 1996, IEEE Computer Society, 0-8186-7386-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Randmoness, Computational Complexity, Derandomization, Expanders |
56 | Boaz Barak, Anup Rao 0001, Ronen Shaltiel, Avi Wigderson |
2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 671-680, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
independent sources, extractors, dispersers, Ramsey graphs |
56 | Aviad Cohen 0001, Avi Wigderson |
Dispersers, Deterministic Amplification, and Weak Random Sources (Extended Abstract) ![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. 14-19, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
weak bit fixing sources, RP algorithm, BPP algorithm, deterministic amplification, bipartite multigraphs, probabilistic algorithms, dispersers, error probability, weak random sources |
49 | Christopher Umans |
Hardness of Approximating Sigma2p Minimization Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 40th Annual Symposium on Foundations of Computer Science, FOCS '99, 17-18 October, 1999, New York, NY, USA, pp. 465-474, 1999, IEEE Computer Society, 0-7695-0409-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
computational complexity, hardness of approximation, logic minimization, dispersers, polynomial hierarchy |
48 | Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma |
On the Error Parameter of Dispersers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th InternationalWorkshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings, pp. 294-305, 2005, Springer, 3-540-28239-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
48 | Michael E. Saks, Aravind Srinivasan, Shiyu Zhou |
Explicit OR-Dispersers with Polylogarithmic Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 45(1), pp. 123-154, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
hashing lemmas, imperfect sources of randomness, measures of information, hardness of approximation, derandomization, expander graphs, time-space tradeoffs, pseudo-random generators, explicit constructions, randomized computation |
41 | Boaz Barak, Russell Impagliazzo, Avi Wigderson |
Extracting Randomness Using Few Independent Sources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings, pp. 384-393, 2004, IEEE Computer Society, 0-7695-2228-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
28 | Gil Cohen |
Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 50(3), 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
28 | Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma |
Near-Optimal Strong Dispersers, Erasure List-Decodable Codes and Friends. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR18, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
28 | Xue Chen |
Integrality Gaps and Approximation Algorithms for Dispersers and Bipartite Expanders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, pp. 1543-1560, 2016, SIAM, 978-1-61197-433-1. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
28 | Alexander Golovnev, Alexander S. Kulikov |
Weighted Gate Elimination: Boolean Dispersers for Quadratic Varieties Imply Improved Circuit Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, Cambridge, MA, USA, January 14-16, 2016, pp. 405-411, 2016, ACM, 978-1-4503-4057-1. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
28 | Gil Cohen |
Two-source dispersers for polylogarithmic entropy and improved ramsey graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016, pp. 278-284, 2016, ACM, 978-1-4503-4132-5. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
28 | Gil Cohen |
Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR15, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
28 | Alexander Golovnev, Alexander S. Kulikov |
Weighted gate elimination: Boolean dispersers for quadratic varieties imply improved circuit lower bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR15, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
28 | Gil Cohen |
Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1506.04428, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
28 | Xue Chen |
Integrality Gaps and Approximation Algorithms for Dispersers and Bipartite Expanders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1510.05137, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
28 | Raghu Meka, Omer Reingold, Yuan Zhou 0007 |
Deterministic Coupon Collection and Better Strong Dispersers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain, pp. 872-884, 2014, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-74-3. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
28 | Ariel Gabizon, Ronen Shaltiel |
Increasing the output length of zero-error dispersers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 40(1), pp. 74-104, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
28 | Eli Ben-Sasson, Swastik Kopparty |
Affine Dispersers from Subspace Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 41(4), pp. 880-914, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
28 | Ariel Gabizon, Ronen Shaltiel |
Invertible Zero-Error Dispersers and Defective Memory with Stuck-At Errors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012. Proceedings, pp. 553-564, 2012, Springer, 978-3-642-32511-3. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
28 | Ronen Shaltiel |
Dispersers for affine sources with sub-polynomial entropy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR11, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
28 | Evgeny Demenkov, Alexander S. Kulikov |
An Elementary Proof of 3n-o(n) Lower Bound on the Circuit Complexity of Affine Dispersers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR11, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
28 | Ronen Shaltiel |
Dispersers for Affine Sources with Sub-polynomial Entropy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22-25, 2011, pp. 247-256, 2011, IEEE Computer Society, 978-1-4577-1843-4. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
28 | Evgeny Demenkov, Alexander S. Kulikov |
An Elementary Proof of a 3n - o(n) Lower Bound on the Circuit Complexity of Affine Dispersers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings, pp. 256-265, 2011, Springer, 978-3-642-22992-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
28 | Xin Li 0006 |
A New Approach to Affine Extractors and Dispersers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, USA, June 8-10, 2011, pp. 137-147, 2011, IEEE Computer Society, 978-0-7695-4411-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
28 | Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson |
Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 57(4), pp. 20:1-20:52, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
28 | Eli Ben-Sasson, Swastik Kopparty |
Affine Dispersers from Subspace Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR10, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
28 | Xin Li 0006 |
A New Approach to Affine Extractors and Dispersers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR10, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
28 | Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson |
Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers, and Extractors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR10, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
28 | Christopher Umans |
Reconstructive Dispersers and Hitting Set Generators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 55(1), pp. 134-156, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Hitting set generator, Derandomization, Disperser |
28 | Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma |
On the Error Parameter of Dispersers ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR05, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
28 | Christopher Umans |
Reconstructive Dispersers and Hitting Set Generators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th InternationalWorkshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings, pp. 460-471, 2005, Springer, 3-540-28239-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Amnon Ta-Shma |
Almost Optimal Dispersers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 22(1), pp. 123-145, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) Classes: 68Q01, 68R10 |
28 | Jaikumar Radhakrishnan, Amnon Ta-Shma |
Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 13(1), pp. 2-24, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
28 | Amnon Ta-Shma |
Almost Optimal Dispersers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, Dallas, Texas, USA, May 23-26, 1998, pp. 196-202, 1998, ACM, 0-89791-962-9. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
28 | Michael E. Saks, Aravind Srinivasan, Shiyu Zhou |
Explicit dispersers with polylog degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA, pp. 479-488, 1995, ACM, 0-89791-718-9. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
20 | Eran Rom, Amnon Ta-Shma |
Improving the Alphabet-Size in Expander-Based Code Constructions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(8), pp. 3695-3700, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
20 | Christopher Umans |
Optimization Problems in the Polynomial-Time Hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings, pp. 345-355, 2006, Springer, 3-540-34021-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
20 | Anup Rao 0001 |
Extractors for a constant number of polynomially small min-entropy independent sources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 497-506, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
independent sources, extractor, Ramsey graphs |
20 | Amnon Ta-Shma, Christopher Umans, David Zuckerman |
Loss-less condensers, unbalanced expanders, and extractors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece, pp. 143-152, 2001, ACM, 1-58113-349-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
20 | Peter Bro Miltersen, N. V. Vinodchandran |
Derandomizing Arthur-Merlin Games Using Hitting Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 40th Annual Symposium on Foundations of Computer Science, FOCS '99, 17-18 October, 1999, New York, NY, USA, pp. 71-80, 1999, IEEE Computer Society, 0-7695-0409-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
derandomization, hitting sets, Arthur-Merlin games |
20 | Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano |
On the Complexity of Wavelength Converters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings, pp. 771-779, 1998, Springer, 3-540-64827-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
20 | 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 |
Displaying result #1 - #48 of 48 (100 per page; Change: )
|
|