Abstract: We present Modular Polynomial (MP) Codes for Secure Distributed Matrix Multiplication (SDMM). The construction is based on the observation that one can decode certain proper subsets of the ...
The One Billion Row Challenge (1BRC) is a fun exploration of how far modern Java can be pushed for aggregating one billion rows from a text file. Later the community created a dedicated @1brc ...
Abstract: Echelon-Ferrers is an important method to improve lower bounds for constant-dimension codes, which can be applied on various parameters. Fagang Li combined the linkage construction and ...
forces each developer to be responsible for its own code quality(see diffCoverage task) helps to increase total code coverage(especially useful for old legacy ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback