Publications

Exploiting Computation-Friendly Graph Compression Methods for Adjacency-Matrix Multiplication

AuthID
P-00P-E75

Author(s)

Francisco, AP

Gagie, T

Ladra, S

Navarro, G

Editor(s)

Ali Bilgin; Michael W. Marcellin; Joan Serra-Sagristà; James A. Storer

Document Type

Proceedings Paper

Year published

2018

Published

in 2018 Data Compression Conference, DCC 2018, Snowbird, UT, USA, March 27-30, 2018 in DCC, ISSN: 1068-0314

Volume: 2018-March, Pages: 307-314

Conference

2018 Data Compression Conference, Dcc 2018, Date: 27 March 2018 through 30 March 2018, Sponsors: Brandeis University;Microsoft Research;University of Arizona

Indexing

Scopus^®

Dblp^®/en/publications/view/735461

Google Scholar^®

Metadata
Sources

Publication Identifiers

DOI: 10.1109/dcc.2018.00039

DBLP: conf/dcc/FranciscoGLN18

SCOPUS: 2-s2.0-85050980889

Source Identifiers

ISSN: 1068-0314

Export Publication Metadata

Marked List

Add to Marked List

Info

At this moment we don't have any links to full text documens.

Exploiting Computation-Friendly Graph Compression Methods for Adjacency-Matrix Multiplication

Useful Links

Get Help

Federated Authentication (Click on the image)

Exploiting Computation-Friendly Graph Compression Methods for Adjacency-Matrix Multiplication

Useful Links

Get Help