Michael Soltys

CoRR, 2021

Cloudifying the Curriculum with AWS.

[BibT_eX]

[DOI]

Proceedings of the IEEE Frontiers in Education Conference, 2021

2020

A formal framework for Stringology.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

WordPress on AWS: a Communication Framework.

[BibT_eX]

[DOI]

Katharine Soltys

CoRR, 2020

Cybersecurity in the AWS Cloud.

[BibT_eX]

[DOI]

CoRR, 2020

Malware Persistence Mechanisms.

[BibT_eX]

[DOI]

Zane Gittins

Proceedings of the Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 24th International Conference KES-2020, 2020

Voyager: Tracking with a Click.

[BibT_eX]

[DOI]

Samuel Decanio

Kimo Hildreth

Proceedings of the Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 24th International Conference KES-2020, 2020

2019

When is the condition of order preservation met?

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2019

Approximating consistency in pairwise comparisons.

[BibT_eX]

[DOI]

Christopher Kuske

Konrad Kulakowski

Proceedings of the Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 23rd International Conference KES-2019, 2019

SEAKER: A mobile digital forensics triage device.

[BibT_eX]

[DOI]

Eric Gentry

Proceedings of the Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 23rd International Conference KES-2019, 2019

Deploying Health Campaign Strategies to Defend Against Social Engineering Threats.

[BibT_eX]

[DOI]

Noelle Abe

Proceedings of the Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 23rd International Conference KES-2019, 2019

2018

Constructing an indeterminate string from its associated graph.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

An improved upper bound and algorithm for clique covers.

[BibT_eX]

[DOI]

Ryan McIntyre

J. Discrete Algorithms, 2018

When condition of order preservation is met?

[BibT_eX]

[DOI]

CoRR, 2018

An Introduction to the Analysis of Algorithms

[BibT_eX]

[DOI]

WorldScientific, ISBN: 9789813235922, 2018

2017

On normalization of inconsistency indicators in pairwise comparisons.

[BibT_eX]

[DOI]

Waldemar W. Koczkodaj

Int. J. Approx. Reason., 2017

An exact upper bound on the size of minimal clique covers.

[BibT_eX]

[DOI]

Ryan McIntyre

CoRR, 2017

2016

Complex Ranking Procedures.

[BibT_eX]

[DOI]

Barbara Sandrasagra

Fundam. Informaticae, 2016

Important Facts and Observations about Pairwise Comparisons (the special issue edition).

[BibT_eX]

[DOI]

Waldemar W. Koczkodaj

Fundam. Informaticae, 2016

Forced Repetitions over Alphabet Lists.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2016, 2016

2015

A formal approach to ranking procedures.

[BibT_eX]

[DOI]

Int. J. Knowl. Based Intell. Eng. Syst., 2015

String shuffle: Circuits and graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2015

Non-repetitive Strings over Alphabet Lists.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

2014

Unshuffling a square is NP-hard.

[BibT_eX]

[DOI]

Sam Buss

J. Comput. Syst. Sci., 2014

Fair Ranking in Competitive Bidding Procurement: A Case Analysis.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference in Knowledge Based and Intelligent Information and Engineering Systems, 2014

2013

Feasible Combinatorial Matrix Theory.

[BibT_eX]

[DOI]

Ariel Germán Fernández

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Circuit Complexity of Shuffle.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2012

Unambiguous Functions in Logarithmic Space.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2012

Proving properties of matrices over Z<sub>2</sub>.

[BibT_eX]

[DOI]

Arch. Math. Log., 2012

2011

On the Complexity of Computing Winning Strategies for Finite Poset Games.

[BibT_eX]

[DOI]

Craig Wilson

Theory Comput. Syst., 2011

Feasible Proofs of Szpilrajn's Theorem - A Proof-Complexity Framework for Concurrent Automata.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2011

2009

On the Ehrenfeucht-Mycielski sequence.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2009

2008

Foreword: selected papers from the Franco-Canadian workshop on combinatorial algorithms.

[BibT_eX]

[DOI]

David Bremner

Antoine Deza

J. Comb. Optim., 2008

A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem

[BibT_eX]

[DOI]

CoRR, 2008

2007

A Propositional Proof System with Quantification Over Permutations.

[BibT_eX]

[DOI]

Tim Paterson

Fundam. Informaticae, 2007

The proof theoretic strength of the Steinitz exchange theorem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

2005

LA, permutations, and the Hajós Calculus.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Weak theories of linear algebra.

[BibT_eX]

[DOI]

Neil Thapen

Arch. Math. Log., 2005

Feasible Proofs of Matrix Properties with Csanky's Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 19th International Workshop, 2005

2004

The proof complexity of linear algebra.

[BibT_eX]

[DOI]

Stephen A. Cook

Ann. Pure Appl. Log., 2004

Matrix identities and the pigeonhole principle.

[BibT_eX]

[DOI]