Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Richard Beigel
@article{DBLP:journals/tcs/BeigelG16,
author = {Richard Beigel and
William I. Gasarch},
title = {On the sizes of DPDAs, PDAs, LBAs},
journal = {Theor. Comput. Sci.},
volume = {638},
pages = {63--75},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2015.08.028},
doi = {10.1016/J.TCS.2015.08.028},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BeigelG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BeigelG15,
author = {Richard Beigel and
William I. Gasarch},
title = {On the Sizes of DPDAs, PDAs, LBAs},
journal = {CoRR},
volume = {abs/1503.08847},
year = {2015},
url = {http://arxiv.org/abs/1503.08847},
eprinttype = {arXiv},
eprint = {1503.08847},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BeigelG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mobihoc/Beigel0Z14,
author = {Richard Beigel and
Jie Wu and
Huanyang Zheng},
editor = {Mario Gerla and
Yanyong Zhang},
title = {On optimal scheduling of multiple mobile chargers in wireless sensor
networks},
booktitle = {Proceedings of the first international workshop on Mobile sensing,
computing and communication, MSCC@MobiHoc 2014, Philadelphia, Pennsylvania,
USA, August 11, 2014},
pages = {1--6},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2633675.2633676},
doi = {10.1145/2633675.2633676},
timestamp = {Tue, 06 Nov 2018 11:07:07 +0100},
biburl = {https://dblp.org/rec/conf/mobihoc/Beigel0Z14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/BeigelF12,
author = {Richard Beigel and
Bin Fu},
editor = {Jack Snoeyink and
Pinyan Lu and
Kaile Su and
Lusheng Wang},
title = {A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin
Packing},
booktitle = {Frontiers in Algorithmics and Algorithmic Aspects in Information and
Management - Joint International Conference, {FAW-AAIM} 2012, Beijing,
China, May 14-16, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7285},
pages = {172--181},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-29700-7\_16},
doi = {10.1007/978-3-642-29700-7\_16},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/aaim/BeigelF12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeigelF11,
author = {Richard Beigel and
Bin Fu},
title = {A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin
Packing},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-028}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/028},
eprinttype = {ECCC},
eprint = {TR11-028},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeigelF11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1007-1260,
author = {Richard Beigel and
Bin Fu},
title = {A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin
Packing},
journal = {CoRR},
volume = {abs/1007.1260},
year = {2010},
url = {http://arxiv.org/abs/1007.1260},
eprinttype = {arXiv},
eprint = {1007.1260},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1007-1260.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BeigelFG06,
author = {Richard Beigel and
Lance Fortnow and
William I. Gasarch},
title = {A tight lower bound for restricted pir protocols},
journal = {Comput. Complex.},
volume = {15},
number = {1},
pages = {82--91},
year = {2006},
url = {https://doi.org/10.1007/s00037-006-0208-3},
doi = {10.1007/S00037-006-0208-3},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BeigelFG06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/BeigelBFFGLMST06,
author = {Richard Beigel and
Harry Buhrman and
Peter A. Fejer and
Lance Fortnow and
Piotr Grabowski and
Luc Longpr{\'{e}} and
Andrej Muchnik and
Frank Stephan and
Leen Torenvliet},
title = {Enumerations of the Kolmogorov function},
journal = {J. Symb. Log.},
volume = {71},
number = {2},
pages = {501--528},
year = {2006},
url = {https://doi.org/10.2178/jsl/1146620156},
doi = {10.2178/JSL/1146620156},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/BeigelBFFGLMST06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BeigelFS06,
author = {Richard Beigel and
Lance Fortnow and
Frank Stephan},
title = {Infinitely-Often Autoreducible Sets},
journal = {{SIAM} J. Comput.},
volume = {36},
number = {3},
pages = {595--608},
year = {2006},
url = {https://doi.org/10.1137/S0097539704441630},
doi = {10.1137/S0097539704441630},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BeigelFS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BeigelGG06,
author = {Richard Beigel and
William I. Gasarch and
James Glenn},
editor = {Rastislav Kralovic and
Pawel Urzyczyn},
title = {The Multiparty Communication Complexity of Exact-\emph{T}: Improved
Bounds and New Problems},
booktitle = {Mathematical Foundations of Computer Science 2006, 31st International
Symposium, {MFCS} 2006, Star{\'{a}} Lesn{\'{a}}, Slovakia,
August 28-September 1, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4162},
pages = {146--156},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11821069\_13},
doi = {10.1007/11821069\_13},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BeigelGG06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BeigelE05,
author = {Richard Beigel and
David Eppstein},
title = {3-coloring in time O(1.3289\({}^{\mbox{n}}\))},
journal = {J. Algorithms},
volume = {54},
number = {2},
pages = {168--204},
year = {2005},
url = {https://doi.org/10.1016/j.jalgor.2004.06.008},
doi = {10.1016/J.JALGOR.2004.06.008},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/BeigelE05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AlonBKRS04,
author = {Noga Alon and
Richard Beigel and
Simon Kasif and
Steven Rudich and
Benny Sudakov},
title = {Learning a Hidden Matching},
journal = {{SIAM} J. Comput.},
volume = {33},
number = {2},
pages = {487--501},
year = {2004},
url = {https://doi.org/10.1137/S0097539702420139},
doi = {10.1137/S0097539702420139},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AlonBKRS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DahllofJB04,
author = {Vilhelm Dahll{\"{o}}f and
Peter Jonsson and
Richard Beigel},
title = {Algorithms for four variants of the exact satisfiability problem},
journal = {Theor. Comput. Sci.},
volume = {320},
number = {2-3},
pages = {373--394},
year = {2004},
url = {https://doi.org/10.1016/j.tcs.2004.02.035},
doi = {10.1016/J.TCS.2004.02.035},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DahllofJB04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FuB04,
author = {Bin Fu and
Richard Beigel},
editor = {Rudolf Fleischer and
Gerhard Trippen},
title = {Diagnosis in the Presence of Intermittent Faults},
booktitle = {Algorithms and Computation, 15th International Symposium, {ISAAC}
2004, Hong Kong, China, December 20-22, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3341},
pages = {427--441},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30551-4\_38},
doi = {10.1007/978-3-540-30551-4\_38},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/FuB04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-015,
author = {Richard Beigel and
Harry Buhrman and
Peter A. Fejer and
Lance Fortnow and
Piotr Grabowski and
Luc Longpr{\'{e}} and
Andrei A. Muchnik and
Frank Stephan and
Leen Torenvliet},
title = {Enumerations of the Kolmogorov Function},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-015}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-015/index.html},
eprinttype = {ECCC},
eprint = {TR04-015},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/AmirBG03,
author = {Amihood Amir and
Richard Beigel and
William I. Gasarch},
title = {Some connections between bounded query classes and non-uniform complexity},
journal = {Inf. Comput.},
volume = {186},
number = {1},
pages = {104--139},
year = {2003},
url = {https://doi.org/10.1016/S0890-5401(03)00091-9},
doi = {10.1016/S0890-5401(03)00091-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/AmirBG03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeigelF03,
author = {Richard Beigel and
Lance Fortnow},
title = {Are Cook and Karp Ever the Same?},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {333--336},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214431},
doi = {10.1109/CCC.2003.1214431},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BeigelF03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BeigelFS03,
author = {Richard Beigel and
Lance Fortnow and
Frank Stephan},
editor = {Toshihide Ibaraki and
Naoki Katoh and
Hirotaka Ono},
title = {Infinitely-Often Autoreducible Sets},
booktitle = {Algorithms and Computation, 14th International Symposium, {ISAAC}
2003, Kyoto, Japan, December 15-17, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2906},
pages = {98--107},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24587-2\_12},
doi = {10.1007/978-3-540-24587-2\_12},
timestamp = {Fri, 29 Dec 2023 12:40:31 +0100},
biburl = {https://dblp.org/rec/conf/isaac/BeigelFS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR03-087,
author = {Richard Beigel and
Lance Fortnow and
William I. Gasarch},
title = {A Nearly Tight Bound for Private Information Retrieval Protocols},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR03-087}},
year = {2003},
url = {https://eccc.weizmann.ac.il/eccc-reports/2003/TR03-087/index.html},
eprinttype = {ECCC},
eprint = {TR03-087},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR03-087.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BeigelHHV02,
author = {Richard Beigel and
Lane A. Hemaspaandra and
Harald Hempel and
J{\"{o}}rg Vogel},
title = {Optimal Series-Parallel Trade-offs for Reducing a Function to Its
Own Graph},
journal = {Inf. Comput.},
volume = {173},
number = {2},
pages = {123--131},
year = {2002},
url = {https://doi.org/10.1006/inco.2001.3072},
doi = {10.1006/INCO.2001.3072},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BeigelHHV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlonBKRS02,
author = {Noga Alon and
Richard Beigel and
Simon Kasif and
Steven Rudich and
Benny Sudakov},
title = {Learning a Hidden Matching},
booktitle = {43rd Symposium on Foundations of Computer Science {(FOCS} 2002), 16-19
November 2002, Vancouver, BC, Canada, Proceedings},
pages = {197},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/SFCS.2002.1181943},
doi = {10.1109/SFCS.2002.1181943},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AlonBKRS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BeigelC01,
author = {Richard Beigel and
Richard Chang},
title = {Commutative Queries},
journal = {Inf. Comput.},
volume = {166},
number = {1},
pages = {71--91},
year = {2001},
url = {https://doi.org/10.1006/inco.2000.2918},
doi = {10.1006/INCO.2000.2918},
timestamp = {Tue, 14 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BeigelC01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AlonB01,
author = {Noga Alon and
Richard Beigel},
title = {Lower Bounds for Approximations by Low Degree Polynomials Over Z\({}_{\mbox{m}}\)},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {184--187},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933885},
doi = {10.1109/CCC.2001.933885},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AlonB01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recomb/BeigelAKAF01,
author = {Richard Beigel and
Noga Alon and
Simon Kasif and
Mehmet Serkan Apaydin and
Lance Fortnow},
editor = {Thomas Lengauer},
title = {An optimal procedure for gap closing in whole genome shotgun sequencing},
booktitle = {Proceedings of the Fifth Annual International Conference on Computational
Biology, {RECOMB} 2001, Montr{\'{e}}al, Qu{\'{e}}bec, Canada,
April 22-25, 2001},
pages = {22--30},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/369133.369152},
doi = {10.1145/369133.369152},
timestamp = {Mon, 13 May 2019 09:30:09 +0200},
biburl = {https://dblp.org/rec/conf/recomb/BeigelAKAF01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BeigelF00,
author = {Richard Beigel and
Bin Fu},
title = {Circuits over {PP} and {PL}},
journal = {J. Comput. Syst. Sci.},
volume = {60},
number = {2},
pages = {422--441},
year = {2000},
url = {https://doi.org/10.1006/jcss.1999.1676},
doi = {10.1006/JCSS.1999.1676},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BeigelF00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/BeigelGKMMS00,
author = {Richard Beigel and
William I. Gasarch and
Martin Kummer and
Georgia Martin and
Timothy H. McNicholl and
Frank Stephan},
title = {The Comlexity of Odd\({}^{\mbox{A}}\)\({}_{\mbox{n}}\)},
journal = {J. Symb. Log.},
volume = {65},
number = {1},
pages = {1--18},
year = {2000},
url = {https://doi.org/10.2307/2586523},
doi = {10.2307/2586523},
timestamp = {Mon, 11 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsyml/BeigelGKMMS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ArvindBL00,
author = {Vikraman Arvind and
Richard Beigel and
Antoni Lozano},
title = {The Complexity of Modular Graph Automorphism},
journal = {{SIAM} J. Comput.},
volume = {30},
number = {4},
pages = {1299--1320},
year = {2000},
url = {https://doi.org/10.1137/S0097539799358227},
doi = {10.1137/S0097539799358227},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ArvindBL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0006046,
author = {Richard Beigel and
David Eppstein},
title = {3-Coloring in Time O(1.3289{\^{}}n)},
journal = {CoRR},
volume = {cs.DS/0006046},
year = {2000},
url = {https://arxiv.org/abs/cs/0006046},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0006046.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR00-024,
author = {Amihood Amir and
Richard Beigel and
William I. Gasarch},
title = {Some Connections between Bounded Query Classes and Non-Uniform Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR00-024}},
year = {2000},
url = {https://eccc.weizmann.ac.il/eccc-reports/2000/TR00-024/index.html},
eprinttype = {ECCC},
eprint = {TR00-024},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR00-024.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FuB99,
author = {Bin Fu and
Richard Beigel},
title = {A Comparison of Resource-Bounded Molecular Computation Models},
journal = {Algorithmica},
volume = {24},
number = {2},
pages = {87--95},
year = {1999},
url = {https://doi.org/10.1007/PL00009276},
doi = {10.1007/PL00009276},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FuB99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BeigelF99,
author = {Richard Beigel and
Bin Fu},
title = {Molecular Computing, Bounded Nondeterminism, and Efficient Recursion},
journal = {Algorithmica},
volume = {25},
number = {2-3},
pages = {222--238},
year = {1999},
url = {https://doi.org/10.1007/PL00008275},
doi = {10.1007/PL00008275},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BeigelF99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BeigelB99,
author = {Richard Beigel and
Anna Bernasconi},
title = {A Note on the Polynomial Representation of Boolean Functions over
{GF(2)}},
journal = {Int. J. Found. Comput. Sci.},
volume = {10},
number = {4},
pages = {535},
year = {1999},
url = {https://doi.org/10.1142/S012905419900037X},
doi = {10.1142/S012905419900037X},
timestamp = {Sat, 23 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/BeigelB99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Beigel99,
author = {Richard Beigel},
title = {Gaps in Bounded Query Hierarchies},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {124--141},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766271},
doi = {10.1109/CCC.1999.766271},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Beigel99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeigelM99,
author = {Richard Beigel and
Alexis Maciel},
title = {Circuit Lower Bounds Collapse Relativized Complexity Classes},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {222--226},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766280},
doi = {10.1109/CCC.1999.766280},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BeigelM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Beigel99,
author = {Richard Beigel},
editor = {Robert Endre Tarjan and
Tandy J. Warnow},
title = {Finding Maximum Independent Sets in Sparse and General Graphs},
booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
17-19 January 1999, Baltimore, Maryland, {USA}},
pages = {856--857},
publisher = {{ACM/SIAM}},
year = {1999},
url = {http://dl.acm.org/citation.cfm?id=314500.314969},
timestamp = {Thu, 05 Jul 2018 07:29:57 +0200},
biburl = {https://dblp.org/rec/conf/soda/Beigel99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BeigelG98,
author = {Richard Beigel and
Judy Goldsmith},
title = {Downward Separation Fails Catastrophically for Limited Nondeterminism
Classes},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {5},
pages = {1420--1429},
year = {1998},
url = {https://doi.org/10.1137/S0097539794277421},
doi = {10.1137/S0097539794277421},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BeigelG98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BeigelGLZ98,
author = {Richard Beigel and
William I. Gasarch and
Ming Li and
Louxin Zhang},
title = {Addition in log\({}_{\mbox{2}}\)n + {O(1)} Steps on Average: {A} Simple
Analysis},
journal = {Theor. Comput. Sci.},
volume = {191},
number = {1-2},
pages = {245--248},
year = {1998},
url = {https://doi.org/10.1016/S0304-3975(97)00181-3},
doi = {10.1016/S0304-3975(97)00181-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BeigelGLZ98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeigelF98,
author = {Richard Beigel and
Bin Fu},
title = {Solving Intractable Problems with {DNA} Computing},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {154},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694601},
doi = {10.1109/CCC.1998.694601},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BeigelF98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BeigelT98,
author = {Richard Beigel and
Egemen Tanin},
editor = {Claudio L. Lucchesi and
Arnaldo V. Moura},
title = {The Geometry of Browsing},
booktitle = {{LATIN} '98: Theoretical Informatics, Third Latin American Symposium,
Campinas, Brazil, April, 20-24, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1380},
pages = {331--340},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054333},
doi = {10.1007/BFB0054333},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/BeigelT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ArvindBL98,
author = {Vikraman Arvind and
Richard Beigel and
Antoni Lozano},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {The Complexity of Modular Graph Automorphism},
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 = {172--182},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028559},
doi = {10.1007/BFB0028559},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ArvindBL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BeigelH98,
author = {Richard Beigel and
Tirza Hirst},
editor = {Jeffrey Scott Vitter},
title = {One Help Bit Doesn't Help},
booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory
of Computing, Dallas, Texas, USA, May 23-26, 1998},
pages = {124--130},
publisher = {{ACM}},
year = {1998},
url = {https://doi.org/10.1145/276698.276720},
doi = {10.1145/276698.276720},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BeigelH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BeigelBF98,
author = {Richard Beigel and
Harry Buhrman and
Lance Fortnow},
editor = {Jeffrey Scott Vitter},
title = {{NP} Might Not Be As Easy As Detecting Unique Solutions},
booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory
of Computing, Dallas, Texas, USA, May 23-26, 1998},
pages = {203--208},
publisher = {{ACM}},
year = {1998},
url = {https://doi.org/10.1145/276698.276737},
doi = {10.1145/276698.276737},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BeigelBF98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR98-026,
author = {Richard Beigel},
title = {Gaps in Bounded Query Hierarchies},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR98-026}},
year = {1998},
url = {https://eccc.weizmann.ac.il/eccc-reports/1998/TR98-026/index.html},
eprinttype = {ECCC},
eprint = {TR98-026},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR98-026.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BeigelM97,
author = {Richard Beigel and
Alexis Maciel},
title = {Upper and Lower Bounds for Some Depth-3 Circuit Classes},
journal = {Comput. Complex.},
volume = {6},
number = {3},
pages = {235--255},
year = {1997},
url = {https://doi.org/10.1007/BF01294257},
doi = {10.1007/BF01294257},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BeigelM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeigelF97,
author = {Richard Beigel and
Bin Fu},
title = {Circuits Over {PP} and {PL}},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {24--35},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612297},
doi = {10.1109/CCC.1997.612297},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BeigelF97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeigelM97,
author = {Richard Beigel and
Alexis Maciel},
title = {Upper and Lower Bounds for Some Depth-3 Circuit Classes},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {149--157},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612310},
doi = {10.1109/CCC.1997.612310},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BeigelM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/FuB97,
author = {Bin Fu and
Richard Beigel},
editor = {Harvey Rubin and
David Harlan Wood},
title = {On molecular approximation algorithms for {NP} optimization problem},
booktitle = {{DNA} Based Computers, Proceedings of a {DIMACS} Workshop, Philadelphia,
Pennsylvania, USA, June 23-25, 1997},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {48},
pages = {207--216},
publisher = {{DIMACS/AMS}},
year = {1997},
url = {https://doi.org/10.1090/dimacs/048/16},
doi = {10.1090/DIMACS/048/16},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/FuB97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BeigelF97,
author = {Richard Beigel and
Bin Fu},
editor = {Pierpaolo Degano and
Roberto Gorrieri and
Alberto Marchetti{-}Spaccamela},
title = {Molecular Computing, Bounded Nondeterminism, and Efficient Recursion},
booktitle = {Automata, Languages and Programming, 24th International Colloquium,
ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1256},
pages = {816--826},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63165-8\_234},
doi = {10.1007/3-540-63165-8\_234},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BeigelF97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infovis/TaninBS97,
author = {Egemen Tanin and
Richard Beigel and
Ben Shneiderman},
title = {Design and Evaluation of Incremental Data Structures and Algorithms
for Dynamic Query Interfaces},
booktitle = {1997 {IEEE} Symposium on Information Visualization (InfoVis '97),
October 18-25, 1997, Phoenix, AZ, {USA}},
pages = {81--86},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/INFVIS.1997.636790},
doi = {10.1109/INFVIS.1997.636790},
timestamp = {Wed, 16 Oct 2019 14:14:53 +0200},
biburl = {https://dblp.org/rec/conf/infovis/TaninBS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/istcs/FuB97,
author = {Bin Fu and
Richard Beigel},
title = {A Comparison of Resource-Bounded Molecular Computation Models},
booktitle = {Fifth Israel Symposium on Theory of Computing and Systems, {ISTCS}
1997, Ramat-Gan, Israel, June 17-19, 1997, Proceedings},
pages = {6--11},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/ISTCS.1997.595152},
doi = {10.1109/ISTCS.1997.595152},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/istcs/FuB97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/istcs/Beigel97,
author = {Richard Beigel},
title = {Closure Properties of GapP and {\#}P},
booktitle = {Fifth Israel Symposium on Theory of Computing and Systems, {ISTCS}
1997, Ramat-Gan, Israel, June 17-19, 1997, Proceedings},
pages = {144--146},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/ISTCS.1997.595166},
doi = {10.1109/ISTCS.1997.595166},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/istcs/Beigel97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/istcs/BeigelC97,
author = {Richard Beigel and
Richard Chang},
title = {Commutative Queries},
booktitle = {Fifth Israel Symposium on Theory of Computing and Systems, {ISTCS}
1997, Ramat-Gan, Israel, June 17-19, 1997, Proceedings},
pages = {159--165},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/ISTCS.1997.595168},
doi = {10.1109/ISTCS.1997.595168},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/istcs/BeigelC97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR97-002,
author = {Richard Beigel and
Alexis Maciel},
title = {Upper and Lower Bounds for Some Depth-3 Circuit Classes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR97-002}},
year = {1997},
url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-002/index.html},
eprinttype = {ECCC},
eprint = {TR97-002},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-002.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0098542,
author = {Robert W. Floyd and
Richard Beigel},
title = {Die Sprache der Maschinen},
series = {Informatik Lehrbuch-Reihe},
publisher = {International Thomson},
year = {1996},
isbn = {978-3-8266-0216-0},
timestamp = {Thu, 28 Apr 2011 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/daglib/0098542.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigmod/TaninBS96,
author = {Egemen Tanin and
Richard Beigel and
Ben Shneiderman},
title = {Incremental data Structures and Algorithms for Dynamic Query Interfaces},
journal = {{SIGMOD} Rec.},
volume = {25},
number = {4},
pages = {21--24},
year = {1996},
url = {https://doi.org/10.1145/245882.245891},
doi = {10.1145/245882.245891},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigmod/TaninBS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BeigelGK96,
author = {Richard Beigel and
William I. Gasarch and
Efim B. Kinber},
title = {Frequency Computation and Bounded Queries},
journal = {Theor. Comput. Sci.},
volume = {163},
number = {1{\&}2},
pages = {177--192},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00149-2},
doi = {10.1016/0304-3975(95)00149-2},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BeigelGK96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/AgrawalBT96,
author = {Manindra Agrawal and
Richard Beigel and
Thomas Thierauf},
editor = {Vijay Chandru and
V. Vinay},
title = {Pinpointing Computation with Modular Queries in the Boolean Hierarchy},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
16th Conference, Hyderabad, India, December 18-20, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1180},
pages = {322--334},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-62034-6\_60},
doi = {10.1007/3-540-62034-6\_60},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/AgrawalBT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BeigelGKMS96,
author = {Richard Beigel and
William I. Gasarch and
Martin Kummer and
Timothy H. McNicholl and
Frank Stephan},
editor = {Wojciech Penczek and
Andrzej Szalas},
title = {On the Query Complexity of Sets},
booktitle = {Mathematical Foundations of Computer Science 1996, 21st International
Symposium, MFCS'96, Cracow, Poland, September 2-6, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1113},
pages = {206--217},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61550-4\_149},
doi = {10.1007/3-540-61550-4\_149},
timestamp = {Mon, 11 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/BeigelGKMS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR96-001,
author = {Manindra Agrawal and
Richard Beigel and
Thomas Thierauf},
title = {Modulo Information from Nonadaptive Queries to {NP}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR96-001}},
year = {1996},
url = {https://eccc.weizmann.ac.il/eccc-reports/1996/TR96-001/index.html},
eprinttype = {ECCC},
eprint = {TR96-001},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR96-001.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR96-051,
author = {Richard Beigel and
William I. Gasarch and
Ming Li and
Louxin Zhang},
title = {Addition in log\({}_{\mbox{2}}\)n + {O(1)} Steps on Average: {A} Simple
Analysis},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR96-051}},
year = {1996},
url = {https://eccc.weizmann.ac.il/eccc-reports/1996/TR96-051/index.html},
eprinttype = {ECCC},
eprint = {TR96-051},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR96-051.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BeigelKS95a,
author = {Richard Beigel and
Martin Kummer and
Frank Stephan},
title = {Quantifying the Amount of Verboseness},
journal = {Inf. Comput.},
volume = {118},
number = {1},
pages = {73--90},
year = {1995},
url = {https://doi.org/10.1006/inco.1995.1053},
doi = {10.1006/INCO.1995.1053},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BeigelKS95a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BeigelKS95b,
author = {Richard Beigel and
Martin Kummer and
Frank Stephan},
title = {Approximable Sets},
journal = {Inf. Comput.},
volume = {120},
number = {2},
pages = {304--314},
year = {1995},
url = {https://doi.org/10.1006/inco.1995.1115},
doi = {10.1006/INCO.1995.1115},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BeigelKS95b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BeigelRS95,
author = {Richard Beigel and
Nick Reingold and
Daniel A. Spielman},
title = {{PP} Is Closed under Intersection},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {2},
pages = {191--202},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1017},
doi = {10.1006/JCSS.1995.1017},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BeigelRS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeigelGK95,
author = {Richard Beigel and
William I. Gasarch and
Efim B. Kinber},
title = {Frequency Computation and Bounded Queries},
booktitle = {Proceedings of the Tenth Annual Structure in Complexity Theory Conference,
Minneapolis, Minnesota, USA, June 19-22, 1995},
pages = {125--132},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SCT.1995.514852},
doi = {10.1109/SCT.1995.514852},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BeigelGK95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeigelS95,
author = {Richard Beigel and
Howard Straubing},
title = {The Power of Local Self-Reductions},
booktitle = {Proceedings of the Tenth Annual Structure in Complexity Theory Conference,
Minneapolis, Minnesota, USA, June 19-22, 1995},
pages = {277--285},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SCT.1995.514866},
doi = {10.1109/SCT.1995.514866},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BeigelS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BeigelE95,
author = {Richard Beigel and
David Eppstein},
title = {3-Coloring in Time O(1.3446\({}^{\mbox{n}}\)): {A} No-MIS Algorithm},
booktitle = {36th Annual Symposium on Foundations of Computer Science, Milwaukee,
Wisconsin, USA, 23-25 October 1995},
pages = {444--452},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SFCS.1995.492575},
doi = {10.1109/SFCS.1995.492575},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BeigelE95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BeigelHK95,
author = {Richard Beigel and
William Hurwood and
Nabil Kahal{\'{e}}},
title = {Fault Diagnosis in a Flash},
booktitle = {36th Annual Symposium on Foundations of Computer Science, Milwaukee,
Wisconsin, USA, 23-25 October 1995},
pages = {571--580},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SFCS.1995.492587},
doi = {10.1109/SFCS.1995.492587},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BeigelHK95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR95-033,
author = {Richard Beigel and
David Eppstein},
title = {3-Coloring in time O(1.3446\({}^{\mbox{n}}\)): {A} no-MIS Algorithm},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR95-033}},
year = {1995},
url = {https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-033/index.html},
eprinttype = {ECCC},
eprint = {TR95-033},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR95-033.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR95-035,
author = {Richard Beigel},
title = {Closure Properties of GapP and {\#}P},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR95-035}},
year = {1995},
url = {https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-035/index.html},
eprinttype = {ECCC},
eprint = {TR95-035},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR95-035.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR95-036,
author = {Richard Beigel and
William I. Gasarch and
Efim B. Kinber},
title = {Frequency Computation and Bounded Queries},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR95-036}},
year = {1995},
url = {https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-036/index.html},
eprinttype = {ECCC},
eprint = {TR95-036},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR95-036.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR95-037,
author = {Richard Beigel and
Howard Straubing},
title = {The Power of Local Self-Reductions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR95-037}},
year = {1995},
url = {https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-037/index.html},
eprinttype = {ECCC},
eprint = {TR95-037},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR95-037.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Beigel94,
author = {Richard Beigel},
title = {When do Extra Majority Gates Help? Polylog(\emph{N}) Majority Gates
Are Equivalent to One},
journal = {Comput. Complex.},
volume = {4},
pages = {314--324},
year = {1994},
url = {https://doi.org/10.1007/BF01263420},
doi = {10.1007/BF01263420},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Beigel94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Beigel94a,
author = {Richard Beigel},
title = {Perceptrons, PP, and the Polynomial Hierarchy},
journal = {Comput. Complex.},
volume = {4},
pages = {339--349},
year = {1994},
url = {https://doi.org/10.1007/BF01263422},
doi = {10.1007/BF01263422},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Beigel94a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BeigelT94,
author = {Richard Beigel and
Jun Tarui},
title = {On {ACC}},
journal = {Comput. Complex.},
volume = {4},
pages = {350--366},
year = {1994},
url = {https://doi.org/10.1007/BF01263423},
doi = {10.1007/BF01263423},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BeigelT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BarringtonBR94,
author = {David A. Mix Barrington and
Richard Beigel and
Steven Rudich},
title = {Representing Boolean Functions as Polynomials Modulo Composite Numbers},
journal = {Comput. Complex.},
volume = {4},
pages = {367--382},
year = {1994},
url = {https://doi.org/10.1007/BF01263424},
doi = {10.1007/BF01263424},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BarringtonBR94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/AspnesBFR94,
author = {James Aspnes and
Richard Beigel and
Merrick L. Furst and
Steven Rudich},
title = {The Expressive Power of Voting Polynomials},
journal = {Comb.},
volume = {14},
number = {2},
pages = {135--148},
year = {1994},
url = {https://doi.org/10.1007/BF01215346},
doi = {10.1007/BF01215346},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/AspnesBFR94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeigelKS94,
author = {Richard Beigel and
Martin Kummer and
Frank Stephan},
title = {Approximable Sets},
booktitle = {Proceedings of the Ninth Annual Structure in Complexity Theory Conference,
Amsterdam, The Netherlands, June 28 - July 1, 1994},
pages = {12--23},
publisher = {{IEEE} Computer Society},
year = {1994},
url = {https://doi.org/10.1109/SCT.1994.315822},
doi = {10.1109/SCT.1994.315822},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BeigelKS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeigelG94,
author = {Richard Beigel and
Judy Goldsmith},
title = {Downward separation fails catastrophically for limited nondeterminism
classes},
booktitle = {Proceedings of the Ninth Annual Structure in Complexity Theory Conference,
Amsterdam, The Netherlands, June 28 - July 1, 1994},
pages = {134--138},
publisher = {{IEEE} Computer Society},
year = {1994},
url = {https://doi.org/10.1109/SCT.1994.315810},
doi = {10.1109/SCT.1994.315810},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BeigelG94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuFB94,
author = {Ming Gu and
Martin Farach and
Richard Beigel},
editor = {Daniel Dominic Sleator},
title = {An Efficient Algorithm for Dynamic Text Indexing},
booktitle = {Proceedings of the Fifth Annual {ACM-SIAM} Symposium on Discrete Algorithms.
23-25 January 1994, Arlington, Virginia, {USA}},
pages = {697--704},
publisher = {{ACM/SIAM}},
year = {1994},
url = {http://dl.acm.org/citation.cfm?id=314464.314675},
timestamp = {Thu, 05 Jul 2018 07:29:19 +0200},
biburl = {https://dblp.org/rec/conf/soda/GuFB94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR94-011,
author = {Richard Beigel and
William Hurwood and
Nabil Kahal{\'{e}}},
title = {Fault Diagnosis in a Flash},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR94-011}},
year = {1994},
url = {https://eccc.weizmann.ac.il/eccc-reports/1994/TR94-011/index.html},
eprinttype = {ECCC},
eprint = {TR94-011},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR94-011.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BeigelGGO93,
author = {Richard Beigel and
William I. Gasarch and
John Gill and
James C. Owings},
title = {Terse, Superterse, and Verbose Sets},
journal = {Inf. Comput.},
volume = {103},
number = {1},
pages = {68--85},
year = {1993},
url = {https://doi.org/10.1006/inco.1993.1014},
doi = {10.1006/INCO.1993.1014},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BeigelGGO93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BeigelCO93,
author = {Richard Beigel and
Richard Chang and
Mitsunori Ogiwara},
title = {A Relationship Between Difference Hierarchies and Relativized Polynomial
Hierarchies},
journal = {Math. Syst. Theory},
volume = {26},
number = {3},
pages = {293--310},
year = {1993},
url = {https://doi.org/10.1007/BF01371729},
doi = {10.1007/BF01371729},
timestamp = {Tue, 14 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/BeigelCO93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AllenderBHH93,
author = {Eric Allender and
Richard Beigel and
Ulrich Hertrampf and
Steven Homer},
title = {Almost-Everywhere Complexity Hierarchies for Nondeterministic Time},
journal = {Theor. Comput. Sci.},
volume = {115},
number = {2},
pages = {225--241},
year = {1993},
url = {https://doi.org/10.1016/0304-3975(93)90117-C},
doi = {10.1016/0304-3975(93)90117-C},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AllenderBHH93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/MurthyKSB93,
author = {Sreerama K. Murthy and
Simon Kasif and
Steven Salzberg and
Richard Beigel},
editor = {Richard Fikes and
Wendy G. Lehnert},
title = {{OC1:} {A} Randomized Induction of Oblique Decision Trees},
booktitle = {Proceedings of the 11th National Conference on Artificial Intelligence.
Washington, DC, USA, July 11-15, 1993},
pages = {322--327},
publisher = {{AAAI} Press / The {MIT} Press},
year = {1993},
url = {http://www.aaai.org/Library/AAAI/1993/aaai93-049.php},
timestamp = {Mon, 04 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/MurthyKSB93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Beigel93,
author = {Richard Beigel},
title = {The Polynomial Method in Circuit Complexity},
booktitle = {Proceedings of the Eigth Annual Structure in Complexity Theory Conference,
San Diego, CA, USA, May 18-21, 1993},
pages = {82--95},
publisher = {{IEEE} Computer Society},
year = {1993},
url = {https://doi.org/10.1109/SCT.1993.336538},
doi = {10.1109/SCT.1993.336538},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Beigel93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/BeigelMS93,
author = {Richard Beigel and
Grigorii Margulis and
Daniel A. Spielman},
editor = {Lawrence Snyder},
title = {Fault Diagnosis in a Small Constant Number of Parallel Testing Rounds},
booktitle = {Proceedings of the 5th Annual {ACM} Symposium on Parallel Algorithms
and Architectures, {SPAA} '93, Velen, Germany, June 30 - July 2, 1993},
pages = {21--29},
publisher = {{ACM}},
year = {1993},
url = {https://doi.org/10.1145/165231.165234},
doi = {10.1145/165231.165234},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spaa/BeigelMS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BeigelF92,
author = {Richard Beigel and
Joan Feigenbaum},
title = {On Being Incoherent Without Being Very Hard},
journal = {Comput. Complex.},
volume = {2},
pages = {1--17},
year = {1992},
url = {https://doi.org/10.1007/BF01276436},
doi = {10.1007/BF01276436},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BeigelF92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BeigelG92,
author = {Richard Beigel and
John Gill},
title = {Counting Classes: Thresholds, Parity, Mods, and Fewness},
journal = {Theor. Comput. Sci.},
volume = {103},
number = {1},
pages = {3--23},
year = {1992},
url = {https://doi.org/10.1016/0304-3975(92)90084-S},
doi = {10.1016/0304-3975(92)90084-S},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BeigelG92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Beigel92,
author = {Richard Beigel},
title = {Perceptrons, PP, and the Polynomial Hierarchy},
booktitle = {Proceedings of the Seventh Annual Structure in Complexity Theory Conference,
Boston, Massachusetts, USA, June 22-25, 1992},
pages = {14--19},
publisher = {{IEEE} Computer Society},
year = {1992},
url = {https://doi.org/10.1109/SCT.1992.215376},
doi = {10.1109/SCT.1992.215376},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Beigel92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BeigelTT92,
author = {Richard Beigel and
Jun Tarui and
Seinosuke Toda},
editor = {Toshihide Ibaraki and
Yasuyoshi Inagaki and
Kazuo Iwama and
Takao Nishizeki and
Masafumi Yamashita},
title = {On Probabilistic {ACC} Circuits with an Exact-Threshold Output Gate},
booktitle = {Algorithms and Computation, Third International Symposium, {ISAAC}
'92, Nagoya, Japan, December 16-18, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {650},
pages = {420--429},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56279-6\_94},
doi = {10.1007/3-540-56279-6\_94},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BeigelTT92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lfcs/BeigelKS92,
author = {Richard Beigel and
Martin Kummer and
Frank Stephan},
editor = {Anil Nerode and
Michael A. Taitslin},
title = {Quantifying the Amount of Verboseness},
booktitle = {Logical Foundations of Computer Science - Tver '92, Second International
Symposium, Tver, Russia, July 20-24, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {620},
pages = {21--32},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/BFb0023860},
doi = {10.1007/BFB0023860},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lfcs/BeigelKS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Beigel92,
author = {Richard Beigel},
editor = {S. Rao Kosaraju and
Mike Fellows and
Avi Wigderson and
John A. Ellis},
title = {When Do Extra Majority Gates Help? Polylog(n) Majority Gates Are Equivalent
to One},
booktitle = {Proceedings of the 24th Annual {ACM} Symposium on Theory of Computing,
May 4-6, 1992, Victoria, British Columbia, Canada},
pages = {450--454},
publisher = {{ACM}},
year = {1992},
url = {https://doi.org/10.1145/129712.129755},
doi = {10.1145/129712.129755},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Beigel92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BarringtonBR92,
author = {David A. Mix Barrington and
Richard Beigel and
Steven Rudich},
editor = {S. Rao Kosaraju and
Mike Fellows and
Avi Wigderson and
John A. Ellis},
title = {Representing Boolean Functions as Polynomials Modulo Composite Numbers
(Extended Abstract)},
booktitle = {Proceedings of the 24th Annual {ACM} Symposium on Theory of Computing,
May 4-6, 1992, Victoria, British Columbia, Canada},
pages = {455--461},
publisher = {{ACM}},
year = {1992},
url = {https://doi.org/10.1145/129712.129756},
doi = {10.1145/129712.129756},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BarringtonBR92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BeigelG91,
author = {Richard Beigel and
William I. Gasarch},
title = {The Mapmaker's dilemma},
journal = {Discret. Appl. Math.},
volume = {34},
number = {1-3},
pages = {37--48},
year = {1991},
url = {https://doi.org/10.1016/0166-218X(91)90077-A},
doi = {10.1016/0166-218X(91)90077-A},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BeigelG91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BeigelHW91,
author = {Richard Beigel and
Lane A. Hemachandra and
Gerd Wechsung},
title = {Probabilistic Polynomial Time is Closed under Parity Reductions},
journal = {Inf. Process. Lett.},
volume = {37},
number = {2},
pages = {91--94},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90140-D},
doi = {10.1016/0020-0190(91)90140-D},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BeigelHW91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Beigel91,
author = {Richard Beigel},
title = {Relativized Counting Classes: Relations among Thresholds, Parity,
and Mods},
journal = {J. Comput. Syst. Sci.},
volume = {42},
number = {1},
pages = {76--96},
year = {1991},
url = {https://doi.org/10.1016/0022-0000(91)90040-C},
doi = {10.1016/0022-0000(91)90040-C},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Beigel91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigarch/BeigelK91,
author = {Richard Beigel and
Clyde P. Kruskal},
title = {Processor networks and interconnection networks without long wires
(extended abstract)},
journal = {{SIGARCH} Comput. Archit. News},
volume = {19},
number = {1},
pages = {15--24},
year = {1991},
url = {https://doi.org/10.1145/121956.121958},
doi = {10.1145/121956.121958},
timestamp = {Thu, 30 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigarch/BeigelK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Beigel91,
author = {Richard Beigel},
title = {Bounded Queries to {SAT} and the Boolean Hierarchy},
journal = {Theor. Comput. Sci.},
volume = {84},
number = {2},
pages = {199--223},
year = {1991},
url = {https://doi.org/10.1016/0304-3975(91)90160-4},
doi = {10.1016/0304-3975(91)90160-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Beigel91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeigelRS91,
author = {Richard Beigel and
Nick Reingold and
Daniel A. Spielman},
title = {The Perceptron Strikes Back},
booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference,
Chicago, Illinois, USA, June 30 - July 3, 1991},
pages = {286--291},
publisher = {{IEEE} Computer Society},
year = {1991},
url = {https://doi.org/10.1109/SCT.1991.160270},
doi = {10.1109/SCT.1991.160270},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BeigelRS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BeigelBFG91,
author = {Richard Beigel and
Mihir Bellare and
Joan Feigenbaum and
Shafi Goldwasser},
title = {Languages that Are Easier than their Proofs},
booktitle = {32nd Annual Symposium on Foundations of Computer Science, San Juan,
Puerto Rico, 1-4 October 1991},
pages = {19--28},
publisher = {{IEEE} Computer Society},
year = {1991},
url = {https://doi.org/10.1109/SFCS.1991.185343},
doi = {10.1109/SFCS.1991.185343},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BeigelBFG91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BeigelT91,
author = {Richard Beigel and
Jun Tarui},
title = {On {ACC}},
booktitle = {32nd Annual Symposium on Foundations of Computer Science, San Juan,
Puerto Rico, 1-4 October 1991},
pages = {783--792},
publisher = {{IEEE} Computer Society},
year = {1991},
url = {https://doi.org/10.1109/SFCS.1991.185449},
doi = {10.1109/SFCS.1991.185449},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BeigelT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BeigelRS91,
author = {Richard Beigel and
Nick Reingold and
Daniel A. Spielman},
editor = {Cris Koutsougeras and
Jeffrey Scott Vitter},
title = {{PP} Is Closed Under Intersection (Extended Abstract)},
booktitle = {Proceedings of the 23rd Annual {ACM} Symposium on Theory of Computing,
May 5-8, 1991, New Orleans, Louisiana, {USA}},
pages = {1--9},
publisher = {{ACM}},
year = {1991},
url = {https://doi.org/10.1145/103418.103426},
doi = {10.1145/103418.103426},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BeigelRS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AspnesBFR91,
author = {James Aspnes and
Richard Beigel and
Merrick L. Furst and
Steven Rudich},
editor = {Cris Koutsougeras and
Jeffrey Scott Vitter},
title = {The Expressive Power of Voting Polynomials},
booktitle = {Proceedings of the 23rd Annual {ACM} Symposium on Theory of Computing,
May 5-8, 1991, New Orleans, Louisiana, {USA}},
pages = {402--409},
publisher = {{ACM}},
year = {1991},
url = {https://doi.org/10.1145/103418.103461},
doi = {10.1145/103418.103461},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AspnesBFR91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Beigel90,
author = {Richard Beigel},
title = {Unbounded Searching Slgorithms},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {3},
pages = {522--537},
year = {1990},
url = {https://doi.org/10.1137/0219035},
doi = {10.1137/0219035},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Beigel90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tc/BeigelG90,
author = {Richard Beigel and
John Gill},
title = {Sorting n Objects with a K-Sorter},
journal = {{IEEE} Trans. Computers},
volume = {39},
number = {5},
pages = {714--716},
year = {1990},
url = {https://doi.org/10.1109/12.53587},
doi = {10.1109/12.53587},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tc/BeigelG90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Beigel90,
author = {Richard Beigel},
title = {Bi-Immunity Results for Cheatable Sets},
journal = {Theor. Comput. Sci.},
volume = {73},
number = {3},
pages = {249--263},
year = {1990},
url = {https://doi.org/10.1016/0304-3975(90)90177-J},
doi = {10.1016/0304-3975(90)90177-J},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Beigel90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AmirBG90,
author = {Amihood Amir and
Richard Beigel and
William I. Gasarch},
title = {Some Connections Between Bounded Query Classes and Non-Uniform Complexity},
booktitle = {Proceedings: Fifth Annual Structure in Complexity Theory Conference,
Universitat Polit{\`{e}}cnica de Catalunya, Barcelona, Spain, July
8-11, 1990},
pages = {232--243},
publisher = {{IEEE} Computer Society},
year = {1990},
url = {https://doi.org/10.1109/SCT.1990.113971},
doi = {10.1109/SCT.1990.113971},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AmirBG90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/AllenderBHH90,
author = {Eric Allender and
Richard Beigel and
Ulrich Hertrampf and
Steven Homer},
editor = {Christian Choffrut and
Thomas Lengauer},
title = {A Note on the Almost-Everywhere Hierarchy for Nondeterministic Time},
booktitle = {{STACS} 90, 7th Annual Symposium on Theoretical Aspects of Computer
Science, Rouen, France, February 22-24, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {415},
pages = {1--11},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52282-4\_27},
doi = {10.1007/3-540-52282-4\_27},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/AllenderBHH90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BeigelGH90,
author = {Richard Beigel and
John Gill and
Ulrich Hertrampf},
editor = {Christian Choffrut and
Thomas Lengauer},
title = {Counting Classes: Thresholds, Parity, Mods, and Fewness},
booktitle = {{STACS} 90, 7th Annual Symposium on Theoretical Aspects of Computer
Science, Rouen, France, February 22-24, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {415},
pages = {49--57},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52282-4\_31},
doi = {10.1007/3-540-52282-4\_31},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BeigelGH90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aml/BeigelGH89,
author = {Richard Beigel and
William I. Gasarch and
Louise Hay},
title = {Bounded query classes and the difference hierarchy},
journal = {Arch. Math. Log.},
volume = {29},
number = {2},
pages = {69--84},
year = {1989},
url = {https://doi.org/10.1007/BF01620618},
doi = {10.1007/BF01620618},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aml/BeigelGH89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/BeigelGO89,
author = {Richard Beigel and
William I. Gasarch and
James C. Owings},
title = {Nondeterministic Bounded Query Reducibilities},
journal = {Ann. Pure Appl. Log.},
volume = {41},
number = {2},
pages = {107--118},
year = {1989},
url = {https://doi.org/10.1016/0168-0072(89)90010-9},
doi = {10.1016/0168-0072(89)90010-9},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/BeigelGO89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/BeigelG89,
author = {Richard Beigel and
William I. Gasarch},
title = {On the Complexity of Finding the Chromatic Number of a Recursive Graph
{I:} The Bounded Case},
journal = {Ann. Pure Appl. Log.},
volume = {45},
number = {1},
pages = {1--38},
year = {1989},
url = {https://doi.org/10.1016/0168-0072(89)90029-8},
doi = {10.1016/0168-0072(89)90029-8},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/BeigelG89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/BeigelG89a,
author = {Richard Beigel and
William I. Gasarch},
title = {On the Complexity of Finding the Chromatic Number of a Recursive Graph
{II:} The Unbounded Case},
journal = {Ann. Pure Appl. Log.},
volume = {45},
number = {3},
pages = {227--246},
year = {1989},
url = {https://doi.org/10.1016/0168-0072(89)90037-7},
doi = {10.1016/0168-0072(89)90037-7},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/BeigelG89a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/FischerFB89,
author = {Michael J. Fischer and
Robert P. Fischer and
Richard Beigel},
title = {Primitive recursion without implicit predecessor},
journal = {{SIGACT} News},
volume = {20},
number = {4},
pages = {87--91},
year = {1989},
url = {https://doi.org/10.1145/74074.74089},
doi = {10.1145/74074.74089},
timestamp = {Fri, 07 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigact/FischerFB89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Beigel89,
author = {Richard Beigel},
title = {On the Relativized Power of Additional Accepting Paths},
booktitle = {Proceedings: Fourth Annual Structure in Complexity Theory Conference,
University of Oregon, Eugene, Oregon, USA, June 19-22, 1989},
pages = {216--224},
publisher = {{IEEE} Computer Society},
year = {1989},
url = {https://doi.org/10.1109/SCT.1989.41827},
doi = {10.1109/SCT.1989.41827},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Beigel89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BeigelHW89,
author = {Richard Beigel and
Lane A. Hemachandra and
Gerd Wechsung},
title = {On the Power of Probabilistic Polynomial Time: P\({}^{\mbox{NP[log]}}\)
subseteq {PP}},
booktitle = {Proceedings: Fourth Annual Structure in Complexity Theory Conference,
University of Oregon, Eugene, Oregon, USA, June 19-22, 1989},
pages = {225--227},
publisher = {{IEEE} Computer Society},
year = {1989},
url = {https://doi.org/10.1109/SCT.1989.41828},
doi = {10.1109/SCT.1989.41828},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BeigelHW89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/BeigelKS89,
author = {Richard Beigel and
S. Rao Kosaraju and
Gregory F. Sullivan},
editor = {Frank Thomson Leighton},
title = {Locating Faults in a Constant Number of Parallel Testing Rounds},
booktitle = {Proceedings of the {ACM} Symposium on Parallel Algorithms and Architectures,
{SPAA} '89, Santa Fe, New Mexico, USA, June 18-21, 1989},
pages = {189--198},
publisher = {{ACM}},
year = {1989},
url = {https://doi.org/10.1145/72935.72956},
doi = {10.1145/72935.72956},
timestamp = {Wed, 21 Nov 2018 12:27:44 +0100},
biburl = {https://dblp.org/rec/conf/spaa/BeigelKS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/us/Beigel87,
author = {Richard Beigel},
title = {Query-limited reducibilities},
school = {Stanford University, {USA}},
year = {1987},
url = {https://searchworks.stanford.edu/view/1294221},
timestamp = {Tue, 23 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/us/Beigel87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Beigel87,
author = {Richard Beigel},
title = {A structural theorem that depends quantitatively on the complexity
of {SAT}},
booktitle = {Proceedings of the Second Annual Conference on Structure in Complexity
Theory, Cornell University, Ithaca, New York, USA, June 16-19, 1987},
pages = {28--32},
publisher = {{IEEE} Computer Society},
year = {1987},
url = {https://ieeexplore.ieee.org/document/10319251},
timestamp = {Tue, 21 Nov 2023 11:59:25 +0100},
biburl = {https://dblp.org/rec/conf/coco/Beigel87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2023-11-22 20:41 CET 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:
