Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Andrew Wan
@article{DBLP:journals/toc/SteinkeVW17,
author = {Thomas Steinke and
Salil P. Vadhan and
Andrew Wan},
title = {Pseudorandomness and Fourier-Growth Bounds for Width-3 Branching Programs},
journal = {Theory Comput.},
volume = {13},
number = {1},
pages = {1--50},
year = {2017},
url = {https://doi.org/10.4086/toc.2017.v013a012},
doi = {10.4086/TOC.2017.V013A012},
timestamp = {Sun, 14 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toc/SteinkeVW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cjtcs/DiakonikolasJST16,
author = {Ilias Diakonikolas and
Ragesh Jaiswal and
Rocco A. Servedio and
Li{-}Yang Tan and
Andrew Wan},
title = {Noise Stable Halfspaces are Close to Very Small Juntas},
journal = {Chic. J. Theor. Comput. Sci.},
volume = {2015},
year = {2015},
url = {http://cjtcs.cs.uchicago.edu/articles/2015/4/contents.html},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cjtcs/DiakonikolasJST16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigir/MaiyaVW15,
author = {Arun S. Maiya and
Dale Visser and
Andrew Wan},
editor = {Ricardo Baeza{-}Yates and
Mounia Lalmas and
Alistair Moffat and
Berthier A. Ribeiro{-}Neto},
title = {Mining Measured Information from Text},
booktitle = {Proceedings of the 38th International {ACM} {SIGIR} Conference on
Research and Development in Information Retrieval, Santiago, Chile,
August 9-13, 2015},
pages = {899--902},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2766462.2767789},
doi = {10.1145/2766462.2767789},
timestamp = {Sun, 22 Sep 2019 18:15:38 +0200},
biburl = {https://dblp.org/rec/conf/sigir/MaiyaVW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Dachman-SoledFTWW15,
author = {Dana Dachman{-}Soled and
Vitaly Feldman and
Li{-}Yang Tan and
Andrew Wan and
Karl Wimmer},
editor = {Piotr Indyk},
title = {Approximate resilience, monotonicity, and the complexity of agnostic
learning},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {498--511},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.34},
doi = {10.1137/1.9781611973730.34},
timestamp = {Tue, 02 Feb 2021 17:07:30 +0100},
biburl = {https://dblp.org/rec/conf/soda/Dachman-SoledFTWW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MaiyaVW15,
author = {Arun S. Maiya and
Dale Visser and
Andrew Wan},
title = {Mining Measured Information from Text},
journal = {CoRR},
volume = {abs/1505.01072},
year = {2015},
url = {http://arxiv.org/abs/1505.01072},
eprinttype = {arXiv},
eprint = {1505.01072},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MaiyaVW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BlaisTW15,
author = {Eric Blais and
Li{-}Yang Tan and
Andrew Wan},
title = {An inequality for the Fourier spectrum of parity decision trees},
journal = {CoRR},
volume = {abs/1506.01055},
year = {2015},
url = {http://arxiv.org/abs/1506.01055},
eprinttype = {arXiv},
eprint = {1506.01055},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BlaisTW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/DiakonikolasSTW14,
author = {Ilias Diakonikolas and
Rocco A. Servedio and
Li{-}Yang Tan and
Andrew Wan},
title = {A Regularity Lemma and Low-Weight Approximators for Low-Degree Polynomial
Threshold Functions},
journal = {Theory Comput.},
volume = {10},
pages = {27--53},
year = {2014},
url = {https://doi.org/10.4086/toc.2014.v010a002},
doi = {10.4086/TOC.2014.V010A002},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/DiakonikolasSTW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/SteinkeVW14,
author = {Thomas Steinke and
Salil P. Vadhan and
Andrew Wan},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Nikhil R. Devanur and
Cristopher Moore},
title = {Pseudorandomness and Fourier Growth Bounds for Width-3 Branching Programs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2014, September 4-6, 2014, Barcelona,
Spain},
series = {LIPIcs},
volume = {28},
pages = {885--899},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.885},
doi = {10.4230/LIPICS.APPROX-RANDOM.2014.885},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/SteinkeVW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LivnatPRVW14,
author = {Adi Livnat and
Christos H. Papadimitriou and
Aviad Rubinstein and
Gregory Valiant and
Andrew Wan},
title = {Satisfiability and Evolution},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {524--530},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.62},
doi = {10.1109/FOCS.2014.62},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LivnatPRVW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/WanWW14,
author = {Andrew Wan and
John Wright and
Chenggang Wu},
editor = {Moni Naor},
title = {Decision trees, protocols and the entropy-influence conjecture},
booktitle = {Innovations in Theoretical Computer Science, ITCS'14, Princeton, NJ,
USA, January 12-14, 2014},
pages = {67--80},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2554797.2554806},
doi = {10.1145/2554797.2554806},
timestamp = {Wed, 19 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/WanWW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/ChandrasekaranTUW14,
author = {Karthekeyan Chandrasekaran and
Justin Thaler and
Jonathan R. Ullman and
Andrew Wan},
editor = {Moni Naor},
title = {Faster private release of marginals on small databases},
booktitle = {Innovations in Theoretical Computer Science, ITCS'14, Princeton, NJ,
USA, January 12-14, 2014},
pages = {387--402},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2554797.2554833},
doi = {10.1145/2554797.2554833},
timestamp = {Tue, 27 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/ChandrasekaranTUW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Dachman-SoledFTWW14,
author = {Dana Dachman{-}Soled and
Vitaly Feldman and
Li{-}Yang Tan and
Andrew Wan and
Karl Wimmer},
title = {Approximate resilience, monotonicity, and the complexity of agnostic
learning},
journal = {CoRR},
volume = {abs/1405.5268},
year = {2014},
url = {http://arxiv.org/abs/1405.5268},
eprinttype = {arXiv},
eprint = {1405.5268},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Dachman-SoledFTWW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/SteinkeVW14,
author = {Thomas Steinke and
Salil P. Vadhan and
Andrew Wan},
title = {Pseudorandomness and Fourier Growth Bounds for Width 3 Branching Programs},
journal = {CoRR},
volume = {abs/1405.7028},
year = {2014},
url = {http://arxiv.org/abs/1405.7028},
eprinttype = {arXiv},
eprint = {1405.7028},
timestamp = {Sun, 14 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/SteinkeVW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-3754,
author = {Karthekeyan Chandrasekaran and
Justin Thaler and
Jonathan R. Ullman and
Andrew Wan},
title = {Faster Private Release of Marginals on Small Databases},
journal = {CoRR},
volume = {abs/1304.3754},
year = {2013},
url = {http://arxiv.org/abs/1304.3754},
eprinttype = {arXiv},
eprint = {1304.3754},
timestamp = {Tue, 27 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-3754.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LivnatPRW13,
author = {Adi Livnat and
Christos H. Papadimitriou and
Aviad Rubinstein and
Andrew Wan},
title = {Satisfiability and Evolution},
journal = {CoRR},
volume = {abs/1312.1983},
year = {2013},
url = {http://arxiv.org/abs/1312.1983},
eprinttype = {arXiv},
eprint = {1312.1983},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LivnatPRW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/WanWW13,
author = {Andrew Wan and
John Wright and
Chenggang Wu},
title = {Decision Trees, Protocols, and the Fourier Entropy-Influence Conjecture},
journal = {CoRR},
volume = {abs/1312.3003},
year = {2013},
url = {http://arxiv.org/abs/1312.3003},
eprinttype = {arXiv},
eprint = {1312.3003},
timestamp = {Wed, 19 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/WanWW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BogdanovPW12,
author = {Andrej Bogdanov and
Periklis A. Papakonstantinou and
Andrew Wan},
editor = {Anupam Gupta and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Rocco A. Servedio},
title = {Pseudorandomness for Linear Length Branching Programs and Stack Machines},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques - 15th International Workshop, {APPROX} 2012, and 16th
International Workshop, {RANDOM} 2012, Cambridge, MA, USA, August
15-17, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7408},
pages = {447--458},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32512-0\_38},
doi = {10.1007/978-3-642-32512-0\_38},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/BogdanovPW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-6680,
author = {Ilias Diakonikolas and
Ragesh Jaiswal and
Rocco A. Servedio and
Li{-}Yang Tan and
Andrew Wan},
title = {On the Distribution of the Fourier Spectrum of Halfspaces},
journal = {CoRR},
volume = {abs/1202.6680},
year = {2012},
url = {http://arxiv.org/abs/1202.6680},
eprinttype = {arXiv},
eprint = {1202.6680},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-6680.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DiakonikolasLMSW11,
author = {Ilias Diakonikolas and
Homin K. Lee and
Kevin Matulef and
Rocco A. Servedio and
Andrew Wan},
title = {Efficiently Testing Sparse \emph{GF}(2) Polynomials},
journal = {Algorithmica},
volume = {61},
number = {3},
pages = {580--605},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9426-9},
doi = {10.1007/S00453-010-9426-9},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DiakonikolasLMSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/JacksonLSW11,
author = {Jeffrey C. Jackson and
Homin K. Lee and
Rocco A. Servedio and
Andrew Wan},
title = {Learning random monotone {DNF}},
journal = {Discret. Appl. Math.},
volume = {159},
number = {5},
pages = {259--271},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2010.08.022},
doi = {10.1016/J.DAM.2010.08.022},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/JacksonLSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BogdanovPW11,
author = {Andrej Bogdanov and
Periklis A. Papakonstantinou and
Andrew Wan},
editor = {Rafail Ostrovsky},
title = {Pseudorandomness for Read-Once Formulas},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {240--246},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.57},
doi = {10.1109/FOCS.2011.57},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BogdanovPW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BogdanovPW11,
author = {Andrej Bogdanov and
Periklis A. Papakonstantinou and
Andrew Wan},
title = {Pseudorandomness for read-once formulas},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-117}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/117},
eprinttype = {ECCC},
eprint = {TR11-117},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BogdanovPW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DiakonikolasSTW10,
author = {Ilias Diakonikolas and
Rocco A. Servedio and
Li{-}Yang Tan and
Andrew Wan},
title = {A Regularity Lemma, and Low-Weight Approximators, for Low-Degree Polynomial
Threshold Functions},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {211--222},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.28},
doi = {10.1109/CCC.2010.28},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/DiakonikolasSTW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/KlivansLW10,
author = {Adam R. Klivans and
Homin K. Lee and
Andrew Wan},
editor = {Adam Tauman Kalai and
Mehryar Mohri},
title = {Mansour's Conjecture is True for Random {DNF} Formulas},
booktitle = {{COLT} 2010 - The 23rd Conference on Learning Theory, Haifa, Israel,
June 27-29, 2010},
pages = {368--380},
publisher = {Omnipress},
year = {2010},
url = {http://colt2010.haifa.il.ibm.com/papers/COLT2010proceedings.pdf\#page=376},
timestamp = {Tue, 25 Jan 2022 13:23:33 +0100},
biburl = {https://dblp.org/rec/conf/colt/KlivansLW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icra/BergMDHWFGA10,
author = {Jur van den Berg and
Stephen Miller and
Daniel Duckworth and
Humphrey Hu and
Andrew Wan and
Xiao{-}Yu Fu and
Kenneth Y. Goldberg and
Pieter Abbeel},
title = {Superhuman performance of surgical tasks by robots using iterative
learning from human-guided demonstrations},
booktitle = {{IEEE} International Conference on Robotics and Automation, {ICRA}
2010, Anchorage, Alaska, USA, 3-7 May 2010},
pages = {2074--2081},
publisher = {{IEEE}},
year = {2010},
url = {https://doi.org/10.1109/ROBOT.2010.5509621},
doi = {10.1109/ROBOT.2010.5509621},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icra/BergMDHWFGA10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BogdanovTW10,
author = {Andrej Bogdanov and
Kunal Talwar and
Andrew Wan},
editor = {Andrew Chi{-}Chih Yao},
title = {Hard Instances for Satisfiability and Quasi-one-way Functions},
booktitle = {Innovations in Computer Science - {ICS} 2010, Tsinghua University,
Beijing, China, January 5-7, 2010. Proceedings},
pages = {290--300},
publisher = {Tsinghua University Press},
year = {2010},
url = {http://conference.iiis.tsinghua.edu.cn/ICS2010/content/papers/23.html},
timestamp = {Wed, 04 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/BogdanovTW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KlivansLW10,
author = {Adam R. Klivans and
Homin K. Lee and
Andrew Wan},
title = {Mansour's Conjecture is True for Random {DNF} Formulas},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-023}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/023},
eprinttype = {ECCC},
eprint = {TR10-023},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KlivansLW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/Dachman-SoledLMSWW09,
author = {Dana Dachman{-}Soled and
Homin K. Lee and
Tal Malkin and
Rocco A. Servedio and
Andrew Wan and
Hoeteck Wee},
title = {Optimal Cryptographic Hardness of Learning Monotone Functions},
journal = {Theory Comput.},
volume = {5},
number = {1},
pages = {257--282},
year = {2009},
url = {https://doi.org/10.4086/toc.2009.v005a013},
doi = {10.4086/TOC.2009.V005A013},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/Dachman-SoledLMSWW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0909-4727,
author = {Ilias Diakonikolas and
Rocco A. Servedio and
Li{-}Yang Tan and
Andrew Wan},
title = {A regularity lemma, and low-weight approximators, for low-degree polynomial
threshold functions},
journal = {CoRR},
volume = {abs/0909.4727},
year = {2009},
url = {http://arxiv.org/abs/0909.4727},
eprinttype = {arXiv},
eprint = {0909.4727},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0909-4727.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/JacksonLSW08,
author = {Jeffrey C. Jackson and
Homin K. Lee and
Rocco A. Servedio and
Andrew Wan},
editor = {Ashish Goel and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Ronitt Rubinfeld},
title = {Learning Random Monotone {DNF}},
booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms
and Techniques, 11th International Workshop, {APPROX} 2008, and 12th
International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5171},
pages = {483--497},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85363-3\_38},
doi = {10.1007/978-3-540-85363-3\_38},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/JacksonLSW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Dachman-SoledLMSWW08,
author = {Dana Dachman{-}Soled and
Homin K. Lee and
Tal Malkin and
Rocco A. Servedio and
Andrew Wan and
Hoeteck Wee},
editor = {Luca Aceto and
Ivan Damg{\aa}rd and
Leslie Ann Goldberg and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Igor Walukiewicz},
title = {Optimal Cryptographic Hardness of Learning Monotone Functions},
booktitle = {Automata, Languages and Programming, 35th International Colloquium,
{ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
{I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
series = {Lecture Notes in Computer Science},
volume = {5125},
pages = {36--47},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-70575-8\_4},
doi = {10.1007/978-3-540-70575-8\_4},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/Dachman-SoledLMSWW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DiakonikolasLMSW08,
author = {Ilias Diakonikolas and
Homin K. Lee and
Kevin Matulef and
Rocco A. Servedio and
Andrew Wan},
editor = {Luca Aceto and
Ivan Damg{\aa}rd and
Leslie Ann Goldberg and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Igor Walukiewicz},
title = {Efficiently Testing Sparse {GF(2)} Polynomials},
booktitle = {Automata, Languages and Programming, 35th International Colloquium,
{ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
{I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
series = {Lecture Notes in Computer Science},
volume = {5125},
pages = {502--514},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-70575-8\_41},
doi = {10.1007/978-3-540-70575-8\_41},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DiakonikolasLMSW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0805-1765,
author = {Ilias Diakonikolas and
Homin K. Lee and
Kevin Matulef and
Rocco A. Servedio and
Andrew Wan},
title = {Efficiently Testing Sparse {GF(2)} Polynomials},
journal = {CoRR},
volume = {abs/0805.1765},
year = {2008},
url = {http://arxiv.org/abs/0805.1765},
eprinttype = {arXiv},
eprint = {0805.1765},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0805-1765.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jmlr/ElbazLSW07,
author = {Ariel Elbaz and
Homin K. Lee and
Rocco A. Servedio and
Andrew Wan},
title = {Separating Models of Learning from Correlated and Uncorrelated Data},
journal = {J. Mach. Learn. Res.},
volume = {8},
pages = {277--290},
year = {2007},
url = {http://jmlr.org/papers/v8/elbaz07a.html},
timestamp = {Wed, 10 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jmlr/ElbazLSW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ml/LeeSW07,
author = {Homin K. Lee and
Rocco A. Servedio and
Andrew Wan},
title = {{DNF} are teachable in the average case},
journal = {Mach. Learn.},
volume = {69},
number = {2-3},
pages = {79--96},
year = {2007},
url = {https://doi.org/10.1007/s10994-007-5007-9},
doi = {10.1007/S10994-007-5007-9},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ml/LeeSW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DiakonikolasLMORSW07,
author = {Ilias Diakonikolas and
Homin K. Lee and
Kevin Matulef and
Krzysztof Onak and
Ronitt Rubinfeld and
Rocco A. Servedio and
Andrew Wan},
title = {Testing for Concise Representations},
booktitle = {48th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2007), October 20-23, 2007, Providence, RI, USA, Proceedings},
pages = {549--558},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/FOCS.2007.32},
doi = {10.1109/FOCS.2007.32},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DiakonikolasLMORSW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DiakonikolasLMORSW07,
author = {Ilias Diakonikolas and
Homin K. Lee and
Kevin Matulef and
Krzysztof Onak and
Ronitt Rubinfeld and
Rocco A. Servedio and
Andrew Wan},
title = {Testing for Concise Representations},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR07-077}},
year = {2007},
url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-077/index.html},
eprinttype = {ECCC},
eprint = {TR07-077},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DiakonikolasLMORSW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/JacksonLSW07,
author = {Jeffrey C. Jackson and
Homin K. Lee and
Rocco A. Servedio and
Andrew Wan},
title = {Learning Random Monotone {DNF}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR07-129}},
year = {2007},
url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-129/index.html},
eprinttype = {ECCC},
eprint = {TR07-129},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/JacksonLSW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcbi/ChenWL06,
author = {Yixin Chen and
Andrew Wan and
Wei Liu},
title = {A fast parallel algorithm for finding the longest common sequence
of multiple biosequences},
journal = {{BMC} Bioinform.},
volume = {7},
number = {{S-4}},
year = {2006},
url = {https://doi.org/10.1186/1471-2105-7-S4-S4},
doi = {10.1186/1471-2105-7-S4-S4},
timestamp = {Wed, 11 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bmcbi/ChenWL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/LeeSW06,
author = {Homin K. Lee and
Rocco A. Servedio and
Andrew Wan},
editor = {G{\'{a}}bor Lugosi and
Hans Ulrich Simon},
title = {{DNF} Are Teachable in the Average Case},
booktitle = {Learning Theory, 19th Annual Conference on Learning Theory, {COLT}
2006, Pittsburgh, PA, USA, June 22-25, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4005},
pages = {214--228},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11776420\_18},
doi = {10.1007/11776420\_18},
timestamp = {Fri, 08 Sep 2023 21:18:17 +0200},
biburl = {https://dblp.org/rec/conf/colt/LeeSW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icn/WanRJ06,
author = {Andrew Wan and
Abdel Rigumye and
Phillip Jones},
title = {Profile Based Routing and Billing Multimedia Content Delivery Network},
booktitle = {Fifth International Conference on Networking and the International
Conference on Systems {(ICN} / {ICONS} / {MCL} 2006), 23-29 April
2006, Mauritius},
pages = {172},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/ICNICONSMCL.2006.176},
doi = {10.1109/ICNICONSMCL.2006.176},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icn/WanRJ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictai/WahCW06,
author = {Benjamin W. Wah and
Yixin Chen and
Andrew Wan},
title = {Constrained Global Optimization by Constraint Partitioning and Simulated
Annealing},
booktitle = {18th {IEEE} International Conference on Tools with Artificial Intelligence
{(ICTAI} 2006), 13-15 November 2006, Arlington, VA, {USA}},
pages = {265--274},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/ICTAI.2006.47},
doi = {10.1109/ICTAI.2006.47},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ictai/WahCW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ServedioW05,
author = {Rocco A. Servedio and
Andrew Wan},
title = {Computing sparse permanents faster},
journal = {Inf. Process. Lett.},
volume = {96},
number = {3},
pages = {89--92},
year = {2005},
url = {https://doi.org/10.1016/j.ipl.2005.06.007},
doi = {10.1016/J.IPL.2005.06.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ServedioW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/ElbazLSW05,
author = {Ariel Elbaz and
Homin K. Lee and
Rocco A. Servedio and
Andrew Wan},
editor = {Peter Auer and
Ron Meir},
title = {Separating Models of Learning from Correlated and Uncorrelated Data},
booktitle = {Learning Theory, 18th Annual Conference on Learning Theory, {COLT}
2005, Bertinoro, Italy, June 27-30, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3559},
pages = {637--651},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11503415\_43},
doi = {10.1007/11503415\_43},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/colt/ElbazLSW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2023-09-27 22:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
