Round compression for parallel matching algorithms
- Artur Czumaj
- Jakub Lacki
- et al.
- 2019
- SIAM Journal on Computing
Publications
Date
Featured collections
Popular topics
123 results at SIAM Journal on Computing
If the current Clique algorithms are optimal, so is Valiant's parser
- Amir Abboud
- Arturs Backurs
- et al.
- 2018
- SIAM Journal on Computing
Matching triangles and basing hardness on an extremely popular conjecture
- Amir Abboud
- Virginia Vassilevska Williams
- et al.
- 2018
- SIAM Journal on Computing
Hardness of coloring 2-colorable 12-uniform hypergraphs with 2(log n)ω(1) colors
- Subhash Khot
- Rishi Saket
- 2017
- SIAM Journal on Computing
Optimal cur matrix decompositions
- Christos Boutsidis
- David P. Woodruff
- 2017
- SIAM Journal on Computing
Frequent directions: Simple and deterministic matrix sketching
- Mina Ghashami
- Edo Liberty
- et al.
- 2016
- SIAM Journal on Computing
Candidate indistinguishability obfuscation and functional encryption for all circuits
- Sanjam Garg
- Craig Gentry
- et al.
- 2016
- SIAM Journal on Computing
Optimal bounds on approximation of submodular and XOS functions by juntas
- Vitaly Feldman
- Jan Vondrák
- 2016
- SIAM Journal on Computing
The fast Cauchy transform and faster robust linear regression
- Kenneth L. Clarkson
- Petros Drineas
- et al.
- 2016
- SIAM Journal on Computing
Minimum congestion mapping in a cloud
- Nikhil Bansal
- Kang-Won Lee
- et al.
- 2015
- SIAM Journal on Computing