Tables of subspace codes. - Daniel Heinlein; Michael Kiermaier; Sascha Kurz; Alfred Wassermann (CoRR, 2016)

Asymptotic Bounds for the Sizes of Constant Dimension Codes and an Improved Lower Bound. - Daniel Heinlein; Sascha Kurz (ICMCTA, 2017)

Coset Construction for Subspace Codes. - Daniel Heinlein; Sascha Kurz (IEEE Trans. Inf. Theory, 2017)

Binary subspace codes in small ambient spaces. - Daniel Heinlein; Sascha Kurz (Adv. Math. Commun., 2018)

New LMRD bounds for constant dimension codes and improved constructions. - Daniel Heinlein (CoRR, 2018)

Generalized vector space partitions. - Daniel Heinlein; Thomas Honold; Michael Kiermaier; Sascha Kurz (Australas. J Comb., 2019)

A subspace code of size 333 in the setting of a binary q-analog of the Fano plane. - Daniel Heinlein; Michael Kiermaier; Sascha Kurz; Alfred Wassermann (Adv. Math. Commun., 2019)

Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6. - Daniel Heinlein; Thomas Honold; Michael Kiermaier; Sascha Kurz; Alfred Wassermann (Des. Codes Cryptogr., 2019)

New LMRD Code Bounds for Constant Dimension Codes and Improved Constructions. - Daniel Heinlein (IEEE Trans. Inf. Theory, 2019)

Notes on Communication and Computation in Secure Distributed Matrix Multiplication. - Rafael G. L. D'Oliveira; Salim El Rouayheb; Daniel Heinlein; David A. Karpuk (CNS, 2020)

New and updated semidefinite programming bounds for subspace codes. - Daniel Heinlein; Ferdinand Ihringer (Adv. Math. Commun., 2020)

Field Trace Polynomial Codes for Secure Distributed Matrix Multiplication. - Roberto Assis Machado; Rafael G. L. D'Oliveira; Salim El Rouayheb; Daniel Heinlein (REDUNDANCY, 2021)

Degree Tables for Secure Distributed Matrix Multiplication. - Rafael G. L. D'Oliveira; Salim El Rouayheb; Daniel Heinlein; David A. Karpuk (IEEE J. Sel. Areas Inf. Theory, 2021)

Generalized Linkage Construction for Constant-Dimension Codes. - Daniel Heinlein (IEEE Trans. Inf. Theory, 2021)

Secure Distributed Matrix Multiplication with Precomputation. - Ryann Cartor; Rafael G. L. D'Oliveira; Salim El Rouayheb; Daniel Heinlein; David A. Karpuk; Alex Sprintson (ISIT, 2024)

Private linear equation solving: An application to federated learning and extreme learning machines. - Daniel Heinlein; Anton Akusok; Kaj-Mikael Björk; Leonardo Espinosa-Leal (J. Comput. Sci., 2025)

SPIRe: Boosting LLM Inference Throughput with Speculative Decoding. - Sanjit Neelam; Daniel Heinlein; Vaclav Cvicek; Akshay Mishra; Reiner Pope (CoRR, 2025)