Ilias S. Kotsireas

According to our database1, Ilias S. Kotsireas authored at least 88 papers between 1999 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Nonexistence Certificates for Ovals in a Projective Plane of Order Ten.
CoRR, 2020

Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem.
CoRR, 2020

Guest editorial: revised selected papers from the LION 12 conference.
Ann. Math. Artif. Intell., 2020

Constructing orthogonal designs in powers of two via symbolic computation and rewriting techniques.
Ann. Math. Artif. Intell., 2020

2019
Preface.
Theor. Comput. Sci., 2019

Foreword.
Mathematics in Computer Science, 2019

A Nonexistence Certificate for Projective Planes of Order Ten with Weight 15 Codewords.
CoRR, 2019

Complex Golay Pairs up to Length 28: A Search via Computer Algebra and Programmatic SAT.
CoRR, 2019

SAT Solvers and Computer Algebra Systems: A Powerful Combination for Mathematics.
CoRR, 2019

Effective problem solving using SAT solvers.
CoRR, 2019

New Infinite Families of Perfect Quaternion Sequences and Williamson Sequences.
CoRR, 2019

Complexity in Medical Informatics.
Complexity, 2019

The SAT+CAS method for combinatorial search with applications to best matrices.
Ann. Math. Artif. Intell., 2019

How to Use Boltzmann Machines and Neural Networks for Covering Array Generation.
Proceedings of the Learning and Intelligent Optimization - 13th International Conference, 2019

PAF Reconstruction with the Orbits Method.
Proceedings of the Computer Algebra in Scientific Computing - 21st International Workshop, 2019

Root-Finding with Implicit Deflation.
Proceedings of the Computer Algebra in Scientific Computing - 21st International Workshop, 2019

Algebraic Models for Arbitrary Strength Covering Arrays over v-ary Alphabets.
Proceedings of the Algebraic Informatics - 8th International Conference, 2019

A SAT+CAS Approach to Finding Good Matrices: New Examples and Counterexamples.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Foreword.
Mathematics in Computer Science, 2018

Goethals-Seidel Difference Families with Symmetric or Skew Base Blocks.
Mathematics in Computer Science, 2018

A feasibility approach for constructing combinatorial designs of circulant type.
J. Comb. Optim., 2018

Applying Computer Algebra Systems and SAT Solvers to the Williamson Conjecture.
CoRR, 2018

The SAT+CAS paradigm and the Williamson conjecture.
ACM Comm. Computer Algebra, 2018

Evaluation of Tie-Breaking and Parameter Ordering for the IPO Family of Algorithms Used in Covering Array Generation.
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

Enumeration of Complex Golay Pairs via Programmatic SAT.
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

Autocorrelation via Runs.
Proceedings of the Artificial Intelligence and Symbolic Computation, 2018

A SAT+CAS Method for Enumerating Williamson Matrices of Even Order.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Mathematics in Computer Science: After 10 Years.
Mathematics in Computer Science, 2017

Foreword.
Mathematics in Computer Science, 2017

Combining SAT Solvers with Computer Algebra Systems to Verify Combinatorial Conjectures.
J. Autom. Reasoning, 2017

Matrix Representations by Means of Interpolation.
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

2016
Circulant weighing matrices: a demanding challenge for parallel optimization metaheuristics.
Optimization Letters, 2016

Hard satisfiable 3-SAT instances via autocorrelation.
J. Satisf. Boolean Model. Comput., 2016

On the Solution of Circulant Weighing Matrices Problems Using Algorithm Portfolios on Multi-core Processors.
Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures.
Proceedings of the 1st Workshop on Satisfiability Checking and Symbolic Computation co-located with 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2016), 2016

Computational Approaches to Open Problems in Combinatorics.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2016

2015
Some new periodic Golay pairs.
Numerical Algorithms, 2015

Foreword: Computer Algebra in Coding Theory and Cryptography.
Des. Codes Cryptogr., 2015

Compression of periodic complementary sequences and applications.
Des. Codes Cryptogr., 2015

Charm bracelets and their application to the construction of periodic Golay pairs.
Discret. Appl. Math., 2015

Constructing Orthogonal Designs in Powers of Two: Gröbner Bases Meet Equational Unification.
Proceedings of the 26th International Conference on Rewriting Techniques and Applications, 2015

2014
High performance computing theory and applications - Proceedings of SHARCNET Research Day 2012 (Guelph, Ontario).
J. Comput. Sci., 2014

Message from the SIGSAM Chair.
ACM Comm. Computer Algebra, 2014

A New Existence Condition for Hadamard Matrices with Circulant Core.
Proceedings of the Learning and Intelligent Optimization, 2014

2013
Preface.
Theor. Comput. Sci., 2013

Preface.
J. Comput. Sci., 2013

D-optimal matrices via quadratic integer optimization.
J. Heuristics, 2013

Structured Hadamard Conjecture.
Proceedings of the Number Theory and Related Fields, In Memory of Alf van der Poorten, 2013

2012
New weighing matrices constructed from two circulant submatrices.
Optimization Letters, 2012

Foreword.
Mathematics in Computer Science, 2012

Competent genetic algorithms for weighing matrices.
J. Comb. Optim., 2012

Ant-Based Approaches for Solving Autocorrelation Problems.
Proceedings of the Swarm Intelligence - 8th International Conference, 2012

2011
Preface.
Theor. Comput. Sci., 2011

Bruno Buchberger and the world of Gröbner bases.
J. Symb. Comput., 2011

A modified power spectral density test applied to weighing matrices with small weight.
J. Comb. Optim., 2011

D-Optimal Designs: A Mathematical Programming Approach Using Cyclotomic Cosets.
Informatica, Lith. Acad. Sci., 2011

Abstracts of WWCA 2011 in honor of Herb Wilf's 80th birthday.
ACM Comm. Computer Algebra, 2011

2010
An efficient string sorting algorithm for weighing matrices of small weight.
Optimization Letters, 2010

Periodic complementary binary sequences and Combinatorial Optimization algorithms.
J. Comb. Optim., 2010

New classes of orthogonal designs constructed from complementary sequences with given spread.
Australasian J. Combinatorics, 2010

On circulant and two-circulant weighing matrices.
Australasian J. Combinatorics, 2010

2009
Hadamard matrices of Williamson type: A challenge for Computer Algebra.
J. Symb. Comput., 2009

Using symmetries in the eigenvalue method for polynomial systems.
J. Symb. Comput., 2009

MDS and near-MDS self-dual codes over large prime fields.
Adv. in Math. of Comm., 2009

2008
Heuristic algorithms for Hadamard matrices with two circulant cores.
Theor. Comput. Sci., 2008

Foreword.
Mathematics in Computer Science, 2008

New orthogonal designs from weighing matrices.
Australasian J. Combinatorics, 2008

New skew-Hadamard matrices via computational algebra.
Australasian J. Combinatorics, 2008

2007
ISSAC 2007 poster abstracts.
ACM Comm. Computer Algebra, 2007

Orthogonal designs of order 32 and 64 via computational algebra.
Australasian J. Combinatorics, 2007

Inequivalent Hadamard matrices from orthogonal designs.
Proceedings of the Parallel Symbolic Computation, 2007

2006
Addendum: On the statistical analysis of the first digits of the Feigenbaum constants.
J. Frankl. Inst., 2006

Hadamard ideals and Hadamard matrices with two circulant cores.
Eur. J. Comb., 2006

WWCA 2006 abstracts.
ACM Comm. Computer Algebra, 2006

Genetic algorithms for orthogonal designs.
Australasian J. Combinatorics, 2006

2005
Foreword to the special issue on Applications of computer algebra.
J. Symb. Comput., 2005

Statistical analysis of the first digits of the binary expansion of Feigenbaum constants α and δ.
J. Frankl. Inst., 2005

A Meta-Software System for the Discovery of Hadamard Matrices.
Proceedings of the 19th Annual International Symposium on High Performance Computing Systems and Applications (HPCS 2005), 2005

2004
Exact Computation of the bifurcation Point B4 of the logistic Map and the Bailey-broadhurst Conjectures.
I. J. Bifurcation and Chaos, 2004

ANTS VI: algorithmic number theory symposium poster abstracts.
ACM SIGSAM Bulletin, 2004

2003
Exact implicitization of polynomial curves and surfaces.
ACM SIGSAM Bulletin, 2003

Implicit Polynomial Support Optimized for Sparseness.
Proceedings of the Computational Science and Its Applications, 2003

Implicitization Exploiting Sparseness.
Proceedings of the Geometric and Algorithmic Aspects of Computer-Aided Design and Manufacturing, 2003

2002
A geometric-numeric algorithm for absolute factorization of multivariate polynomials.
Proceedings of the Symbolic and Algebraic Computation, 2002

2001
Homotopies and polynomial system solving I: basic principles.
ACM SIGSAM Bulletin, 2001

Towards factoring bivariate approximate polynomials.
Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, 2001

2000
Numerical Implicitization of Parametric Hypersurfaces with Linear Algebra.
Proceedings of the Artificial Intelligence and Symbolic Computation, 2000

1999
Symmetry Theorems for the Newtonian 4- and 5-body Problems with Equal Masses.
Proceedings of the Second Workshop on Computer Algebra in Scientific Computing, 1999


  Loading...