default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Nader H. Bshouty
@article{DBLP:journals/tcs/Bshouty24,
author = {Nader H. Bshouty},
title = {On one-sided testing affine subspaces},
journal = {Theor. Comput. Sci.},
volume = {1013},
pages = {114745},
year = {2024},
url = {https://doi.org/10.1016/j.tcs.2024.114745},
doi = {10.1016/J.TCS.2024.114745},
timestamp = {Thu, 15 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/Bshouty24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BshoutyH24,
author = {Nader H. Bshouty and
George Haddad},
editor = {Amit Kumar and
Noga Ron{-}Zewi},
title = {Approximating the Number of Relevant Variables in a Parity Implies
Proper Learning},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2024, August 28-30, 2024, London School
of Economics, London, {UK}},
series = {LIPIcs},
volume = {317},
pages = {38:1--38:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.38},
doi = {10.4230/LIPICS.APPROX/RANDOM.2024.38},
timestamp = {Mon, 16 Sep 2024 17:07:54 +0200},
biburl = {https://dblp.org/rec/conf/approx/BshoutyH24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2407-11832,
author = {Nader H. Bshouty and
George Haddad},
title = {Approximating the Number of Relevant Variables in a Parity Implies
Proper Learning},
journal = {CoRR},
volume = {abs/2407.11832},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2407.11832},
doi = {10.48550/ARXIV.2407.11832},
eprinttype = {arXiv},
eprint = {2407.11832},
timestamp = {Fri, 23 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2407-11832.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Bshouty24,
author = {Nader H. Bshouty},
title = {Approximating the Number of Relevant Variables in a Parity Implies
Proper Learning},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR24-121}},
year = {2024},
url = {https://eccc.weizmann.ac.il/report/2024/121},
eprinttype = {ECCC},
eprint = {TR24-121},
timestamp = {Thu, 08 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Bshouty24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Bshouty23,
author = {Nader H. Bshouty},
title = {An optimal tester for \emph{k}-linear},
journal = {Theor. Comput. Sci.},
volume = {950},
pages = {113759},
year = {2023},
url = {https://doi.org/10.1016/j.tcs.2023.113759},
doi = {10.1016/J.TCS.2023.113759},
timestamp = {Thu, 16 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Bshouty23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Bshouty23,
author = {Nader H. Bshouty},
editor = {Nicole Megow and
Adam D. Smith},
title = {Superpolynomial Lower Bounds for Learning Monotone Classes},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2023, September 11-13, 2023, Atlanta,
Georgia, {USA}},
series = {LIPIcs},
volume = {275},
pages = {34:1--34:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.34},
doi = {10.4230/LIPICS.APPROX/RANDOM.2023.34},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/Bshouty23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Bshouty23,
author = {Nader H. Bshouty},
editor = {Marios Mavronicolas},
title = {On One-Sided Testing Affine Subspaces},
booktitle = {Algorithms and Complexity - 13th International Conference, {CIAC}
2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13898},
pages = {157--171},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-30448-4\_12},
doi = {10.1007/978-3-031-30448-4\_12},
timestamp = {Fri, 28 Apr 2023 19:21:51 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Bshouty23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/Bshouty23,
author = {Nader H. Bshouty},
editor = {Weili Wu and
Jianxiong Guo},
title = {Improved Lower Bound for Estimating the Number of Defective Items},
booktitle = {Combinatorial Optimization and Applications - 17th International Conference,
{COCOA} 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings,
Part {I}},
series = {Lecture Notes in Computer Science},
volume = {14461},
pages = {303--315},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-49611-0\_22},
doi = {10.1007/978-3-031-49611-0\_22},
timestamp = {Sat, 13 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/Bshouty23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/BshoutyH23,
author = {Nader H. Bshouty and
Catherine A. Haddad{-}Zaknoon},
editor = {Weili Wu and
Guangmo Tong},
title = {On Detecting Some Defective Items in Group Testing},
booktitle = {Computing and Combinatorics - 29th International Conference, {COCOON}
2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {14422},
pages = {244--271},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-49190-0\_18},
doi = {10.1007/978-3-031-49190-0\_18},
timestamp = {Sat, 13 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/BshoutyH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Bshouty23,
author = {Nader H. Bshouty},
editor = {J{\'{e}}r{\^{o}}me Leroux and
Sylvain Lombardy and
David Peleg},
title = {On Property Testing of the Binary Rank},
booktitle = {48th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2023, August 28 to September 1, 2023, Bordeaux, France},
series = {LIPIcs},
volume = {272},
pages = {27:1--27:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2023.27},
doi = {10.4230/LIPICS.MFCS.2023.27},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Bshouty23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Bshouty23,
author = {Nader H. Bshouty},
editor = {Petra Berenbrink and
Patricia Bouyer and
Anuj Dawar and
Mamadou Moustapha Kant{\'{e}}},
title = {Non-Adaptive Proper Learning Polynomials},
booktitle = {40th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2023, March 7-9, 2023, Hamburg, Germany},
series = {LIPIcs},
volume = {254},
pages = {16:1--16:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.STACS.2023.16},
doi = {10.4230/LIPICS.STACS.2023.16},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Bshouty23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-04406,
author = {Nader H. Bshouty},
title = {A Note on Property Testing of the Binary Rank},
journal = {CoRR},
volume = {abs/2301.04406},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.04406},
doi = {10.48550/ARXIV.2301.04406},
eprinttype = {arXiv},
eprint = {2301.04406},
timestamp = {Thu, 19 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-04406.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-08486,
author = {Nader H. Bshouty},
title = {Superpolynomial Lower Bounds for Learning Monotone Classes},
journal = {CoRR},
volume = {abs/2301.08486},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.08486},
doi = {10.48550/ARXIV.2301.08486},
eprinttype = {arXiv},
eprint = {2301.08486},
timestamp = {Thu, 26 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-08486.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-04822,
author = {Nader H. Bshouty and
Catherine A. Haddad{-}Zaknoon},
title = {On Detecting Some Defective Items in Group Testing},
journal = {CoRR},
volume = {abs/2307.04822},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.04822},
doi = {10.48550/ARXIV.2307.04822},
eprinttype = {arXiv},
eprint = {2307.04822},
timestamp = {Mon, 24 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-04822.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-07721,
author = {Nader H. Bshouty},
title = {Improved Lower Bound for Estimating the Number of Defective Items},
journal = {CoRR},
volume = {abs/2308.07721},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.07721},
doi = {10.48550/ARXIV.2308.07721},
eprinttype = {arXiv},
eprint = {2308.07721},
timestamp = {Wed, 23 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-07721.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-09613,
author = {Nader H. Bshouty and
Gergely Harcos},
title = {A Tight Lower Bound of {\(\Omega\)}(log n) for the Estimation of the
Number of Defective Items},
journal = {CoRR},
volume = {abs/2309.09613},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.09613},
doi = {10.48550/ARXIV.2309.09613},
eprinttype = {arXiv},
eprint = {2309.09613},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-09613.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Bshouty23,
author = {Nader H. Bshouty},
title = {Superpolynomial Lower Bounds for Learning Monotone Classes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR23-006}},
year = {2023},
url = {https://eccc.weizmann.ac.il/report/2023/006},
eprinttype = {ECCC},
eprint = {TR23-006},
timestamp = {Mon, 06 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/Bshouty23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BshoutyH23,
author = {Nader H. Bshouty and
Gergely Harcos},
title = {A Tight Lower Bound of {\(\Omega\)}(log n) for the Estimation of the
Number of Defective Items},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR23-141}},
year = {2023},
url = {https://eccc.weizmann.ac.il/report/2023/141},
eprinttype = {ECCC},
eprint = {TR23-141},
timestamp = {Wed, 10 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/BshoutyH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/Bshouty22,
author = {Nader H. Bshouty},
editor = {Armando Casta{\~{n}}eda and
Francisco Rodr{\'{\i}}guez{-}Henr{\'{\i}}quez},
title = {Almost Optimal Proper Learning and Testing Polynomials},
booktitle = {{LATIN} 2022: Theoretical Informatics - 15th Latin American Symposium,
Guanajuato, Mexico, November 7-11, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13568},
pages = {312--327},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-20624-5\_19},
doi = {10.1007/978-3-031-20624-5\_19},
timestamp = {Thu, 03 Nov 2022 11:43:27 +0100},
biburl = {https://dblp.org/rec/conf/latin/Bshouty22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BshoutyH22,
author = {Nader H. Bshouty and
Catherine A. Haddad{-}Zaknoon},
editor = {Petra Berenbrink and
Benjamin Monmege},
title = {On Testing Decision Tree},
booktitle = {39th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2022, March 15-18, 2022, Marseille, France (Virtual Conference)},
series = {LIPIcs},
volume = {219},
pages = {17:1--17:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.STACS.2022.17},
doi = {10.4230/LIPICS.STACS.2022.17},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BshoutyH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/Bshouty22,
author = {Nader H. Bshouty},
editor = {Petra Mutzel and
Md. Saidur Rahman and
Slamin},
title = {An Optimal Tester for k-Linear},
booktitle = {{WALCOM:} Algorithms and Computation - 16th International Conference
and Workshops, {WALCOM} 2022, Jember, Indonesia, March 24-26, 2022,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13174},
pages = {201--212},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-030-96731-4\_17},
doi = {10.1007/978-3-030-96731-4\_17},
timestamp = {Tue, 22 Mar 2022 13:01:32 +0100},
biburl = {https://dblp.org/rec/conf/walcom/Bshouty22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-03207,
author = {Nader H. Bshouty},
title = {Almost Optimal Proper Learning and Testing Polynomials},
journal = {CoRR},
volume = {abs/2202.03207},
year = {2022},
url = {https://arxiv.org/abs/2202.03207},
eprinttype = {arXiv},
eprint = {2202.03207},
timestamp = {Wed, 09 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-03207.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Bshouty022,
author = {Nader H. Bshouty and
Oded Goldreich},
title = {On properties that are non-trivial to test},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-013}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/013},
eprinttype = {ECCC},
eprint = {TR22-013},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/Bshouty022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Bshouty22,
author = {Nader H. Bshouty},
title = {Non-Adaptive Proper Learning Polynomials},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-098}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/098},
eprinttype = {ECCC},
eprint = {TR22-098},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Bshouty22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Bshouty22a,
author = {Nader H. Bshouty},
title = {On One-Sided Testing Affine Subspaces},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-104}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/104},
eprinttype = {ECCC},
eprint = {TR22-104},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Bshouty22a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BshoutyH21,
author = {Nader H. Bshouty and
Catherine A. Haddad{-}Zaknoon},
title = {Optimal deterministic group testing algorithms to estimate the number
of defectives},
journal = {Theor. Comput. Sci.},
volume = {874},
pages = {46--58},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2021.05.011},
doi = {10.1016/J.TCS.2021.05.011},
timestamp = {Tue, 25 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BshoutyH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-04587,
author = {Nader H. Bshouty and
Catherine A. Haddad{-}Zaknoon},
title = {On Learning and Testing Decision Tree},
journal = {CoRR},
volume = {abs/2108.04587},
year = {2021},
url = {https://arxiv.org/abs/2108.04587},
eprinttype = {arXiv},
eprint = {2108.04587},
timestamp = {Wed, 11 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-04587.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Bshouty20,
author = {Nader H. Bshouty},
editor = {Jaroslaw Byrka and
Raghu Meka},
title = {Almost Optimal Testers for Concise Representations},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2020, August 17-19, 2020, Virtual
Conference},
series = {LIPIcs},
volume = {176},
pages = {5:1--5:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.5},
doi = {10.4230/LIPICS.APPROX/RANDOM.2020.5},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/Bshouty20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/BshoutyH20,
author = {Nader H. Bshouty and
Catherine A. Haddad{-}Zaknoon},
editor = {Weili Wu and
Zhongnan Zhang},
title = {Optimal Deterministic Group Testing Algorithms to Estimate the Number
of Defectives},
booktitle = {Combinatorial Optimization and Applications - 14th International Conference,
{COCOA} 2020, Dallas, TX, USA, December 11-13, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12577},
pages = {393--410},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-64843-5\_27},
doi = {10.1007/978-3-030-64843-5\_27},
timestamp = {Thu, 02 Dec 2021 16:45:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/BshoutyH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/BshoutyHH20,
author = {Nader H. Bshouty and
George Haddad and
Catherine A. Haddad{-}Zaknoon},
editor = {Alexander Chatzigeorgiou and
Riccardo Dondi and
Herodotos Herodotou and
Christos A. Kapoutsis and
Yannis Manolopoulos and
George A. Papadopoulos and
Florian Sikora},
title = {Bounds for the Number of Tests in Non-adaptive Randomized Algorithms
for Group Testing},
booktitle = {{SOFSEM} 2020: Theory and Practice of Computer Science - 46th International
Conference on Current Trends in Theory and Practice of Informatics,
{SOFSEM} 2020, Limassol, Cyprus, January 20-24, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12011},
pages = {101--112},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-38919-2\_9},
doi = {10.1007/978-3-030-38919-2\_9},
timestamp = {Tue, 21 Jan 2020 16:23:03 +0100},
biburl = {https://dblp.org/rec/conf/sofsem/BshoutyHH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BshoutyHBMNNZ20,
author = {Nader H. Bshouty and
Catherine A. Haddad{-}Zaknoon and
Raghd Boulos and
Foad Moalem and
Jalal Nada and
Elias Noufi and
Yara Zaknoon},
editor = {Susanne Albers},
title = {Optimal Randomized Group Testing Algorithm to Determine the Number
of Defectives},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {18:1--18:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.18},
doi = {10.4230/LIPICS.SWAT.2020.18},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BshoutyHBMNNZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2001-00441,
author = {Nader H. Bshouty and
Catherine A. Haddad{-}Zaknoon and
Raghd Boulos and
Foad Moalem and
Jalal Nada and
Elias Noufi and
Yara Zaknoon},
title = {Optimal Randomized Group Testing Algorithm to Determine the Number
of Defectives},
journal = {CoRR},
volume = {abs/2001.00441},
year = {2020},
url = {http://arxiv.org/abs/2001.00441},
eprinttype = {arXiv},
eprint = {2001.00441},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2001-00441.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-05922,
author = {Nader H. Bshouty},
title = {Lecture Note on LCSSX's Lower Bounds for Non-Adaptive Distribution-free
Property Testing},
journal = {CoRR},
volume = {abs/2004.05922},
year = {2020},
url = {https://arxiv.org/abs/2004.05922},
eprinttype = {arXiv},
eprint = {2004.05922},
timestamp = {Tue, 14 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-05922.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-04409,
author = {Nader H. Bshouty},
title = {An Optimal Tester for {\textdollar}k{\textdollar}-Linear},
journal = {CoRR},
volume = {abs/2006.04409},
year = {2020},
url = {https://arxiv.org/abs/2006.04409},
eprinttype = {arXiv},
eprint = {2006.04409},
timestamp = {Fri, 12 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-04409.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-02520,
author = {Nader H. Bshouty and
Catherine A. Haddad{-}Zaknoon},
title = {Optimal Deterministic Group Testing Algorithms to Estimate the Number
of Defectives},
journal = {CoRR},
volume = {abs/2009.02520},
year = {2020},
url = {https://arxiv.org/abs/2009.02520},
eprinttype = {arXiv},
eprint = {2009.02520},
timestamp = {Wed, 16 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-02520.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Bshouty20,
author = {Nader H. Bshouty},
title = {An Optimal Tester for k-Linear},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-123}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/123},
eprinttype = {ECCC},
eprint = {TR20-123},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Bshouty20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/AbasiN19,
author = {Hasan Abasi and
Nader H. Bshouty},
editor = {Aur{\'{e}}lien Garivier and
Satyen Kale},
title = {On Learning Graphs with Edge-Detecting Queries},
booktitle = {Algorithmic Learning Theory, {ALT} 2019, 22-24 March 2019, Chicago,
Illinois, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {98},
pages = {3--30},
publisher = {{PMLR}},
year = {2019},
url = {http://proceedings.mlr.press/v98/abasi19a.html},
timestamp = {Tue, 16 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alt/AbasiN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/BshoutyH19,
author = {Nader H. Bshouty and
Catherine A. Haddad{-}Zaknoon},
editor = {Aur{\'{e}}lien Garivier and
Satyen Kale},
title = {Adaptive Exact Learning of Decision Trees from Membership Queries},
booktitle = {Algorithmic Learning Theory, {ALT} 2019, 22-24 March 2019, Chicago,
Illinois, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {98},
pages = {207--234},
publisher = {{PMLR}},
year = {2019},
url = {http://proceedings.mlr.press/v98/bshouty19a.html},
timestamp = {Wed, 29 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alt/BshoutyH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Bshouty19,
author = {Nader H. Bshouty},
editor = {Amir Shpilka},
title = {Almost Optimal Distribution-Free Junta Testing},
booktitle = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
2019, New Brunswick, NJ, {USA}},
series = {LIPIcs},
volume = {137},
pages = {2:1--2:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.CCC.2019.2},
doi = {10.4230/LIPICS.CCC.2019.2},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/Bshouty19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Bshouty19,
author = {Nader H. Bshouty},
editor = {Pinyan Lu and
Guochuan Zhang},
title = {Lower Bound for Non-Adaptive Estimation of the Number of Defective
Items},
booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC}
2019, December 8-11, 2019, Shanghai University of Finance and Economics,
Shanghai, China},
series = {LIPIcs},
volume = {149},
pages = {2:1--2:9},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.2},
doi = {10.4230/LIPICS.ISAAC.2019.2},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/Bshouty19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-00717,
author = {Nader H. Bshouty},
title = {Almost Optimal Distribution-free Junta Testing},
journal = {CoRR},
volume = {abs/1901.00717},
year = {2019},
url = {http://arxiv.org/abs/1901.00717},
eprinttype = {arXiv},
eprint = {1901.00717},
timestamp = {Thu, 31 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-00717.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-07750,
author = {Nader H. Bshouty and
Catherine A. Haddad{-}Zaknoon},
title = {Adaptive Exact Learning of Decision Trees from Membership Queries},
journal = {CoRR},
volume = {abs/1901.07750},
year = {2019},
url = {http://arxiv.org/abs/1901.07750},
eprinttype = {arXiv},
eprint = {1901.07750},
timestamp = {Sat, 02 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-07750.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-09958,
author = {Nader H. Bshouty},
title = {Almost Optimal Testers for Concise Representations},
journal = {CoRR},
volume = {abs/1904.09958},
year = {2019},
url = {http://arxiv.org/abs/1904.09958},
eprinttype = {arXiv},
eprint = {1904.09958},
timestamp = {Fri, 26 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-09958.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-01694,
author = {Nader H. Bshouty and
George Haddad and
Catherine A. Haddad{-}Zaknoon},
title = {Bounds for the Number of Tests in Non-Adaptive Randomized Algorithms
for Group Testing},
journal = {CoRR},
volume = {abs/1911.01694},
year = {2019},
url = {http://arxiv.org/abs/1911.01694},
eprinttype = {arXiv},
eprint = {1911.01694},
timestamp = {Mon, 11 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-01694.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Bshouty19,
author = {Nader H. Bshouty},
title = {Almost Optimal Testers for Concise Representations},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-156}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/156},
eprinttype = {ECCC},
eprint = {TR19-156},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Bshouty19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AbasiBM18,
author = {Hasan Abasi and
Nader H. Bshouty and
Hanna Mazzawi},
title = {Non-adaptive learning of a hidden hypergraph},
journal = {Theor. Comput. Sci.},
volume = {716},
pages = {15--27},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2017.11.019},
doi = {10.1016/J.TCS.2017.11.019},
timestamp = {Tue, 13 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AbasiBM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Bshouty18,
author = {Nader H. Bshouty},
title = {Exact learning from an honest teacher that answers membership queries},
journal = {Theor. Comput. Sci.},
volume = {733},
pages = {4--43},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2018.04.034},
doi = {10.1016/J.TCS.2018.04.034},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Bshouty18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BshoutyC18,
author = {Nader H. Bshouty and
Areej Costa},
title = {Exact learning of juntas from membership queries},
journal = {Theor. Comput. Sci.},
volume = {742},
pages = {82--97},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2017.12.032},
doi = {10.1016/J.TCS.2017.12.032},
timestamp = {Wed, 22 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BshoutyC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/BshoutyBHHKS18,
author = {Nader H. Bshouty and
Vivian E. Bshouty{-}Hurani and
George Haddad and
Thomas Hashem and
Fadi Khoury and
Omar Sharafy},
editor = {Firdaus Janoos and
Mehryar Mohri and
Karthik Sridharan},
title = {Adaptive Group Testing Algorithms to Estimate the Number of Defectives},
booktitle = {Algorithmic Learning Theory, {ALT} 2018, 7-9 April 2018, Lanzarote,
Canary Islands, Spain},
series = {Proceedings of Machine Learning Research},
volume = {83},
pages = {93--110},
publisher = {{PMLR}},
year = {2018},
url = {http://proceedings.mlr.press/v83/bshouty18a.html},
timestamp = {Wed, 03 Apr 2019 18:17:24 +0200},
biburl = {https://dblp.org/rec/conf/alt/BshoutyBHHKS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BshoutyM18,
author = {Nader H. Bshouty and
Waseem Makhoul},
editor = {Wen{-}Lian Hsu and
Der{-}Tsai Lee and
Chung{-}Shou Liao},
title = {On Polynomial Time Constructions of Minimum Height Decision Tree},
booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC}
2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan},
series = {LIPIcs},
volume = {123},
pages = {34:1--34:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.34},
doi = {10.4230/LIPICS.ISAAC.2018.34},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/isaac/BshoutyM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-00233,
author = {Nader H. Bshouty and
Waseem Makhoul},
title = {On Polynomial time Constructions of Minimum Height Decision Tree},
journal = {CoRR},
volume = {abs/1802.00233},
year = {2018},
url = {http://arxiv.org/abs/1802.00233},
eprinttype = {arXiv},
eprint = {1802.00233},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-00233.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-07046,
author = {Nader H. Bshouty and
Vivian E. Bshouty{-}Hurani and
George Haddad and
Thomas Hashem and
Fadi Khoury and
Omar Sharafy},
title = {Elementary Proofs of Some Stirling Bounds},
journal = {CoRR},
volume = {abs/1802.07046},
year = {2018},
url = {http://arxiv.org/abs/1802.07046},
eprinttype = {arXiv},
eprint = {1802.07046},
timestamp = {Mon, 06 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-07046.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-10639,
author = {Hasan Abasi and
Nader H. Bshouty},
title = {On Learning Graphs with Edge-Detecting Queries},
journal = {CoRR},
volume = {abs/1803.10639},
year = {2018},
url = {http://arxiv.org/abs/1803.10639},
eprinttype = {arXiv},
eprint = {1803.10639},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-10639.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Bshouty18,
author = {Nader H. Bshouty},
title = {Lower Bound for Non-Adaptive Estimate the Number of Defective Items},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-053}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/053},
eprinttype = {ECCC},
eprint = {TR18-053},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Bshouty18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/BshoutyDKS17,
author = {Nader H. Bshouty and
Nuha Diab and
Shada R. Kawar and
Robert J. Shahla},
editor = {Steve Hanneke and
Lev Reyzin},
title = {Non-Adaptive Randomized Algorithm for Group Testing},
booktitle = {International Conference on Algorithmic Learning Theory, {ALT} 2017,
15-17 October 2017, Kyoto University, Kyoto, Japan},
series = {Proceedings of Machine Learning Research},
volume = {76},
pages = {109--128},
publisher = {{PMLR}},
year = {2017},
url = {http://proceedings.mlr.press/v76/bshouty17a.html},
timestamp = {Wed, 03 Apr 2019 18:17:23 +0200},
biburl = {https://dblp.org/rec/conf/alt/BshoutyDKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BshoutyG17,
author = {Nader H. Bshouty and
Ariel Gabizon},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Almost Optimal Cover-Free Families},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {140--151},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_13},
doi = {10.1007/978-3-319-57586-5\_13},
timestamp = {Thu, 24 Mar 2022 11:08:56 +0100},
biburl = {https://dblp.org/rec/conf/ciac/BshoutyG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BshoutyDVY17,
author = {Nader H. Bshouty and
Dana Drachsler{-}Cohen and
Martin T. Vechev and
Eran Yahav},
editor = {Satyen Kale and
Ohad Shamir},
title = {Learning Disjunctions of Predicates},
booktitle = {Proceedings of the 30th Conference on Learning Theory, {COLT} 2017,
Amsterdam, The Netherlands, 7-10 July 2017},
series = {Proceedings of Machine Learning Research},
volume = {65},
pages = {346--369},
publisher = {{PMLR}},
year = {2017},
url = {http://proceedings.mlr.press/v65/bshouty17a.html},
timestamp = {Wed, 29 May 2019 08:41:46 +0200},
biburl = {https://dblp.org/rec/conf/colt/BshoutyDVY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Bshouty17,
author = {Nader H. Bshouty},
title = {Exact Learning from an Honest Teacher That Answers Membership Queries},
journal = {CoRR},
volume = {abs/1706.03935},
year = {2017},
url = {http://arxiv.org/abs/1706.03935},
eprinttype = {arXiv},
eprint = {1706.03935},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Bshouty17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BshoutyDVY17,
author = {Nader H. Bshouty and
Dana Drachsler{-}Cohen and
Martin T. Vechev and
Eran Yahav},
title = {Learning Disjunctions of Predicates},
journal = {CoRR},
volume = {abs/1706.05070},
year = {2017},
url = {http://arxiv.org/abs/1706.05070},
eprinttype = {arXiv},
eprint = {1706.05070},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BshoutyDVY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BshoutyC17,
author = {Nader H. Bshouty and
Areej Costa},
title = {Exact Learning of Juntas from Membership Queries},
journal = {CoRR},
volume = {abs/1706.06934},
year = {2017},
url = {http://arxiv.org/abs/1706.06934},
eprinttype = {arXiv},
eprint = {1706.06934},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BshoutyC17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BshoutyH17,
author = {Nader H. Bshouty and
Catherine A. Haddad{-}Zaknoon},
title = {The Maximum Cosine Framework for Deriving Perceptron Based Linear
Classifiers},
journal = {CoRR},
volume = {abs/1707.00821},
year = {2017},
url = {http://arxiv.org/abs/1707.00821},
eprinttype = {arXiv},
eprint = {1707.00821},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BshoutyH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-02787,
author = {Nader H. Bshouty and
Nuha Diab and
Shada R. Kawar and
Robert J. Shahla},
title = {Non-Adaptive Randomized Algorithm for Group Testing},
journal = {CoRR},
volume = {abs/1708.02787},
year = {2017},
url = {http://arxiv.org/abs/1708.02787},
eprinttype = {arXiv},
eprint = {1708.02787},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-02787.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1712-00615,
author = {Nader H. Bshouty and
Vivian E. Bshouty{-}Hurani and
George Haddad and
Thomas Hashem and
Fadi Khoury and
Omar Sharafy},
title = {Adaptive Group Testing Algorithms to Estimate the Number of Defectives},
journal = {CoRR},
volume = {abs/1712.00615},
year = {2017},
url = {http://arxiv.org/abs/1712.00615},
eprinttype = {arXiv},
eprint = {1712.00615},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1712-00615.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/AbdiB16,
author = {Ali Z. Abdi and
Nader H. Bshouty},
title = {Lower Bounds for Cover-Free Families},
journal = {Electron. J. Comb.},
volume = {23},
number = {2},
pages = {2},
year = {2016},
url = {https://doi.org/10.37236/5202},
doi = {10.37236/5202},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/AbdiB16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AbasiAB16,
author = {Hasan Abasi and
Ali Z. Abdi and
Nader H. Bshouty},
title = {Learning boolean halfspaces with small weights from membership queries},
journal = {Theor. Comput. Sci.},
volume = {650},
pages = {45--56},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2016.07.030},
doi = {10.1016/J.TCS.2016.07.030},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AbasiAB16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/BshoutyC16,
author = {Nader H. Bshouty and
Areej Costa},
editor = {Ronald Ortner and
Hans Ulrich Simon and
Sandra Zilles},
title = {Exact Learning of Juntas from Membership Queries},
booktitle = {Algorithmic Learning Theory - 27th International Conference, {ALT}
2016, Bari, Italy, October 19-21, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9925},
pages = {115--129},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-46379-7\_8},
doi = {10.1007/978-3-319-46379-7\_8},
timestamp = {Fri, 08 Sep 2023 21:18:15 +0200},
biburl = {https://dblp.org/rec/conf/alt/BshoutyC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/BshoutyH16,
author = {Nader H. Bshouty and
Catherine A. Haddad{-}Zaknoon},
editor = {Ronald Ortner and
Hans Ulrich Simon and
Sandra Zilles},
title = {The Maximum Cosine Framework for Deriving Perceptron Based Linear
Classifiers},
booktitle = {Algorithmic Learning Theory - 27th International Conference, {ALT}
2016, Bari, Italy, October 19-21, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9925},
pages = {207--222},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-46379-7\_14},
doi = {10.1007/978-3-319-46379-7\_14},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alt/BshoutyH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BshoutyDKS16,
author = {Nader H. Bshouty and
Nuha Diab and
Shada R. Kawar and
Robert J. Shahla},
title = {Enumerating all the Irreducible Polynomials over Finite Field},
journal = {CoRR},
volume = {abs/1602.05032},
year = {2016},
url = {http://arxiv.org/abs/1602.05032},
eprinttype = {arXiv},
eprint = {1602.05032},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BshoutyDKS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Bshouty16,
author = {Nader H. Bshouty},
title = {Derandomizing Chernoff Bound with Union Bound with an Application
to {\textdollar}k{\textdollar}-wise Independent Sets},
journal = {CoRR},
volume = {abs/1608.01568},
year = {2016},
url = {http://arxiv.org/abs/1608.01568},
eprinttype = {arXiv},
eprint = {1608.01568},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Bshouty16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Bshouty16,
author = {Nader H. Bshouty},
title = {Derandomizing Chernoff Bound with Union Bound with an Application
to \emph{k}-wise Independent Sets},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-083}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/083},
eprinttype = {ECCC},
eprint = {TR16-083},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Bshouty16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BshoutyM15,
author = {Nader H. Bshouty and
Hanna Mazzawi},
title = {On Parity Check (0, 1)-Matrix over {\(\mathbb{Z}\)}\({}_{\mbox{p}}\)},
journal = {{SIAM} J. Discret. Math.},
volume = {29},
number = {1},
pages = {631--657},
year = {2015},
url = {https://doi.org/10.1137/120881129},
doi = {10.1137/120881129},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BshoutyM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/AbasiBM15,
author = {Hasan Abasi and
Nader H. Bshouty and
Hanna Mazzawi},
editor = {Kamalika Chaudhuri and
Claudio Gentile and
Sandra Zilles},
title = {Non-adaptive Learning of a Hidden Hypergraph},
booktitle = {Algorithmic Learning Theory - 26th International Conference, {ALT}
2015, Banff, AB, Canada, October 4-6, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9355},
pages = {89--101},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-24486-0\_6},
doi = {10.1007/978-3-319-24486-0\_6},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/alt/AbasiBM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Bshouty15,
author = {Nader H. Bshouty},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {Linear Time Constructions of Some d -Restriction Problems},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {74--88},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_5},
doi = {10.1007/978-3-319-18173-8\_5},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Bshouty15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/BshoutyA15,
author = {Nader H. Bshouty and
Ali Z. Abdi},
editor = {Ekrem Duman and
Ali Fuat Alkaya},
title = {Lower Bounds for Cover-Free Families},
booktitle = {13th Cologne Twente Workshop on Graphs and Combinatorial Optimization,
Istanbul, Turkey, May 26-28, 2015},
pages = {48--51},
year = {2015},
timestamp = {Thu, 02 Feb 2017 18:00:28 +0100},
biburl = {https://dblp.org/rec/conf/colognetwente/BshoutyA15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AbdiB15,
author = {Ali Z. Abdi and
Nader H. Bshouty},
title = {Lower Bounds for Cover-Free Families},
journal = {CoRR},
volume = {abs/1502.03578},
year = {2015},
url = {http://arxiv.org/abs/1502.03578},
eprinttype = {arXiv},
eprint = {1502.03578},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AbdiB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AbasiBM15,
author = {Hasan Abasi and
Nader H. Bshouty and
Hanna Mazzawi},
title = {Non-Adaptive Learning a Hidden Hipergraph},
journal = {CoRR},
volume = {abs/1502.04137},
year = {2015},
url = {http://arxiv.org/abs/1502.04137},
eprinttype = {arXiv},
eprint = {1502.04137},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AbasiBM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BshoutyG15,
author = {Nader H. Bshouty and
Ariel Gabizon},
title = {Almost Optimal Cover-Free Families},
journal = {CoRR},
volume = {abs/1507.07368},
year = {2015},
url = {http://arxiv.org/abs/1507.07368},
eprinttype = {arXiv},
eprint = {1507.07368},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BshoutyG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Bshouty15,
author = {Nader H. Bshouty},
title = {Dense Testers: Almost Linear Time and Locally Explicit Constructions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-006}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/006},
eprinttype = {ECCC},
eprint = {TR15-006},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Bshouty15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BshoutySVZ14,
author = {Nader H. Bshouty and
Gilles Stoltz and
Nicolas Vayatis and
Thomas Zeugmann},
title = {Guest Editors' foreword},
journal = {Theor. Comput. Sci.},
volume = {558},
pages = {1--4},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2014.09.021},
doi = {10.1016/J.TCS.2014.09.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BshoutySVZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/AbasiAB14,
author = {Hasan Abasi and
Ali Z. Abdi and
Nader H. Bshouty},
editor = {Peter Auer and
Alexander Clark and
Thomas Zeugmann and
Sandra Zilles},
title = {Learning Boolean Halfspaces with Small Weights from Membership Queries},
booktitle = {Algorithmic Learning Theory - 25th International Conference, {ALT}
2014, Bled, Slovenia, October 8-10, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8776},
pages = {96--110},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-11662-4\_8},
doi = {10.1007/978-3-319-11662-4\_8},
timestamp = {Sun, 25 Oct 2020 22:46:29 +0100},
biburl = {https://dblp.org/rec/conf/alt/AbasiAB14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/AbasiBM14,
author = {Hasan Abasi and
Nader H. Bshouty and
Hanna Mazzawi},
editor = {Peter Auer and
Alexander Clark and
Thomas Zeugmann and
Sandra Zilles},
title = {On Exact Learning Monotone {DNF} from Membership Queries},
booktitle = {Algorithmic Learning Theory - 25th International Conference, {ALT}
2014, Bled, Slovenia, October 8-10, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8776},
pages = {111--124},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-11662-4\_9},
doi = {10.1007/978-3-319-11662-4\_9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alt/AbasiBM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Bshouty14,
author = {Nader H. Bshouty},
editor = {Moni Naor},
title = {Testers and their applications},
booktitle = {Innovations in Theoretical Computer Science, ITCS'14, Princeton, NJ,
USA, January 12-14, 2014},
pages = {327--352},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2554797.2554828},
doi = {10.1145/2554797.2554828},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/Bshouty14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/AbasiBGH14,
author = {Hasan Abasi and
Nader H. Bshouty and
Ariel Gabizon and
Elad Haramaty},
editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Martin Dietzfelbinger and
Zolt{\'{a}}n {\'{E}}sik},
title = {On r-Simple k-Path},
booktitle = {Mathematical Foundations of Computer Science 2014 - 39th International
Symposium, {MFCS} 2014, Budapest, Hungary, August 25-29, 2014. Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {8635},
pages = {1--12},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44465-8\_1},
doi = {10.1007/978-3-662-44465-8\_1},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/AbasiBGH14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AbasiB14,
author = {Hasan Abasi and
Nader H. Bshouty},
title = {A Simple Algorithm for Hamiltonicity},
journal = {CoRR},
volume = {abs/1404.2827},
year = {2014},
url = {http://arxiv.org/abs/1404.2827},
eprinttype = {arXiv},
eprint = {1404.2827},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AbasiB14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AbasiBM14,
author = {Hasan Abasi and
Nader H. Bshouty and
Hanna Mazzawi},
title = {On Exact Learning Monotone {DNF} from Membership Queries},
journal = {CoRR},
volume = {abs/1405.0792},
year = {2014},
url = {http://arxiv.org/abs/1405.0792},
eprinttype = {arXiv},
eprint = {1405.0792},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AbasiBM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AbasiAB14,
author = {Hasan Abasi and
Ali Z. Abdi and
Nader H. Bshouty},
title = {Learning Boolean Halfspaces with Small Weights from Membership Queries},
journal = {CoRR},
volume = {abs/1405.1535},
year = {2014},
url = {http://arxiv.org/abs/1405.1535},
eprinttype = {arXiv},
eprint = {1405.1535},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AbasiAB14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Bshouty14,
author = {Nader H. Bshouty},
title = {Linear time Constructions of some {\textdollar}d{\textdollar}-Restriction
Problems},
journal = {CoRR},
volume = {abs/1406.2108},
year = {2014},
url = {http://arxiv.org/abs/1406.2108},
eprinttype = {arXiv},
eprint = {1406.2108},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Bshouty14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Bshouty14a,
author = {Nader H. Bshouty},
title = {Dense Testers: Almost Linear Time and Locally Explicit Constructions},
journal = {CoRR},
volume = {abs/1412.5889},
year = {2014},
url = {http://arxiv.org/abs/1412.5889},
eprinttype = {arXiv},
eprint = {1412.5889},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Bshouty14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AbasiBGH14,
author = {Hasan Abasi and
Nader H. Bshouty and
Ariel Gabizon and
Elad Haramaty},
title = {On \emph{r}-Simple \emph{k}-Path},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-004}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/004},
eprinttype = {ECCC},
eprint = {TR14-004},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AbasiBGH14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/Bshouty13,
author = {Nader H. Bshouty},
editor = {Sanjay Jain and
R{\'{e}}mi Munos and
Frank Stephan and
Thomas Zeugmann},
title = {Exact Learning from Membership Queries: Some Techniques, Results and
New Directions},
booktitle = {Algorithmic Learning Theory - 24th International Conference, {ALT}
2013, Singapore, October 6-9, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8139},
pages = {33--52},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40935-6\_4},
doi = {10.1007/978-3-642-40935-6\_4},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/alt/Bshouty13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AbasiBGH13,
author = {Hasan Abasi and
Nader H. Bshouty and
Ariel Gabizon and
Elad Haramaty},
title = {On {\textdollar}r{\textdollar}-Simple {\textdollar}k{\textdollar}-Path},
journal = {CoRR},
volume = {abs/1312.4863},
year = {2013},
url = {http://arxiv.org/abs/1312.4863},
eprinttype = {arXiv},
eprint = {1312.4863},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AbasiBGH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AbasiB13,
author = {Hasan Abasi and
Nader H. Bshouty},
title = {A Simple Algorithm for Undirected Hamiltonicity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-012}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/012},
eprinttype = {ECCC},
eprint = {TR13-012},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AbasiB13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Bshouty13,
author = {Nader H. Bshouty},
title = {Multilinear Complexity is Equivalent to Optimal Tester Size},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-011}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/011},
eprinttype = {ECCC},
eprint = {TR13-011},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Bshouty13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cca/Bshouty12,
author = {Nader H. Bshouty},
title = {Testers},
journal = {{ACM} Commun. Comput. Algebra},
volume = {46},
number = {3/4},
pages = {78--79},
year = {2012},
url = {https://doi.org/10.1145/2429135.2429142},
doi = {10.1145/2429135.2429142},
timestamp = {Wed, 04 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cca/Bshouty12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ml/BshoutyL12,
author = {Nader H. Bshouty and
Philip M. Long},
title = {Linear classifiers are nearly optimal when hidden variables have diverse
effects},
journal = {Mach. Learn.},
volume = {86},
number = {2},
pages = {209--231},
year = {2012},
url = {https://doi.org/10.1007/s10994-011-5262-7},
doi = {10.1007/S10994-011-5262-7},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ml/BshoutyL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BshoutyM12,
author = {Nader H. Bshouty and
Hanna Mazzawi},
title = {Toward a deterministic polynomial time algorithm with optimal additive
query complexity},
journal = {Theor. Comput. Sci.},
volume = {417},
pages = {23--35},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2011.09.005},
doi = {10.1016/J.TCS.2011.09.005},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BshoutyM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/BshoutySVZ12,
author = {Nader H. Bshouty and
Gilles Stoltz and
Nicolas Vayatis and
Thomas Zeugmann},
editor = {Nader H. Bshouty and
Gilles Stoltz and
Nicolas Vayatis and
Thomas Zeugmann},
title = {Editors' Introduction},
booktitle = {Algorithmic Learning Theory - 23rd International Conference, {ALT}
2012, Lyon, France, October 29-31, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7568},
pages = {1--11},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-34106-9\_1},
doi = {10.1007/978-3-642-34106-9\_1},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/alt/BshoutySVZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Bshouty12,
author = {Nader H. Bshouty},
editor = {Anupam Gupta and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Rocco A. Servedio},
title = {On the Coin Weighing Problem with the Presence of Noise},
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 = {471--482},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32512-0\_40},
doi = {10.1007/978-3-642-32512-0\_40},
timestamp = {Sun, 04 Aug 2024 19:37:16 +0200},
biburl = {https://dblp.org/rec/conf/approx/Bshouty12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/alt/2012,
editor = {Nader H. Bshouty and
Gilles Stoltz and
Nicolas Vayatis and
Thomas Zeugmann},
title = {Algorithmic Learning Theory - 23rd International Conference, {ALT}
2012, Lyon, France, October 29-31, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7568},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-34106-9},
doi = {10.1007/978-3-642-34106-9},
isbn = {978-3-642-34105-2},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alt/2012.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Bshouty12,
author = {Nader H. Bshouty},
title = {Testers and their Applications},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-011}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/011},
eprinttype = {ECCC},
eprint = {TR12-011},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Bshouty12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BshoutyM11,
author = {Nader H. Bshouty and
Hanna Mazzawi},
title = {Reconstructing weighted graphs with minimal query complexity},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {19},
pages = {1782--1790},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.055},
doi = {10.1016/J.TCS.2010.12.055},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BshoutyM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BshoutyM11,
author = {Nader H. Bshouty and
Hanna Mazzawi},
editor = {Dana Randall},
title = {On Parity Check (0, 1)-Matrix over Z\({}^{\mbox{p}}\)},
booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
2011},
pages = {1383--1394},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973082.106},
doi = {10.1137/1.9781611973082.106},
timestamp = {Tue, 02 Feb 2021 17:07:23 +0100},
biburl = {https://dblp.org/rec/conf/soda/BshoutyM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BshoutyM11,
author = {Nader H. Bshouty and
Hanna Mazzawi},
title = {Algorithms for the Coin Weighing Problems with the Presence of Noise},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-124}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/124},
eprinttype = {ECCC},
eprint = {TR11-124},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BshoutyM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/BshoutyL10,
author = {Nader H. Bshouty and
Philip M. Long},
editor = {Johannes F{\"{u}}rnkranz and
Thorsten Joachims},
title = {Finding Planted Partitions in Nearly Linear Time using Arrested Spectral
Clustering},
booktitle = {Proceedings of the 27th International Conference on Machine Learning
(ICML-10), June 21-24, 2010, Haifa, Israel},
pages = {135--142},
publisher = {Omnipress},
year = {2010},
url = {https://icml.cc/Conferences/2010/papers/119.pdf},
timestamp = {Wed, 03 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/BshoutyL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BshoutyM10,
author = {Nader H. Bshouty and
Hanna Mazzawi},
editor = {Petr Hlinen{\'{y}} and
Anton{\'{\i}}n Kucera},
title = {Toward a Deterministic Polynomial Time Algorithm with Optimal Additive
Query Complexity},
booktitle = {Mathematical Foundations of Computer Science 2010, 35th International
Symposium, {MFCS} 2010, Brno, Czech Republic, August 23-27, 2010.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6281},
pages = {221--232},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15155-2\_21},
doi = {10.1007/978-3-642-15155-2\_21},
timestamp = {Fri, 30 Aug 2019 10:02:28 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BshoutyM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BshoutyM10,
author = {Nader H. Bshouty and
Hanna Mazzawi},
editor = {Jean{-}Yves Marion and
Thomas Schwentick},
title = {Optimal Query Complexity for Reconstructing Hypergraphs},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2010, March 4-6, 2010, Nancy, France},
series = {LIPIcs},
volume = {5},
pages = {143--154},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2010},
url = {https://doi.org/10.4230/LIPIcs.STACS.2010.2496},
doi = {10.4230/LIPICS.STACS.2010.2496},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BshoutyM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1001-0405,
author = {Nader H. Bshouty and
Hanna Mazzawi},
title = {Optimal Query Complexity for Reconstructing Hypergraphs},
journal = {CoRR},
volume = {abs/1001.0405},
year = {2010},
url = {http://arxiv.org/abs/1001.0405},
eprinttype = {arXiv},
eprint = {1001.0405},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1001-0405.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BshoutyLL09,
author = {Nader H. Bshouty and
Yi Li and
Philip M. Long},
title = {Using the doubling dimension to analyze the generalization of learning
algorithms},
journal = {J. Comput. Syst. Sci.},
volume = {75},
number = {6},
pages = {323--335},
year = {2009},
url = {https://doi.org/10.1016/j.jcss.2009.01.003},
doi = {10.1016/J.JCSS.2009.01.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BshoutyLL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/BshoutyM09,
author = {Nader H. Bshouty and
Hanna Mazzawi},
editor = {Ricard Gavald{\`{a}} and
G{\'{a}}bor Lugosi and
Thomas Zeugmann and
Sandra Zilles},
title = {Reconstructing Weighted Graphs with Minimal Query Complexity},
booktitle = {Algorithmic Learning Theory, 20th International Conference, {ALT}
2009, Porto, Portugal, October 3-5, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5809},
pages = {97--109},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04414-4\_12},
doi = {10.1007/978-3-642-04414-4\_12},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/alt/BshoutyM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Bshouty09,
author = {Nader H. Bshouty},
title = {Optimal Algorithms for the Coin Weighing Problem with a Spring Scale},
booktitle = {{COLT} 2009 - The 22nd Conference on Learning Theory, Montreal, Quebec,
Canada, June 18-21, 2009},
year = {2009},
url = {http://www.cs.mcgill.ca/\%7Ecolt2009/papers/004.pdf\#page=1},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/Bshouty09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BshoutyL09,
author = {Nader H. Bshouty and
Philip M. Long},
title = {Linear Classifiers are Nearly Optimal When Hidden Variables Have Diverse
Effect},
booktitle = {{COLT} 2009 - The 22nd Conference on Learning Theory, Montreal, Quebec,
Canada, June 18-21, 2009},
year = {2009},
url = {http://www.cs.mcgill.ca/\%7Ecolt2009/papers/002.pdf\#page=1},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/BshoutyL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/MazzawiB09,
author = {Hanna Mazzawi and
Nader H. Bshouty},
title = {On Parity Check (0, 1)-Matrix over Z\({}_{\mbox{p}}\)},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-067}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/067},
eprinttype = {ECCC},
eprint = {TR09-067},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/MazzawiB09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BishtBK08,
author = {Laurence Bisht and
Nader H. Bshouty and
Lawrance Khoury},
title = {Learning with errors in answers to membership queries},
journal = {J. Comput. Syst. Sci.},
volume = {74},
number = {1},
pages = {2--15},
year = {2008},
url = {https://doi.org/10.1016/j.jcss.2007.04.010},
doi = {10.1016/J.JCSS.2007.04.010},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BishtBK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ml/BshoutyG08,
author = {Nader H. Bshouty and
Claudio Gentile},
title = {Guest Editors' Introduction: Special issue on Learning Theory {(COLT-2007)}},
journal = {Mach. Learn.},
volume = {72},
number = {1-2},
pages = {1--4},
year = {2008},
url = {https://doi.org/10.1007/s10994-008-5062-x},
doi = {10.1007/S10994-008-5062-X},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ml/BshoutyG08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/BeimelBBKV08,
author = {Amos Beimel and
Francesco Bergadano and
Nader H. Bshouty and
Eyal Kushilevitz and
Stefano Varricchio},
editor = {Ming{-}Yang Kao},
title = {Learning Automata},
booktitle = {Encyclopedia of Algorithms - 2008 Edition},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-0-387-30162-4\_194},
doi = {10.1007/978-0-387-30162-4\_194},
timestamp = {Thu, 27 Jun 2019 16:25:31 +0200},
biburl = {https://dblp.org/rec/reference/algo/BeimelBBKV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BennetB07,
author = {Rotem Bennet and
Nader H. Bshouty},
title = {Learning attribute-efficiently with corrupt oracles},
journal = {Theor. Comput. Sci.},
volume = {387},
number = {1},
pages = {32--50},
year = {2007},
url = {https://doi.org/10.1016/j.tcs.2007.07.040},
doi = {10.1016/J.TCS.2007.07.040},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BennetB07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/colt/2007,
editor = {Nader H. Bshouty and
Claudio Gentile},
title = {Learning Theory, 20th Annual Conference on Learning Theory, {COLT}
2007, San Diego, CA, USA, June 13-15, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4539},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-72927-3},
doi = {10.1007/978-3-540-72927-3},
isbn = {978-3-540-72925-9},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/2007.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BshoutyK06,
author = {Nader H. Bshouty and
Michael Kaminski},
title = {Polynomial multiplication over finite fields: from quadratic to straight-line
complexity},
journal = {Comput. Complex.},
volume = {15},
number = {3},
pages = {252--262},
year = {2006},
url = {https://doi.org/10.1007/s00037-006-0215-4},
doi = {10.1007/S00037-006-0215-4},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BshoutyK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BshoutyB06,
author = {Nader H. Bshouty and
Lynn Burroughs},
title = {Maximizing agreements and coagnostic learning},
journal = {Theor. Comput. Sci.},
volume = {350},
number = {1},
pages = {24--39},
year = {2006},
url = {https://doi.org/10.1016/j.tcs.2005.10.014},
doi = {10.1016/J.TCS.2005.10.014},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BshoutyB06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/BshoutyW06,
author = {Nader H. Bshouty and
Ehab Wattad},
editor = {Jos{\'{e}} L. Balc{\'{a}}zar and
Philip M. Long and
Frank Stephan},
title = {On Exact Learning Halfspaces with Random Consistent Hypothesis Oracle},
booktitle = {Algorithmic Learning Theory, 17th International Conference, {ALT}
2006, Barcelona, Spain, October 7-10, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4264},
pages = {48--62},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11894841\_8},
doi = {10.1007/11894841\_8},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/alt/BshoutyW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/BshoutyB06,
author = {Nader H. Bshouty and
Iddo Bentov},
editor = {Jos{\'{e}} L. Balc{\'{a}}zar and
Philip M. Long and
Frank Stephan},
title = {On Exact Learning from Random Walk},
booktitle = {Algorithmic Learning Theory, 17th International Conference, {ALT}
2006, Barcelona, Spain, October 7-10, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4264},
pages = {184--198},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11894841\_17},
doi = {10.1007/11894841\_17},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alt/BshoutyB06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BishtBM06,
author = {Laurence Bisht and
Nader H. Bshouty and
Hanna Mazzawi},
editor = {G{\'{a}}bor Lugosi and
Hans Ulrich Simon},
title = {On Optimal Learning Algorithms for Multiplicity Automata},
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 = {184--198},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11776420\_16},
doi = {10.1007/11776420\_16},
timestamp = {Fri, 08 Sep 2023 21:18:17 +0200},
biburl = {https://dblp.org/rec/conf/colt/BishtBM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BshoutyM06,
author = {Nader H. Bshouty and
Hanna Mazzawi},
editor = {G{\'{a}}bor Lugosi and
Hans Ulrich Simon},
title = {Exact Learning Composed Classes with a Small Number of Mistakes},
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 = {199--213},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11776420\_17},
doi = {10.1007/11776420\_17},
timestamp = {Sun, 21 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/BshoutyM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BshoutyJT05,
author = {Nader H. Bshouty and
Jeffrey C. Jackson and
Christino Tamon},
title = {Exploring learnability between exact and {PAC}},
journal = {J. Comput. Syst. Sci.},
volume = {70},
number = {4},
pages = {471--484},
year = {2005},
url = {https://doi.org/10.1016/j.jcss.2004.10.002},
doi = {10.1016/J.JCSS.2004.10.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BshoutyJT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BshoutyMOS05,
author = {Nader H. Bshouty and
Elchanan Mossel and
Ryan O'Donnell and
Rocco A. Servedio},
title = {Learning {DNF} from random walks},
journal = {J. Comput. Syst. Sci.},
volume = {71},
number = {3},
pages = {250--265},
year = {2005},
url = {https://doi.org/10.1016/j.jcss.2004.10.010},
doi = {10.1016/J.JCSS.2004.10.010},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/BshoutyMOS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ml/BshoutyB05,
author = {Nader H. Bshouty and
Lynn Burroughs},
title = {Maximizing Agreements with One-Sided Error with Applications to Heuristic
Learning},
journal = {Mach. Learn.},
volume = {59},
number = {1-2},
pages = {99--123},
year = {2005},
url = {https://doi.org/10.1007/s10994-005-0464-5},
doi = {10.1007/S10994-005-0464-5},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ml/BshoutyB05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/BennetB05,
author = {Rotem Bennet and
Nader H. Bshouty},
editor = {Sanjay Jain and
Hans Ulrich Simon and
Etsuji Tomita},
title = {Learning Attribute-Efficiently with Corrupt Oracles},
booktitle = {Algorithmic Learning Theory, 16th International Conference, {ALT}
2005, Singapore, October 8-11, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3734},
pages = {183--197},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11564089\_16},
doi = {10.1007/11564089\_16},
timestamp = {Fri, 08 Sep 2023 21:18:15 +0200},
biburl = {https://dblp.org/rec/conf/alt/BennetB05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BshoutyJT04,
author = {Nader H. Bshouty and
Jeffrey C. Jackson and
Christino Tamon},
title = {More efficient PAC-learning of {DNF} with membership queries under
the uniform distribution},
journal = {J. Comput. Syst. Sci.},
volume = {68},
number = {1},
pages = {205--234},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2003.10.002},
doi = {10.1016/J.JCSS.2003.10.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BshoutyJT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Bshouty04,
author = {Nader H. Bshouty},
editor = {John Shawe{-}Taylor and
Yoram Singer},
title = {Polynomial Time Prediction Strategy with Almost Optimal Mistake Probability},
booktitle = {Learning Theory, 17th Annual Conference on Learning Theory, {COLT}
2004, Banff, Canada, July 1-4, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3120},
pages = {64--76},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27819-1\_5},
doi = {10.1007/978-3-540-27819-1\_5},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/colt/Bshouty04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BishtBK04,
author = {Laurence Bisht and
Nader H. Bshouty and
Lawrance Khoury},
title = {Learning with Errors in Answers to Membership Queries},
booktitle = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19
October 2004, Rome, Italy, Proceedings},
pages = {611--620},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/FOCS.2004.37},
doi = {10.1109/FOCS.2004.37},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BishtBK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Bshouty03,
author = {Nader H. Bshouty},
title = {The monotone theory for the PAC-model},
journal = {Inf. Comput.},
volume = {186},
number = {1},
pages = {20--35},
year = {2003},
url = {https://doi.org/10.1016/S0890-5401(03)00116-0},
doi = {10.1016/S0890-5401(03)00116-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/Bshouty03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BshoutyJT03,
author = {Nader H. Bshouty and
Jeffrey C. Jackson and
Christino Tamon},
title = {Uniform-distribution attribute noise learnability},
journal = {Inf. Comput.},
volume = {187},
number = {2},
pages = {277--290},
year = {2003},
url = {https://doi.org/10.1016/S0890-5401(03)00135-4},
doi = {10.1016/S0890-5401(03)00135-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BshoutyJT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jmlr/BshoutyB03,
author = {Nader H. Bshouty and
Lynn Burroughs},
title = {On the Proper Learning of Axis-Parallel Concepts},
journal = {J. Mach. Learn. Res.},
volume = {4},
pages = {157--176},
year = {2003},
url = {https://jmlr.org/papers/v4/bshouty03a.html},
timestamp = {Wed, 11 Sep 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jmlr/BshoutyB03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BshoutyMOS03,
author = {Nader H. Bshouty and
Elchanan Mossel and
Ryan O'Donnell and
Rocco A. Servedio},
title = {Learning {DNF} from Random Walks},
booktitle = {44th Symposium on Foundations of Computer Science {(FOCS} 2003), 11-14
October 2003, Cambridge, MA, USA, Proceedings},
pages = {189--198},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/SFCS.2003.1238193},
doi = {10.1109/SFCS.2003.1238193},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BshoutyMOS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jmlr/BshoutyF02,
author = {Nader H. Bshouty and
Vitaly Feldman},
title = {On Using Extended Statistical Queries to Avoid Membership Queries},
journal = {J. Mach. Learn. Res.},
volume = {2},
pages = {359--395},
year = {2002},
url = {https://jmlr.org/papers/v2/bshouty02a.html},
timestamp = {Wed, 11 Sep 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jmlr/BshoutyF02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jmlr/BshoutyE02,
author = {Nader H. Bshouty and
Nadav Eiron},
title = {Learning Monotone {DNF} from a Teacher that Almost Does Not Answer
Membership Queries},
journal = {J. Mach. Learn. Res.},
volume = {3},
pages = {49--57},
year = {2002},
url = {https://jmlr.org/papers/v3/bshouty02a.html},
timestamp = {Wed, 11 Sep 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jmlr/BshoutyE02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jmlr/BshoutyG02,
author = {Nader H. Bshouty and
Dmitry Gavinsky},
title = {On Boosting with Polynomially Bounded Distributions},
journal = {J. Mach. Learn. Res.},
volume = {3},
pages = {483--506},
year = {2002},
url = {https://jmlr.org/papers/v3/bshouty02b.html},
timestamp = {Wed, 11 Sep 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jmlr/BshoutyG02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BshoutyM02,
author = {Nader H. Bshouty and
Yishay Mansour},
title = {Simple Learning Algorithms for Decision Trees and Multivariate Polynomials},
journal = {{SIAM} J. Comput.},
volume = {31},
number = {6},
pages = {1909--1925},
year = {2002},
url = {https://doi.org/10.1137/S009753979732058X},
doi = {10.1137/S009753979732058X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BshoutyM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BshoutyEK02,
author = {Nader H. Bshouty and
Nadav Eiron and
Eyal Kushilevitz},
title = {{PAC} learning with nasty noise},
journal = {Theor. Comput. Sci.},
volume = {288},
number = {2},
pages = {255--275},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(01)00403-0},
doi = {10.1016/S0304-3975(01)00403-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BshoutyEK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/BshoutyB02,
author = {Nader H. Bshouty and
Lynn Burroughs},
editor = {Nicol{\`{o}} Cesa{-}Bianchi and
Masayuki Numao and
R{\"{u}}diger Reischuk},
title = {Maximizing Agreements and CoAgnostic Learning},
booktitle = {Algorithmic Learning Theory, 13th International Conference, {ALT}
2002, L{\"{u}}beck, Germany, November 24-26, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2533},
pages = {83--97},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36169-3\_9},
doi = {10.1007/3-540-36169-3\_9},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/alt/BshoutyB02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BshoutyJT02,
author = {Nader H. Bshouty and
Jeffrey C. Jackson and
Christino Tamon},
editor = {Jyrki Kivinen and
Robert H. Sloan},
title = {Exploring Learnability between Exact and {PAC}},
booktitle = {Computational Learning Theory, 15th Annual Conference on Computational
Learning Theory, {COLT} 2002, Sydney, Australia, July 8-10, 2002,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2375},
pages = {244--254},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45435-7\_17},
doi = {10.1007/3-540-45435-7\_17},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/colt/BshoutyJT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BshoutyB02,
author = {Nader H. Bshouty and
Lynn Burroughs},
editor = {Jyrki Kivinen and
Robert H. Sloan},
title = {Bounds for the Minimum Disagreement Problem with Applications to Learning
Theory},
booktitle = {Computational Learning Theory, 15th Annual Conference on Computational
Learning Theory, {COLT} 2002, Sydney, Australia, July 8-10, 2002,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2375},
pages = {271--286},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45435-7\_19},
doi = {10.1007/3-540-45435-7\_19},
timestamp = {Sun, 21 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/BshoutyB02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BshoutyB02a,
author = {Nader H. Bshouty and
Lynn Burroughs},
editor = {Jyrki Kivinen and
Robert H. Sloan},
title = {On the Proper Learning of Axis Parallel Concepts},
booktitle = {Computational Learning Theory, 15th Annual Conference on Computational
Learning Theory, {COLT} 2002, Sydney, Australia, July 8-10, 2002,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2375},
pages = {287--302},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45435-7\_20},
doi = {10.1007/3-540-45435-7\_20},
timestamp = {Sun, 21 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/BshoutyB02a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BshoutyG02,
author = {Nader H. Bshouty and
Dmitry Gavinsky},
title = {{PAC} = PAExact and Other Equivalent Models in Learning},
booktitle = {43rd Symposium on Foundations of Computer Science {(FOCS} 2002), 16-19
November 2002, Vancouver, BC, Canada, Proceedings},
pages = {167--176},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/SFCS.2002.1181893},
doi = {10.1109/SFCS.2002.1181893},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BshoutyG02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-019,
author = {Nader H. Bshouty and
Lynn Burroughs},
title = {On the proper learning of axis parallel concepts},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-019}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-019/index.html},
eprinttype = {ECCC},
eprint = {TR02-019},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BshoutyG01,
author = {Nader H. Bshouty and
Dmitry Gavinsky},
editor = {David P. Helmbold and
Robert C. Williamson},
title = {On Boosting with Optimal Poly-Bounded Distributions},
booktitle = {Computational Learning Theory, 14th Annual Conference on Computational
Learning Theory, {COLT} 2001 and 5th European Conference on Computational
Learning Theory, EuroCOLT 2001, Amsterdam, The Netherlands, July 16-19,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2111},
pages = {490--506},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44581-1\_32},
doi = {10.1007/3-540-44581-1\_32},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/colt/BshoutyG01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BshoutyF01,
author = {Nader H. Bshouty and
Vitaly Feldman},
editor = {David P. Helmbold and
Robert C. Williamson},
title = {On Using Extended Statistical Queries to Avoid Membership Queries},
booktitle = {Computational Learning Theory, 14th Annual Conference on Computational
Learning Theory, {COLT} 2001 and 5th European Conference on Computational
Learning Theory, EuroCOLT 2001, Amsterdam, The Netherlands, July 16-19,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2111},
pages = {529--545},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44581-1\_35},
doi = {10.1007/3-540-44581-1\_35},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/BshoutyF01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BshoutyE01,
author = {Nader H. Bshouty and
Nadav Eiron},
editor = {David P. Helmbold and
Robert C. Williamson},
title = {Learning Monotone {DNF} from a Teacher That Almost Does Not Answer
Membership Queries},
booktitle = {Computational Learning Theory, 14th Annual Conference on Computational
Learning Theory, {COLT} 2001 and 5th European Conference on Computational
Learning Theory, EuroCOLT 2001, Amsterdam, The Netherlands, July 16-19,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2111},
pages = {546--557},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44581-1\_36},
doi = {10.1007/3-540-44581-1\_36},
timestamp = {Sun, 21 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/BshoutyE01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BshoutyO01,
author = {Nader H. Bshouty and
Avi Owshanko},
editor = {David P. Helmbold and
Robert C. Williamson},
title = {Learning Regular Sets with an Incomplete Membership Oracle},
booktitle = {Computational Learning Theory, 14th Annual Conference on Computational
Learning Theory, {COLT} 2001 and 5th European Conference on Computational
Learning Theory, EuroCOLT 2001, Amsterdam, The Netherlands, July 16-19,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2111},
pages = {574--588},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44581-1\_38},
doi = {10.1007/3-540-44581-1\_38},
timestamp = {Sun, 21 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/BshoutyO01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BeimelBBKV00,
author = {Amos Beimel and
Francesco Bergadano and
Nader H. Bshouty and
Eyal Kushilevitz and
Stefano Varricchio},
title = {Learning functions represented as multiplicity automata},
journal = {J. {ACM}},
volume = {47},
number = {3},
pages = {506--530},
year = {2000},
url = {https://doi.org/10.1145/337244.337257},
doi = {10.1145/337244.337257},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BeimelBBKV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BshoutyHW99,
author = {Nader H. Bshouty and
Lisa Higham and
Jolanta Warpechowska{-}Gruca},
title = {Meeting Times of Random Walks on Graphs},
journal = {Inf. Process. Lett.},
volume = {69},
number = {5},
pages = {259--265},
year = {1999},
url = {https://doi.org/10.1016/S0020-0190(99)00017-4},
doi = {10.1016/S0020-0190(99)00017-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BshoutyHW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Bshouty99,
author = {Nader H. Bshouty},
title = {Lower Bounds for the Complexity of Functions in a Realistic {RAM}
Model},
journal = {J. Algorithms},
volume = {32},
number = {1},
pages = {1--20},
year = {1999},
url = {https://doi.org/10.1006/jagm.1998.0994},
doi = {10.1006/JAGM.1998.0994},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Bshouty99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BshoutyJ99,
author = {Nader H. Bshouty and
Jeffrey C. Jackson},
title = {Learning {DNF} over the Uniform Distribution Using a Quantum Example
Oracle},
journal = {{SIAM} J. Comput.},
volume = {28},
number = {3},
pages = {1136--1153},
year = {1999},
url = {https://doi.org/10.1137/S0097539795293123},
doi = {10.1137/S0097539795293123},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BshoutyJ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/BshoutyEK98,
author = {Nader H. Bshouty and
Nadav Eiron and
Eyal Kushilevitz},
editor = {Osamu Watanabe and
Takashi Yokomori},
title = {{PAC} Learning with Nasty Noise},
booktitle = {Algorithmic Learning Theory, 10th International Conference, {ALT}
'99, Tokyo, Japan, December 6-8, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1720},
pages = {206--218},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-46769-6\_17},
doi = {10.1007/3-540-46769-6\_17},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/alt/BshoutyEK98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BshoutyJT99,
author = {Nader H. Bshouty and
Jeffrey C. Jackson and
Christino Tamon},
editor = {Shai Ben{-}David and
Philip M. Long},
title = {Uniform-Distribution Attribute Noise Learnability},
booktitle = {Proceedings of the Twelfth Annual Conference on Computational Learning
Theory, {COLT} 1999, Santa Cruz, CA, USA, July 7-9, 1999},
pages = {75--80},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/307400.307414},
doi = {10.1145/307400.307414},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/BshoutyJT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BshoutyW99,
author = {Nader H. Bshouty and
David K. Wilson},
editor = {Shai Ben{-}David and
Philip M. Long},
title = {On Learning in the Presence of Unspecified Attribute Values},
booktitle = {Proceedings of the Twelfth Annual Conference on Computational Learning
Theory, {COLT} 1999, Santa Cruz, CA, USA, July 7-9, 1999},
pages = {81--87},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/307400.307415},
doi = {10.1145/307400.307415},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/BshoutyW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BshoutyJT99a,
author = {Nader H. Bshouty and
Jeffrey C. Jackson and
Christino Tamon},
editor = {Shai Ben{-}David and
Philip M. Long},
title = {More Efficient PAC-Learning of {DNF} with Membership Queries Under
the Uniform Distribution},
booktitle = {Proceedings of the Twelfth Annual Conference on Computational Learning
Theory, {COLT} 1999, Santa Cruz, CA, USA, July 7-9, 1999},
pages = {286--295},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/307400.307472},
doi = {10.1145/307400.307472},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/BshoutyJT99a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/AbboudABRS99,
author = {Elias Abboud and
Nader Agha and
Nader H. Bshouty and
Nizar Radwan and
Fathi Saleh},
editor = {Shai Ben{-}David and
Philip M. Long},
title = {Learning Threshold Functions with Small Weights Using Membership Queries},
booktitle = {Proceedings of the Twelfth Annual Conference on Computational Learning
Theory, {COLT} 1999, Santa Cruz, CA, USA, July 7-9, 1999},
pages = {318--322},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/307400.307483},
doi = {10.1145/307400.307483},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/AbboudABRS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BshoutyTW98,
author = {Nader H. Bshouty and
Christino Tamon and
David K. Wilson},
title = {On Learning Decision Trees with Large Output Domains},
journal = {Algorithmica},
volume = {20},
number = {1},
pages = {77--100},
year = {1998},
url = {https://doi.org/10.1007/PL00009188},
doi = {10.1007/PL00009188},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BshoutyTW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BshoutyTW98a,
author = {Nader H. Bshouty and
Christino Tamon and
David K. Wilson},
title = {Learning Matrix Functions over Rings},
journal = {Algorithmica},
volume = {22},
number = {1/2},
pages = {91--111},
year = {1998},
url = {https://doi.org/10.1007/PL00013836},
doi = {10.1007/PL00013836},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BshoutyTW98a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BshoutyGM98,
author = {Nader H. Bshouty and
Sally A. Goldman and
H. David Mathias},
title = {Noise-Tolerant Parallel Learning of Geometric Concepts},
journal = {Inf. Comput.},
volume = {147},
number = {1},
pages = {89--110},
year = {1998},
url = {https://doi.org/10.1006/inco.1998.2737},
doi = {10.1006/INCO.1998.2737},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BshoutyGM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BshoutyTW98,
author = {Nader H. Bshouty and
Christino Tamon and
David K. Wilson},
title = {On Learning width Two Branching Programs},
journal = {Inf. Process. Lett.},
volume = {65},
number = {4},
pages = {217--222},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00204-4},
doi = {10.1016/S0020-0190(97)00204-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BshoutyTW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BshoutyGMST98,
author = {Nader H. Bshouty and
Sally A. Goldman and
H. David Mathias and
Subhash Suri and
Hisao Tamaki},
title = {Noise-Tolerant Distribution-Free Learning of General Geometric Concepts},
journal = {J. {ACM}},
volume = {45},
number = {5},
pages = {863--890},
year = {1998},
url = {https://doi.org/10.1145/290179.290184},
doi = {10.1145/290179.290184},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BshoutyGMST98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/Bshouty98,
author = {Nader H. Bshouty},
title = {On the Direct Sum Conjecture in the Straight Line Model},
journal = {J. Complex.},
volume = {14},
number = {1},
pages = {49--62},
year = {1998},
url = {https://doi.org/10.1006/jcom.1997.0466},
doi = {10.1006/JCOM.1997.0466},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jc/Bshouty98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BshoutyB98,
author = {Daoud Bshouty and
Nader H. Bshouty},
title = {On Interpolating Arithmetic Read-Once Formulas with Exponentiation},
journal = {J. Comput. Syst. Sci.},
volume = {56},
number = {1},
pages = {112--124},
year = {1998},
url = {https://doi.org/10.1006/jcss.1997.1550},
doi = {10.1006/JCSS.1997.1550},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BshoutyB98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BshoutyH98,
author = {Nader H. Bshouty and
Lisa Hellerstein},
title = {Attribute-Efficient Learning in Query and Mistake-Bound Models},
journal = {J. Comput. Syst. Sci.},
volume = {56},
number = {3},
pages = {310--319},
year = {1998},
url = {https://doi.org/10.1006/jcss.1998.1571},
doi = {10.1006/JCSS.1998.1571},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BshoutyH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BshoutyC98,
author = {Nader H. Bshouty and
Richard Cleve},
title = {Interpolating Arithmetic Read-Once Formulas in Parallel},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {2},
pages = {401--413},
year = {1998},
url = {https://doi.org/10.1137/S009753979528812X},
doi = {10.1137/S009753979528812X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BshoutyC98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BshoutyGGM98,
author = {Nader H. Bshouty and
Paul W. Goldberg and
Sally A. Goldman and
H. David Mathias},
title = {Exact Learning of Discretized Geometric Concepts},
journal = {{SIAM} J. Comput.},
volume = {28},
number = {2},
pages = {674--699},
year = {1998},
url = {https://doi.org/10.1137/S0097539794274246},
doi = {10.1137/S0097539794274246},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BshoutyGGM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BshoutyB98,
author = {Nader H. Bshouty and
Lynn Burroughs},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Massaging a Linear Programming Solution to Give a 2-Approximation
for a Generalization of the Vertex Cover Problem},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {298--308},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028569},
doi = {10.1007/BFB0028569},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BshoutyB98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Bshouty98,
author = {Nader H. Bshouty},
editor = {Jeffrey Scott Vitter},
title = {A New Composition Theorem for Learning Algorithms},
booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory
of Computing, Dallas, Texas, USA, May 23-26, 1998},
pages = {583--589},
publisher = {{ACM}},
year = {1998},
url = {https://doi.org/10.1145/276698.276873},
doi = {10.1145/276698.276873},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Bshouty98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR98-013,
author = {Nader H. Bshouty},
title = {A New Composition Theorem for Learning Algorithms},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR98-013}},
year = {1998},
url = {https://eccc.weizmann.ac.il/eccc-reports/1998/TR98-013/index.html},
eprinttype = {ECCC},
eprint = {TR98-013},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR98-013.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR98-076,
author = {Nader H. Bshouty and
Jeffrey C. Jackson and
Christino Tamon},
title = {Attribute Efficient {PAC} Learning of {DNF} with Membership Queries
under the Uniform Distribution},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR98-076}},
year = {1998},
url = {https://eccc.weizmann.ac.il/eccc-reports/1998/TR98-076/index.html},
eprinttype = {ECCC},
eprint = {TR98-076},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR98-076.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Bshouty97,
author = {Nader H. Bshouty},
title = {Simple Learning Algorithms Using Divide and Conquer},
journal = {Comput. Complex.},
volume = {6},
number = {2},
pages = {174--194},
year = {1997},
url = {https://doi.org/10.1007/BF01262930},
doi = {10.1007/BF01262930},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Bshouty97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bshouty97,
author = {Nader H. Bshouty},
title = {On Learning Multivariate Polynomials Under the Uniform Distribution},
journal = {Inf. Process. Lett.},
volume = {61},
number = {6},
pages = {303--309},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00021-5},
doi = {10.1016/S0020-0190(97)00021-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Bshouty97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BshoutyMST97,
author = {Nader H. Bshouty and
Yishay Mansour and
Baruch Schieber and
Prasoon Tiwari},
title = {A Tight Bound for Approximating the Square Root},
journal = {Inf. Process. Lett.},
volume = {63},
number = {4},
pages = {211--213},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00126-9},
doi = {10.1016/S0020-0190(97)00126-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BshoutyMST97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ml/Bshouty97,
author = {Nader H. Bshouty},
title = {Exact Learning of Formulas in Parallel},
journal = {Mach. Learn.},
volume = {26},
number = {1},
pages = {25--41},
year = {1997},
url = {https://doi.org/10.1023/A:1007320031970},
doi = {10.1023/A:1007320031970},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ml/Bshouty97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eurocolt/BshoutyTW97,
author = {Nader H. Bshouty and
Christino Tamon and
David K. Wilson},
editor = {Shai Ben{-}David},
title = {Learning Matrix Functions over Rings},
booktitle = {Computational Learning Theory, Third European Conference, EuroCOLT
'97, Jerusalem, Israel, March 17-19, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1208},
pages = {27--37},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62685-9\_4},
doi = {10.1007/3-540-62685-9\_4},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/eurocolt/BshoutyTW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eurocolt/BergadanoBTV97,
author = {Francesco Bergadano and
Nader H. Bshouty and
Christino Tamon and
Stefano Varricchio},
editor = {Shai Ben{-}David},
title = {On Learning Programs and Small Depth Circuits},
booktitle = {Computational Learning Theory, Third European Conference, EuroCOLT
'97, Jerusalem, Israel, March 17-19, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1208},
pages = {150--161},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62685-9\_13},
doi = {10.1007/3-540-62685-9\_13},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/eurocolt/BergadanoBTV97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Ben-DavidBK97,
author = {Shai Ben{-}David and
Nader H. Bshouty and
Eyal Kushilevitz},
editor = {Frank Thomson Leighton and
Peter W. Shor},
title = {A Composition Theorem for Learning Algorithms with Applications to
Geometric Concept Classes},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM} Symposium on the Theory
of Computing, El Paso, Texas, USA, May 4-6, 1997},
pages = {324--333},
publisher = {{ACM}},
year = {1997},
url = {https://doi.org/10.1145/258533.258614},
doi = {10.1145/258533.258614},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Ben-DavidBK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bshouty96,
author = {Nader H. Bshouty},
title = {A Subexponential Exact Learning Algorithm for {DNF} Using Equivalence
Queries},
journal = {Inf. Process. Lett.},
volume = {59},
number = {1},
pages = {37--39},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(96)00077-4},
doi = {10.1016/0020-0190(96)00077-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Bshouty96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BshoutyT96,
author = {Nader H. Bshouty and
Christino Tamon},
title = {On the Fourier Spectrum of Monotone Functions},
journal = {J. {ACM}},
volume = {43},
number = {4},
pages = {747--770},
year = {1996},
url = {https://doi.org/10.1145/234533.234564},
doi = {10.1145/234533.234564},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BshoutyT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BshoutyGHM96,
author = {Nader H. Bshouty and
Sally A. Goldman and
Thomas R. Hancock and
Sleiman Matar},
title = {Asking Questions to Minimize Errors},
journal = {J. Comput. Syst. Sci.},
volume = {52},
number = {2},
pages = {268--286},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0021},
doi = {10.1006/JCSS.1996.0021},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BshoutyGHM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BshoutyCGKT96,
author = {Nader H. Bshouty and
Richard Cleve and
Ricard Gavald{\`{a}} and
Sampath Kannan and
Christino Tamon},
title = {Oracles and Queries That Are Sufficient for Exact Learning},
journal = {J. Comput. Syst. Sci.},
volume = {52},
number = {3},
pages = {421--433},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0032},
doi = {10.1006/JCSS.1996.0032},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BshoutyCGKT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BshoutyTW96,
author = {Nader H. Bshouty and
Christino Tamon and
David K. Wilson},
editor = {Avrim Blum and
Michael J. Kearns},
title = {On Learning width Two Branching Programs (Extended Abstract)},
booktitle = {Proceedings of the Ninth Annual Conference on Computational Learning
Theory, {COLT} 1996, Desenzano del Garda, Italy, June 28-July 1, 1996},
pages = {224--227},
publisher = {{ACM}},
year = {1996},
url = {https://doi.org/10.1145/238061.238102},
doi = {10.1145/238061.238102},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/BshoutyTW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BshoutyH96,
author = {Nader H. Bshouty and
Lisa Hellerstein},
editor = {Avrim Blum and
Michael J. Kearns},
title = {Attribute-Efficient Learning in Query and Mistake-Bound Models},
booktitle = {Proceedings of the Ninth Annual Conference on Computational Learning
Theory, {COLT} 1996, Desenzano del Garda, Italy, June 28-July 1, 1996},
pages = {235--243},
publisher = {{ACM}},
year = {1996},
url = {https://doi.org/10.1145/238061.238108},
doi = {10.1145/238061.238108},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/BshoutyH96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BeimelBBKV96,
author = {Amos Beimel and
Francesco Bergadano and
Nader H. Bshouty and
Eyal Kushilevitz and
Stefano Varricchio},
title = {On the Applications of Multiplicity Automata in Learning},
booktitle = {37th Annual Symposium on Foundations of Computer Science, {FOCS} '96,
Burlington, Vermont, USA, 14-16 October, 1996},
pages = {349--358},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/SFCS.1996.548494},
doi = {10.1109/SFCS.1996.548494},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BeimelBBKV96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Bshouty96,
author = {Nader H. Bshouty},
editor = {Gary L. Miller},
title = {Towards the Learnability of {DNF} Formulae},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM} Symposium on the Theory
of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996},
pages = {131--140},
publisher = {{ACM}},
year = {1996},
url = {https://doi.org/10.1145/237814.237848},
doi = {10.1145/237814.237848},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Bshouty96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BshoutyGMST96,
author = {Nader H. Bshouty and
Sally A. Goldman and
H. David Mathias and
Subhash Suri and
Hisao Tamaki},
editor = {Gary L. Miller},
title = {Noise-Tolerant Distribution-Free Learning of General Geometric Concepts},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM} Symposium on the Theory
of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996},
pages = {151--160},
publisher = {{ACM}},
year = {1996},
url = {https://doi.org/10.1145/237814.237854},
doi = {10.1145/237814.237854},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BshoutyGMST96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR96-008,
author = {Francesco Bergadano and
Nader H. Bshouty and
Stefano Varricchio},
title = {Learning Multivariate Polynomials from Substitution and Equivalence
Queries},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR96-008}},
year = {1996},
url = {https://eccc.weizmann.ac.il/eccc-reports/1996/TR96-008/index.html},
eprinttype = {ECCC},
eprint = {TR96-008},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR96-008.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR96-009,
author = {Francesco Bergadano and
Nader H. Bshouty and
Christino Tamon and
Stefano Varricchio},
title = {On Learning Branching Programs and Small Depth Circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR96-009}},
year = {1996},
url = {https://eccc.weizmann.ac.il/eccc-reports/1996/TR96-009/index.html},
eprinttype = {ECCC},
eprint = {TR96-009},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR96-009.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR96-059,
author = {Shai Ben{-}David and
Nader H. Bshouty and
Eyal Kushilevitz},
title = {A Composition Theorem for Learning Algorithms with Applications to
Geometric Concept Classes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR96-059}},
year = {1996},
url = {https://eccc.weizmann.ac.il/eccc-reports/1996/TR96-059/index.html},
eprinttype = {ECCC},
eprint = {TR96-059},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR96-059.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Bshouty95,
author = {Nader H. Bshouty},
title = {Exact Learning Boolean Function via the Monotone Theory},
journal = {Inf. Comput.},
volume = {123},
number = {1},
pages = {146--153},
year = {1995},
url = {https://doi.org/10.1006/inco.1995.1164},
doi = {10.1006/INCO.1995.1164},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/Bshouty95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bshouty95,
author = {Nader H. Bshouty},
title = {On the Additive Complexity of 2 x 2 Matrix Multiplication},
journal = {Inf. Process. Lett.},
volume = {56},
number = {6},
pages = {329--335},
year = {1995},
url = {https://doi.org/10.1016/0020-0190(95)00176-X},
doi = {10.1016/0020-0190(95)00176-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Bshouty95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BshoutyHH95,
author = {Nader H. Bshouty and
Thomas R. Hancock and
Lisa Hellerstein},
title = {Learning Boolean Read-Once Formulas over Generalized Bases},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {3},
pages = {521--542},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1042},
doi = {10.1006/JCSS.1995.1042},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BshoutyHH95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BshoutyCE95,
author = {Nader H. Bshouty and
Richard Cleve and
Wayne Eberly},
title = {Size-Depth Tradeoffs for Algebraic Formulas},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {4},
pages = {682--705},
year = {1995},
url = {https://doi.org/10.1137/S0097539792232586},
doi = {10.1137/S0097539792232586},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BshoutyCE95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BshoutyHH95,
author = {Nader H. Bshouty and
Thomas R. Hancock and
Lisa Hellerstein},
title = {Learning Arithmetic Read-Once Formulas},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {4},
pages = {706--735},
year = {1995},
url = {https://doi.org/10.1137/S009753979223664X},
doi = {10.1137/S009753979223664X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BshoutyHH95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Bshouty95,
author = {Nader H. Bshouty},
editor = {Wolfgang Maass},
title = {A Note on Learning Multivariate Polynomials Under the Uniform Distribution
(Extended Abstract)},
booktitle = {Proceedings of the Eigth Annual Conference on Computational Learning
Theory, {COLT} 1995, Santa Cruz, California, USA, July 5-8, 1995},
pages = {79--82},
publisher = {{ACM}},
year = {1995},
url = {https://doi.org/10.1145/225298.225307},
doi = {10.1145/225298.225307},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/Bshouty95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BshoutyJ95,
author = {Nader H. Bshouty and
Jeffrey C. Jackson},
editor = {Wolfgang Maass},
title = {Learning {DNF} over the Uniform Distribution using a Quantum Example
Oracle},
booktitle = {Proceedings of the Eigth Annual Conference on Computational Learning
Theory, {COLT} 1995, Santa Cruz, California, USA, July 5-8, 1995},
pages = {118--127},
publisher = {{ACM}},
year = {1995},
url = {https://doi.org/10.1145/225298.225312},
doi = {10.1145/225298.225312},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/BshoutyJ95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BshoutyTW95,
author = {Nader H. Bshouty and
Christino Tamon and
David K. Wilson},
editor = {Wolfgang Maass},
title = {On Learning Decision Trees with Large Output Domains (Extended Abstract)},
booktitle = {Proceedings of the Eigth Annual Conference on Computational Learning
Theory, {COLT} 1995, Santa Cruz, California, USA, July 5-8, 1995},
pages = {190--197},
publisher = {{ACM}},
year = {1995},
url = {https://doi.org/10.1145/225298.225321},
doi = {10.1145/225298.225321},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/BshoutyTW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BshoutyCDH95,
author = {Nader H. Bshouty and
Zhixiang Chen and
Scott E. Decatur and
Steven Homer},
editor = {Wolfgang Maass},
title = {On the Learnability of \emph{Z}\({}_{\mbox{n}}\)-DNF Formulas (Extended
Abstract)},
booktitle = {Proceedings of the Eigth Annual Conference on Computational Learning
Theory, {COLT} 1995, Santa Cruz, California, USA, July 5-8, 1995},
pages = {198--205},
publisher = {{ACM}},
year = {1995},
url = {https://doi.org/10.1145/225298.225322},
doi = {10.1145/225298.225322},
timestamp = {Wed, 04 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/BshoutyCDH95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BshoutyGM95,
author = {Nader H. Bshouty and
Sally A. Goldman and
H. David Mathias},
editor = {Wolfgang Maass},
title = {Noise-Tolerant Parallel Learning of Geometric Concepts},
booktitle = {Proceedings of the Eigth Annual Conference on Computational Learning
Theory, {COLT} 1995, Santa Cruz, California, USA, July 5-8, 1995},
pages = {345--352},
publisher = {{ACM}},
year = {1995},
url = {https://doi.org/10.1145/225298.225340},
doi = {10.1145/225298.225340},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/BshoutyGM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Bshouty95a,
author = {Nader H. Bshouty},
editor = {Wolfgang Maass},
title = {Simple Learning Algorithms Using Divide and Conquer},
booktitle = {Proceedings of the Eigth Annual Conference on Computational Learning
Theory, {COLT} 1995, Santa Cruz, California, USA, July 5-8, 1995},
pages = {447--453},
publisher = {{ACM}},
year = {1995},
url = {https://doi.org/10.1145/225298.225352},
doi = {10.1145/225298.225352},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/Bshouty95a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BshoutyM95,
author = {Nader H. Bshouty and
Yishay Mansour},
title = {Simple Learning Algorithms for Decision Trees and Multivariate Polynomials},
booktitle = {36th Annual Symposium on Foundations of Computer Science, Milwaukee,
Wisconsin, USA, 23-25 October 1995},
pages = {304--311},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SFCS.1995.492486},
doi = {10.1109/SFCS.1995.492486},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BshoutyM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BshoutyT95,
author = {Nader H. Bshouty and
Christino Tamon},
editor = {Frank Thomson Leighton and
Allan Borodin},
title = {On the Fourier spectrum of monotone functions (Extended Abstract)},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory
of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}},
pages = {219--228},
publisher = {{ACM}},
year = {1995},
url = {https://doi.org/10.1145/225058.225125},
doi = {10.1145/225058.225125},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BshoutyT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR95-008,
author = {Nader H. Bshouty},
title = {Exact Learning Boolean Functions via the Monotone Theory},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR95-008}},
year = {1995},
url = {https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-008/index.html},
eprinttype = {ECCC},
eprint = {TR95-008},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR95-008.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR95-015,
author = {Nader H. Bshouty and
Richard Cleve and
Ricard Gavald{\`{a}} and
Sampath Kannan and
Christino Tamon},
title = {Oracles and Queries That Are Sufficient for Exact Learning},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR95-015}},
year = {1995},
url = {https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-015/index.html},
eprinttype = {ECCC},
eprint = {TR95-015},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR95-015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR95-032,
author = {Nader H. Bshouty and
Christino Tamon},
title = {On the Fourier spectrum of Monotone Functions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR95-032}},
year = {1995},
url = {https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-032/index.html},
eprinttype = {ECCC},
eprint = {TR95-032},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR95-032.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR95-059,
author = {Nader H. Bshouty},
title = {The Monotone Theory for the PAC-Model},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR95-059}},
year = {1995},
url = {https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-059/index.html},
eprinttype = {ECCC},
eprint = {TR95-059},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR95-059.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR95-060,
author = {Nader H. Bshouty},
title = {A Subexponential Exact Learning Algorithm for {DNF} Using Equivalence
Queries},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR95-060}},
year = {1995},
url = {https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-060/index.html},
eprinttype = {ECCC},
eprint = {TR95-060},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR95-060.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BshoutyHHK94,
author = {Nader H. Bshouty and
Thomas R. Hancock and
Lisa Hellerstein and
Marek Karpinski},
title = {An Algorithm to Learn Read-Once Threshold Formulas, and Transformations
Between Learning Models},
journal = {Comput. Complex.},
volume = {4},
pages = {37--61},
year = {1994},
url = {https://doi.org/10.1007/BF01205054},
doi = {10.1007/BF01205054},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BshoutyHHK94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Bshouty94,
author = {Nader H. Bshouty},
title = {On the Complexity of Bilinear Forms over Associative Algebras},
journal = {{SIAM} J. Comput.},
volume = {23},
number = {4},
pages = {815--833},
year = {1994},
url = {https://doi.org/10.1137/S0097539790192696},
doi = {10.1137/S0097539790192696},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Bshouty94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BshoutyCKT94,
author = {Nader H. Bshouty and
Richard Cleve and
Sampath Kannan and
Christino Tamon},
editor = {Manfred K. Warmuth},
title = {Oracles and Queries that are Sufficient for Exact Learning (Extended
Abstract)},
booktitle = {Proceedings of the Seventh Annual {ACM} Conference on Computational
Learning Theory, {COLT} 1994, New Brunswick, NJ, USA, July 12-15,
1994},
pages = {130--139},
publisher = {{ACM}},
year = {1994},
url = {https://doi.org/10.1145/180139.181067},
doi = {10.1145/180139.181067},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/BshoutyCKT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BshoutyB94,
author = {Daoud Bshouty and
Nader H. Bshouty},
editor = {Manfred K. Warmuth},
title = {On Learning Arithmetic Read-Once Formulas with Exponentiation (Extended
Abstract)},
booktitle = {Proceedings of the Seventh Annual {ACM} Conference on Computational
Learning Theory, {COLT} 1994, New Brunswick, NJ, USA, July 12-15,
1994},
pages = {311--317},
publisher = {{ACM}},
year = {1994},
url = {https://doi.org/10.1145/180139.181163},
doi = {10.1145/180139.181163},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/BshoutyB94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BshoutyCH94,
author = {Nader H. Bshouty and
Zhixiang Chen and
Steven Homer},
title = {On Learning Discretized Geometric Concepts (Extended Abstract)},
booktitle = {35th Annual Symposium on Foundations of Computer Science, Santa Fe,
New Mexico, USA, 20-22 November 1994},
pages = {54--63},
publisher = {{IEEE} Computer Society},
year = {1994},
url = {https://doi.org/10.1109/SFCS.1994.365705},
doi = {10.1109/SFCS.1994.365705},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BshoutyCH94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Bshouty93,
author = {Nader H. Bshouty},
title = {On the Complexity of Functions for Random Access Machines},
journal = {J. {ACM}},
volume = {40},
number = {2},
pages = {211--223},
year = {1993},
url = {https://doi.org/10.1145/151261.151262},
doi = {10.1145/151261.151262},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Bshouty93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BshoutyGHM93,
author = {Nader H. Bshouty and
Sally A. Goldman and
Thomas R. Hancock and
Sleiman Matar},
editor = {Lenny Pitt},
title = {Asking Questions to Minimize Errors},
booktitle = {Proceedings of the Sixth Annual {ACM} Conference on Computational
Learning Theory, {COLT} 1993, Santa Cruz, CA, USA, July 26-28, 1993},
pages = {41--50},
publisher = {{ACM}},
year = {1993},
url = {https://doi.org/10.1145/168304.168310},
doi = {10.1145/168304.168310},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/BshoutyGHM93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Bshouty93,
author = {Nader H. Bshouty},
editor = {Thomas Lengauer},
title = {On the Direct Sum Conjecture in the Straight Line Model},
booktitle = {Algorithms - {ESA} '93, First Annual European Symposium, Bad Honnef,
Germany, September 30 - October 2, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {726},
pages = {85--96},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57273-2\_46},
doi = {10.1007/3-540-57273-2\_46},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/Bshouty93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Bshouty93,
author = {Nader H. Bshouty},
title = {Exact Learning via the Monotone Theory (Extended Abstract)},
booktitle = {34th Annual Symposium on Foundations of Computer Science, Palo Alto,
California, USA, 3-5 November 1993},
pages = {302--311},
publisher = {{IEEE} Computer Society},
year = {1993},
url = {https://doi.org/10.1109/SFCS.1993.366857},
doi = {10.1109/SFCS.1993.366857},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Bshouty93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BshoutyMST92,
author = {Nader H. Bshouty and
Yishay Mansour and
Baruch Schieber and
Prasoon Tiwari},
title = {Fast Exponentiation Using the Truncation Operation},
journal = {Comput. Complex.},
volume = {2},
pages = {244--255},
year = {1992},
url = {https://doi.org/10.1007/BF01272076},
doi = {10.1007/BF01272076},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BshoutyMST92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bshouty92,
author = {Nader H. Bshouty},
title = {A Lower Bound for the Multiplication of Polynomials Modulo a Polynomial},
journal = {Inf. Process. Lett.},
volume = {41},
number = {6},
pages = {321--326},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90159-S},
doi = {10.1016/0020-0190(92)90159-S},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Bshouty92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/AverbuchBK92,
author = {Amir Averbuch and
Nader H. Bshouty and
Michael Kaminski},
title = {A Classification of Algorithms for Multiplying Polynomials of Small
Degree over Finite Fields},
journal = {J. Algorithms},
volume = {13},
number = {4},
pages = {577--588},
year = {1992},
url = {https://doi.org/10.1016/0196-6774(92)90057-J},
doi = {10.1016/0196-6774(92)90057-J},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/AverbuchBK92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BshoutyHH92,
author = {Nader H. Bshouty and
Thomas R. Hancock and
Lisa Hellerstein},
editor = {David Haussler},
title = {Learning Boolean Read-Once Formulas with Arbitrary Symmetric and Constant
Fan-in Gates},
booktitle = {Proceedings of the Fifth Annual {ACM} Conference on Computational
Learning Theory, {COLT} 1992, Pittsburgh, PA, USA, July 27-29, 1992},
pages = {1--15},
publisher = {{ACM}},
year = {1992},
url = {https://doi.org/10.1145/130385.130386},
doi = {10.1145/130385.130386},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/BshoutyHH92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BshoutyC92,
author = {Nader H. Bshouty and
Richard Cleve},
title = {On the Exact Learning of Formulas in Parallel (Extended Abstract)},
booktitle = {33rd Annual Symposium on Foundations of Computer Science, Pittsburgh,
Pennsylvania, USA, 24-27 October 1992},
pages = {513--522},
publisher = {{IEEE} Computer Society},
year = {1992},
url = {https://doi.org/10.1109/SFCS.1992.267800},
doi = {10.1109/SFCS.1992.267800},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BshoutyC92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icci/BshoutyF92,
author = {Nader H. Bshouty and
Geoffrey T. Falk},
editor = {Waldemar W. Koczkodaj and
Peter E. Lauer and
Anestis A. Toptsis},
title = {Compression of Dictionaries via Extensions to Front Coding},
booktitle = {Computing and Information - ICCI'92, Fourth International Conference
on Computing and Information, Toronto, Ontario, Canada, May 28-30,
1992, Proceedings},
pages = {361--364},
publisher = {{IEEE} Computer Society},
year = {1992},
timestamp = {Mon, 15 Apr 2002 13:14:05 +0200},
biburl = {https://dblp.org/rec/conf/icci/BshoutyF92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/istcs/Bshouty92,
author = {Nader H. Bshouty},
editor = {Danny Dolev and
Zvi Galil and
Michael Rodeh},
title = {Lower Bounds for the Complexity of Functions in a Realistic {RAM}
Model},
booktitle = {Theory of Computing and Systems, ISTCS'92, Israel Symposium, Haifa,
Israel, May 1992},
series = {Lecture Notes in Computer Science},
volume = {601},
pages = {12--23},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/BFb0035162},
doi = {10.1007/BFB0035162},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/istcs/Bshouty92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BshoutyHH92,
author = {Nader H. Bshouty and
Thomas R. Hancock and
Lisa Hellerstein},
editor = {S. Rao Kosaraju and
Mike Fellows and
Avi Wigderson and
John A. Ellis},
title = {Learning Arithmetic Read-Once Formulas},
booktitle = {Proceedings of the 24th Annual {ACM} Symposium on Theory of Computing,
May 4-6, 1992, Victoria, British Columbia, Canada},
pages = {370--381},
publisher = {{ACM}},
year = {1992},
url = {https://doi.org/10.1145/129712.129747},
doi = {10.1145/129712.129747},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BshoutyHH92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BshoutyCE91,
author = {Nader H. Bshouty and
Richard Cleve and
Wayne Eberly},
title = {Size-Depth Tradeoffs for Algebraic Formulae},
booktitle = {32nd Annual Symposium on Foundations of Computer Science, San Juan,
Puerto Rico, 1-4 October 1991},
pages = {334--341},
publisher = {{IEEE} Computer Society},
year = {1991},
url = {https://doi.org/10.1109/SFCS.1991.185387},
doi = {10.1109/SFCS.1991.185387},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BshoutyCE91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icci/Bshouty91,
author = {Nader H. Bshouty},
editor = {Frank K. H. A. Dehne and
Frantisek Fiala and
Waldemar W. Koczkodaj},
title = {Lower Bounds for Algebraic Computation Trees of Functions with Finite
Domains},
booktitle = {Advances in Computing and Information - ICCI'91, International Conference
on Computing and Information, Ottawa, Canada, May 27-29, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {497},
pages = {55--65},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/3-540-54029-6\_154},
doi = {10.1007/3-540-54029-6\_154},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/icci/Bshouty91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BshoutyK90,
author = {Nader H. Bshouty and
Michael Kaminski},
title = {Multiplication of Polynomials over Finite Fields},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {3},
pages = {452--456},
year = {1990},
url = {https://doi.org/10.1137/0219029},
doi = {10.1137/0219029},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BshoutyK90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Bshouty90,
author = {Nader H. Bshouty},
title = {Maximal Rank of m x n x (mn - k) Tensors},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {3},
pages = {467--471},
year = {1990},
url = {https://doi.org/10.1137/0219031},
doi = {10.1137/0219031},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Bshouty90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BshoutyS90,
author = {Nader H. Bshouty and
Gadiel Seroussi},
title = {Generalizations of the Normal Basis Theorem of Finite Fields},
journal = {{SIAM} J. Discret. Math.},
volume = {3},
number = {3},
pages = {330--337},
year = {1990},
url = {https://doi.org/10.1137/0403028},
doi = {10.1137/0403028},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BshoutyS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KaminskiB89,
author = {Michael Kaminski and
Nader H. Bshouty},
title = {Multiplicative complexity of polynomial multiplication over finite
fields},
journal = {J. {ACM}},
volume = {36},
number = {1},
pages = {150--170},
year = {1989},
url = {https://doi.org/10.1145/58562.59306},
doi = {10.1145/58562.59306},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KaminskiB89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Bshouty89,
author = {Nader H. Bshouty},
title = {A Lower Bound for Matrix Multiplication},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {4},
pages = {759--765},
year = {1989},
url = {https://doi.org/10.1137/0218052},
doi = {10.1137/0218052},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Bshouty89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Bshouty89,
author = {Nader H. Bshouty},
editor = {David S. Johnson},
title = {On the Extended Direct Sum Conjecture},
booktitle = {Proceedings of the 21st Annual {ACM} Symposium on Theory of Computing,
May 14-17, 1989, Seattle, Washington, {USA}},
pages = {177--185},
publisher = {{ACM}},
year = {1989},
url = {https://doi.org/10.1145/73007.73024},
doi = {10.1145/73007.73024},
timestamp = {Wed, 24 Nov 2021 12:15:31 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Bshouty89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/KaminskiKB88,
author = {Michael Kaminski and
David G. Kirkpatrick and
Nader H. Bshouty},
title = {Addition Requirements for Matrix and Transposed Matrix Products},
journal = {J. Algorithms},
volume = {9},
number = {3},
pages = {354--364},
year = {1988},
url = {https://doi.org/10.1016/0196-6774(88)90026-0},
doi = {10.1016/0196-6774(88)90026-0},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/KaminskiKB88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/SeroussiB88,
author = {Gadiel Seroussi and
Nader H. Bshouty},
title = {Vector sets for exhaustive testing of logic circuits},
journal = {{IEEE} Trans. Inf. Theory},
volume = {34},
number = {3},
pages = {513--522},
year = {1988},
url = {https://doi.org/10.1109/18.6031},
doi = {10.1109/18.6031},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/SeroussiB88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Bshouty88,
author = {Nader H. Bshouty},
title = {A Lower Bound for Matrix Multiplication},
booktitle = {29th Annual Symposium on Foundations of Computer Science, White Plains,
New York, USA, 24-26 October 1988},
pages = {64--67},
publisher = {{IEEE} Computer Society},
year = {1988},
url = {https://doi.org/10.1109/SFCS.1988.21922},
doi = {10.1109/SFCS.1988.21922},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Bshouty88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KaminskiB87,
author = {Michael Kaminski and
Nader H. Bshouty},
title = {Multiplicative complexity of polynomial multiplication over finite
fields (Extended abstract)},
booktitle = {28th Annual Symposium on Foundations of Computer Science, Los Angeles,
California, USA, 27-29 October 1987},
pages = {138--140},
publisher = {{IEEE} Computer Society},
year = {1987},
url = {https://doi.org/10.1109/SFCS.1987.41},
doi = {10.1109/SFCS.1987.41},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KaminskiB87.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-09-18 01:10 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:
