<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Curtis Bright</style></author><author><style face="normal" font="default" size="100%">Ilias S. Kotsireas</style></author><author><style face="normal" font="default" size="100%">Albert Heinle</style></author><author><style face="normal" font="default" size="100%">Vijay Ganesh</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Manuel Kauers</style></author><author><style face="normal" font="default" size="100%">Alexey Ovchinnikov</style></author><author><style face="normal" font="default" size="100%">Éric Schost</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Enumeration of Complex Golay Pairs via Programmatic SAT</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2018, New York, NY, USA, July 16-19, 2018</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1145/3208976.3209006</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">ACM</style></publisher><pages><style face="normal" font="default" size="100%">111–118</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record></records></xml>