Bright, Curtis; Kotsireas, Ilias; Heinle, Albert; Ganesh, Vijay Complex Golay pairs up to length 28: a search via computer algebra and programmatic SAT. (English) Zbl 1468.68276 J. Symb. Comput. 102, 153-172 (2021). MSC: 68V05 05A15 11B83 68R07 68W30 94A55 PDFBibTeX XMLCite \textit{C. Bright} et al., J. Symb. Comput. 102, 153--172 (2021; Zbl 1468.68276) Full Text: DOI arXiv
Bright, Curtis; Kotsireas, Ilias; Ganesh, Vijay Applying computer algebra systems with SAT solvers to the Williamson conjecture. (English) Zbl 1432.68595 J. Symb. Comput. 100, 187-209 (2020). MSC: 68W30 05B20 PDFBibTeX XMLCite \textit{C. Bright} et al., J. Symb. Comput. 100, 187--209 (2020; Zbl 1432.68595) Full Text: DOI arXiv
Bright, Curtis; Kotsireas, Ilias; Heinle, Albert; Ganesh, Vijay Enumeration of complex Golay pairs via programmatic SAT. (English) Zbl 1467.68202 Arreche, Carlos (ed.), Proceedings of the 43rd international symposium on symbolic and algebraic computation, ISSAC 2018, New York, NY, USA, July 16–19, 2018. New York, NY: Association for Computing Machinery (ACM). 111-118 (2018). MSC: 68V05 05A15 11B83 68R07 68W30 94A55 PDFBibTeX XMLCite \textit{C. Bright} et al., in: Proceedings of the 43rd international symposium on symbolic and algebraic computation, ISSAC 2018, New York, NY, USA, July 16--19, 2018. New York, NY: Association for Computing Machinery (ACM). 111--118 (2018; Zbl 1467.68202) Full Text: DOI arXiv
Dobrev, Stefan; Královič, Rastislav; Pardubská, Dana Treasure hunt with barely communicating agents. (English) Zbl 1487.68042 Aspnes, James (ed.) et al., 21st international conference on principles of distributed systems, OPODIS 2017, Lisboa, Portugal, December 18–20, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 95, Article 14, 16 p. (2018). MSC: 68M14 68M15 68P10 68W10 PDFBibTeX XMLCite \textit{S. Dobrev} et al., LIPIcs -- Leibniz Int. Proc. Inform. 95, Article 14, 16 p. (2018; Zbl 1487.68042) Full Text: DOI
Yuan, Jie; Zhou, Mingquan; Geng, Guohua; Zhang, Yuhe Automatic reassembly of fractured fragments using Morse topological features. (Chinese. English summary) Zbl 1424.68199 Acta Autom. Sin. 44, No. 8, 1486-1495 (2018). MSC: 68U07 PDFBibTeX XMLCite \textit{J. Yuan} et al., Acta Autom. Sin. 44, No. 8, 1486--1495 (2018; Zbl 1424.68199) Full Text: DOI
Tzanakis, Georgios; Moura, Lucia; Panario, Daniel; Stevens, Brett Constructing new covering arrays from LFSR sequences over finite fields. (English) Zbl 1328.05027 Discrete Math. 339, No. 3, 1158-1171 (2016). MSC: 05B15 68N30 68P10 PDFBibTeX XMLCite \textit{G. Tzanakis} et al., Discrete Math. 339, No. 3, 1158--1171 (2016; Zbl 1328.05027) Full Text: DOI
Elsawy, Ahmed; Zaki, Amira; Abdennadher, Slim CHR exhaustive execution – revisited. (English) Zbl 1407.68074 De Vos, Marina (ed.) et al., Technical communications of the 31st international conference on logic programming, ICLP 2015, Cork, Ireland, August 31 – September 4, 2015. Aachen: RWTH Aachen. CEUR Workshop Proc. 1433, 13 p. (2015). MSC: 68N15 68N30 PDFBibTeX XMLCite \textit{A. Elsawy} et al., CEUR Workshop Proc. 1433, 13 p. (2015; Zbl 1407.68074) Full Text: Link
Elsawy, Ahmed; Zaki, Amira; Abdennadher, Slim Exhaustive execution of CHR through source-to-source transformation. (English) Zbl 1457.68040 Proietti, Maurizio (ed.) et al., Logic-based program synthesis and transformation. 24th international symposium, LOPSTR 2014, Canterbury, UK, September 9–11, 2014. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 8981, 59-73 (2015). MSC: 68N17 PDFBibTeX XMLCite \textit{A. Elsawy} et al., Lect. Notes Comput. Sci. 8981, 59--73 (2015; Zbl 1457.68040) Full Text: DOI
Bouillaguet, Charles; Cheng, Chen-Mou; Chou, Tung; Niederhagen, Ruben; Yang, Bo-Yin Fast exhaustive search for quadratic systems in \(\mathbb {F}_2\) on FPGAs. (English) Zbl 1339.94038 Lange, Tanja (ed.) et al., Selected areas in cryptography – SAC 2013. 20th international conference, Burnaby, BC, Canada, August 14–16, 2013. Revised selected papers. Berlin: Springer (ISBN 978-3-662-43413-0/pbk; 978-3-662-43414-7/ebook). Lecture Notes in Computer Science 8282, 205-222 (2014). MSC: 94A60 11T06 68W30 PDFBibTeX XMLCite \textit{C. Bouillaguet} et al., Lect. Notes Comput. Sci. 8282, 205--222 (2014; Zbl 1339.94038) Full Text: DOI
Rijnbeek, Peter R.; Kors, Jan A. Finding a short and accurate decision rule in disjunctive normal form by exhaustive search. (English) Zbl 1470.68164 Mach. Learn. 80, No. 1, 33-62 (2010). MSC: 68T05 68T20 PDFBibTeX XMLCite \textit{P. R. Rijnbeek} and \textit{J. A. Kors}, Mach. Learn. 80, No. 1, 33--62 (2010; Zbl 1470.68164) Full Text: DOI
Bouillaguet, Charles; Chen, Hsieh-Chung; Cheng, Chen-Mou; Chou, Tung; Niederhagen, Ruben; Shamir, Adi; Yang, Bo-Yin Fast exhaustive search for polynomial systems in \({\mathbb{F}_2}\). (English) Zbl 1297.94055 Mangard, Stefan (ed.) et al., Cryptographic hardware and embedded systems – CHES 2010. 12th international workshop, Santa Barbara, USA, August 17–20, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15030-2/pbk). Lecture Notes in Computer Science 6225, 203-218 (2010). MSC: 94A60 11T06 68W30 PDFBibTeX XMLCite \textit{C. Bouillaguet} et al., Lect. Notes Comput. Sci. 6225, 203--218 (2010; Zbl 1297.94055) Full Text: DOI
Hermans, Jens; Schneider, Michael; Buchmann, Johannes; Vercauteren, Frederik; Preneel, Bart Parallel shortest lattice vector enumeration on graphics cards. (English) Zbl 1284.68638 Bernstein, Daniel J. (ed.) et al., Progress in cryptology – AFRICACRYPT 2010. Third international conference on cryptology in Africa, Stellenbosch, South Africa, May 3–6, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-12677-2/pbk). Lecture Notes in Computer Science 6055, 52-68 (2010). MSC: 68W10 94A60 PDFBibTeX XMLCite \textit{J. Hermans} et al., Lect. Notes Comput. Sci. 6055, 52--68 (2010; Zbl 1284.68638) Full Text: DOI
Sarkar, Sumanta; Maitra, Subhamov Efficient search for symmetric Boolean functions under constraints on Walsh spectrum values. (English) Zbl 1172.94657 J. Comb. Math. Comb. Comput. 68, 163-191 (2009). MSC: 94C10 68R05 PDFBibTeX XMLCite \textit{S. Sarkar} and \textit{S. Maitra}, J. Comb. Math. Comb. Comput. 68, 163--191 (2009; Zbl 1172.94657)
Kohnert, Axel; Kurz, Sascha Integral point sets over \(\mathbb Z_n^m\). (English) Zbl 1173.05316 Discrete Appl. Math. 157, No. 9, 2105-2117 (2009). MSC: 05C12 05C85 68R10 PDFBibTeX XMLCite \textit{A. Kohnert} and \textit{S. Kurz}, Discrete Appl. Math. 157, No. 9, 2105--2117 (2009; Zbl 1173.05316) Full Text: DOI
Miroiu, Maria On tree search algorithms. (English) Zbl 1240.68332 Bul. Ştiinţ., Univ. Piteşti, Ser. Mat. Inf. 14, 103-110 (2008). MSC: 68T20 05C05 PDFBibTeX XMLCite \textit{M. Miroiu}, Bul. Științ., Univ. Pitești, Ser. Mat. Inf. 14, 103--110 (2008; Zbl 1240.68332)
Chee, Yeow Meng; Ling, San Improved lower bounds for constant GC-content DNA codes. (English) Zbl 1305.68077 IEEE Trans. Inf. Theory 54, No. 1, 391-394 (2008). MSC: 68P20 92D20 94B60 94B65 PDFBibTeX XMLCite \textit{Y. M. Chee} and \textit{S. Ling}, IEEE Trans. Inf. Theory 54, No. 1, 391--394 (2008; Zbl 1305.68077) Full Text: DOI arXiv
Moisset de Espanés, Pablo; Goel, Ashish Toward minimum size self-assembled counters. (English) Zbl 1154.68417 Nat. Comput. 7, No. 3, 317-334 (2008). MSC: 68Q10 68T10 68W05 PDFBibTeX XMLCite \textit{P. Moisset de Espanés} and \textit{A. Goel}, Nat. Comput. 7, No. 3, 317--334 (2008; Zbl 1154.68417) Full Text: DOI
Rosenblueth, David A. Chain programs for writing deterministic metainterpreters. (English) Zbl 1087.68533 Theory Pract. Log. Program. 2, No. 2, 203-232 (2002). MSC: 68N17 PDFBibTeX XMLCite \textit{D. A. Rosenblueth}, Theory Pract. Log. Program. 2, No. 2, 203--232 (2002; Zbl 1087.68533) Full Text: DOI Link
Gharavi-Alkhansari, Mohammad A fast globally optimal algorithm for template matching using low-resolution pruning. (English) Zbl 1041.68539 IEEE Trans. Image Process. 10, No. 4, 526-533 (2001). MSC: 68U10 68T10 PDFBibTeX XMLCite \textit{M. Gharavi-Alkhansari}, IEEE Trans. Image Process. 10, No. 4, 526--533 (2001; Zbl 1041.68539) Full Text: DOI
Litvinenko, A. E. Determination of the class of validity of logical formulas by directed exhaustive search. (English. Russian original) Zbl 1010.68169 Cybern. Syst. Anal. 36, No. 5, 652-658 (2000); translation from Kibern. Sist. Anal. 2000, No. 5, 23-31 (2000). MSC: 68T15 PDFBibTeX XMLCite \textit{A. E. Litvinenko}, Cybern. Syst. Anal. 36, No. 5, 652--658 (2000; Zbl 1010.68169); translation from Kibern. Sist. Anal. 2000, No. 5, 23--31 (2000) Full Text: DOI
Susmaga, Robert Generation of exhaustive rule sets using a reduct generating algorithm. (English) Zbl 0965.68092 Kłopotek, Mieczysław (ed.) et al., Intelligent information systems. Proceedings of the IIS 2000 symposium, Bystra, Poland, June 12-16, 2000. Heidelberg: Physica Verlag. Advances in Soft Computing. 65-74 (2000). MSC: 68T20 PDFBibTeX XMLCite \textit{R. Susmaga}, in: Intelligent information systems. Proceedings of the IIS 2000 symposium, Bystra, Poland, June 12--16, 2000. Heidelberg: Physica Verlag. 65--74 (2000; Zbl 0965.68092)
Nievergelt, Jurg; Deo, Narsingh; Marzetta, Ambros Memory-efficient enumeration of constrained spanning trees. (English) Zbl 1338.68116 Inf. Process. Lett. 72, No. 1-2, 47-53 (1999). MSC: 68Q25 68R10 68T20 PDFBibTeX XMLCite \textit{J. Nievergelt} et al., Inf. Process. Lett. 72, No. 1--2, 47--53 (1999; Zbl 1338.68116) Full Text: DOI Link
Low, Chor Ping A fast search algorithm for the quorumcast routing problem. (English) Zbl 1078.68596 Inf. Process. Lett. 66, No. 2, 87-92 (1998). MSC: 68M20 68T20 PDFBibTeX XMLCite \textit{C. P. Low}, Inf. Process. Lett. 66, No. 2, 87--92 (1998; Zbl 1078.68596) Full Text: DOI
Kreinovich, V. (ed.); Mints, G. (ed.) Problems of reducing the exhaustive search. Transl. from the Russian by V. Minachin. (English) Zbl 0853.00021 Translations. Series 2. American Mathematical Society (AMS). 178. Providence, RI: American Mathematical Society (AMS). x, 189 p. (1997). MSC: 00B15 68-06 68P10 PDFBibTeX XMLCite \textit{V. Kreinovich} (ed.) and \textit{G. Mints} (ed.), Problems of reducing the exhaustive search. Transl. from the Russian by V. Minachin. Providence, RI: American Mathematical Society (1997; Zbl 0853.00021)
Lewandowski, Gary; Condon, Anne Experiments with parallel graph coloring heuristics and applications of graph coloring. (English) Zbl 0862.90122 Johnson, David S. (ed.) et al., Cliques, coloring, and satisfiability. Second DIMACS implementation challenge. Proceedings of a workshop held at DIMACS, October 11–13, 1993. Providence, RI: American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 26, 309-334 (1996). MSC: 90C35 05C90 68U99 05C15 68R05 68R10 PDFBibTeX XMLCite \textit{G. Lewandowski} and \textit{A. Condon}, DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 26, 309--334 (1996; Zbl 0862.90122)
Biham, Eli; Biryukov, Alex How to strengthen DES using existing hardware. (English) Zbl 0873.94014 Pieprzyk, Josef (ed.) et al., Advances in cryptology - ASIACRYPT ’94. 4th international conference on the theory and applications of cryptology, Wollongong, Australia, November 28 - December 1, 1994. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 917, 398-412 (1995). MSC: 94A60 68P25 PDFBibTeX XMLCite \textit{E. Biham} and \textit{A. Biryukov}, Lect. Notes Comput. Sci. 917, 398--412 (1995; Zbl 0873.94014)
Hamamoto, Yoshihiko; Uchimura, Shunji; Matsuura, Yutaka; Kanaoka, Taiho; Tomita, Shingo Evaluation of the branch and bound algorithm for feature selection. (English) Zbl 0941.68722 Pattern Recognit. Lett. 11, No. 7, 453-456 (1990). MSC: 68T10 90C57 PDFBibTeX XMLCite \textit{Y. Hamamoto} et al., Pattern Recognit. Lett. 11, No. 7, 453--456 (1990; Zbl 0941.68722) Full Text: DOI
Cull, Paul Analysis of algorithms. (English) Zbl 0772.68050 Lectures in applied mathematics and informatics, 1-61 (1990). Reviewer: C.D.Ziegler (Berlin) MSC: 68Q25 PDFBibTeX XMLCite \textit{P. Cull}, in: Lectures in applied mathematics and informatics, . 1--61 (1990; Zbl 0772.68050)
Sedgewick, Robert Algorithms. 2nd ed. (English) Zbl 0717.68005 Addison-Wesley Series in Computer Science. Reading, MA: Addison-Wesley. XII, 657 p.640 p. DM 80.00 (1989). MSC: 68-01 68W10 68N01 68P10 68Q25 68P05 PDFBibTeX XMLCite \textit{R. Sedgewick}, Algorithms. 2nd ed. Reading, MA: Addison-Wesley (1989; Zbl 0717.68005)
Ueda, Kazunori Guarded Horn clauses. (English) Zbl 0771.68037 Cambridge, MA: MIT Press; Tokyo: Univ. Tokyo, Information Engineering Course, VI, 161 p. (1988). MSC: 68N17 68T99 68N15 PDFBibTeX XMLCite \textit{K. Ueda}, Guarded Horn clauses. Cambridge, MA: MIT Press; Also: Univ. Tokyo, Information Engineering Course (1988; Zbl 0771.68037)
Amirazizi, Hamid R.; Hellman, Martin E. Time-memory-processor trade-offs. (English) Zbl 0651.68047 IEEE Trans. Inf. Theory 34, No. 3, 505-512 (1988). MSC: 68Q25 94A60 68P10 PDFBibTeX XMLCite \textit{H. R. Amirazizi} and \textit{M. E. Hellman}, IEEE Trans. Inf. Theory 34, No. 3, 505--512 (1988; Zbl 0651.68047) Full Text: DOI Link
Ueda, Kazunori Making exhaustive search programs deterministic. (English) Zbl 0631.68074 New Generation Comput. 5, 29-44 (1987). MSC: 68T20 68N01 68T15 PDFBibTeX XMLCite \textit{K. Ueda}, New Generation Comput. 5, 29--44 (1987; Zbl 0631.68074) Full Text: DOI
Regener, Eric; Lam, Clement W. H.; Opatrny, Jaroslav Exhaustive searching in Ramsey theory. (English) Zbl 0635.05032 Combinatorics, graph theory and computing, Proc. 16th Southeast. Conf., Boca Raton/Fla. 1985, Congr. Numerantium 49, 147-160 (1985). MSC: 05C55 68R10 PDFBibTeX XML
Stepashko, V. S. A finite selection procedure for pruning an exhaustive search of models. (English. Russian original) Zbl 0542.68090 Sov. Autom. Control 16, No. 4, 88-93 (1983); translation from Avtomatika 1983, No. 4, 84-88 (1983). MSC: 68U20 PDFBibTeX XMLCite \textit{V. S. Stepashko}, Sov. Autom. Control 16, No. 4, 88--93 (1983; Zbl 0542.68090); translation from Avtomatika 1983, No. 4, 84--88 (1983)
Sedgewick, Robert Algorithms. (English) Zbl 0529.68002 Addison-Wesley Series in Computer Science. Reading, Massachusetts etc.: Addison-Wesley Publishing Company. VIII, 552 p. (1983). MSC: 68-01 68W99 68N01 68Rxx 68P10 68R10 68R99 68Q25 PDFBibTeX XML
Richards, Ronald C. Shape distribution of height-balanced trees. (English) Zbl 0518.68037 Inf. Process. Lett. 17, 17-20 (1983). MSC: 68R10 05C05 PDFBibTeX XMLCite \textit{R. C. Richards}, Inf. Process. Lett. 17, 17--20 (1983; Zbl 0518.68037) Full Text: DOI
Ershov, A. P. (ed.); Knuth, D. E. (ed.) [Zemanek, H.; Knuth, D. E.; Uspensky, V. A.; Semenov, A. L.; Barzdin, J. M.; Manin, Yu. I.; Nepeivoda, N. N.; Tyugu, E. H.; Letichevsky, A. A.; Adel’son-Vel’skii, G. M.; Slisenko, A. O.; Alder, A.; Strassen, V.; Kleene, S. C.; Shanin, N. A.; Tseytlin, G. S.; Ershov, A. P.; Bauer, F. L.; Glushkov, V. M.; Matijasevic, Y.; Matiyasevich, Yu. V.; Buda, A.; Anisimov, A. V.] Algorithms in modern mathematics and computer science. Proceedings, Urgench, Uzbek SSR, September 16–22, 1979. (English) Zbl 0477.68035 Lecture Notes in Computer Science, 122. Berlin-Heidelberg-New York: Springer-Verlag. XI, 487 p. DM 45.50; $ 21.20 (1981). MSC: 68W99 68-06 01A30 03-06 68Q25 03D60 03B25 03D25 11U05 68N01 03F60 03F65 94A15 68P10 03A05 03D40 03D15 68Q60 PDFBibTeX XML
Zeps, D. A. An exhaustive search algorithm for Hamiltonian cycles. (Russian. German and English summaries). (English) Zbl 0436.05042 Elektron. Inform.-verarb. Kybernetik 16, 69-75 (1980). MSC: 05C45 05-04 68W99 PDFBibTeX XMLCite \textit{D. A. Zeps}, Elektron. Informationsverarbeitung Kybernetik 16, 69--75 (1980; Zbl 0436.05042)
Georgieva, N. C. An algorithm for exact partitioning of a graph with R vertices into two subgraphs. (Bulgarian) Zbl 0413.68059 God. Vissh. Uchebn. Zaved., Prilozhna Mat. 12(1976), No. 3, 47-56 (1978). MSC: 68R10 05C99 PDFBibTeX XMLCite \textit{N. C. Georgieva}, God. Vissh. Uchebn. Zaved., Prilozh. Mat. 12, No. 3, 47--56 (1978; Zbl 0413.68059)