The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for Disperser with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1991-2007 (15) 2008-2023 (9)
Publication types (Num. hits)
article(7) inproceedings(16) phdthesis(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 41 occurrences of 31 keywords

Results
Found 24 publication records. Showing 24 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
113Jaikumar Radhakrishnan, Amnon Ta-Shma Tight Bounds for Depth-two Superconcentrators. Search on Bibsonomy FOCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF depth-two superconcentrators, optimal bounds, disperser graphs, entropy loss, superconcentrator, entropy, directed graphs, directed graph, edges, tight bounds
92Christopher Umans Reconstructive Dispersers and Hitting Set Generators. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Hitting set generator, Derandomization, Disperser
63Christopher Umans Reconstructive Dispersers and Hitting Set Generators. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
42Amnon Ta-Shma, Christopher Umans, David Zuckerman Lossless Condensers, Unbalanced Expanders, And Extractors. Search on Bibsonomy Comb. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 68Q01
42Boaz 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 STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF independent sources, extractors, dispersers, Ramsey graphs
42Amnon Ta-Shma Almost Optimal Dispersers. Search on Bibsonomy Comb. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF AMS Subject Classification (2000) Classes: 68Q01, 68R10
42Michael E. Saks, Aravind Srinivasan, Shiyu Zhou Explicit OR-Dispersers with Polylogarithmic Degree. Search on Bibsonomy J. ACM The full citation details ... 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
36Paul Beame, Sajin Koroth On Disperser/Lifting Properties of the Index and Inner-Product Functions. Search on Bibsonomy ITCS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
36Paul Beame, Sajin Koroth On Disperser/Lifting Properties of the Index and Inner-Product Functions. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2022 DBLP  BibTeX  RDF
36Paul Beame, Sajin Koroth On Disperser/Lifting Properties of the Index and Inner-Product Functions. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
36Ibrahim Ardi, Hervé Carfantan, Simon Lacroix, Antoine Monmayrant Fast Hyperspectral Cube Reconstruction for a Double Disperser Imager. Search on Bibsonomy EUSIPCO The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
36Wen Liang Chang, Jeevan Kanesan, Anand Jayant Kulkarni, Harikrishnan Ramiah Data clustering using seed disperser ant algorithm. Search on Bibsonomy Turkish J. Electr. Eng. Comput. Sci. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
36Wen Liang Chang, Jeevan Kanesan, Anand Jayant Kulkarni Seed Disperser Ant Algorithm: An Evolutionary Approach for Optimization. Search on Bibsonomy EvoApplications The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
36Aviad Cohen 0001 Disperser graphs, deterministic amplification, and imperfect random sources (גרפים מפזרים, הגברה דטרמיניסטית ומקורות אקראים חלשים.). Search on Bibsonomy 1991   RDF
29David Zuckerman Linear degree extractors and the inapproximability of max clique and chromatic number. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF approximation, NP-hard, clique, extractor, pseudorandom, disperser, chromatic number, explicit construction
29Bogdan S. Chlebus, Dariusz R. Kowalski Cooperative asynchronous update of shared memory. Search on Bibsonomy STOC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF problem Write-All, read and write register, work efficiency, distributed algorithm, expander, asynchrony, disperser
21Eli Ben-Sasson, Swastik Kopparty Affine dispersers from subspace polynomials. Search on Bibsonomy STOC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF randomness, extractors
21Ariel Gabizon, Ronen Shaltiel Increasing the Output Length of Zero-Error Dispersers. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
21Anup Rao 0001 Extractors for a constant number of polynomially small min-entropy independent sources. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF independent sources, extractor, Ramsey graphs
21Eran Rom, Amnon Ta-Shma Improving the Alphabet-Size in High Noise, Almost Optimal Rate List Decodable Codes. Search on Bibsonomy STACS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
21Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma On the Error Parameter of Dispersers. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
21Elchanan Mossel, Christopher Umans On the Complexity of Approximating the VC Dimension. Search on Bibsonomy CCC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
21Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson Near-Optimal Conversion of Hardness into Pseudo-Randomness. Search on Bibsonomy FOCS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Pseudo-Ranndom Generators, Derandomization
21Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan Weak Random Sources, Hitting Sets, and BPP Simulations. Search on Bibsonomy FOCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF BPP simulations, parallel classes, lower bound, sampling, polynomial time, randomised algorithms, hitting sets, weak random source, weak random sources, min-entropy
Displaying result #1 - #24 of 24 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license