Search results for "Derandomization"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
14	Anne Auger, Dimo Brockhoff, Nikolaus Hansen	Mirrored variants of the (1, 4)-CMA-ES compared on the noisy BBOB-2010 testbed.	GECCO (Companion)	2010	DBLP DOI BibTeX RDF	benchmarking, black-box optimization
14	Anne Auger, Dimo Brockhoff, Nikolaus Hansen	Comparing the (1+1)-CMA-ES with a mirrored (1+2)-CMA-ES with sequential selection on the noiseless BBOB-2010 testbed.	GECCO (Companion)	2010	DBLP DOI BibTeX RDF	benchmarking, black-box optimization
14	Anne Auger, Dimo Brockhoff, Nikolaus Hansen	Mirrored variants of the (1, 2)-CMA-ES compared on the noisy BBOB-2010 testbed.	GECCO (Companion)	2010	DBLP DOI BibTeX RDF	benchmarking, black-box optimization
14	Andrzej Lingas	A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication.	ESA	2009	DBLP DOI BibTeX RDF
14	Raghu Meka, David Zuckerman	Small-Bias Spaces for Group Products.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF
14	Xiaoyang Gu, Jack H. Lutz	Dimension Characterizations of Complexity Classes.	Comput. Complex.	2008	DBLP DOI BibTeX RDF	Subject classification, 68Q15
14	Aduri Pavan, N. V. Vinodchandran	Relations between Average-Case and Worst-Case Complexity.	Theory Comput. Syst.	2008	DBLP DOI BibTeX RDF	Average-case complexity, Arthur-Merlin games, Worst-case complexity
14	Luqing Wang, Chintha Tellambura	Clipping-Noise Guided Sign-Selection for PAR Reduction in OFDM Systems.	IEEE Trans. Signal Process.	2008	DBLP DOI BibTeX RDF
14	Zeev Dvir, Amir Shpilka, Amir Yehudayoff	Hardness-randomness tradeoffs for bounded depth arithmetic circuits.	STOC	2008	DBLP DOI BibTeX RDF	bounded depth circuits, hardness-randomness tradeoffs, identity testing, lower bounds, arithmetic circuits
14	Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel	Constant-Round Oblivious Transfer in the Bounded Storage Model.	J. Cryptol.	2007	DBLP DOI BibTeX RDF
14	Peng Cui 0008	A Tighter Analysis of Set Cover Greedy Algorithm for Test Set.	ESCAPE	2007	DBLP DOI BibTeX RDF
14	Jianer Chen, Songjian Lu, Sing-Hoi Sze, Fenghui Zhang	Improved algorithms for path, matching, and packing problems.	SODA	2007	DBLP BibTeX RDF
14	Shankar Kalyanaraman, Christopher Umans	Algorithms for Playing Games with Limited Randomness.	ESA	2007	DBLP DOI BibTeX RDF
14	Andris Ambainis, Joseph Emerson	Quantum t-designs: t-wise Independence in the Quantum World.	CCC	2007	DBLP DOI BibTeX RDF
14	Xiaoyang Gu, Jack H. Lutz	Dimension Characterizations of Complexity Classes.	MFCS	2006	DBLP DOI BibTeX RDF
14	Joachim Kneis, Daniel Mölle, Stefan Richter 0001, Peter Rossmanith	Divide-and-Color.	WG	2006	DBLP DOI BibTeX RDF
14	Shlomo Hoory, Avner Magen, Toniann Pitassi	Monotone Circuits for the Majority Function.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
14	Allan Borodin	Further Reflections on a Theory for Basic Algorithms.	AAIM	2006	DBLP DOI BibTeX RDF
14	Peter Bro Miltersen, N. V. Vinodchandran	Derandomizing Arthur-Merlin Games using Hitting Sets.	Comput. Complex.	2005	DBLP DOI BibTeX RDF	68Q17, Subject classification. 68Q15
14	Guy Even, Guy Kortsarz, Wolfgang Slany	On network design problems: fixed cost flows and the covering steiner problem.	ACM Trans. Algorithms	2005	DBLP DOI BibTeX RDF	Optimization, approximation, graphs, theory, flow
14	Avi Wigderson, David Xiao	A Randomness-Efficient Sampler for Matrix-valued Functions and Applications.	FOCS	2005	DBLP DOI BibTeX RDF
14	Liam Roditty, Mikkel Thorup, Uri Zwick	Deterministic Constructions of Approximate Distance Oracles and Spanners.	ICALP	2005	DBLP DOI BibTeX RDF
14	Aduri Pavan, N. V. Vinodchandran	Relations Between Average-Case and Worst-Case Complexity.	FCT	2005	DBLP DOI BibTeX RDF
14	Yajun Kou, Wu-Sheng Lu, Andreas Antoniou	Peak-to-average power-ratio reduction algorithms for OFDM systems via constellation extension.	ISCAS (3)	2005	DBLP DOI BibTeX RDF
14	Jacobo Torán	Arthur-Merlin Games and the Problem of Isomorphism Testing.	CiE	2005	DBLP DOI BibTeX RDF
14	Ravi Jain, David Molnar, Zulfikar Ramzan	Towards understanding algorithmic factors affecting energy consumption: switching complexity, randomness, and preliminary experiments.	DIALM-POMC	2005	DBLP DOI BibTeX RDF	randomness cost, switching cost, energy measurement
14	Aggelos Kiayias, Yona Raekow, Alexander Russell	Efficient Steganography with Provable Security Guarantees.	Information Hiding	2005	DBLP DOI BibTeX RDF
14	Ronen Shaltiel, Christopher Umans	Pseudorandomness for Approximate Counting and Sampling.	CCC	2005	DBLP DOI BibTeX RDF
14	Emanuele Viola	Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates.	CCC	2005	DBLP DOI BibTeX RDF
14	Matti Kääriäinen, John Langford 0001	A comparison of tight generalization error bounds.	ICML	2005	DBLP DOI BibTeX RDF
14	Valentine Kabanets, Russell Impagliazzo	Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds.	Comput. Complex.	2004	DBLP DOI BibTeX RDF	68Q17, 68Q15, Subject classification. 68Q10
14	Hovav Shacham, Matthew Page, Ben Pfaff, Eu-Jin Goh, Nagendra Modadugu, Dan Boneh	On the effectiveness of address-space randomization.	CCS	2004	DBLP DOI BibTeX RDF	address-space randomization, automated attacks, diversity
14	Carlos A. J. Martinhon, Fábio Protti	An Improved Derandomized Approximation Algorithm for the Max-Controlled Set Problem.	WEA	2004	DBLP DOI BibTeX RDF
14	Alexander Healy, Salil P. Vadhan, Emanuele Viola	Using nondeterminism to amplify hardness.	STOC	2004	DBLP DOI BibTeX RDF	noise stability, pseudorandom generators for space-bounded computation, average-case complexity, hardness amplification
14	Luca Trevisan	A Note on Approximate Counting for k-DNF.	APPROX-RANDOM	2004	DBLP DOI BibTeX RDF
14	Amnon Ta-Shma	Almost Optimal Dispersers.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 68Q01, 68R10
14	Lars Engebretsen, Piotr Indyk, Ryan O'Donnell	Derandomized dimensionality reduction with applications.	SODA	2002	DBLP BibTeX RDF
14	Salil P. Vadhan	Randomness Extractors and their Many Guises.	FOCS	2002	DBLP DOI BibTeX RDF
14	Johan Håstad, Srinivasan Venkatesh 0001	On the advantage over a random assignment.	STOC	2002	DBLP DOI BibTeX RDF
14	Ziv Bar-Yossef, Luca Trevisan, Omer Reingold, Ronen Shaltiel	Streaming Computation of Combinatorial Objects.	CCC	2002	DBLP DOI BibTeX RDF	error-correcting codes, extractors, dispersers, streaming computation, universal hash functions, online computation
14	Amnon Ta-Shma, Christopher Umans, David Zuckerman	Loss-less condensers, unbalanced expanders, and extractors.	STOC	2001	DBLP DOI BibTeX RDF
14	Russell Impagliazzo, Valentine Kabanets, Avi Wigderson	In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time.	CCC	2001	DBLP DOI BibTeX RDF
14	Artur Czumaj, Andrzej Lingas	A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity.	ICALP	1998	DBLP DOI BibTeX RDF
14	Pascal Koiran	Randomized and Deterministic Algorithms for the Dimension of Algebraic Varieties.	FOCS	1997	DBLP DOI BibTeX RDF	Arthur-Merlin class, Generalized Riemann Hypothesis, complexity, NP-complete, randomized algorithms, deterministic algorithms, deterministic algorithms, algebraic varieties
14	Piotr Indyk	Deterministic Superimposed Coding with Applications to Pattern Matching.	FOCS	1997	DBLP DOI BibTeX RDF
14	Vikraman Arvind, Johannes Köbler	On Resource-Bounded Measure and Pseudorandomness.	FSTTCS	1997	DBLP DOI BibTeX RDF
14	Anand Srivastav, Peter Stangier	Algorthmic Chernoff-Hoeffding Inequalitiers in Integer Programming.	ISAAC	1994	DBLP DOI BibTeX RDF
14	Jürgen Bierbrauer, K. Gopalakrishnan 0001, Douglas R. Stinson	Bounds for Resilient Functions and Orthogonal Arrays.	CRYPTO	1994	DBLP DOI BibTeX RDF