Calculated based on number of publications stored in Pure and citations from Scopus
1982 …2013

Research activity per year

If you made any changes in Pure these will be visible here soon.
Filter
Conference contribution

Search results

  • 2009

    Polynomial-time theory of matrix groups

    Babai, L., Beals, R. & Seress, Á., 2009, STOC'09 - Proceedings of the 2009 ACM International Symposium on Theory of Computing. p. 55-64 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    33 Scopus citations
  • 1996

    Multiplicative equations over commuting matrices

    Babai, L., Beals, R., Cai, J. Y., Ivanyos, G. & Luks, E. M., Jan 28 1996, Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996. Association for Computing Machinery, p. 498-507 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. Part F129447).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    52 Scopus citations
  • The complexity of matrix rank and feasible systems of linear equations

    Allender, E., Beals, R. & Ogihara, M., Jul 1 1996, Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC 1996. Association for Computing Machinery, p. 161-167 7 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. Part F129452).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    10 Scopus citations
  • 1993

    An elementary algorithm for computing the composition factors of a permutation group

    Beals, R., Aug 1 1993, Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, ISSAC 1993. Bronstein, M. (ed.). Association for Computing Machinery, p. 127-134 8 p. (Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Scopus citations
  • Deciding finiteness of matrix groups in deterministic polynomial time

    Babai, L., Beals, R. & Rockmore, D., Aug 1 1993, Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, ISSAC 1993. Bronstein, M. (ed.). Association for Computing Machinery, p. 117-126 10 p. (Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    20 Scopus citations
  • Las Vegas algorithms for matrix groups

    Beals, R. & Babai, L., 1993, Annual Symposium on Foundatons of Computer Science (Proceedings). Anon (ed.). Publ by IEEE, p. 427-436 10 p. (Annual Symposium on Foundatons of Computer Science (Proceedings)).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    25 Scopus citations
  • 1992

    Structure forest and composition factors for small base groups in nearly linear time

    Beals, R. & Seress, Á., Jul 1 1992, Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992. Association for Computing Machinery, p. 116-125 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. Part F129722).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    10 Scopus citations
  • Symmetry and complexity

    Babai, L., Beals, R. & Takácsi-Nagy, P., Jul 1 1992, Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992. Association for Computing Machinery, p. 438-449 12 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. Part F129722).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    7 Scopus citations