Breaking the linear-memory barrier in MPC: fast MIS on trees with strongly sublinear memory (Q2303285)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7176653
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Breaking the linear-memory barrier in MPC: fast MIS on trees with strongly sublinear memory |
scientific article; zbMATH DE number 7176653 |
Statements
Breaking the linear-memory barrier in MPC: fast MIS on trees with strongly sublinear memory (English)
0 references
3 March 2020
0 references
0.9806318
0 references
0 references
0.83360225
0 references
0.8329477
0 references
0.83025193
0 references
0 references
0.8288065
0 references
