Search results for "disperser"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
113	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
92	Christopher Umans	Reconstructive Dispersers and Hitting Set Generators.	Algorithmica	2009	DBLP DOI BibTeX RDF	Hitting set generator, Derandomization, Disperser
63	Christopher Umans	Reconstructive Dispersers and Hitting Set Generators.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
42	Amnon Ta-Shma, Christopher Umans, David Zuckerman	Lossless Condensers, Unbalanced Expanders, And Extractors.	Comb.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 68Q01
42	Boaz Barak, Anup Rao 0001, Ronen Shaltiel, Avi Wigderson	2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction.	STOC	2006	DBLP DOI BibTeX RDF	independent sources, extractors, dispersers, Ramsey graphs
42	Amnon Ta-Shma	Almost Optimal Dispersers.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 68Q01, 68R10
42	Michael E. Saks, Aravind Srinivasan, Shiyu Zhou	Explicit OR-Dispersers with Polylogarithmic Degree.	J. ACM	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
36	Paul Beame, Sajin Koroth	On Disperser/Lifting Properties of the Index and Inner-Product Functions.	ITCS	2023	DBLP DOI BibTeX RDF
36	Paul Beame, Sajin Koroth	On Disperser/Lifting Properties of the Index and Inner-Product Functions.	Electron. Colloquium Comput. Complex.	2022	DBLP BibTeX RDF
36	Paul Beame, Sajin Koroth	On Disperser/Lifting Properties of the Index and Inner-Product Functions.	CoRR	2022	DBLP DOI BibTeX RDF
36	Ibrahim Ardi, Hervé Carfantan, Simon Lacroix, Antoine Monmayrant	Fast Hyperspectral Cube Reconstruction for a Double Disperser Imager.	EUSIPCO	2018	DBLP DOI BibTeX RDF
36	Wen Liang Chang, Jeevan Kanesan, Anand Jayant Kulkarni, Harikrishnan Ramiah	Data clustering using seed disperser ant algorithm.	Turkish J. Electr. Eng. Comput. Sci.	2017	DBLP DOI BibTeX RDF
36	Wen Liang Chang, Jeevan Kanesan, Anand Jayant Kulkarni	Seed Disperser Ant Algorithm: An Evolutionary Approach for Optimization.	EvoApplications	2015	DBLP DOI BibTeX RDF
36	Aviad Cohen 0001	Disperser graphs, deterministic amplification, and imperfect random sources (גרפים מפזרים, הגברה דטרמיניסטית ומקורות אקראים חלשים.).		1991	RDF
29	David Zuckerman	Linear degree extractors and the inapproximability of max clique and chromatic number.	STOC	2006	DBLP DOI BibTeX RDF	approximation, NP-hard, clique, extractor, pseudorandom, disperser, chromatic number, explicit construction
29	Bogdan S. Chlebus, Dariusz R. Kowalski	Cooperative asynchronous update of shared memory.	STOC	2005	DBLP DOI BibTeX RDF	problem Write-All, read and write register, work efficiency, distributed algorithm, expander, asynchrony, disperser
21	Eli Ben-Sasson, Swastik Kopparty	Affine dispersers from subspace polynomials.	STOC	2009	DBLP DOI BibTeX RDF	randomness, extractors
21	Ariel Gabizon, Ronen Shaltiel	Increasing the Output Length of Zero-Error Dispersers.	APPROX-RANDOM	2008	DBLP DOI BibTeX RDF
21	Anup Rao 0001	Extractors for a constant number of polynomially small min-entropy independent sources.	STOC	2006	DBLP DOI BibTeX RDF	independent sources, extractor, Ramsey graphs
21	Eran Rom, Amnon Ta-Shma	Improving the Alphabet-Size in High Noise, Almost Optimal Rate List Decodable Codes.	STACS	2005	DBLP DOI BibTeX RDF
21	Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma	On the Error Parameter of Dispersers.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
21	Elchanan Mossel, Christopher Umans	On the Complexity of Approximating the VC Dimension.	CCC	2001	DBLP DOI BibTeX RDF
21	Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson	Near-Optimal Conversion of Hardness into Pseudo-Randomness.	FOCS	1999	DBLP DOI BibTeX RDF	Pseudo-Ranndom Generators, Derandomization
21	Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan	Weak Random Sources, Hitting Sets, and BPP Simulations.	FOCS	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