{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,13]],"date-time":"2024-06-13T00:03:25Z","timestamp":1718237005891},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2015,11,19]],"date-time":"2015-11-19T00:00:00Z","timestamp":1447891200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s00236-015-0251-0","type":"journal-article","created":{"date-parts":[[2015,11,19]],"date-time":"2015-11-19T07:33:37Z","timestamp":1447918417000},"page":"493-508","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A linear-time algorithm for the orbit problem over cyclic groups"],"prefix":"10.1007","volume":"53","author":[{"given":"Anthony W.","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanming","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,19]]},"reference":[{"key":"251_CR1","doi-asserted-by":"crossref","unstructured":"Babai, L., Luks, E.M.: Canonical labeling of graphs. In: STOC, pp. 171\u2013183 (1983)","DOI":"10.1145\/800061.808746"},{"issue":"2","key":"251_CR2","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/0022-0000(88)90028-1","volume":"36","author":"L Babai","year":"1988","unstructured":"Babai, L., Moran, S.: Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity classes. J. Comput. Syst. Sci. 36(2), 254\u2013276 (1988). doi: 10.1016\/0022-0000(88)90028-1","journal-title":"J. Comput. Syst. Sci."},{"key":"251_CR3","volume-title":"Algorithmic Number Theory, Foundations of Computing","author":"E Bach","year":"1996","unstructured":"Bach, E., Shallit, J.: Algorithmic Number Theory, Foundations of Computing, vol. 1. The MIT Press, Cambridge (1996)"},{"key":"251_CR4","doi-asserted-by":"crossref","first-page":"95","DOI":"10.2307\/3219141","volume":"75","author":"AT Benjamin","year":"2002","unstructured":"Benjamin, A.T., Preston, G.O., Quinn, J.J.: A stirling encounter with harmonic numbers. Math. Mag. 75, 95\u2013103 (2002)","journal-title":"Math. Mag."},{"issue":"6","key":"251_CR5","doi-asserted-by":"crossref","first-page":"1777","DOI":"10.1137\/S0097539704443793","volume":"36","author":"A Bostan","year":"2007","unstructured":"Bostan, A., Gaudry, P., Schost, \u00c9.: Linear recurrences with polynomial coefficients and application to integer factorization and Cartier-Manin operator. SIAM J. Comput. 36(6), 1777\u20131806 (2007)","journal-title":"SIAM J. Comput."},{"key":"251_CR6","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721182","volume-title":"Combinatorial Matrix Classes. Encyclopedia of Mathematics and Its Applications","author":"RA Brualdi","year":"2006","unstructured":"Brualdi, R.A.: Combinatorial Matrix Classes. Encyclopedia of Mathematics and Its Applications, vol. 108. Cambridge University Press, Cambridge (2006)"},{"key":"251_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511623677","volume-title":"Permutation Groups. London Mathematical Society Student Texts","author":"PJ Cameron","year":"1999","unstructured":"Cameron, P.J.: Permutation Groups. London Mathematical Society Student Texts. Cambridge University Press, Cambridge (1999)"},{"key":"251_CR8","doi-asserted-by":"crossref","unstructured":"Clarke, E.M.: The birth of model checking. In: 25 Years of Model Checking (2008)","DOI":"10.1007\/978-3-540-69850-0_1"},{"key":"251_CR9","doi-asserted-by":"crossref","unstructured":"Clarke, E.M., Emerson, E.A., Jha, S., Sistla, A.P.: Symmetry reductions in model checking. In: CAV, pp. 147\u2013158 (1998)","DOI":"10.1007\/BFb0028741"},{"issue":"1\/2","key":"251_CR10","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF00625969","volume":"9","author":"EM Clarke","year":"1996","unstructured":"Clarke, E.M., Jha, S., Enders, R., Filkorn, T.: Exploiting symmetry in temporal logic model checking. Formal Methods Syst. Des. 9(1\/2), 77\u2013104 (1996)","journal-title":"Formal Methods Syst. Des."},{"key":"251_CR11","unstructured":"Comtet, L.: Advanced Combinatorics: The Art of Finite and Infinite Expansions. D. Reidel Publishing Company. http:\/\/books.google.com.sg\/books?id=C0HPgWhEssYC (1974)"},{"key":"251_CR12","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)","edition":"3"},{"key":"251_CR13","unstructured":"Costa, E., Harvey, D.: Faster deterministic integer factorization. CoRR abs\/1201.2116 (2012)"},{"issue":"1","key":"251_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10472-009-9171-4","volume":"57","author":"AF Donaldson","year":"2009","unstructured":"Donaldson, A.F., Miller, A.: On the constructive orbit problem. Ann. Math. Artif. Intell. 57(1), 1\u201335 (2009)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"1\/2","key":"251_CR15","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF00625970","volume":"9","author":"EA Emerson","year":"1996","unstructured":"Emerson, E.A., Sistla, A.P.: Symmetry and model checking. Formal Methods Syst. Des. 9(1\/2), 105\u2013131 (1996)","journal-title":"Formal Methods Syst. Des."},{"key":"251_CR16","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity and a methodology of cryptographic protocol design (extended abstract). FOCS, 174\u2013187 (1986). doi: 10.1109\/SFCS.1986.47","DOI":"10.1109\/SFCS.1986.47"},{"key":"251_CR17","volume-title":"Handbook of Combinatorics","year":"1995","unstructured":"Graham, R.L., Gr\u00f6tschel, M., Lov\u00e1sz, L. (eds.): Handbook of Combinatorics, vol. 2. MIT Press, Cambridge, MA (1995)"},{"key":"251_CR18","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780199219858.001.0001","volume-title":"An Introduction to The Theory of Numbers","author":"GH Hardy","year":"2008","unstructured":"Hardy, G.H., Wright, E.M.: An Introduction to The Theory of Numbers, 6th edn. OUP Oxford, Oxford (2008)","edition":"6"},{"issue":"1\/2","key":"251_CR19","first-page":"41","volume":"9","author":"CN Ip","year":"1996","unstructured":"Ip, C.N., Dill, D.L.: Better verification through symmetry. Formal Methods Syst. Des. 9(1\/2), 41\u201375 (1996)","journal-title":"Formal Methods Syst. Des."},{"key":"251_CR20","doi-asserted-by":"publisher","unstructured":"Israeli, A., Jalfon, M.: Token management schemes and random walks yield self-stabilizing mutual exclusion. In: PoDC, pp. 119\u2013131 (1990). doi: 10.1145\/93385.93409","DOI":"10.1145\/93385.93409"},{"issue":"4","key":"251_CR21","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1145\/6490.6496","volume":"33","author":"R Kannan","year":"1986","unstructured":"Kannan, R., Lipton, R.J.: Polynomial-time algorithm for the orbit problem. J. ACM 33(4), 808\u2013821 (1986)","journal-title":"J. ACM"},{"key":"251_CR22","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1090\/dimacs\/011\/11","volume":"11","author":"EM Luks","year":"1993","unstructured":"Luks, E.M.: Permutation groups and polynomial-time computation. DIMACS Ser. Discrete Math. Theor. Comput. Sci. 11, 139\u2013175 (1993)","journal-title":"DIMACS Ser. Discrete Math. Theor. Comput. Sci."},{"key":"251_CR23","doi-asserted-by":"crossref","unstructured":"Norman, G.: Analysing randomized distributed algorithms. In: Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P., Siegle, M. (eds.) Validation of Stochastic Systems. LNCS, vol.\u00a02925, pp. 384\u2013418. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-24611-4_11"},{"key":"251_CR24","unstructured":"Primorial numbers (the on-line encyclopedia of integer sequences). http:\/\/oeis.org\/A002110"},{"key":"251_CR25","volume-title":"An Introduction to the Analysis of Algorithms","author":"R Sedgewick","year":"2013","unstructured":"Sedgewick, R., Flajolet, P.: An Introduction to the Analysis of Algorithms, 2nd edn. Addison-Wesley Professional, Boston (2013)","edition":"2"},{"key":"251_CR26","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139165464","volume-title":"A Computational Introduction to Number Theory and Algebra","author":"V Shoup","year":"2005","unstructured":"Shoup, V.: A Computational Introduction to Number Theory and Algebra, 2nd edn. Cambridge University Press, Cambridge (2005)","edition":"2"},{"key":"251_CR27","doi-asserted-by":"crossref","first-page":"799","DOI":"10.3390\/sym2020799","volume":"2","author":"T Wahl","year":"2010","unstructured":"Wahl, T., Donaldson, A.F.: Replication and abstraction: symmetry in automated formal verification. Symmetry 2, 799\u2013847 (2010)","journal-title":"Symmetry"},{"key":"251_CR28","doi-asserted-by":"crossref","unstructured":"Zhang, S.J., Sun, J., Sun, C., Liu, Y., Ma, J., Dong, J.S.: Constraint-based automatic symmetry detection. In: ASE, pp. 15\u201325 (2013)","DOI":"10.1109\/ASE.2013.6693062"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-015-0251-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-015-0251-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-015-0251-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,12]],"date-time":"2024-06-12T15:08:37Z","timestamp":1718204917000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-015-0251-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,19]]},"references-count":28,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["251"],"URL":"https:\/\/doi.org\/10.1007\/s00236-015-0251-0","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,19]]}}}