SIAM Journal on Computing
Latest Publications

TOTAL DOCUMENTS

3600
(FIVE YEARS 135)

H-INDEX

163
(FIVE YEARS 1)

Published By Society For Industrial And Applied Mathematics

1095-7111, 0097-5397
Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model

2022 ◽  
pp. STOC17-333-STOC17-399
Author(s):  
Ran Canetti ◽  
Oxana Poburinnaya ◽  
Muthuramakrishnan Venkitasubramaniam
Keyword(s):  
Secure Multiparty Computation ◽  
Multiparty Computation

scholarly journals Improved Bounds for Perfect Sampling of $k$-Colorings in Graphs

2022 ◽  
pp. STOC20-54-STOC20-74
Author(s):  
Siddharth Bhandari ◽  
Sayantan Chakraborty
Keyword(s):  
Perfect Sampling

scholarly journals An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences

2022 ◽  
Vol 51 (1) ◽  
pp. 1-18
Author(s):  
Dirk Nowotka ◽  
Aleksi Saarela
Keyword(s):  
Solution Sets ◽  
Optimal Bound ◽  
Word Equations

scholarly journals Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time

2021 ◽  
pp. STOC19-128-STOC19-155
Author(s):  
Aaron Bernstein ◽  
Maximilian Probst Gutenberg ◽  
Christian Wulff-Nilsen
Keyword(s):  
Linear Time ◽  
Connected Components ◽  
Single Source ◽  
Strongly Connected Components ◽  
Strongly Connected

scholarly journals Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria

2021 ◽  
pp. FOCS18-316-FOCS18-348
Author(s):  
Mika Göös ◽  
Aviad Rubinstein
Keyword(s):  
Lower Bounds ◽  
Nash Equilibria ◽  
Approximate Nash Equilibria

Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time

2021 ◽  
pp. STOC19-112-STOC19-127
Author(s):  
Aaron Bernstein ◽  
Danupon Nanongkai
Keyword(s):  
Linear Time ◽  
Shortest Paths ◽  
All Pairs Shortest Paths

Low-Density Parity-Check Codes Achieve List-Decoding Capacity

2021 ◽  
pp. FOCS20-38-FOCS20-73
Author(s):  
Jonathan Mosheiff ◽  
Nicolas Resch ◽  
Noga Ron-Zewi ◽  
Shashwat Silas ◽  
Mary Wootters
Keyword(s):  
Low Density ◽  
List Decoding ◽  
Parity Check ◽  
Low Density Parity Check ◽  
Parity Check Codes

scholarly journals Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication

2021 ◽  
pp. FOCS18-285-FOCS18-315
Author(s):  
Josh Alman ◽  
Virginia Vassilevska Williams
Keyword(s):  
Matrix Multiplication

scholarly journals A Tight Analysis of Bethe Approximation for Permanent

2021 ◽  
pp. FOCS19-81-FOCS19-101
Author(s):  
Nima Anari ◽  
Alireza Rezaei
Keyword(s):  
Bethe Approximation

scholarly journals Lower Bounds for External Memory Integer Sorting via Network Coding

2021 ◽  
pp. STOC19-87-STOC19-111
Author(s):  
Alireza Farhadi ◽  
MohammadTaghi Hajiaghayi ◽  
Kasper Green Larsen ◽  
Elaine Shi
Keyword(s):  
Network Coding ◽  
Lower Bounds ◽  
External Memory ◽  
Integer Sorting
Load More ...
Sign in / Sign up

Export Citation Format

Share Document