Skip to main content
Avi Wigderson
Personal
Short Bio
CV
Contact
Interviews & More
Works
Book: Math and Computation
Publications
Talks
Surveys
Efficient Universe
Post-Docs
Students
CSDM
Seminars
Conferences & videos
Optimization, Complexity and Invariant Theory
Avi60
Lens of Computation on the Sciences
Pseudorandomness
You are here
Home
Explicit Capacity Approaching Coding for Interactive Communication
Submitted by
dloring
on Thu, 2017-04-27 11:10
Author:
R. Gelles
B. Haeupler
G. Kol
N. Ron-Zewi
A. Wigderson
Publication:
IEEE Transactions on Information Theory, vol. 64, no. 10, pp. 6546-6560, Oct. 2018, doi: 10.1109/TIT.2018.2829764
IEEE Transactions on Information Theory, 2017.
Year:
2017
Hide
Files
File:
Journal version (pdf)
Read more
about Explicit Capacity Approaching Coding for Interactive Communication
P vs. NP Problem: Efficient Computation...Knowledge
Submitted by
dloring
on Thu, 2017-03-09 17:03
Description:
Institute for Advanced Study, Princeton, New Jersey - May 16, 2016
File:
Video
Read more
about P vs. NP Problem: Efficient Computation...Knowledge
Some of My Favorite Open Problems on Expanders and Extractors
Submitted by
dloring
on Mon, 2017-02-06 16:28
Description:
"Expanders and Extractors" workshop, Berkeley, California - January 31, 2017
File:
Video
Read more
about Some of My Favorite Open Problems on Expanders and Extractors
Toward Better Formula Lower Bounds: the Composition of a Function and a Universal Relation
Submitted by
dloring
on Thu, 2016-10-13 00:00
Author:
D. Gavinsky
O. Meir
O. Weinstein
A. Wigderson
Publication:
SIAM Journal on Computing (SICOMP), vol. 46, no. 1, pp. 114-131, 2017. https://doi.org/10.1137/15M1018319
Year:
2017
Hide
Files
File:
Journal version (pdf)
Read more
about Toward Better Formula Lower Bounds: the Composition of a Function and a Universal Relation
Local Expanders
Submitted by
dloring
on Wed, 2016-08-17 14:32
Author:
E. Viola
A. Wigderson
Publication:
Springer, Computational Complexity, 2017, DOI 10.1007/s00037-017-0155-1
Electronic Colloquium on Computational Complexity (ECCC) Report TR16-129, pp. 1-13, 2016.
Year:
2016
Hide
Files
File:
Journal version (pdf)
Read more
about Local Expanders
Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via Operator Scaling
Submitted by
dloring
on Tue, 2016-07-26 00:00
Author:
A. Garg
L. Gurvits
R. Oliveira
A. Wigderson
Publication:
Geometric and Functional Analysis 2018, https://doi.org/10.1007/s00039-018-0434-2
Proceedings of the Symposium on Theory of Computing (STOC) 2017, pp. 397-409, 2017.
arXiv:1607.06711
Year:
2017
Hide
Files
File:
Journal version (pdf)
Read more
about Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via Operator Scaling
R. Oliveira
Submitted by
dloring
on Tue, 2016-06-28 11:03
Home Page:
https://www.cs.utoronto.ca/~rafael/
Read more
about R. Oliveira
L. Gurvits
Submitted by
dloring
on Tue, 2016-06-28 11:02
Home Page:
https://www.ccny.cuny.edu/profiles/leonid-gurvits
Read more
about L. Gurvits
A. Garg
Submitted by
dloring
on Tue, 2016-06-28 11:01
Home Page:
https://ankit-garg-6.github.io/
Read more
about A. Garg
A Deterministic Polynomial Time Algorithm for Non-commutative Rational Identity Testing
Submitted by
dloring
on Tue, 2016-06-28 00:00
Author:
A. Garg
L. Gurvits
R. Oliveira
A. Wigderson
Publication:
Proceedings of Foundations of Computer Science (FOCS) 2016, pp. 109-117, 2016. https://doi.org/10.1109/FOCS.2016.95.
Year:
2016
Hide
Files
File:
Proceedings version (pdf)
Read more
about A Deterministic Polynomial Time Algorithm for Non-commutative Rational Identity Testing
Pages
« first
‹ previous
…
14
15
16
17
18
19
20
21
22
…
next ›
last »