{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:30:08Z","timestamp":1750221008550,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,8]],"date-time":"2019-07-08T00:00:00Z","timestamp":1562544000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-2018-04950"],"award-info":[{"award-number":["RGPIN-2018-04950"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,8]]},"DOI":"10.1145\/3326229.3326260","type":"proceedings-article","created":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T12:53:20Z","timestamp":1562676800000},"page":"179-186","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Quadratic-Time Algorithms for Normal Elements"],"prefix":"10.1145","author":[{"given":"Mark","family":"Giesbrecht","sequence":"first","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}]},{"given":"Armin","family":"Jamshidpey","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}]},{"given":"\u00c9ric","family":"Schost","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}]}],"member":"320","published-online":{"date-parts":[[2019,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(02)00471-8"},{"volume-title":"Proc. EUROCODE'94","author":"Augot D.","key":"e_1_3_2_1_2_1","unstructured":"D. Augot and P. Camion. 1994. A deterministic algorithm for computing a normal basis in a finite field. In Proc. EUROCODE'94, P. Charpin (Ed.)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","unstructured":"E. Bach and J. Shallit. 1996. Algorithmic Number Theory Volume 1: Efficient Algorithms. MIT Press Cambridge MA.","DOI":"10.5555\/236590"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2005.07.001"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/322092.322099"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/74540.74556"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2002.06.006"},{"key":"e_1_3_2_1_8_1","unstructured":"C. Curtis and I. Reiner. 1988. Representation theory of finite groups and associative algebras. John Wiley & Sons Inc. New York New York. xiv+689 pages."},{"key":"e_1_3_2_1_9_1","volume-title":"Proc. of Transgressive Computing","author":"Dahan X.","year":"2006","unstructured":"X. Dahan, M. Moreno Maza, \u00c9. Schost, and Y. Xie. 2006. On the complexity of the D5 principle. In Proc. of Transgressive Computing 2006. Granada, Spain."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1999.0309"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","unstructured":"J. von zur Gathen and J. Gerhard. 2013. Modern Computer Algebra (third edition). Cambridge University Press Cambridge U.K.","DOI":"10.5555\/2512973"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80158-7"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01272074"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/jnth.1999.2388"},{"key":"e_1_3_2_1_15_1","volume-title":"Algebraic construction of quasisplit algebraic tori. ArXiv","author":"Jamshidpey A.","year":"1801","unstructured":"A. Jamshidpey, N. Lemire, and \u00c9. Schost. 2018. Algebraic construction of quasisplit algebraic tori. ArXiv: 1801.09629 (2018)."},{"volume-title":"Presentations of Groups","author":"Johnson D. L.","key":"e_1_3_2_1_16_1","unstructured":"D. L. Johnson. 1976. Presentations of Groups. Cambridge University Press, Cambridge-New York-Melbourne. v+204 pages. London Mathematical Society Lecture Notes Series, No. 22."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","unstructured":"E. Kaltofen and D. Saunders. 1991. On Wiedemann's method of solving sparse linear systems. In AAECC-9 (LNCS) Vol. 539. Springer Verlag 29--38.","DOI":"10.5555\/646027.676885"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-98-00944-2"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-004-0185-3"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(88)90026-0"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/08073408X"},{"volume-title":"Algebra","author":"Lang S.","key":"e_1_3_2_1_22_1","unstructured":"S. Lang. 2002. Algebra (third ed.). Graduate Texts in Mathematics, Vol. 211. Springer-Verlag, New York. xvi+914 pages."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2608628.2608664"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/3174304.3175337"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1991-1052099-2"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2008.04.019"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(83)90054-3"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-017-9555-5"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1080\/00927879408825099"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1006\/jnth.1993.1031"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02242355"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1995.1055"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057137"}],"event":{"name":"ISSAC '19: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Beijing China","acronym":"ISSAC '19"},"container-title":["Proceedings of the 2019 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3326229.3326260","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3326229.3326260","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:25:59Z","timestamp":1750206359000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3326229.3326260"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,8]]},"references-count":33,"alternative-id":["10.1145\/3326229.3326260","10.1145\/3326229"],"URL":"https:\/\/doi.org\/10.1145\/3326229.3326260","relation":{},"subject":[],"published":{"date-parts":[[2019,7,8]]},"assertion":[{"value":"2019-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}