ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2206.01559
  4. Cited By
Root of Unity for Secure Distributed Matrix Multiplication: Grid
  Partition Case

Root of Unity for Secure Distributed Matrix Multiplication: Grid Partition Case

3 June 2022
R. A. Machado
Felice Manganiello
ArXiv (abs)PDFHTML

Papers citing "Root of Unity for Secure Distributed Matrix Multiplication: Grid Partition Case"

8 / 8 papers shown
Title
Speeding Up Private Distributed Matrix Multiplication via Bivariate
  Polynomial Codes
Speeding Up Private Distributed Matrix Multiplication via Bivariate Polynomial Codes
Burak Hasircioglu
J. Gómez-Vilardebó
Deniz Gunduz
109
11
0
16 Feb 2021
Secure Distributed Matrix Computation with Discrete Fourier Transform
Secure Distributed Matrix Computation with Discrete Fourier Transform
N. Mital
Cong Ling
Deniz Gunduz
67
37
0
08 Jul 2020
Entangled Polynomial Codes for Secure, Private, and Batch Distributed
  Matrix Multiplication: Breaking the "Cubic" Barrier
Entangled Polynomial Codes for Secure, Private, and Batch Distributed Matrix Multiplication: Breaking the "Cubic" Barrier
Qian-long Yu
A. Avestimehr
68
77
0
15 Jan 2020
Uplink-Downlink Tradeoff in Secure Distributed Matrix Multiplication
Uplink-Downlink Tradeoff in Secure Distributed Matrix Multiplication
Jaber Kakar
Anton Khristoforov
Seyedhamed Ebadifar
Aydin Sezgin
84
24
0
30 Oct 2019
An Application of Storage-Optimal MatDot Codes for Coded Matrix
  Multiplication: Fast k-Nearest Neighbors Estimation
An Application of Storage-Optimal MatDot Codes for Coded Matrix Multiplication: Fast k-Nearest Neighbors Estimation
Utsav Sheth
Sanghamitra Dutta
Malhar Chaudhari
Haewon Jeong
Yaoqing Yang
J. Kohonen
Teemu Roos
P. Grover
100
39
0
28 Nov 2018
On the Capacity of Secure Distributed Matrix Multiplication
On the Capacity of Secure Distributed Matrix Multiplication
Wei-Ting Chang
Ravi Tandon
48
126
0
01 Jun 2018
Polynomial Codes: an Optimal Design for High-Dimensional Coded Matrix
  Multiplication
Polynomial Codes: an Optimal Design for High-Dimensional Coded Matrix Multiplication
Qian-long Yu
M. Maddah-ali
A. Avestimehr
121
464
0
30 May 2017
A Fundamental Tradeoff between Computation and Communication in
  Distributed Computing
A Fundamental Tradeoff between Computation and Communication in Distributed Computing
Songze Li
M. Maddah-ali
Qian-long Yu
A. Avestimehr
OT
69
451
0
24 Apr 2016
1