Search results for "derandomized"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
118	Ofer M. Shir, Thomas Bäck	Niching with derandomized evolution strategies in artificial and real-world landscapes.	Nat. Comput.	2009	DBLP DOI BibTeX RDF	Derandomized evolution strategies, CMA, Quantum control, Niching, Laser pulse shaping
101	Ofer M. Shir, Thomas Bäck	Performance analysis of niching algorithms based on derandomized-ES variants.	GECCO	2007	DBLP DOI BibTeX RDF	MPR analysis, derandomized evolution strategies, niching
75	Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson	Uniform direct product theorems: simplified, optimized, and derandomized.	STOC	2008	DBLP DOI BibTeX RDF	direct product code, xor code, direct product theorem
68	Ofer M. Shir, Jonathan Roslund, Thomas Bäck, Herschel Rabitz	Performance analysis of derandomized evolution strategies in quantum control experiments.	GECCO	2008	DBLP DOI BibTeX RDF	derandomized evolution strategies, experimental quantum control, CMA-ES, laser pulse shaping
52	Irit Dinur, Or Meir	Derandomized Parallel Repetition of Structured PCPs.	CCC	2010	DBLP DOI BibTeX RDF	Low error, Direct Product Test, Derandomized Parallel Repetition, PCP, Direct Product, de-Bruijn
43	Ofer M. Shir, Thomas Bäck	The second harmonic generation case-study as a gateway for es to quantum control problems.	GECCO	2007	DBLP DOI BibTeX RDF	derandomized evolution strategies, quantum control, second harmonic generation, scalability, fourier analysis
41	Russell Impagliazzo	Can every randomized algorithm be derandomized?	STOC	2006	DBLP DOI BibTeX RDF	algebraic circuit complexity, probabilistic algorithms, derandomization, circuit complexity, complexity classes, pseudo-randomness
41	Eyal Rozenman, Salil P. Vadhan	Derandomized Squaring of Graphs.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
33	Venkatesan T. Chakaravarthy, Sambuddha Roy	Arthur and Merlin as Oracles.	MFCS	2008	DBLP DOI BibTeX RDF
33	Madhu Sudan 0001, Luca Trevisan, Salil P. Vadhan	Pseudorandom Generators without the XOR Lemma (Abstract).	CCC	1999	DBLP DOI BibTeX RDF	polynomial reconstruct ion, Pseudorandom generators, extractors, list-decoding
27	David R. Karger, Daphne Koller	(De)randomized Construction of Small Sample Spaces in \calNC	FOCS	1994	DBLP DOI BibTeX RDF	general probabilistic analysis, derandomized construction, small sample spaces, compact distributions, d-uniform hypergraphs, parallel algorithm, linear programming, finite automata
27	Bernard Chazelle, Joel Friedman	A Deterministic View of Random Sampling and its Use in Geometry	FOCS	1988	DBLP DOI BibTeX RDF	polynomial preprocessing, deterministic view, efficient probabilistic algorithms, polynomial overhead, probabilistic bounds, geometry complexity, simplicial packing, storage, polynomial time, random sampling, hypergraphs, divide-and-conquer, derandomized, hyperplanes
25	Amir Abboud, Nathan Wallheimer	Worst-Case to Expander-Case Reductions: Derandomized and Generalized.	CoRR	2024	DBLP DOI BibTeX RDF
25	Gil Cohen, Itay Cohen 0003, Gal Maor, Yuval Peled	Derandomized Squaring: An Analytical Insight into Its True Behavior.	Electron. Colloquium Comput. Complex.	2023	DBLP BibTeX RDF
25	Meshi Bashari, Amir Epstein, Yaniv Romano, Matteo Sesia	Derandomized Novelty Detection with FDR Control via Conformal E-values.	CoRR	2023	DBLP DOI BibTeX RDF
25	Meshi Bashari, Amir Epstein, Yaniv Romano, Matteo Sesia	Derandomized novelty detection with FDR control via conformal e-values.	NeurIPS	2023	DBLP BibTeX RDF
25	Lijie Chen 0001, Xin Lyu 0002	Inverse-Exponential Correlation Bounds and Extremely Rigid Matrices from a New Derandomized XOR Lemma.	Electron. Colloquium Comput. Complex.	2021	DBLP BibTeX RDF
25	Lijie Chen 0001, Xin Lyu 0002	Inverse-exponential correlation bounds and extremely rigid matrices from a new derandomized XOR lemma.	STOC	2021	DBLP DOI BibTeX RDF
25	Rocco A. Servedio, Li-Yang Tan	Deterministic Approximate Counting of Polynomial Threshold Functions via a Derandomized Regularity Lemma.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
25	Max Rabinovich, Michael I. Jordan, Martin J. Wainwright	Lower bounds in multiple testing: A framework based on derandomized proxies.	CoRR	2020	DBLP BibTeX RDF
25	Or Meir	On Derandomized Composition of Boolean Functions.	Comput. Complex.	2019	DBLP DOI BibTeX RDF
25	David G. Harris 0001	Derandomized Concentration Bounds for Polynomials, and Hypergraph Maximal Independent Set.	ACM Trans. Algorithms	2019	DBLP DOI BibTeX RDF
25	Dengwang Tang, Vijay G. Subramanian	Derandomized Load Balancing using Random Walks on Expander Graphs.	CoRR	2019	DBLP BibTeX RDF
25	Charles Clum, Dustin G. Mixon	Derandomized compressed sensing with nonuniform guarantees for 1 recovery.	CoRR	2019	DBLP BibTeX RDF
25	Xue Chen 0001	Derandomized Balanced Allocation.	SODA	2019	DBLP DOI BibTeX RDF
25	Adam Bobowski, Miroslaw Kutylowski	Derandomized PACE with Mutual Authentication.	NSS	2019	DBLP DOI BibTeX RDF
25	Dengwang Tang, Vijay G. Subramanian	Derandomized Asymmetrical Balanced Allocation.	Allerton	2019	DBLP DOI BibTeX RDF
25	Hamid Nabati, Jia Yuan Yu	Distributed, Private, and Derandomized Allocation Algorithm for EV Charging.	CoRR	2018	DBLP BibTeX RDF
25	Syed Eqbal Alam, Robert Shorten, Fabian Wirth, Jia Yuan Yu	Derandomized Distributed Multi-resource Allocation with Little Communication Overhead.	CoRR	2018	DBLP BibTeX RDF
25	David G. Harris 0001	Derandomized concentration bounds for polynomials, and hypergraph maximal independent set.	SODA	2018	DBLP DOI BibTeX RDF
25	Hamid Nabati, Jia Yuan Yu	Distributed, Private, and Derandomized Allocation Algorithm for EV Charging.	ISC2	2018	DBLP DOI BibTeX RDF
25	Syed Eqbal Alam, Robert Shorten, Fabian Wirth, Jia Yuan Yu	Derandomized Distributed Multi-resource Allocation with Little Communication Overhead.	Allerton	2018	DBLP DOI BibTeX RDF
25	Or Meir	On Derandomized Composition of Boolean Functions.	Electron. Colloquium Comput. Complex.	2017	DBLP BibTeX RDF
25	Xue Chen 0001	Derandomized Balanced Allocation.	CoRR	2017	DBLP BibTeX RDF
25	Dana Moshkovitz, Govind Ramnarayan, Henry Yuen	A No-Go Theorem for Derandomized Parallel Repetition: Beyond Feige-Kilian.	CoRR	2016	DBLP BibTeX RDF
25	Dana Moshkovitz, Govind Ramnarayan, Henry Yuen	A No-Go Theorem for Derandomized Parallel Repetition: Beyond Feige-Kilian.	APPROX-RANDOM	2016	DBLP DOI BibTeX RDF
25	Srimanta Bhattacharya	Derandomized Construction of Combinatorial Batch Codes.	CoRR	2015	DBLP BibTeX RDF
25	Saeed Afrasiabi Gorgani, Gerhard Wunder	Derandomized Multi-block Sign Selection for PMEPR Reduction of FBMC Waveform.	VTC Spring	2015	DBLP DOI BibTeX RDF
25	Srimanta Bhattacharya	Derandomized Construction of Combinatorial Batch Codes.	FCT	2015	DBLP DOI BibTeX RDF
25	Irit Dinur, Prahladh Harsha, Srikanth Srinivasan 0001, Girish Varma	Derandomized Graph Product Results Using the Low Degree Long Code.	STACS	2015	DBLP DOI BibTeX RDF
25	Mario Ventresca, Dionne M. Aleman	A derandomized approximation algorithm for the critical node detection problem.	Comput. Oper. Res.	2014	DBLP DOI BibTeX RDF
25	Irit Dinur, Prahladh Harsha, Srikanth Srinivasan 0001, Girish Varma	Derandomized Graph Product Results using the Low Degree Long Code.	CoRR	2014	DBLP BibTeX RDF
25	Ronen Shaltiel	Derandomized Parallel Repetition Theorems for Free Games.	Comput. Complex.	2013	DBLP DOI BibTeX RDF
25	Jérémie Decock, Olivier Teytaud	Linear Convergence of Evolution Strategies with Derandomized Sampling Beyond Quasi-Convex Functions.	Artificial Evolution	2013	DBLP DOI BibTeX RDF
25	Luca Trevisan, Tongke Xue	A Derandomized Switching Lemma and an Improved Derandomization of AC0.	CCC	2013	DBLP DOI BibTeX RDF
25	Luca Trevisan	A Derandomized Switching Lemma and an Improved Derandomization of AC0.	Electron. Colloquium Comput. Complex.	2012	DBLP BibTeX RDF
25	Zheng Wang 0013, Cong Ling 0001	Derandomized sampling algorithm for lattice decoding.	ITW	2012	DBLP DOI BibTeX RDF
25	Irit Dinur, Or Meir	Derandomized Parallel Repetition via Structured PCPs.	Comput. Complex.	2011	DBLP DOI BibTeX RDF
25	Carlos A. J. Martinhon, Fábio Protti	An improved derandomized approximation algorithm for the max-controlled set problem.	RAIRO Theor. Informatics Appl.	2011	DBLP DOI BibTeX RDF
25	Daniel M. Kane, Jelani Nelson	A Derandomized Sparse Johnson-Lindenstrauss Transform.	Electron. Colloquium Comput. Complex.	2010	DBLP BibTeX RDF
25	Irit Dinur, Or Meir	Derandomized Parallel Repetition via Structured PCPs.	Electron. Colloquium Comput. Complex.	2010	DBLP BibTeX RDF
25	Daniel M. Kane, Jelani Nelson	A Derandomized Sparse Johnson-Lindenstrauss Transform	CoRR	2010	DBLP BibTeX RDF
25	Irit Dinur, Or Meir	Derandomized Parallel Repetition of Structured PCPs	CoRR	2010	DBLP BibTeX RDF
25	Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson	Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized.	SIAM J. Comput.	2010	DBLP DOI BibTeX RDF
25	Ronen Shaltiel	Derandomized Parallel Repetition Theorems for Free Games.	CCC	2010	DBLP DOI BibTeX RDF	Derandomization, Randomness extractors, Parallel repetition
25	Eyal Kaplan, Moni Naor, Omer Reingold	Derandomized Constructions of k-Wise (Almost) Independent Permutations.	Algorithmica	2009	DBLP DOI BibTeX RDF	Card shuffling, Connectivity, Block ciphers, Random walk, Pseudo-randomness
25	Christian Glaßer, Christian Reitwießner, Maximilian Witek	Improved and Derandomized Approximations for Two-Criteria Metric Traveling Salesman.	Electron. Colloquium Comput. Complex.	2009	DBLP BibTeX RDF
25	Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson	Uniform Direct-Product Theorems: Simplified, Optimized, and Derandomized.	Electron. Colloquium Comput. Complex.	2008	DBLP BibTeX RDF
25	Eyal Kaplan, Moni Naor, Omer Reingold	Derandomized Constructions of k-Wise (Almost) Independent Permutations	Electron. Colloquium Comput. Complex.	2006	DBLP BibTeX RDF
25	Amnon Ta-Shma, Christopher Umans	Better lossless condensers through derandomized curve samplers.	FOCS	2006	DBLP DOI BibTeX RDF
25	Eyal Rozenman, Salil P. Vadhan	Derandomized Squaring of Graphs	Electron. Colloquium Comput. Complex.	2005	DBLP BibTeX RDF
25	Eyal Kaplan, Moni Naor, Omer Reingold	Derandomized Constructions of k-Wise (Almost) Independent Permutations.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
25	Carlos A. J. Martinhon, Fábio Protti	An Improved Derandomized Approximation Algorithm for the Max-Controlled Set Problem.	WEA	2004	DBLP DOI BibTeX RDF
25	Nikolaus Hansen, Sibylle D. Müller, Petros Koumoutsakos	Reducing the Time Complexity of the Derandomized Evolution Strategy with Covariance Matrix Adaptation (CMA-ES).	Evol. Comput.	2003	DBLP DOI BibTeX RDF
25	Lars Engebretsen, Piotr Indyk, Ryan O'Donnell	Derandomized dimensionality reduction with applications.	SODA	2002	DBLP BibTeX RDF
25	Nikolaus Hansen, Andreas Ostermeier	Completely Derandomized Self-Adaptation in Evolution Strategies.	Evol. Comput.	2001	DBLP DOI BibTeX RDF
25	Meera Sitharam, Timothy Straney	Derandomized Learning of Boolean Functions over Finite Abelian Groups.	Int. J. Found. Comput. Sci.	2001	DBLP DOI BibTeX RDF
25	Leandro dos Santos Coelho, Antonio Augusto Rodrigues Coelho	Automatic tuning of PID and gain scheduling PID controllers by a derandomized evolution strategy.	Artif. Intell. Eng. Des. Anal. Manuf.	1999	DBLP BibTeX RDF
25	Michael Luby	Introduction to Special Issue on Randomized and Derandomized Algorithms.	Algorithmica	1996	DBLP DOI BibTeX RDF
25	Noga Alon, Uriel Feige, Avi Wigderson, David Zuckerman	Derandomized Graph Products.	Comput. Complex.	1995	DBLP DOI BibTeX RDF
25	Andreas Ostermeier, Andreas Gawelczyk, Nikolaus Hansen	A Derandomized Approach to Self Adaptation of Evolution Strategies.	Evol. Comput.	1994	DBLP DOI BibTeX RDF
17	Venkatesan Guruswami, Atri Rudra	Better Binary List Decodable Codes Via Multilevel Concatenation.	IEEE Trans. Inf. Theory	2009	DBLP DOI BibTeX RDF
17	Noga Alon, Daniel Lokshtanov, Saket Saurabh 0001	Fast FAST.	ICALP (1)	2009	DBLP DOI BibTeX RDF
17	Venkatesan Guruswami, Valentine Kabanets	Hardness Amplification via Space-Efficient Direct Products.	Comput. Complex.	2008	DBLP DOI BibTeX RDF	94B35, 68Q25, 94B05, 68P30, Subject classification. 68Q17
17	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
17	Friedrich Eisenbrand, Fabrizio Grandoni 0001, Thomas Rothvoß, Guido Schäfer	Approximating connected facility location problems via random facility sampling and core detouring.	SODA	2008	DBLP BibTeX RDF
17	Youhei Akimoto, Jun Sakuma, Isao Ono, Shigenobu Kobayashi	Functionally specialized CMA-ES: a modification of CMA-ES based on the specialization of the functions of covariance matrix adaptation and step size adaptation.	GECCO	2008	DBLP DOI BibTeX RDF	functional specialization, step size adaptation, evolution strategy, covariance matrix adaptation
17	Kord Eickmeyer, Martin Grohe, Magdalena Grüber	Approximation of Natural W[P]-Complete Minimisation Problems Is Hard.	CCC	2008	DBLP DOI BibTeX RDF	derandomisation, parameterized complexity, inapproximability
17	Ofer M. Shir, Joost N. Kok, Thomas Bäck, Marc J. J. Vrakking	Gaining Insights into Laser Pulse Shaping by Evolution Strategies.	IWINAC (1)	2007	DBLP DOI BibTeX RDF
17	Peng Zhang 0008	Approximating Generalized Multicut on Trees.	CiE	2007	DBLP DOI BibTeX RDF	Generalized Multicut, Approximation Algorithm, Combinatorial Optimization, Tree
17	Ronen Shaltiel, Christopher Umans	Low-end uniform hardness vs. randomness tradeoffs for AM.	STOC	2007	DBLP DOI BibTeX RDF	hardness vs. randomness tradeoff, hitting-set generator, derandomization, Arthur-Merlin games
17	Venkatesan Guruswami, Atri Rudra	Better Binary List-Decodable Codes Via Multilevel Concatenation.	APPROX-RANDOM	2007	DBLP DOI BibTeX RDF
17	Joachim Kneis, Daniel Mölle, Peter Rossmanith	Partial vs. Complete Domination: t-Dominating Set.	SOFSEM (1)	2007	DBLP DOI BibTeX RDF
17	Yuval Emek, David Peleg	A tight upper bound on the probabilistic embedding of series-parallel graphs.	SODA	2006	DBLP DOI BibTeX RDF
17	Benjamin Doerr	Generating Randomized Roundings with Cardinality Constraints and Derandomizations.	STACS	2006	DBLP DOI BibTeX RDF
17	Venkatesan Guruswami, Valentine Kabanets	Hardness Amplification Via Space-Efficient Direct Products.	LATIN	2006	DBLP DOI BibTeX RDF	error-correcting codes, expanders, Direct products, hardness amplification
17	Guy Kortsarz, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian	Complete partitions of graphs.	SODA	2005	DBLP BibTeX RDF
17	Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Prívetivý, Anand Srivastav	On the Minimum Load Coloring Problem.	WAOA	2005	DBLP DOI BibTeX RDF
17	Ronen Shaltiel, Christopher Umans	Pseudorandomness for Approximate Counting and Sampling.	CCC	2005	DBLP DOI BibTeX RDF
17	Udo Adamy, Thomas Erlebach, Dieter Mitsche, Ingo Schurr, Bettina Speckmann, Emo Welzl	Off-line Admission Control for Advance Reservations in Star Networks.	WAOA	2004	DBLP DOI BibTeX RDF
17	Nir Andelman, Yishay Mansour	Auctions with Budget Constraints.	SWAT	2004	DBLP DOI BibTeX RDF
17	Amir Shpilka, Avi Wigderson	Derandomizing homomorphism testing in general groups.	STOC	2004	DBLP DOI BibTeX RDF	homomorphism testing, derandomization, linearity testing
17	Luca Trevisan	List-Decoding Using The XOR Lemma.	FOCS	2003	DBLP DOI BibTeX RDF
17	Eli Ben-Sasson, Madhu Sudan 0001, Salil P. Vadhan, Avi Wigderson	Randomness-efficient low degree tests and short PCPs via epsilon-biased sets.	STOC	2003	DBLP DOI BibTeX RDF	property testing, probabilistically checkable proofs, locally testable codes, linearity testing, low degree testing
17	Jinhui Xu 0001, Yang Yang 0012, Zhiyong Lin	Traveling Salesman Problem of Segments.	COCOON	2003	DBLP DOI BibTeX RDF
17	Sibylle D. Müller, Nikolaus Hansen, Petros Koumoutsakos	Increasing the Serial and the Parallel Performance of the CMA-Evolution Strategy with Large Populations.	PPSN	2002	DBLP DOI BibTeX RDF
17	Boris Naujoks, Lars Willmes, Thomas Bäck, Werner Haase	Evaluating Multi-criteria Evolutionary Algorithms for Airfoil Optimisation.	PPSN	2002	DBLP DOI BibTeX RDF
17	Benjamin Doerr	Antirandomizing the Wrong Game.	ICALP	2002	DBLP DOI BibTeX RDF	Games, randomization, derandomization
17	Oded Goldreich 0001, Avi Wigderson	Derandomization That Is Rarely Wrong from Short Advice That Is Typically Good.	RANDOM	2002	DBLP DOI BibTeX RDF
17	Guy Even, Guy Kortsarz, Wolfgang Slany	On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem.	SWAT	2002	DBLP DOI BibTeX RDF