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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Nat. Comput. ![In: Nat. Comput. 8(1), pp. 171-196, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2007, Proceedings, London, England, UK, July 7-11, 2007, pp. 705-712, 2007, ACM, 978-1-59593-697-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 579-588, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2008, Proceedings, Atlanta, GA, USA, July 12-16, 2008, pp. 519-526, 2008, ACM, 978-1-60558-130-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 25th Annual IEEE Conference on Computational Complexity, CCC 2010, Cambridge, Massachusetts, USA, June 9-12, 2010, pp. 16-27, 2010, IEEE Computer Society, 978-0-7695-4060-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2007, Proceedings, London, England, UK, July 7-11, 2007, pp. 713-721, 2007, ACM, 978-1-59593-697-4. The full citation details ...](Pics/full.jpeg) |
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? ![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. 373-374, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
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. ![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. 436-447, 2005, Springer, 3-540-28239-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
33 | Venkatesan T. Chakaravarthy, Sambuddha Roy |
Arthur and Merlin as Oracles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings, pp. 229-240, 2008, Springer, 978-3-540-85237-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Madhu Sudan 0001, Luca Trevisan, Salil P. Vadhan |
Pseudorandom Generators without the XOR Lemma (Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 14th Annual IEEE Conference on Computational Complexity, Atlanta, Georgia, USA, May 4-6, 1999, pp. 4, 1999, IEEE Computer Society, 0-7695-0075-7. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 252-263, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 539-549, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.08394, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
25 | Gil Cohen, Itay Cohen 0003, Gal Maor, Yuval Peled |
Derandomized Squaring: An Analytical Insight into Its True Behavior. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR23, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
25 | Meshi Bashari, Amir Epstein, Yaniv Romano, Matteo Sesia |
Derandomized Novelty Detection with FDR Control via Conformal E-values. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2302.07294, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
25 | Meshi Bashari, Amir Epstein, Yaniv Romano, Matteo Sesia |
Derandomized novelty detection with FDR control via conformal e-values. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NeurIPS ![In: Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023., 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR21, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021., pp. 761-771, 2021, ACM, 978-1-4503-8053-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
25 | Rocco A. Servedio, Li-Yang Tan |
Deterministic Approximate Counting of Polynomial Threshold Functions via a Derandomized Regularity Lemma. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 37:1-37:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2005.03725, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
25 | Or Meir |
On Derandomized Composition of Boolean Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 28(4), pp. 661-708, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
25 | David G. Harris 0001 |
Derandomized Concentration Bounds for Polynomials, and Hypergraph Maximal Independent Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 15(3), pp. 43:1-43:29, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
25 | Dengwang Tang, Vijay G. Subramanian |
Derandomized Load Balancing using Random Walks on Expander Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1901.09094, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
25 | Charles Clum, Dustin G. Mixon |
Derandomized compressed sensing with nonuniform guarantees for 1 recovery. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1912.12045, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
25 | Xue Chen 0001 |
Derandomized Balanced Allocation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019, pp. 2513-2526, 2019, SIAM, 978-1-61197-548-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
25 | Adam Bobowski, Miroslaw Kutylowski |
Derandomized PACE with Mutual Authentication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NSS ![In: Network and System Security - 13th International Conference, NSS 2019, Sapporo, Japan, December 15-18, 2019, Proceedings, pp. 697-705, 2019, Springer, 978-3-030-36937-8. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
25 | Dengwang Tang, Vijay G. Subramanian |
Derandomized Asymmetrical Balanced Allocation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Allerton ![In: 57th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2019, Monticello, IL, USA, September 24-27, 2019, pp. 695-697, 2019, IEEE, 978-1-7281-3151-1. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
25 | Hamid Nabati, Jia Yuan Yu |
Distributed, Private, and Derandomized Allocation Algorithm for EV Charging. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1804.07605, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
25 | Syed Eqbal Alam, Robert Shorten, Fabian Wirth, Jia Yuan Yu |
Derandomized Distributed Multi-resource Allocation with Little Communication Overhead. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1812.09404, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
25 | David G. Harris 0001 |
Derandomized concentration bounds for polynomials, and hypergraph maximal independent set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018, pp. 2161-2180, 2018, SIAM, 978-1-61197-503-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
25 | Hamid Nabati, Jia Yuan Yu |
Distributed, Private, and Derandomized Allocation Algorithm for EV Charging. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISC2 ![In: IEEE International Smart Cities Conference, ISC2 2018, Kansas City, MO, USA, September 16-19, 2018, pp. 1-8, 2018, IEEE, 978-1-5386-5959-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Allerton ![In: 56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018, Monticello, IL, USA, October 2-5, 2018, pp. 84-91, 2018, IEEE, 978-1-5386-6596-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
25 | Or Meir |
On Derandomized Composition of Boolean Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR17, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
25 | Xue Chen 0001 |
Derandomized Balanced Allocation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1702.03375, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
25 | Dana Moshkovitz, Govind Ramnarayan, Henry Yuen |
A No-Go Theorem for Derandomized Parallel Repetition: Beyond Feige-Kilian. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1607.07130, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
25 | Dana Moshkovitz, Govind Ramnarayan, Henry Yuen |
A No-Go Theorem for Derandomized Parallel Repetition: Beyond Feige-Kilian. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 42:3-42:29, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
25 | Srimanta Bhattacharya |
Derandomized Construction of Combinatorial Batch Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1502.02472, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
25 | Saeed Afrasiabi Gorgani, Gerhard Wunder |
Derandomized Multi-block Sign Selection for PMEPR Reduction of FBMC Waveform. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VTC Spring ![In: IEEE 81st Vehicular Technology Conference, VTC Spring 2015, Glasgow, United Kingdom, 11-14 May, 2015, pp. 1-5, 2015, IEEE, 978-1-4799-8088-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
25 | Srimanta Bhattacharya |
Derandomized Construction of Combinatorial Batch Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 20th International Symposium, FCT 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings, pp. 269-282, 2015, Springer, 978-3-319-22176-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, March 4-7, 2015, Garching, Germany, pp. 275-287, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-78-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
25 | Mario Ventresca, Dionne M. Aleman |
A derandomized approximation algorithm for the critical node detection problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 43, pp. 261-270, 2014. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1411.3517, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
25 | Ronen Shaltiel |
Derandomized Parallel Repetition Theorems for Free Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 22(3), pp. 565-594, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
25 | Jérémie Decock, Olivier Teytaud |
Linear Convergence of Evolution Strategies with Derandomized Sampling Beyond Quasi-Convex Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Artificial Evolution ![In: Artificial Evolution - 11th International Conference, Evolution Artificielle, EA 2013, Bordeaux, France, October 21-23, 2013. Revised Selected Papers, pp. 53-64, 2013, Springer, 978-3-319-11682-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
25 | Luca Trevisan, Tongke Xue |
A Derandomized Switching Lemma and an Improved Derandomization of AC0. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013, pp. 242-247, 2013, IEEE Computer Society, 978-0-7695-4997-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
25 | Luca Trevisan |
A Derandomized Switching Lemma and an Improved Derandomization of AC0. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR12, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
25 | Zheng Wang 0013, Cong Ling 0001 |
Derandomized sampling algorithm for lattice decoding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITW ![In: 2012 IEEE Information Theory Workshop, Lausanne, Switzerland, September 3-7, 2012, pp. 222-226, 2012, IEEE, 978-1-4673-0224-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
25 | Irit Dinur, Or Meir |
Derandomized Parallel Repetition via Structured PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 20(2), pp. 207-327, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
25 | Carlos A. J. Martinhon, Fábio Protti |
An improved derandomized approximation algorithm for the max-controlled set problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RAIRO Theor. Informatics Appl. ![In: RAIRO Theor. Informatics Appl. 45(2), pp. 181-196, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
25 | Daniel M. Kane, Jelani Nelson |
A Derandomized Sparse Johnson-Lindenstrauss Transform. ![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 |
|
25 | Irit Dinur, Or Meir |
Derandomized Parallel Repetition via Structured PCPs. ![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 |
|
25 | Daniel M. Kane, Jelani Nelson |
A Derandomized Sparse Johnson-Lindenstrauss Transform ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1006.3585, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
25 | Irit Dinur, Or Meir |
Derandomized Parallel Repetition of Structured PCPs ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1002.1606, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
25 | Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson |
Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 39(4), pp. 1637-1665, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
25 | Ronen Shaltiel |
Derandomized Parallel Repetition Theorems for Free Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 25th Annual IEEE Conference on Computational Complexity, CCC 2010, Cambridge, Massachusetts, USA, June 9-12, 2010, pp. 28-37, 2010, IEEE Computer Society, 978-0-7695-4060-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 55(1), pp. 113-133, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR09, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
25 | Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson |
Uniform Direct-Product Theorems: Simplified, Optimized, and Derandomized. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR08, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
25 | Eyal Kaplan, Moni Naor, Omer Reingold |
Derandomized Constructions of k-Wise (Almost) Independent Permutations ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR06, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP BibTeX RDF |
|
25 | Amnon Ta-Shma, Christopher Umans |
Better lossless condensers through derandomized curve samplers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings, pp. 177-186, 2006, IEEE Computer Society, 0-7695-2720-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Eyal Rozenman, Salil P. Vadhan |
Derandomized Squaring of Graphs ![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 |
|
25 | Eyal Kaplan, Moni Naor, Omer Reingold |
Derandomized Constructions of k-Wise (Almost) Independent Permutations. ![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. 354-365, 2005, Springer, 3-540-28239-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
25 | Carlos A. J. Martinhon, Fábio Protti |
An Improved Derandomized Approximation Algorithm for the Max-Controlled Set Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WEA ![In: Experimental and Efficient Algorithms, Third International Workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004, Proceedings, pp. 341-355, 2004, Springer, 3-540-22067-4. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Evol. Comput. ![In: Evol. Comput. 11(1), pp. 1-18, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
25 | Lars Engebretsen, Piotr Indyk, Ryan O'Donnell |
Derandomized dimensionality reduction with applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA., pp. 705-712, 2002, ACM/SIAM, 0-89871-513-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
25 | Nikolaus Hansen, Andreas Ostermeier |
Completely Derandomized Self-Adaptation in Evolution Strategies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Evol. Comput. ![In: Evol. Comput. 9(2), pp. 159-195, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
25 | Meera Sitharam, Timothy Straney |
Derandomized Learning of Boolean Functions over Finite Abelian Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Found. Comput. Sci. ![In: Int. J. Found. Comput. Sci. 12(4), pp. 491-516, 2001. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Artif. Intell. Eng. Des. Anal. Manuf. ![In: Artif. Intell. Eng. Des. Anal. Manuf. 13(5), pp. 341-349, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP BibTeX RDF |
|
25 | Michael Luby |
Introduction to Special Issue on Randomized and Derandomized Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 16(4/5), pp. 359-366, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
25 | Noga Alon, Uriel Feige, Avi Wigderson, David Zuckerman |
Derandomized Graph Products. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 5(1), pp. 60-75, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
25 | Andreas Ostermeier, Andreas Gawelczyk, Nikolaus Hansen |
A Derandomized Approach to Self Adaptation of Evolution Strategies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Evol. Comput. ![In: Evol. Comput. 2(4), pp. 369-380, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
17 | Venkatesan Guruswami, Atri Rudra |
Better Binary List Decodable Codes Via Multilevel Concatenation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 55(1), pp. 19-26, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
17 | Noga Alon, Daniel Lokshtanov, Saket Saurabh 0001 |
Fast FAST. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I, pp. 49-58, 2009, Springer, 978-3-642-02926-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
17 | Venkatesan Guruswami, Valentine Kabanets |
Hardness Amplification via Space-Efficient Direct Products. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 17(4), pp. 475-500, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 42(4), pp. 596-607, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pp. 1174-1183, 2008, SIAM. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2008, Proceedings, Atlanta, GA, USA, July 12-16, 2008, pp. 479-486, 2008, ACM, 978-1-60558-130-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA, pp. 8-18, 2008, IEEE Computer Society, 978-0-7695-3169-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWINAC (1) ![In: Bio-inspired Modeling of Cognitive Tasks, Second International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2007, La Manga del Mar Menor, Spain, June 18-21, 2007, Proceedings, Part I, pp. 467-477, 2007, Springer, 978-3-540-73052-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
17 | Peng Zhang 0008 |
Approximating Generalized Multicut on Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings, pp. 799-808, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 430-439, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings, pp. 554-568, 2007, Springer, 978-3-540-74207-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
17 | Joachim Kneis, Daniel Mölle, Peter Rossmanith |
Partial vs. Complete Domination: t-Dominating Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM (1) ![In: SOFSEM 2007: Theory and Practice of Computer Science, 33rd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007, Proceedings, pp. 367-376, 2007, Springer, 978-3-540-69506-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
17 | Yuval Emek, David Peleg |
A tight upper bound on the probabilistic embedding of series-parallel graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 1045-1053, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
17 | Benjamin Doerr |
Generating Randomized Roundings with Cardinality Constraints and Derandomizations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings, pp. 571-583, 2006, Springer, 978-3-540-32301-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
17 | Venkatesan Guruswami, Valentine Kabanets |
Hardness Amplification Via Space-Efficient Direct Products. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings, pp. 556-568, 2006, Springer, 3-540-32755-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
error-correcting codes, expanders, Direct products, hardness amplification |
17 | Guy Kortsarz, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian |
Complete partitions of graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 860-869, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
17 | Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Prívetivý, Anand Srivastav |
On the Minimum Load Coloring Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, Third International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Papers, pp. 15-26, 2005, Springer, 3-540-32207-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
17 | Ronen Shaltiel, Christopher Umans |
Pseudorandomness for Approximate Counting and Sampling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11-15 June 2005, San Jose, CA, USA, pp. 212-226, 2005, IEEE Computer Society, 0-7695-2364-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers, pp. 211-224, 2004, Springer, 3-540-24574-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
17 | Nir Andelman, Yishay Mansour |
Auctions with Budget Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings, pp. 26-38, 2004, Springer, 3-540-22339-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
17 | Amir Shpilka, Avi Wigderson |
Derandomizing homomorphism testing in general groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp. 427-435, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
homomorphism testing, derandomization, linearity testing |
17 | Luca Trevisan |
List-Decoding Using The XOR Lemma. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings, pp. 126-135, 2003, IEEE Computer Society, 0-7695-2040-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 612-621, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings, pp. 40-49, 2003, Springer, 3-540-40534-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPSN ![In: Parallel Problem Solving from Nature - PPSN VII, 7th International Conference, Granada, Spain, September 7-11, 2002, Proceedings, pp. 422-431, 2002, Springer, 3-540-44139-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
17 | Boris Naujoks, Lars Willmes, Thomas Bäck, Werner Haase |
Evaluating Multi-criteria Evolutionary Algorithms for Airfoil Optimisation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPSN ![In: Parallel Problem Solving from Nature - PPSN VII, 7th International Conference, Granada, Spain, September 7-11, 2002, Proceedings, pp. 841-850, 2002, Springer, 3-540-44139-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
17 | Benjamin Doerr |
Antirandomizing the Wrong Game. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings, pp. 876-887, 2002, Springer, 3-540-43864-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM ![In: Randomization and Approximation Techniques, 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings, pp. 209-223, 2002, Springer, 3-540-44147-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
17 | Guy Even, Guy Kortsarz, Wolfgang Slany |
On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2002, 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings, pp. 318-327, 2002, Springer, 3-540-43866-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|