Avi Wigderson

B. Haeupler

Submitted by dloring on Mon, 2015-10-19 14:15

Home Page:

http://www.cs.cmu.edu/~haeupler/

Read more about B. Haeupler

R. Gelles

Submitted by dloring on Mon, 2015-10-19 14:15

Home Page:

https://www.eng.biu.ac.il/gellesr/

Read more about R. Gelles

Towards Optimal Deterministic Coding for Interactive Communication

Submitted by dloring on Mon, 2015-10-19 00:00

Author:

Publication:

Proceedings of the Twenty-seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016, pp. 1922-1936, 2016.

Electronic Colloquium on Computational Complexity (ECCC) Report TR15-165, pp. 1-26, 2015.

Year:

2016

Hide Files

File:

Proceedings version (pdf)

Draft of final version (pdf)

Read more about Towards Optimal Deterministic Coding for Interactive Communication

T. Ma

Submitted by dloring on Wed, 2015-09-09 10:26

Home Page:

https://ai.stanford.edu/~tengyuma/

Read more about T. Ma

Sum-of-Squares Lower Bounds for Sparse PCA

Submitted by dloring on Wed, 2015-09-09 00:00

Author:

T. Ma

A. Wigderson

Publication:

Neural Information Processing Systems (NIPS) 2015, pp. 1612-1620, 2015.

Year:

2015

Hide Files

File:

Journal version (pdf)

Read more about Sum-of-Squares Lower Bounds for Sparse PCA

K. Talwar

Submitted by dloring on Mon, 2015-08-17 15:04

Home Page:

http://kunaltalwar.org/

Read more about K. Talwar

R. Servedio

Submitted by dloring on Mon, 2015-08-17 15:03

Home Page:

http://www.cs.columbia.edu/~rocco/

Read more about R. Servedio

P. Gopalan

Submitted by dloring on Mon, 2015-08-17 15:03

Home Page:

https://research.vmware.com/researchers/parikshit-gopalan

Read more about P. Gopalan

Smooth Boolean functions are easy: efficient algorithms for low-sensitivity functions

Submitted by dloring on Mon, 2015-08-17 00:00

Author:

Publication:

Proceedings of the Innovations in Theoretical Computer Science (ITCS) 2016, pp. 59-70, 2016.

Electronic Colloquium on Computational Complexity (ECCC) Report TR15-131, 2015.

Year:

2015

Hide Files

File:

Proceedings version (pdf)

Draft of final version (pdf)

Read more about Smooth Boolean functions are easy: efficient algorithms for low-sensitivity functions

Improved rank bounds for design matrices and a new proof of Kelly's theorem

Submitted by dloring on Mon, 2015-05-04 20:12

Author:

Z. Dvir

S. Saraf

A. Wigderson

Publication:

Forum of Mathematics, Sigma 4, vol. 2, 2014

Electronic Colloquium on Computational Complexity (ECCC) Report TR12-138, 2012.

Year:

2014

Abstract:

Abstract

Hide Files

File:

Journal version (pdf)

Read more about Improved rank bounds for design matrices and a new proof of Kelly's theorem

Avi Wigderson

You are here

Pages