60 citations · 171 across the 20 of their papers we have counts for
4 papers · 1 filter
Algorithms and Complexity for Counting Configurations in Steiner Triple Systems
Daniel Heinlein, Patric R. J. Östergård
Steiner triple systems form one of the most studied classes of combinatorial designs. Configurations, including subsystems, play a central role in the investigation of Steiner trip…
Field Trace Polynomial Codes for Secure Distributed Matrix Multiplication
Roberto Assis Machado, Rafael G. L. D'Oliveira, Salim El Rouayheb +1
We consider the problem of communication efficient secure distributed matrix multiplication. The previous literature has focused on reducing the number of servers as a proxy for mi…
Degree Tables for Secure Distributed Matrix Multiplication
Rafael G. L. D'Oliveira, Salim El Rouayheb, Daniel Heinlein +1
We consider the problem of secure distributed matrix multiplication (SDMM) in which a user wishes to compute the product of two matrices with the assistance of honest but curious s…
Steiner Triple Systems of Order 21 with Subsystems
Daniel Heinlein, Patric R. J. Östergård
The smallest open case for classifying Steiner triple systems is order 21. A Steiner triple system of order 21, an STS(21), can have subsystems of orders 7 and 9, and it is known t…