60 citations · 171 across the 20 of their papers we have counts for
22 papers
SPIRe: Boosting LLM Inference Throughput with Speculative Decoding
Sanjit Neelam, Daniel Heinlein, Vaclav Cvicek +2
Speculative decoding (SD) has been shown to reduce the latency of autoregressive decoding (AD) by 2-3x for small batch sizes. However, increasing throughput and therefore reducing…
Secure Distributed Matrix Multiplication with Precomputation
Ryann Cartor, Rafael G. L. D'Oliveira, Salim El Rouayheb +3
We consider the problem of secure distributed matrix multiplication in which a user wishes to compute the product of two matrices with the assistance of honest but curious servers.…
Enumerating Steiner Triple Systems
Daniel Heinlein, Patric R. J. Östergård
Steiner triple systems (STSs) have been classified up to order 19. Earlier estimations of the number of isomorphism classes of STSs of order 21, the smallest open case, are discour…
Constructing Random Steiner Triple Systems: An Experimental Study
Daniel Heinlein, Patric R. J. Östergård
Several methods for generating random Steiner triple systems (STSs) have been proposed in the literature, such as Stinson's hill-climbing algorithm and Cameron's algorithm, but the…
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…