selected scholarly activity
-
books
-
chapters
- SEAKER: A Tool for Fast Digital Forensic Triage. Lecture Notes in Networks and Systems. 1227-1243. 2020
-
conferences
- A Hands-on Approach to Cloudifying Curriculum in Computing and Engineering Education. Proceedings - Frontiers in Education Conference, FIE. 2021
- Malware Persistence Mechanisms. Procedia Computer Science. 88-97. 2020
- Voyager: Tracking with a Click. Procedia Computer Science. 98-107. 2020
- Approximating consistency in pairwise comparisons. Procedia Computer Science. 814-823. 2019
- Deploying Health Campaign Strategies to Defend Against Social Engineering Threats. Procedia Computer Science. 824-831. 2019
- SEAKER: A mobile digital forensics triage device. Procedia Computer Science. 1652-1661. 2019
- A permutation-based algorithm for computing covers from matchings. Proceedings of the 32nd International Conference on Computers and Their Applications, CATA 2017. 27-32. 2017
- Forced Repetitions over Alphabet Lists. PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2016. 125-134. 2016
- A Formal Framework for Stringology. PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2015. 90-103. 2015
- Non-repetitive Strings over Alphabet Lists. Lecture Notes in Computer Science. 270-281. 2015
- Fair Ranking in Competitive Bidding Procurement: A Case Analysis. Procedia Computer Science. 1138-1144. 2014
- Circuit Complexity of Shuffle. Lecture Notes in Computer Science. 402-411. 2013
- Perceptions of foundational knowledge by computer science students. Proceedings of the Seventeenth Western Canadian Conference on Computing Education. 19-23. 2012
- On the Complexity of Computing Winning Strategies for Finite Poset Games. Theory of Computing Systems. 680-692. 2011
- LA, permutations, and the Hajós Calculus. Theoretical Computer Science. 321-333. 2005
- Feasible Proofs of Matrix Properties with Csanky's Algorithm.. CSL. 493-508. 2005
- The proof complexity of linear algebra. Annals of Pure and Applied Logic. 277-323. 2004
- LA, Permutations, and the Hajós Calculus. Lecture Notes in Computer Science. 1176-1187. 2004
- Finite fields and propositional proof systems. 7TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL II, PROCEEDINGS. 141-146. 2003
- The proof complexity of linear algebra. Proceedings - Symposium on Logic in Computer Science. 335-344. 2002
-
journal articles
- Cloudifying the Curriculum with AWS. Proceedings - Frontiers in Education Conference, FIE. 2021-October. 2021
- Minimum Path Star Topology Algorithms for Weighted Regions and Obstacles 2021
- WordPress on AWS: a Communication Framework 2020
- Cybersecurity in the AWS Cloud 2020
- A formal framework for Stringology. Discrete Applied Mathematics. 274:141-151. 2020
- When is the condition of order preservation met?. European Journal of Operational Research. 277:248-254. 2019
- Constructing an indeterminate string from its associated graph. Theoretical Computer Science. 710:88-96. 2018
- An improved upper bound and algorithm for clique covers. Journal of Discrete Algorithms (Amsterdam). 48:42-56. 2018
- On normalization of inconsistency indicators in pairwise comparisons. International Journal of Approximate Reasoning. 86:73-79. 2017
- Computing covers from matchings with permutations. International Journal of Computers and their Applications. 24:72-80. 2017
- An exact upper bound on the size of minimal clique covers. CoRR. abs/1705.06326. 2017
- On normalization of inconsistency indicators in pairwise comparisons.. CoRR. abs/1702.07205. 2017
- Complex Ranking Procedures. Fundamenta Informaticae. 144:223-240. 2016
- Important Facts and Observations about Pairwise Comparisons (the special issue edition). Fundamenta Informaticae. 144:291-307. 2016
- A formal approach to ranking procedures. International Journal of Knowledge-Based and Intelligent Engineering Systems. 19:225-234. 2016
- Ensemble methods for uplift modeling. Data mining and knowledge discovery. 29:1531-1559. 2015
- String shuffle: Circuits and graphs. Journal of Discrete Algorithms (Amsterdam). 31:120-128. 2015
- Unshuffling a square is NP-hard. Journal of Computer and System Sciences. 80:766-776. 2014
- Feasible Combinatorial Matrix Theory. Lecture Notes in Computer Science. 8087:777-788. 2013
- Feasible combinatorial matrix theory. CoRR. abs/1303.6453. 2013
- Proving properties of matrices over $${\mathbb{Z}_{2}}$$. Archive for Mathematical Logic. 51:535-551. 2012
- Unambiguous Functions in Logarithmic Space. Fundamenta Informaticae. 114:129-147. 2012
- Unshuffling a Square is NP-Hard.. CoRR. abs/1211.7161. 2012
- Feasible Proofs of Szpilrajn's Theorem - A Proof-Complexity Framework for Concurrent Automata.. J. Autom. Lang. Comb.. 16:37-48. 2011
- On the Ehrenfeucht–Mycielski sequence. Journal of Discrete Algorithms (Amsterdam). 7:500-508. 2009
- A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem. CoRR. abs/0811.3959. 2008
- Foreword: selected papers from the Franco-Canadian workshop on combinatorial algorithms. Journal of Combinatorial Optimization. 16:323-323. 2008
- A propositional proof system with quantification over permutations. Fundamenta Informaticae. 79:71-83. 2007
- The proof theoretic strength of the Steinitz exchange theorem. Discrete Applied Mathematics. 155:53-60. 2007
- Weak theories of linear algebra. Archive for Mathematical Logic. 44:195-208. 2005
- Feasible Proofs of Matrix Properties with Csanky’s Algorithm. Lecture Notes in Computer Science. 3634:493-508. 2005
- Matrix identities and the pigeonhole principle. Archive for Mathematical Logic. 43:351-357. 2004
- Berkowitz's algorithm and clow sequences. Electronic Journal of Linear Algebra. 9:42-54. 2002
- Extended frege and gaussian elimination. Bulletin of the Section of Logic. 31:189-205. 2002
- Boolean programs and quantified propositional proof systems. Bulletin of the Section of Logic. 28:119-129. 1999