3 papers
cs.IT2026
Improved Degree Tables for Secure Distributed Matrix Multiplication
John Byrne, Rafael G. L. D'Oliveira, Michael Tait
In secure distributed matrix multiplication, a user wishes to compute the product of two matrices with the assistance of servers, in such a way that any colluding servers learn…
math.CO2023
Forbidden subgraphs and complete partitions
John Byrne, Michael Tait, Craig Timmons
A graph is called an -graph if its vertex set can be partitioned into parts, each having at most vertices and there is at least one edge between any two parts. Let $…
math.CO2023
Improved upper bounds on even-cycle creating Hamilton paths
John Byrne, Michael Tait
We study the function , the maximum number of Hamilton paths such that the union of any pair of them contains as a subgraph. We give upper bounds on this quan…