BibTeX records: Robert Beals

download as .bib file

@article{DBLP:journals/tamm/Beals09,
  author       = {Robert Beals},
  title        = {On Orders of Subgroups in Abelian Groups: An Elementary Solution of
                  an Exercise of Herstein},
  journal      = {Am. Math. Mon.},
  volume       = {116},
  number       = {10},
  pages        = {923--926},
  year         = {2009},
  url          = {http://www.jstor.org/stable/40391251},
  timestamp    = {Thu, 18 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tamm/Beals09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stoc/BabaiBS09,
  author       = {L{\'{a}}szl{\'{o}} Babai and
                  Robert Beals and
                  {\'{A}}kos Seress},
  editor       = {Michael Mitzenmacher},
  title        = {Polynomial-time theory of matrix groups},
  booktitle    = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing,
                  {STOC} 2009, Bethesda, MD, USA, May 31 - June 2, 2009},
  pages        = {55--64},
  publisher    = {{ACM}},
  year         = {2009},
  url          = {https://doi.org/10.1145/1536414.1536425},
  doi          = {10.1145/1536414.1536425},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/BabaiBS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/BabaiBS04,
  author       = {L{\'{a}}szl{\'{o}} Babai and
                  Robert Beals and
                  {\'{A}}kos Seress},
  editor       = {J. Ian Munro},
  title        = {On the diameter of the symmetric group: polynomial bounds},
  booktitle    = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
                  2004},
  pages        = {1108--1112},
  publisher    = {{SIAM}},
  year         = {2004},
  url          = {http://dl.acm.org/citation.cfm?id=982792.982956},
  timestamp    = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BabaiBS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cpc/BealsLNPS02,
  author       = {Robert Beals and
                  Charles R. Leedham{-}Green and
                  Alice C. Niemeyer and
                  Cheryl E. Praeger and
                  {\'{A}}kos Seress},
  title        = {Permutations With Restricted Cycle Structure And An Algorithmic Application},
  journal      = {Comb. Probab. Comput.},
  volume       = {11},
  number       = {5},
  pages        = {447--464},
  year         = {2002},
  url          = {https://doi.org/10.1017/S0963548302005217},
  doi          = {10.1017/S0963548302005217},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/BealsLNPS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/BealsBCMW01,
  author       = {Robert Beals and
                  Harry Buhrman and
                  Richard Cleve and
                  Michele Mosca and
                  Ronald de Wolf},
  title        = {Quantum lower bounds by polynomials},
  journal      = {J. {ACM}},
  volume       = {48},
  number       = {4},
  pages        = {778--797},
  year         = {2001},
  url          = {https://doi.org/10.1145/502090.502097},
  doi          = {10.1145/502090.502097},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/BealsBCMW01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/AllenderBO99,
  author       = {Eric Allender and
                  Robert Beals and
                  Mitsunori Ogihara},
  title        = {The Complexity of Matrix Rank and Feasible Systems of Linear Equations},
  journal      = {Comput. Complex.},
  volume       = {8},
  number       = {2},
  pages        = {99--126},
  year         = {1999},
  url          = {https://doi.org/10.1007/s000370050023},
  doi          = {10.1007/S000370050023},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/AllenderBO99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cjtcs/BealsCGT99,
  author       = {Robert Beals and
                  Richard Chang and
                  William I. Gasarch and
                  Jacobo Tor{\'{a}}n},
  title        = {On Finding the Number of Graph Automorphisms},
  journal      = {Chic. J. Theor. Comput. Sci.},
  volume       = {1999},
  year         = {1999},
  url          = {http://cjtcs.cs.uchicago.edu/articles/1999/1/contents.html},
  timestamp    = {Tue, 14 Dec 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cjtcs/BealsCGT99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jcss/Beals99,
  author       = {Robert Beals},
  title        = {Algorithms for Matrix Groups and the Tits Alternative},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {58},
  number       = {2},
  pages        = {260--279},
  year         = {1999},
  url          = {https://doi.org/10.1006/jcss.1998.1614},
  doi          = {10.1006/JCSS.1998.1614},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/Beals99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/BealsNT98,
  author       = {Robert Beals and
                  Tetsuro Nishino and
                  Keisuke Tanaka},
  title        = {On the Complexity of Negation-Limited Boolean Networks},
  journal      = {{SIAM} J. Comput.},
  volume       = {27},
  number       = {5},
  pages        = {1334--1347},
  year         = {1998},
  url          = {https://doi.org/10.1137/S0097539794275136},
  doi          = {10.1137/S0097539794275136},
  timestamp    = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BealsNT98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/focs/BealsBCMW98,
  author       = {Robert Beals and
                  Harry Buhrman and
                  Richard Cleve and
                  Michele Mosca and
                  Ronald de Wolf},
  title        = {Quantum Lower Bounds by Polynomials},
  booktitle    = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98,
                  November 8-11, 1998, Palo Alto, California, {USA}},
  pages        = {352--361},
  publisher    = {{IEEE} Computer Society},
  year         = {1998},
  url          = {https://doi.org/10.1109/SFCS.1998.743485},
  doi          = {10.1109/SFCS.1998.743485},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/BealsBCMW98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/quant-ph-9802049,
  author       = {Robert Beals and
                  Harry Buhrman and
                  Richard Cleve and
                  Michele Mosca and
                  Ronald de Wolf},
  title        = {Quantum Lower Bounds by Polynomials},
  journal      = {CoRR},
  volume       = {quant-ph/9802049},
  year         = {1998},
  url          = {http://arxiv.org/abs/quant-ph/9802049},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/quant-ph-9802049.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/Beals97,
  author       = {Robert Beals},
  title        = {Equivalence of Binary and Ternary Algebraic Decision Trees},
  journal      = {Algorithmica},
  volume       = {18},
  number       = {4},
  pages        = {521--523},
  year         = {1997},
  url          = {https://doi.org/10.1007/PL00009169},
  doi          = {10.1007/PL00009169},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Beals97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stoc/Beals97,
  author       = {Robert Beals},
  editor       = {Frank Thomson Leighton and
                  Peter W. Shor},
  title        = {Quantum Computation of Fourier Transforms over Symmetric Groups},
  booktitle    = {Proceedings of the Twenty-Ninth Annual {ACM} Symposium on the Theory
                  of Computing, El Paso, Texas, USA, May 4-6, 1997},
  pages        = {48--53},
  publisher    = {{ACM}},
  year         = {1997},
  url          = {https://doi.org/10.1145/258533.258548},
  doi          = {10.1145/258533.258548},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/Beals97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/TanakaNB96,
  author       = {Keisuke Tanaka and
                  Tetsuro Nishino and
                  Robert Beals},
  title        = {Negation-Limited Circuit Complexity of Symmetric Functions},
  journal      = {Inf. Process. Lett.},
  volume       = {59},
  number       = {5},
  pages        = {273--279},
  year         = {1996},
  url          = {https://doi.org/10.1016/0020-0190(96)00115-9},
  doi          = {10.1016/0020-0190(96)00115-9},
  timestamp    = {Tue, 06 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/TanakaNB96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/BabaiBCIL96,
  author       = {L{\'{a}}szl{\'{o}} Babai and
                  Robert Beals and
                  Jin{-}yi Cai and
                  G{\'{a}}bor Ivanyos and
                  Eugene M. Luks},
  editor       = {{\'{E}}va Tardos},
  title        = {Multiplicative Equations over Commuting Matrices},
  booktitle    = {Proceedings of the Seventh Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, 28-30 January 1996, Atlanta, Georgia, {USA}},
  pages        = {498--507},
  publisher    = {{ACM/SIAM}},
  year         = {1996},
  url          = {http://dl.acm.org/citation.cfm?id=313852.314109},
  timestamp    = {Thu, 05 Jul 2018 07:29:31 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/BabaiBCIL96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stoc/AllenderBO96,
  author       = {Eric Allender and
                  Robert Beals and
                  Mitsunori Ogihara},
  editor       = {Gary L. Miller},
  title        = {The Complexity of Matrix Rank and Feasible Systems of Linear Equations
                  (Extended Abstract)},
  booktitle    = {Proceedings of the Twenty-Eighth Annual {ACM} Symposium on the Theory
                  of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996},
  pages        = {161--167},
  publisher    = {{ACM}},
  year         = {1996},
  url          = {https://doi.org/10.1145/237814.237856},
  doi          = {10.1145/237814.237856},
  timestamp    = {Sun, 25 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/AllenderBO96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/ECCC-TR96-024,
  author       = {Eric Allender and
                  Robert Beals and
                  Mitsunori Ogihara},
  title        = {The complexity of matrix rank and feasible systems of linear equations},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR96-024}},
  year         = {1996},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/1996/TR96-024/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR96-024},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR96-024.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/dimacs/Beals95,
  author       = {Robert Beals},
  editor       = {Larry Finkelstein and
                  William M. Kantor},
  title        = {Towards polynomial time algorithms for matrix groups},
  booktitle    = {Groups and Computation, Proceedings of a {DIMACS} Workshop, New Brunswick,
                  New Jersey, USA, June 7-10, 1995},
  series       = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
  volume       = {28},
  pages        = {31--54},
  publisher    = {{DIMACS/AMS}},
  year         = {1995},
  url          = {https://doi.org/10.1090/dimacs/028/03},
  doi          = {10.1090/DIMACS/028/03},
  timestamp    = {Mon, 22 May 2023 16:07:35 +0200},
  biburl       = {https://dblp.org/rec/conf/dimacs/Beals95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/focs/Beals95,
  author       = {Robert Beals},
  title        = {Algorithms for Matrix Groups and the Tits Alternative},
  booktitle    = {36th Annual Symposium on Foundations of Computer Science, Milwaukee,
                  Wisconsin, USA, 23-25 October 1995},
  pages        = {593--602},
  publisher    = {{IEEE} Computer Society},
  year         = {1995},
  url          = {https://doi.org/10.1109/SFCS.1995.492589},
  doi          = {10.1109/SFCS.1995.492589},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/Beals95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stoc/BealsNT95,
  author       = {Robert Beals and
                  Tetsuro Nishino and
                  Keisuke Tanaka},
  editor       = {Frank Thomson Leighton and
                  Allan Borodin},
  title        = {More on the complexity of negation-limited circuits},
  booktitle    = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory
                  of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}},
  pages        = {585--595},
  publisher    = {{ACM}},
  year         = {1995},
  url          = {https://doi.org/10.1145/225058.225276},
  doi          = {10.1145/225058.225276},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/BealsNT95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/AtkinsonB94,
  author       = {M. D. Atkinson and
                  Robert Beals},
  title        = {Priority Queues and Permutations},
  journal      = {{SIAM} J. Comput.},
  volume       = {23},
  number       = {6},
  pages        = {1225--1230},
  year         = {1994},
  url          = {https://doi.org/10.1137/S0097539792240893},
  doi          = {10.1137/S0097539792240893},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/AtkinsonB94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/focs/BealsB93,
  author       = {Robert Beals and
                  L{\'{a}}szl{\'{o}} Babai},
  title        = {Las Vegas algorithms for matrix groups},
  booktitle    = {34th Annual Symposium on Foundations of Computer Science, Palo Alto,
                  California, USA, 3-5 November 1993},
  pages        = {427--436},
  publisher    = {{IEEE} Computer Society},
  year         = {1993},
  url          = {https://doi.org/10.1109/SFCS.1993.366844},
  doi          = {10.1109/SFCS.1993.366844},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/BealsB93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/issac/BabaiBR93,
  author       = {L{\'{a}}szl{\'{o}} Babai and
                  Robert Beals and
                  Daniel N. Rockmore},
  editor       = {Manuel Bronstein},
  title        = {Deciding Finiteness of Matrix Groups in Deterministic Polynomial Time},
  booktitle    = {Proceedings of the 1993 International Symposium on Symbolic and Algebraic
                  Computation, {ISSAC} '93, Kiev, Ukraine, July 6-8, 1993},
  pages        = {117--126},
  publisher    = {{ACM}},
  year         = {1993},
  url          = {https://doi.org/10.1145/164081.164104},
  doi          = {10.1145/164081.164104},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/issac/BabaiBR93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/issac/Beals93,
  author       = {Robert Beals},
  editor       = {Manuel Bronstein},
  title        = {An Elementary Algorithm for Computing the Composition Factors of a
                  Permutation Group},
  booktitle    = {Proceedings of the 1993 International Symposium on Symbolic and Algebraic
                  Computation, {ISSAC} '93, Kiev, Ukraine, July 6-8, 1993},
  pages        = {127--134},
  publisher    = {{ACM}},
  year         = {1993},
  url          = {https://doi.org/10.1145/164081.164105},
  doi          = {10.1145/164081.164105},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/issac/Beals93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stoc/BealsS92,
  author       = {Robert Beals and
                  {\'{A}}kos Seress},
  editor       = {S. Rao Kosaraju and
                  Mike Fellows and
                  Avi Wigderson and
                  John A. Ellis},
  title        = {Structure Forest and Composition Factors for Small Base Groups in
                  Nearly Linear Time},
  booktitle    = {Proceedings of the 24th Annual {ACM} Symposium on Theory of Computing,
                  May 4-6, 1992, Victoria, British Columbia, Canada},
  pages        = {116--125},
  publisher    = {{ACM}},
  year         = {1992},
  url          = {https://doi.org/10.1145/129712.129724},
  doi          = {10.1145/129712.129724},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/BealsS92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stoc/BabaiBT92,
  author       = {L{\'{a}}szl{\'{o}} Babai and
                  Robert Beals and
                  P{\'{a}}l Tak{\'{a}}csi{-}Nagy},
  editor       = {S. Rao Kosaraju and
                  Mike Fellows and
                  Avi Wigderson and
                  John A. Ellis},
  title        = {Symmetry and Complexity},
  booktitle    = {Proceedings of the 24th Annual {ACM} Symposium on Theory of Computing,
                  May 4-6, 1992, Victoria, British Columbia, Canada},
  pages        = {438--449},
  publisher    = {{ACM}},
  year         = {1992},
  url          = {https://doi.org/10.1145/129712.129754},
  doi          = {10.1145/129712.129754},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/BabaiBT92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/BealsGHJ91,
  author       = {Robert Beals and
                  Joseph A. Gallian and
                  Patrick Headley and
                  Douglas S. Jungreis},
  title        = {Harmonious groups},
  journal      = {J. Comb. Theory, Ser. {A}},
  volume       = {56},
  number       = {2},
  pages        = {223--238},
  year         = {1991},
  url          = {https://doi.org/10.1016/0097-3165(91)90034-E},
  doi          = {10.1016/0097-3165(91)90034-E},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/BealsGHJ91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/dimacs/Beals91,
  author       = {Robert Beals},
  editor       = {Larry Finkelstein and
                  William M. Kantor},
  title        = {Computing Blocks of Imprimitivity for Small-Base Groups in Nearly
                  Linear Time 17},
  booktitle    = {Groups And Computation, Proceedings of a {DIMACS} Workshop, New Brunswick,
                  New Jersey, USA, October 7-10, 1991},
  series       = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
  volume       = {11},
  pages        = {17--26},
  publisher    = {{DIMACS/AMS}},
  year         = {1991},
  url          = {https://doi.org/10.1090/dimacs/011/02},
  doi          = {10.1090/DIMACS/011/02},
  timestamp    = {Mon, 22 May 2023 16:07:35 +0200},
  biburl       = {https://dblp.org/rec/conf/dimacs/Beals91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.