default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Eric Blais
@inproceedings{DBLP:conf/innovations/BlackBH24,
author = {Hadley Black and
Eric Blais and
Nathaniel Harms},
editor = {Venkatesan Guruswami},
title = {Testing and Learning Convex Sets in the Ternary Hypercube},
booktitle = {15th Innovations in Theoretical Computer Science Conference, {ITCS}
2024, January 30 to February 2, 2024, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {287},
pages = {15:1--15:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2024.15},
doi = {10.4230/LIPICS.ITCS.2024.15},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/BlackBH24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BlaisS24,
author = {Eric Blais and
Cameron Seth},
editor = {Bojan Mohar and
Igor Shinkar and
Ryan O'Donnell},
title = {New Graph and Hypergraph Container Lemmas with Applications in Property
Testing},
booktitle = {Proceedings of the 56th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2024, Vancouver, BC, Canada, June 24-28, 2024},
pages = {1793--1804},
publisher = {{ACM}},
year = {2024},
url = {https://doi.org/10.1145/3618260.3649708},
doi = {10.1145/3618260.3649708},
timestamp = {Tue, 18 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BlaisS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-18777,
author = {Eric Blais and
Cameron Seth},
title = {New Graph and Hypergraph Container Lemmas with Applications in Property
Testing},
journal = {CoRR},
volume = {abs/2403.18777},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.18777},
doi = {10.48550/ARXIV.2403.18777},
eprinttype = {arXiv},
eprint = {2403.18777},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-18777.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BenDavidB23,
author = {Shalev Ben{-}David and
Eric Blais},
title = {A New Minimax Theorem for Randomized Algorithms},
journal = {J. {ACM}},
volume = {70},
number = {6},
pages = {38:1--38:58},
year = {2023},
url = {https://doi.org/10.1145/3626514},
doi = {10.1145/3626514},
timestamp = {Fri, 26 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BenDavidB23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BlaisS23,
author = {Eric Blais and
Cameron Seth},
title = {Testing Graph Properties with the Container Method},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1787--1795},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00109},
doi = {10.1109/FOCS57990.2023.00109},
timestamp = {Tue, 02 Jan 2024 14:56:14 +0100},
biburl = {https://dblp.org/rec/conf/focs/BlaisS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-03194,
author = {Hadley Black and
Eric Blais and
Nathaniel Harms},
title = {Testing Convexity of Discrete Sets in High Dimensions},
journal = {CoRR},
volume = {abs/2305.03194},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.03194},
doi = {10.48550/ARXIV.2305.03194},
eprinttype = {arXiv},
eprint = {2305.03194},
timestamp = {Wed, 10 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-03194.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-03289,
author = {Eric Blais and
Cameron Seth},
title = {Testing Graph Properties with the Container Method},
journal = {CoRR},
volume = {abs/2308.03289},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.03289},
doi = {10.48550/ARXIV.2308.03289},
eprinttype = {arXiv},
eprint = {2308.03289},
timestamp = {Mon, 21 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-03289.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Ben-DavidBGM22,
author = {Shalev Ben{-}David and
Eric Blais and
Mika G{\"{o}}{\"{o}}s and
Gilbert Maystre},
title = {Randomised Composition and Small-Bias Minimax},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {624--635},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00065},
doi = {10.1109/FOCS54457.2022.00065},
timestamp = {Sat, 31 Dec 2022 17:14:50 +0100},
biburl = {https://dblp.org/rec/conf/focs/Ben-DavidBGM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-12896,
author = {Shalev Ben{-}David and
Eric Blais and
Mika G{\"{o}}{\"{o}}s and
Gilbert Maystre},
title = {Randomised Composition and Small-Bias Minimax},
journal = {CoRR},
volume = {abs/2208.12896},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.12896},
doi = {10.48550/ARXIV.2208.12896},
eprinttype = {arXiv},
eprint = {2208.12896},
timestamp = {Thu, 01 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-12896.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Ben-DavidBGM22,
author = {Shalev Ben{-}David and
Eric Blais and
Mika G{\"{o}}{\"{o}}s and
Gilbert Maystre},
title = {Randomised Composition and Small-Bias Minimax},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-112}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/112},
eprinttype = {ECCC},
eprint = {TR22-112},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Ben-DavidBGM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BelovsB21,
author = {Aleksandrs Belovs and
Eric Blais},
title = {A Polynomial Lower Bound for Testing Monotonicity},
journal = {{SIAM} J. Comput.},
volume = {50},
number = {3},
year = {2021},
url = {https://doi.org/10.1137/16M1097006},
doi = {10.1137/16M1097006},
timestamp = {Wed, 14 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BelovsB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdt/AlwayBS21,
author = {Kaleb Alway and
Eric Blais and
Semih Salihoglu},
editor = {Ke Yi and
Zhewei Wei},
title = {Box Covers and Domain Orderings for Beyond Worst-Case Join Processing},
booktitle = {24th International Conference on Database Theory, {ICDT} 2021, March
23-26, 2021, Nicosia, Cyprus},
series = {LIPIcs},
volume = {186},
pages = {3:1--3:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ICDT.2021.3},
doi = {10.4230/LIPICS.ICDT.2021.3},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/icdt/AlwayBS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BlaisPH21,
author = {Eric Blais and
Renato Ferreira Pinto Jr. and
Nathaniel Harms},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {{VC} dimension and distribution-free sample-based testing},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {504--517},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451104},
doi = {10.1145/3406325.3451104},
timestamp = {Tue, 22 Jun 2021 19:47:11 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BlaisPH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BlaisB20,
author = {Eric Blais and
Abhinav Bommireddi},
editor = {Jaroslaw Byrka and
Raghu Meka},
title = {On Testing and Robust Characterizations of Convexity},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2020, August 17-19, 2020, Virtual
Conference},
series = {LIPIcs},
volume = {176},
pages = {18:1--18:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.18},
doi = {10.4230/LIPICS.APPROX/RANDOM.2020.18},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/BlaisB20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Ben-DavidB20,
author = {Shalev Ben{-}David and
Eric Blais},
editor = {Sandy Irani},
title = {A Tight Composition Theorem for the Randomized Query Complexity of
Partial Functions: Extended Abstract},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {240--246},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00031},
doi = {10.1109/FOCS46700.2020.00031},
timestamp = {Wed, 15 Dec 2021 10:49:16 +0100},
biburl = {https://dblp.org/rec/conf/focs/Ben-DavidB20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Ben-DavidB20a,
author = {Shalev Ben{-}David and
Eric Blais},
editor = {Sandy Irani},
title = {A New Minimax Theorem for Randomized Algorithms (Extended Abstract)},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {403--411},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00045},
doi = {10.1109/FOCS46700.2020.00045},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Ben-DavidB20a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BelovsBB20,
author = {Aleksandrs Belovs and
Eric Blais and
Abhinav Bommireddi},
editor = {Shuchi Chawla},
title = {Testing convexity of functions over finite domains},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
pages = {2030--2045},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611975994.125},
doi = {10.1137/1.9781611975994.125},
timestamp = {Thu, 15 Jul 2021 13:48:53 +0200},
biburl = {https://dblp.org/rec/conf/soda/BelovsBB20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-10802,
author = {Shalev Ben{-}David and
Eric Blais},
title = {A New Minimax Theorem for Randomized Algorithms},
journal = {CoRR},
volume = {abs/2002.10802},
year = {2020},
url = {https://arxiv.org/abs/2002.10802},
eprinttype = {arXiv},
eprint = {2002.10802},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-10802.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-10809,
author = {Shalev Ben{-}David and
Eric Blais},
title = {A Tight Composition Theorem for the Randomized Query Complexity of
Partial Functions},
journal = {CoRR},
volume = {abs/2002.10809},
year = {2020},
url = {https://arxiv.org/abs/2002.10809},
eprinttype = {arXiv},
eprint = {2002.10809},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-10809.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-03923,
author = {Eric Blais and
Renato Ferreira Pinto Jr. and
Nathaniel Harms},
title = {{VC} Dimension and Distribution-Free Sample-Based Testing},
journal = {CoRR},
volume = {abs/2012.03923},
year = {2020},
url = {https://arxiv.org/abs/2012.03923},
eprinttype = {arXiv},
eprint = {2012.03923},
timestamp = {Wed, 09 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-03923.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BlaisY19,
author = {Eric Blais and
Yuichi Yoshida},
title = {A characterization of constant-sample testable properties},
journal = {Random Struct. Algorithms},
volume = {55},
number = {1},
pages = {73--88},
year = {2019},
url = {https://doi.org/10.1002/rsa.20807},
doi = {10.1002/RSA.20807},
timestamp = {Wed, 03 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BlaisY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/BlaisCG19,
author = {Eric Blais and
Cl{\'{e}}ment L. Canonne and
Tom Gur},
title = {Distribution Testing Lower Bounds via Reductions from Communication
Complexity},
journal = {{ACM} Trans. Comput. Theory},
volume = {11},
number = {2},
pages = {6:1--6:37},
year = {2019},
url = {https://doi.org/10.1145/3305270},
doi = {10.1145/3305270},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/BlaisCG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/BlaisCELR19,
author = {Eric Blais and
Cl{\'{e}}ment L. Canonne and
Talya Eden and
Amit Levi and
Dana Ron},
title = {Tolerant Junta Testing and the Connection to Submodular Optimization
and Function Isomorphism},
journal = {{ACM} Trans. Comput. Theory},
volume = {11},
number = {4},
pages = {24:1--24:33},
year = {2019},
url = {https://doi.org/10.1145/3337789},
doi = {10.1145/3337789},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/BlaisCELR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BlaisB19,
author = {Eric Blais and
Joshua Brody},
editor = {Amir Shpilka},
title = {Optimal Separation and Strong Direct Sum for Randomized Query Complexity},
booktitle = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
2019, New Brunswick, NJ, {USA}},
series = {LIPIcs},
volume = {137},
pages = {29:1--29:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.CCC.2019.29},
doi = {10.4230/LIPICS.CCC.2019.29},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/BlaisB19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-01020,
author = {Eric Blais and
Joshua Brody},
title = {Optimal Separation and Strong Direct Sum for Randomized Query Complexity},
journal = {CoRR},
volume = {abs/1908.01020},
year = {2019},
url = {http://arxiv.org/abs/1908.01020},
eprinttype = {arXiv},
eprint = {1908.01020},
timestamp = {Fri, 09 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-01020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-02525,
author = {Aleksandrs Belovs and
Eric Blais and
Abhinav Bommireddi},
title = {Testing convexity of functions over finite domains},
journal = {CoRR},
volume = {abs/1908.02525},
year = {2019},
url = {http://arxiv.org/abs/1908.02525},
eprinttype = {arXiv},
eprint = {1908.02525},
timestamp = {Fri, 09 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-02525.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-12102,
author = {Kaleb Alway and
Eric Blais and
Semih Salihoglu},
title = {Box Covers and Domain Orderings for Beyond Worst-Case Join Processing},
journal = {CoRR},
volume = {abs/1909.12102},
year = {2019},
url = {http://arxiv.org/abs/1909.12102},
eprinttype = {arXiv},
eprint = {1909.12102},
timestamp = {Fri, 27 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-12102.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BlaisCELR18,
author = {Eric Blais and
Cl{\'{e}}ment L. Canonne and
Talya Eden and
Amit Levi and
Dana Ron},
editor = {Artur Czumaj},
title = {Tolerant Junta Testing and the Connection to Submodular Optimization
and Function Isomorphism},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {2113--2132},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.138},
doi = {10.1137/1.9781611975031.138},
timestamp = {Tue, 02 Feb 2021 17:07:58 +0100},
biburl = {https://dblp.org/rec/conf/soda/BlaisCELR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2018,
editor = {Eric Blais and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Steurer},
title = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2018, August 20-22, 2018 - Princeton,
NJ, {USA}},
series = {LIPIcs},
volume = {116},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {http://www.dagstuhl.de/dagpub/978-3-95977-085-9},
isbn = {978-3-95977-085-9},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/2018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pvldb/RahmanAKBKPR17,
author = {Sajjadur Rahman and
Maryam Aliakbarpour and
Hidy Kong and
Eric Blais and
Karrie Karahalios and
Aditya G. Parameswaran and
Ronitt Rubinfeld},
title = {I've Seen "Enough": Incrementally Improving Visualizations
to Support Rapid Decision Making},
journal = {Proc. {VLDB} Endow.},
volume = {10},
number = {11},
pages = {1262--1273},
year = {2017},
url = {http://www.vldb.org/pvldb/vol10/p1262-rahman.pdf},
doi = {10.14778/3137628.3137637},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pvldb/RahmanAKBKPR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ai/GuoBCB17,
author = {Jianmei Guo and
Eric Blais and
Krzysztof Czarnecki and
Peter van Beek},
editor = {Malek Mouhoub and
Philippe Langlais},
title = {A Worst-Case Analysis of Constraint-Based Algorithms for Exact Multi-objective
Combinatorial Optimization},
booktitle = {Advances in Artificial Intelligence - 30th Canadian Conference on
Artificial Intelligence, Canadian {AI} 2017, Edmonton, AB, Canada,
May 16-19, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10233},
pages = {117--128},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57351-9\_16},
doi = {10.1007/978-3-319-57351-9\_16},
timestamp = {Thu, 28 Sep 2023 12:27:16 +0200},
biburl = {https://dblp.org/rec/conf/ai/GuoBCB17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BlaisCG17,
author = {Eric Blais and
Cl{\'{e}}ment L. Canonne and
Tom Gur},
editor = {Ryan O'Donnell},
title = {Distribution Testing Lower Bounds via Reductions from Communication
Complexity},
booktitle = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
Riga, Latvia},
series = {LIPIcs},
volume = {79},
pages = {28:1--28:40},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.CCC.2017.28},
doi = {10.4230/LIPICS.CCC.2017.28},
timestamp = {Thu, 02 Feb 2023 13:27:05 +0100},
biburl = {https://dblp.org/rec/conf/coco/BlaisCG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BlaisB17,
author = {Eric Blais and
Abhinav Bommireddi},
editor = {Christos H. Papadimitriou},
title = {Testing Submodularity and Other Properties of Valuation Functions},
booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS}
2017, January 9-11, 2017, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {67},
pages = {33:1--33:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.33},
doi = {10.4230/LIPICS.ITCS.2017.33},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BlaisB17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/AliakbarpourBR16,
author = {Maryam Aliakbarpour and
Eric Blais and
Ronitt Rubinfeld},
editor = {Vitaly Feldman and
Alexander Rakhlin and
Ohad Shamir},
title = {Learning and Testing Junta Distributions},
booktitle = {Proceedings of the 29th Conference on Learning Theory, {COLT} 2016,
New York, USA, June 23-26, 2016},
series = {{JMLR} Workshop and Conference Proceedings},
volume = {49},
pages = {19--46},
publisher = {JMLR.org},
year = {2016},
url = {http://proceedings.mlr.press/v49/aliakbarpour16.html},
timestamp = {Wed, 29 May 2019 08:41:47 +0200},
biburl = {https://dblp.org/rec/conf/colt/AliakbarpourBR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/splc/ZhangGBCY16,
author = {Yi Zhang and
Jianmei Guo and
Eric Blais and
Krzysztof Czarnecki and
Huiqun Yu},
editor = {Hong Mei},
title = {A mathematical model of performance-relevant feature interactions},
booktitle = {Proceedings of the 20th International Systems and Software Product
Line Conference, {SPLC} 2016, Beijing, China, September 16-23, 2016},
pages = {25--34},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2934466.2934469},
doi = {10.1145/2934466.2934469},
timestamp = {Tue, 09 May 2023 08:00:06 +0200},
biburl = {https://dblp.org/rec/conf/splc/ZhangGBCY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BelovsB16,
author = {Aleksandrs Belovs and
Eric Blais},
editor = {Daniel Wichs and
Yishay Mansour},
title = {A polynomial lower bound for testing monotonicity},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {1021--1032},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897567},
doi = {10.1145/2897518.2897567},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BelovsB16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/crc/p/RubinfeldB16,
author = {Ronitt Rubinfeld and
Eric Blais},
editor = {Peter B{\"{u}}hlmann and
Petros Drineas and
Michael J. Kane and
Mark J. van der Laan},
title = {Something for (Almost) Nothing: New Advances in Sublinear-Time Algorithms},
booktitle = {Handbook of Big Data},
pages = {155--167},
publisher = {Chapman and Hall/CRC},
year = {2016},
url = {http://www.crcnetbase.com/doi/abs/10.1201/b19567-14},
doi = {10.1201/B19567-14},
timestamp = {Tue, 03 Mar 2020 13:17:02 +0100},
biburl = {https://dblp.org/rec/books/crc/p/RubinfeldB16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Blais16,
author = {Eric Blais},
title = {Testing Juntas and Related Properties of Boolean Functions},
booktitle = {Encyclopedia of Algorithms},
pages = {2222--2226},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_709},
doi = {10.1007/978-1-4939-2864-4\_709},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Blais16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BlaisCELR16,
author = {Eric Blais and
Cl{\'{e}}ment L. Canonne and
Talya Eden and
Amit Levi and
Dana Ron},
title = {Tolerant Junta Testing and the Connection to Submodular Optimization
and Function Isomorphism},
journal = {CoRR},
volume = {abs/1607.03938},
year = {2016},
url = {http://arxiv.org/abs/1607.03938},
eprinttype = {arXiv},
eprint = {1607.03938},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BlaisCELR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BlaisB16,
author = {Eric Blais and
Abhinav Bommireddi},
title = {Testing submodularity and other properties of valuation functions},
journal = {CoRR},
volume = {abs/1611.07879},
year = {2016},
url = {http://arxiv.org/abs/1611.07879},
eprinttype = {arXiv},
eprint = {1611.07879},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BlaisB16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BlaisY16,
author = {Eric Blais and
Yuichi Yoshida},
title = {A Characterization of Constant-Sample Testable Properties},
journal = {CoRR},
volume = {abs/1612.06016},
year = {2016},
url = {http://arxiv.org/abs/1612.06016},
eprinttype = {arXiv},
eprint = {1612.06016},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BlaisY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BlaisCELR16,
author = {Eric Blais and
Cl{\'{e}}ment L. Canonne and
Talya Eden and
Amit Levi and
Dana Ron},
title = {Tolerant Junta Testing and the Connection to Submodular Optimization
and Function Isomorphism},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-105}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/105},
eprinttype = {ECCC},
eprint = {TR16-105},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BlaisCELR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BlaisCG16,
author = {Eric Blais and
Cl{\'{e}}ment Louis Canonne and
Tom Gur},
title = {Alice and Bob Show Distribution Testing Lower Bounds (They don't talk
to each other anymore.)},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-168}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/168},
eprinttype = {ECCC},
eprint = {TR16-168},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BlaisCG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BlaisY16,
author = {Eric Blais and
Yuichi Yoshida},
title = {A Characterization of Constant-Sample Testable Properties},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-201}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/201},
eprinttype = {ECCC},
eprint = {TR16-201},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BlaisY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pvldb/KimBPIMR15,
author = {Albert Kim and
Eric Blais and
Aditya G. Parameswaran and
Piotr Indyk and
Samuel Madden and
Ronitt Rubinfeld},
title = {Rapid Sampling for Visualizations with Ordering Guarantees},
journal = {Proc. {VLDB} Endow.},
volume = {8},
number = {5},
pages = {521--532},
year = {2015},
url = {http://www.vldb.org/pvldb/vol8/p521-kim.pdf},
doi = {10.14778/2735479.2735485},
timestamp = {Tue, 08 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pvldb/KimBPIMR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BlaisWY15,
author = {Eric Blais and
Amit Weinstein and
Yuichi Yoshida},
title = {Partially Symmetric Functions Are Efficiently Isomorphism Testable},
journal = {{SIAM} J. Comput.},
volume = {44},
number = {2},
pages = {411--432},
year = {2015},
url = {https://doi.org/10.1137/140971877},
doi = {10.1137/140971877},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BlaisWY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BlaisT15,
author = {Eric Blais and
Li{-}Yang Tan},
title = {Approximating Boolean Functions with Depth-2 Circuits},
journal = {{SIAM} J. Comput.},
volume = {44},
number = {6},
pages = {1583--1600},
year = {2015},
url = {https://doi.org/10.1137/14097402X},
doi = {10.1137/14097402X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BlaisT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/BelovsB15,
author = {Aleksandrs Belovs and
Eric Blais},
title = {Quantum Algorithm for Monotonicity Testing on the Hypercube},
journal = {Theory Comput.},
volume = {11},
pages = {403--412},
year = {2015},
url = {https://doi.org/10.4086/toc.2015.v011a016},
doi = {10.4086/TOC.2015.V011A016},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/BelovsB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BlaisCOST15,
author = {Eric Blais and
Cl{\'{e}}ment L. Canonne and
Igor C. Oliveira and
Rocco A. Servedio and
Li{-}Yang Tan},
editor = {Naveen Garg and
Klaus Jansen and
Anup Rao and
Jos{\'{e}} D. P. Rolim},
title = {Learning Circuits with few Negations},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2015, August 24-26, 2015, Princeton,
NJ, {USA}},
series = {LIPIcs},
volume = {40},
pages = {512--527},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.512},
doi = {10.4230/LIPICS.APPROX-RANDOM.2015.512},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/BlaisCOST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kbse/ZhangGBC15,
author = {Yi Zhang and
Jianmei Guo and
Eric Blais and
Krzysztof Czarnecki},
editor = {Myra B. Cohen and
Lars Grunske and
Michael Whalen},
title = {Performance Prediction of Configurable Software Systems by Fourier
Learning {(T)}},
booktitle = {30th {IEEE/ACM} International Conference on Automated Software Engineering,
{ASE} 2015, Lincoln, NE, USA, November 9-13, 2015},
pages = {365--373},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/ASE.2015.15},
doi = {10.1109/ASE.2015.15},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/kbse/ZhangGBC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BelovsB15,
author = {Aleksandrs Belovs and
Eric Blais},
title = {Quantum Algorithm for Monotonicity Testing on the Hypercube},
journal = {CoRR},
volume = {abs/1503.02868},
year = {2015},
url = {http://arxiv.org/abs/1503.02868},
eprinttype = {arXiv},
eprint = {1503.02868},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BelovsB15.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/corr/BelovsB15a,
author = {Aleksandrs Belovs and
Eric Blais},
title = {A Polynomial Lower Bound for Testing Monotonicity},
journal = {CoRR},
volume = {abs/1511.05053},
year = {2015},
url = {http://arxiv.org/abs/1511.05053},
eprinttype = {arXiv},
eprint = {1511.05053},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BelovsB15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BlaisWY14,
author = {Eric Blais and
Amit Weinstein and
Yuichi Yoshida},
title = {Semi-Strong Colouring of Intersecting Hypergraphs},
journal = {Comb. Probab. Comput.},
volume = {23},
number = {1},
pages = {1--7},
year = {2014},
url = {https://doi.org/10.1017/S0963548313000515},
doi = {10.1017/S0963548313000515},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/BlaisWY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BlaisBG14,
author = {Eric Blais and
Joshua Brody and
Badih Ghazi},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Nikhil R. Devanur and
Cristopher Moore},
title = {The Information Complexity of Hamming Distance},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2014, September 4-6, 2014, Barcelona,
Spain},
series = {LIPIcs},
volume = {28},
pages = {465--489},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.465},
doi = {10.4230/LIPICS.APPROX-RANDOM.2014.465},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/BlaisBG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BlaisRY14,
author = {Eric Blais and
Sofya Raskhodnikova and
Grigory Yaroslavtsev},
title = {Lower Bounds for Testing Properties of Functions over Hypergrid Domains},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {309--320},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.38},
doi = {10.1109/CCC.2014.38},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BlaisRY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BlaisHST14,
author = {Eric Blais and
Johan H{\aa}stad and
Rocco A. Servedio and
Li{-}Yang Tan},
editor = {Javier Esparza and
Pierre Fraigniaud and
Thore Husfeldt and
Elias Koutsoupias},
title = {On {DNF} Approximators for Monotone Boolean Functions},
booktitle = {Automata, Languages, and Programming - 41st International Colloquium,
{ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {8572},
pages = {235--246},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-43948-7\_20},
doi = {10.1007/978-3-662-43948-7\_20},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BlaisHST14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BlaisCOST14,
author = {Eric Blais and
Cl{\'{e}}ment L. Canonne and
Igor C. Oliveira and
Rocco A. Servedio and
Li{-}Yang Tan},
title = {Learning circuits with few negations},
journal = {CoRR},
volume = {abs/1410.8420},
year = {2014},
url = {http://arxiv.org/abs/1410.8420},
eprinttype = {arXiv},
eprint = {1410.8420},
timestamp = {Tue, 30 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BlaisCOST14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KimBPIMR14,
author = {Albert Kim and
Eric Blais and
Aditya G. Parameswaran and
Piotr Indyk and
Sam Madden and
Ronitt Rubinfeld},
title = {Rapid Sampling for Visualizations with Ordering Guarantees},
journal = {CoRR},
volume = {abs/1412.3040},
year = {2014},
url = {http://arxiv.org/abs/1412.3040},
eprinttype = {arXiv},
eprint = {1412.3040},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KimBPIMR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BlaisCOST14,
author = {Eric Blais and
Cl{\'{e}}ment L. Canonne and
Igor Carboni Oliveira and
Rocco A. Servedio and
Li{-}Yang Tan},
title = {Learning circuits with few negations},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-144}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/144},
eprinttype = {ECCC},
eprint = {TR14-144},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BlaisCOST14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AlonBCGM13,
author = {Noga Alon and
Eric Blais and
Sourav Chakraborty and
David Garc{\'{\i}}a{-}Soriano and
Arie Matsliah},
title = {Nearly Tight Bounds for Testing Function Isomorphism},
journal = {{SIAM} J. Comput.},
volume = {42},
number = {2},
pages = {459--493},
year = {2013},
url = {https://doi.org/10.1137/110832677},
doi = {10.1137/110832677},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AlonBCGM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/BlaisT13,
author = {Eric Blais and
Li{-}Yang Tan},
title = {Hypercontractivity Via the Entropy Method},
journal = {Theory Comput.},
volume = {9},
pages = {889--896},
year = {2013},
url = {https://doi.org/10.4086/toc.2013.v009a029},
doi = {10.4086/TOC.2013.V009A029},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/BlaisT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BlaisT13,
author = {Eric Blais and
Li{-}Yang Tan},
title = {Approximating Boolean Functions with Depth-2 Circuits},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {74--85},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.17},
doi = {10.1109/CCC.2013.17},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BlaisT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BlaisRY13,
author = {Eric Blais and
Sofya Raskhodnikova and
Grigory Yaroslavtsev},
title = {Lower Bounds for Testing Properties of Functions on Hypergrid Domains},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-036}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/036},
eprinttype = {ECCC},
eprint = {TR13-036},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BlaisRY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BlaisT13,
author = {Eric Blais and
Li{-}Yang Tan},
title = {Approximating Boolean functions with depth-2 circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-051}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/051},
eprinttype = {ECCC},
eprint = {TR13-051},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BlaisT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BlaisBM12,
author = {Eric Blais and
Joshua Brody and
Kevin Matulef},
title = {Property Testing Lower Bounds via Communication Complexity},
journal = {Comput. Complex.},
volume = {21},
number = {2},
pages = {311--358},
year = {2012},
url = {https://doi.org/10.1007/s00037-012-0040-x},
doi = {10.1007/S00037-012-0040-X},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BlaisBM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BlaisK12,
author = {Eric Blais and
Daniel M. Kane},
editor = {Anupam Gupta and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Rocco A. Servedio},
title = {Tight Bounds for Testing k-Linearity},
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 = {435--446},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32512-0\_37},
doi = {10.1007/978-3-642-32512-0\_37},
timestamp = {Sun, 04 Aug 2024 19:37:16 +0200},
biburl = {https://dblp.org/rec/conf/approx/BlaisK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BalcanBBY12,
author = {Maria{-}Florina Balcan and
Eric Blais and
Avrim Blum and
Liu Yang},
title = {Active Property Testing},
booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2012, New Brunswick, NJ, USA, October 20-23, 2012},
pages = {21--30},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/FOCS.2012.64},
doi = {10.1109/FOCS.2012.64},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BalcanBBY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BlaisWY12,
author = {Eric Blais and
Amit Weinstein and
Yuichi Yoshida},
title = {Partially Symmetric Functions Are Efficiently Isomorphism-Testable},
booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2012, New Brunswick, NJ, USA, October 20-23, 2012},
pages = {551--560},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/FOCS.2012.53},
doi = {10.1109/FOCS.2012.53},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BlaisWY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BlaisBM11,
author = {Eric Blais and
Joshua Brody and
Kevin Matulef},
title = {Property Testing Lower Bounds via Communication Complexity},
booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
pages = {210--220},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCC.2011.31},
doi = {10.1109/CCC.2011.31},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BlaisBM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1111-0897,
author = {Maria{-}Florina Balcan and
Eric Blais and
Avrim Blum and
Liu Yang},
title = {Active Testing},
journal = {CoRR},
volume = {abs/1111.0897},
year = {2011},
url = {http://arxiv.org/abs/1111.0897},
eprinttype = {arXiv},
eprint = {1111.0897},
timestamp = {Sat, 01 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1111-0897.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-5741,
author = {Eric Blais and
Amit Weinstein and
Yuichi Yoshida},
title = {Partially Symmetric Functions are Efficiently Isomorphism-Testable},
journal = {CoRR},
volume = {abs/1112.5741},
year = {2011},
url = {http://arxiv.org/abs/1112.5741},
eprinttype = {arXiv},
eprint = {1112.5741},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1112-5741.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BlaisBM11,
author = {Eric Blais and
Joshua Brody and
Kevin Matulef},
title = {Property Testing Lower Bounds via Communication Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-045}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/045},
eprinttype = {ECCC},
eprint = {TR11-045},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BlaisBM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ml/BlaisOW10,
author = {Eric Blais and
Ryan O'Donnell and
Karl Wimmer},
title = {Polynomial regression under arbitrary product distributions},
journal = {Mach. Learn.},
volume = {80},
number = {2-3},
pages = {273--294},
year = {2010},
url = {https://doi.org/10.1007/s10994-010-5179-6},
doi = {10.1007/S10994-010-5179-6},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ml/BlaisOW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/algosensors/AspnesBDORU10,
author = {James Aspnes and
Eric Blais and
Murat Demirbas and
Ryan O'Donnell and
Atri Rudra and
Steve Uurtamo},
editor = {Christian Scheideler},
title = {k\({}^{\mbox{ + }}\) Decision Trees - (Extended Abstract)},
booktitle = {Algorithms for Sensor Systems - 6th International Workshop on Algorithms
for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile
Entities, {ALGOSENSORS} 2010, Bordeaux, France, July 5, 2010, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {6451},
pages = {74--88},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-16988-5\_7},
doi = {10.1007/978-3-642-16988-5\_7},
timestamp = {Tue, 14 May 2019 10:00:36 +0200},
biburl = {https://dblp.org/rec/conf/algosensors/AspnesBDORU10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AlonB10,
author = {Noga Alon and
Eric Blais},
editor = {Maria J. Serna and
Ronen Shaltiel and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim},
title = {Testing Boolean Function Isomorphism},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 13th International Workshop, {APPROX} 2010, and 14th
International Workshop, {RANDOM} 2010, Barcelona, Spain, September
1-3, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6302},
pages = {394--405},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15369-3\_30},
doi = {10.1007/978-3-642-15369-3\_30},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/AlonB10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BlaisO10,
author = {Eric Blais and
Ryan O'Donnell},
title = {Lower Bounds for Testing Function Isomorphism},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {235--246},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.30},
doi = {10.1109/CCC.2010.30},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BlaisO10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:conf/propertytesting/Blais10,
author = {Eric Blais},
editor = {Oded Goldreich},
title = {Testing Juntas: {A} Brief Survey},
booktitle = {Property Testing - Current Research and Surveys},
series = {Lecture Notes in Computer Science},
volume = {6390},
pages = {32--40},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-16367-8\_4},
doi = {10.1007/978-3-642-16367-8\_4},
timestamp = {Tue, 01 Jun 2021 15:22:56 +0200},
biburl = {https://dblp.org/rec/conf/propertytesting/Blais10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Blais09,
author = {Eric Blais},
editor = {Michael Mitzenmacher},
title = {Testing juntas nearly optimally},
booktitle = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing,
{STOC} 2009, Bethesda, MD, USA, May 31 - June 2, 2009},
pages = {151--158},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1536414.1536437},
doi = {10.1145/1536414.1536437},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Blais09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Blais08,
author = {Eric Blais},
editor = {Ashish Goel and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Ronitt Rubinfeld},
title = {Improved Bounds for Testing Juntas},
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 = {317--330},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85363-3\_26},
doi = {10.1007/978-3-540-85363-3\_26},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/Blais08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BlaisOW08,
author = {Eric Blais and
Ryan O'Donnell and
Karl Wimmer},
editor = {Rocco A. Servedio and
Tong Zhang},
title = {Polynomial Regression under Arbitrary Product Distributions},
booktitle = {21st Annual Conference on Learning Theory - {COLT} 2008, Helsinki,
Finland, July 9-12, 2008},
pages = {193--204},
publisher = {Omnipress},
year = {2008},
url = {http://colt2008.cs.helsinki.fi/papers/78-Blais.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/BlaisOW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/BlinBHGBE07,
author = {Guillaume Blin and
Eric Blais and
Danny Hermelin and
Pierre Guillon and
Mathieu Blanchette and
Nadia El{-}Mabrouk},
title = {Gene Maps Linearization Using Genomic Rearrangement Distances},
journal = {J. Comput. Biol.},
volume = {14},
number = {4},
pages = {394--407},
year = {2007},
url = {https://doi.org/10.1089/cmb.2007.A002},
doi = {10.1089/CMB.2007.A002},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/BlinBHGBE07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jbcb/ChindelevitchLBB06,
author = {Leonid Chindelevitch and
Zhentao Li and
Eric Blais and
Mathieu Blanchette},
title = {On the Inference of Parsimonious Indel Evolutionary Scenarios},
journal = {J. Bioinform. Comput. Biol.},
volume = {4},
number = {3},
pages = {721--744},
year = {2006},
url = {https://doi.org/10.1142/S0219720006002168},
doi = {10.1142/S0219720006002168},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jbcb/ChindelevitchLBB06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BlaisB06,
author = {Eric Blais and
Mathieu Blanchette},
editor = {Moshe Lewenstein and
Gabriel Valiente},
title = {Common Substrings in Random Strings},
booktitle = {Combinatorial Pattern Matching, 17th Annual Symposium, {CPM} 2006,
Barcelona, Spain, July 5-7, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4009},
pages = {129--140},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11780441\_13},
doi = {10.1007/11780441\_13},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BlaisB06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recomb/BlinBGBE06,
author = {Guillaume Blin and
Eric Blais and
Pierre Guillon and
Mathieu Blanchette and
Nadia El{-}Mabrouk},
editor = {Guillaume Bourque and
Nadia El{-}Mabrouk},
title = {Inferring Gene Orders from Gene Maps Using the Breakpoint Distance},
booktitle = {Comparative Genomics, {RECOMB} 2006 International Workshop, {RCG}
2006, Montreal, Canada, September 24-26, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4205},
pages = {99--112},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11864127\_9},
doi = {10.1007/11864127\_9},
timestamp = {Mon, 13 May 2019 09:30:09 +0200},
biburl = {https://dblp.org/rec/conf/recomb/BlinBGBE06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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 2024-08-05 21:13 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:
