Media Summary: Paper by Jonathan Bootle, Alessandro Chiesa, Jens Groth presented at TCC 2020 See ... Jonathan Bootle (IBM Research - Zurich) ... Michael Mahoney of the University of California, Berkeley presents his talk "

Linear Time Arguments With Sublinear - Detailed Analysis & Overview

Paper by Jonathan Bootle, Alessandro Chiesa, Jens Groth presented at TCC 2020 See ... Jonathan Bootle (IBM Research - Zurich) ... Michael Mahoney of the University of California, Berkeley presents his talk " Research talk from Jonathan Bootle, cryptography researcher in the Foundational Cryptography group at IBM Research, Zürich. Ronitt Rubinfeld, Massachusetts Institute of Technology Succinct Data Representations and Applications ... 13th Innovations in Theoretical Computer Science Conference (ITCS 2022)

Paper by Carsten Baum and Jonathan Bootle and Andrea Cerulli and Rafael del Pino and Jens Groth and Vadim Lyubashevsky ... Paper by Jonathan Bootle, Alessandro Chiesa, Siqi Liu presented at Eurocrypt 2022 See ... In many modern optimization problems, specifically those arising in machine learning, the amount data is too large to apply ... Eli Ben-Sasson Technion; Massachusetts Institute of Technology March 18, 2013 The PCP theorem (Arora et. al., J. ACM 45(1,3)) ... Soheil Behnezhad (Northeastern University) ...

Photo Gallery

Linear-Time Arguments with Sublinear Verification from Tensor Codes
Linear-Time Zero-Knowledge Arguments with Logarithmic Proof-Size
DIMACS Sublinear Workshop: Michael Mahoney - Linear and Sublinear Aspects of Combining SGD and RLA
Zero Knowledge Succinct Arguments with a Linear Time Prover - Jonathan Bootle
Something for Almost Nothing: Advances in Sub-Linear Time Algorithms
Sublinear-Time Computation in the Presence of Online Erasures
Sub-Linear Time Algorithms: Fast, Cheap and (Only a Little) Out of Control
Sub Linear Lattice Based Zero Knowledge Arguments for Arithmetic Circuits
Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier
Sublinear Optimization
"What, if anything, can be done in sublinear time?", Vladimir Shpilrain, NYGT Seminar,  Feb 4, 2021
Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity - Eli Ben-Sasson
View Detailed Profile
Linear-Time Arguments with Sublinear Verification from Tensor Codes

Linear-Time Arguments with Sublinear Verification from Tensor Codes

Paper by Jonathan Bootle, Alessandro Chiesa, Jens Groth presented at TCC 2020 See ...

Linear-Time Zero-Knowledge Arguments with Logarithmic Proof-Size

Linear-Time Zero-Knowledge Arguments with Logarithmic Proof-Size

Jonathan Bootle (IBM Research - Zurich) ...

DIMACS Sublinear Workshop: Michael Mahoney - Linear and Sublinear Aspects of Combining SGD and RLA

DIMACS Sublinear Workshop: Michael Mahoney - Linear and Sublinear Aspects of Combining SGD and RLA

Michael Mahoney of the University of California, Berkeley presents his talk "

Zero Knowledge Succinct Arguments with a Linear Time Prover - Jonathan Bootle

Zero Knowledge Succinct Arguments with a Linear Time Prover - Jonathan Bootle

Research talk from Jonathan Bootle, cryptography researcher in the Foundational Cryptography group at IBM Research, Zürich.

Something for Almost Nothing: Advances in Sub-Linear Time Algorithms

Something for Almost Nothing: Advances in Sub-Linear Time Algorithms

Ronitt Rubinfeld, Massachusetts Institute of Technology Succinct Data Representations and Applications ...

Sublinear-Time Computation in the Presence of Online Erasures

Sublinear-Time Computation in the Presence of Online Erasures

13th Innovations in Theoretical Computer Science Conference (ITCS 2022) http://itcs-conf.org/

Sub-Linear Time Algorithms: Fast, Cheap and (Only a Little) Out of Control

Sub-Linear Time Algorithms: Fast, Cheap and (Only a Little) Out of Control

Ronitt Rubinfeld, MIT Real-

Sub Linear Lattice Based Zero Knowledge Arguments for Arithmetic Circuits

Sub Linear Lattice Based Zero Knowledge Arguments for Arithmetic Circuits

Paper by Carsten Baum and Jonathan Bootle and Andrea Cerulli and Rafael del Pino and Jens Groth and Vadim Lyubashevsky ...

Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier

Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier

Paper by Jonathan Bootle, Alessandro Chiesa, Siqi Liu presented at Eurocrypt 2022 See ...

Sublinear Optimization

Sublinear Optimization

In many modern optimization problems, specifically those arising in machine learning, the amount data is too large to apply ...

"What, if anything, can be done in sublinear time?", Vladimir Shpilrain, NYGT Seminar,  Feb 4, 2021

"What, if anything, can be done in sublinear time?", Vladimir Shpilrain, NYGT Seminar, Feb 4, 2021

"What, if anything, can be done in

Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity - Eli Ben-Sasson

Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity - Eli Ben-Sasson

Eli Ben-Sasson Technion; Massachusetts Institute of Technology March 18, 2013 The PCP theorem (Arora et. al., J. ACM 45(1,3)) ...

Recent Progress on Sublinear Time Algorithms for Maximum Matching: Upper Bounds

Recent Progress on Sublinear Time Algorithms for Maximum Matching: Upper Bounds

Soheil Behnezhad (Northeastern University) ...