Camilla Hollanti

Professor in Mathematics

Aalto-yliopisto

Finland

Research Interests

Explore related searches

Professors in Finland

Contact this professor

Get a free first email built on one of their papers, ready for you to edit and send yourself.

About

Camilla Hollanti is a Professor in Mathematics at Aalto University in Finland. Her research areas encompass algebraic geometry codes, secure distributed matrix multiplication, and quantum information theory, as reflected in her recent publications. She has contributed significantly to the study of well-rounded lattices and linear computation over quantum networks.

Articles (18)

Year:

2025

Year:

2025

Year:

2025

Year:

2025

Year:

2024

Year:

2023

Year:

2022

Year:

2022

Year:

2022

Year:

2022

Year:

2021

Year:

2021

Year:

2021

Year:

2021

Year:

2020

Year:

2020

Year:

2020

Year:

2020

Collaborators (2)

Seunghoan Song

Nagoya University

JAPAN

View details

Oliver Wilhelm Gnilke

Aalborg University

DENMARK

View details

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Camilla Hollanti

Research Interests

Explore related searches

Contact this professor

About

Articles (18)

Dense Generic Well-Rounded Lattices

N-Sum Box: An Abstraction for Linear Computation Over Many-to-One Quantum Networks

Algebraic Geometry Codes for Secure Distributed Matrix Multiplication

Fast multiplication and the PLWE–RLWE equivalence for an infinite family of maximal real subfields of cyclotomic fields

General Framework for Linear Secure Distributed Matrix Multiplication With Byzantine Servers

Euclidean lattices: theory and applications

On the Capacity of Quantum Private Information Retrieval From MDS-Coded and Colluding Servers

A Generic Transformation for Optimal Node Repair in MDS Array Codes Over F2

Efficient Recovery of a Shared Secret via Cooperation: Applications to SDMM and PIR

Private and Secure Distributed Matrix Multiplication Schemes for Replicated or MDS-Coded Servers

Cyclic flats of binary matroids

Well-Rounded Lattices: Towards Optimal Coset Codes for Gaussian and Fading Wiretap Channels

The complete hierarchical locality of the punctured Simplex code

Private Information Retrieval Schemes With Product-Matrix MBR Codes

Quantum Private Information Retrieval From Coded and Colluding Servers

Towards Practical Private Information Retrieval From MDS Array Codes

Private Streaming With Convolutional Codes

An Approximation of Theta Functions with Applications to Communications

Collaborators (2)

Seunghoan Song

Oliver Wilhelm Gnilke

Make your next move.