default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAvi Wigderson
Person information
- affiliation: Princeton, New Jersey, USA
- award (2023): Turing Award
- award (2021): Abel Prize
- award (2019): Knuth Prize
- award (2009): Gödel Prize
- award (2008): Josiah Willard Gibbs Lectureship
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c177]Peter Bürgisser, Mahmut Levent Dogan, Visu Makam, Michael Walter, Avi Wigderson:
Complexity of Robust Orbit Problems for Torus Actions and the abc-Conjecture. CCC 2024: 14:1-14:48- [c176]Robert Andrews, Avi Wigderson:
Constant-Depth Arithmetic Circuits for Linear Algebra Problems. FOCS 2024: 2367-2386 - [i97]Robert Andrews, Avi Wigderson:
Constant-Depth Arithmetic Circuits for Linear Algebra Problems. CoRR abs/2404.10839 (2024) - [i96]Peter Bürgisser, Mahmut Levent Dogan, Visu Makam, Michael Walter, Avi Wigderson:
Complexity of Robust Orbit Problems for Torus Actions and the abc-conjecture. CoRR abs/2405.15368 (2024) - [i95]Yotam Dikstein, Siqi Liu, Avi Wigderson:
Sparser Abelian High Dimensional Expanders. CoRR abs/2411.08839 (2024) - [i94]Robert Andrews, Avi Wigderson:
Constant-Depth Arithmetic Circuits for Linear Algebra Problems. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c175]Ronen Eldan, Avi Wigderson, Pei Wu:
An Optimal "It Ain't Over Till It's Over" Theorem. STOC 2023: 853-866 - [i93]Yinan Li, Youming Qiao, Avi Wigderson, Yuval Wigderson, Chuanqi Zhang:
On linear-algebraic notions of expansion. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j107]Oded Goldreich, Avi Wigderson:
Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing. TheoretiCS 1 (2022) - [c174]Fernando Granha Jeronimo, Tushant Mittal
, Sourya Roy, Avi Wigderson:
Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification. FOCS 2022: 378-388 - [c173]Avi Wigderson:
Non-commutative Optimization - Where Algebra, Analysis and Computational Complexity Meet. ISSAC 2022: 13-19 - [i92]Yinan Li, Youming Qiao, Avi Wigderson, Yuval Wigderson, Chuanqi Zhang:
Connections between graphs and matrix spaces. CoRR abs/2206.04815 (2022) - [i91]Ronen Eldan, Avi Wigderson, Pei Wu:
An Optimal "It Ain't Over Till It's Over" Theorem. CoRR abs/2208.03450 (2022) - [i90]Fernando Granha Jeronimo, Tushant Mittal, Sourya Roy, Avi Wigderson:
Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification. CoRR abs/2209.07024 (2022) - [i89]Yinan Li, Youming Qiao, Avi Wigderson, Yuval Wigderson, Chuanqi Zhang:
On linear-algebraic notions of expansion. CoRR abs/2212.13154 (2022) - 2021
- [j106]Michael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson:
Proof Complexity Lower Bounds from Algebraic Circuit Complexity. Adv. Math. Commun. 17: 1-88 (2021) - [c172]Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, Avi Wigderson:
On the Power and Limitations of Branch and Cut. CCC 2021: 6:1-6:30 - [c171]Oded Goldreich, Avi Wigderson:
Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing. CCC 2021: 12:1-12:74 - [c170]Peter Bürgisser, M. Levent Dogan, Visu Makam, Michael Walter, Avi Wigderson:
Polynomial Time Algorithms in Invariant Theory for Torus Actions. CCC 2021: 32:1-32:30 - [c169]Oded Goldreich, Avi Wigderson:
Non-adaptive vs Adaptive Queries in the Dense Graph Testing Model. FOCS 2021: 269-275 - [i88]Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, Avi Wigderson:
On the Power and Limitations of Branch and Cut. CoRR abs/2102.05019 (2021) - [i87]Peter Bürgisser, M. Levent Dogan, Visu Makam, Michael Walter, Avi Wigderson:
Polynomial time algorithms in invariant theory for torus actions. CoRR abs/2102.07727 (2021) - [i86]Oded Goldreich, Avi Wigderson:
Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing. CoRR abs/2112.00673 (2021) - [i85]Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, Avi Wigderson:
On the Power and Limitations of Branch and Cut. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j105]Ankit Garg, Leonid Gurvits, Rafael Mendes de Oliveira, Avi Wigderson:
Operator Scaling: Theory and Applications. Found. Comput. Math. 20(2): 223-290 (2020) - [j104]Zeev Dvir, Sivakanth Gopi, Yuzhou Gu, Avi Wigderson:
Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs. SIAM J. Comput. 49(3): 465-496 (2020) - [c168]Ankit Garg, Christian Ikenmeyer, Visu Makam, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson:
Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings. CCC 2020: 12:1-12:17 - [c167]Visu Makam, Avi Wigderson:
Symbolic determinant identity testing (SDIT) is not a null cone problem; and the symmetries of algebraic varieties. FOCS 2020: 881-888 - [p10]Oded Goldreich, Avi Wigderson:
On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions. Computational Complexity and Property Testing 2020: 41-86 - [i84]Avi Wigderson, Yuval Wigderson:
The uncertainty principle: variations on a theme. CoRR abs/2006.11206 (2020) - [i83]Oded Goldreich, Avi Wigderson:
Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing. Electron. Colloquium Comput. Complex. TR20 (2020) - [i82]Oded Goldreich, Avi Wigderson:
Non-adaptive vs Adaptive Queries in the Dense Graph Testing Model. Electron. Colloquium Comput. Complex. TR20 (2020) - [i81]Oded Goldreich, Avi Wigderson:
Constructing Large Families of Pairwise Far Permutations: Good Permutation Codes Based on the Shuffle-Exchange Network. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j103]Or Meir, Avi Wigderson:
Prediction from Partial Information and Hindsight, with Application to Circuit Lower Bounds. Comput. Complex. 28(2): 145-183 (2019) - [c166]Ankit Garg, Visu Makam, Rafael Mendes de Oliveira, Avi Wigderson:
More Barriers for Rank Methods, via a "numeric to Symbolic" Transfer. FOCS 2019: 824-844 - [c165]Peter Bürgisser, Cole Franks, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson:
Towards a Theory of Non-Commutative Optimization: Geodesic 1st and 2nd Order Methods for Moment Maps and Polytopes. FOCS 2019: 845-861 - [c164]Zeev Dvir, Sivakanth Gopi, Yuzhou Gu, Avi Wigderson:
Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs. ITCS 2019: 32:1-32:20 - [p9]Oded Goldreich, Silvio Micali, Avi Wigderson:
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. Providing Sound Foundations for Cryptography 2019: 285-306 - [p8]Oded Goldreich, Silvio Micali, Avi Wigderson:
How to play any mental game, or a completeness theorem for protocols with honest majority. Providing Sound Foundations for Cryptography 2019: 307-328 - [p7]Michael Ben-Or, Shafi Goldwasser, Avi Wigderson:
Completeness theorems for non-cryptographic fault-tolerant distributed computation. Providing Sound Foundations for Cryptography 2019: 351-371 - [p6]Michael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson:
Multi-prover interactive proofs: how to remove intractability assumptions. Providing Sound Foundations for Cryptography 2019: 373-410 - [i80]Orit E. Raz, Avi Wigderson:
Subspace arrangements, graph rigidity and derandomization through submodular optimization. CoRR abs/1901.09423 (2019) - [i79]Ankit Garg, Visu Makam, Rafael Mendes de Oliveira, Avi Wigderson:
More barriers for rank methods, via a "numeric to symbolic" transfer. CoRR abs/1904.04299 (2019) - [i78]Visu Makam, Avi Wigderson:
Singular tuples of matrices is not a null cone (and, the symmetries of algebraic varieties). CoRR abs/1909.00857 (2019) - [i77]Ankit Garg, Visu Makam, Rafael Mendes de Oliveira, Avi Wigderson:
Search problems in algebraic complexity, GCT, and hardness of generator for invariant rings. CoRR abs/1910.01251 (2019) - [i76]Peter Bürgisser, Cole Franks, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson:
Towards a theory of non-commutative optimization: geodesic first and second order methods for moment maps and polytopes. CoRR abs/1910.12375 (2019) - [i75]Ankit Garg, Visu Makam, Rafael Mendes de Oliveira, Avi Wigderson:
Search problems in algebraic complexity, GCT, and hardness of generator for invariant rings. Electron. Colloquium Comput. Complex. TR19 (2019) - [i74]Visu Makam, Avi Wigderson:
Singular tuples of matrices is not a null cone (and, the symmetries of algebraic varieties). Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j102]Emanuele Viola, Avi Wigderson:
Local Expanders. Comput. Complex. 27(2): 225-244 (2018) - [j101]Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, Avi Wigderson:
Explicit Capacity Approaching Coding for Interactive Communication. IEEE Trans. Inf. Theory 64(10): 6546-6560 (2018) - [c163]Peter Bürgisser, Cole Franks, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson:
Efficient Algorithms for Tensor Scaling, Quantum Marginals, and Moment Polytopes. FOCS 2018: 883-897 - [c162]Klim Efremenko, Ankit Garg, Rafael Mendes de Oliveira, Avi Wigderson:
Barriers for Rank Methods in Arithmetic Complexity. ITCS 2018: 1:1-1:19 - [c161]Peter Bürgisser, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson:
Alternating Minimization, Scaling Algorithms, and the Null-Cone Problem from Invariant Theory. ITCS 2018: 24:1-24:20 - [c160]Zeyuan Allen-Zhu, Ankit Garg, Yuanzhi Li, Rafael Mendes de Oliveira, Avi Wigderson:
Operator scaling via geodesically convex optimization, invariant theory and polynomial identity testing. STOC 2018: 172-181 - [i73]Zeyuan Allen-Zhu, Ankit Garg, Yuanzhi Li, Rafael Mendes de Oliveira, Avi Wigderson:
Operator Scaling via Geodesically Convex Optimization, Invariant Theory and Polynomial Identity Testing. CoRR abs/1804.01076 (2018) - [i72]Peter Bürgisser, Cole Franks, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson:
Efficient algorithms for tensor scaling, quantum marginals and moment polytopes. CoRR abs/1804.04739 (2018) - [i71]Zeev Dvir, Sivakanth Gopi, Avi Wigderson:
Spanoids - an abstraction of spanning structures, and a barrier for LCCs. CoRR abs/1809.10372 (2018) - [i70]Avi Wigderson:
On the nature of the Theory of Computation (ToC). Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j100]Avi Wigderson:
Technical Perspective: Low-depth arithmetic circuits. Commun. ACM 60(6): 91 (2017) - [j99]Dmitry Gavinsky, Or Meir, Omri Weinstein, Avi Wigderson:
Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation. SIAM J. Comput. 46(1): 114-131 (2017) - [j98]Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Superquadratic Lower Bound for 3-Query Locally Correctable Codes over the Reals. Theory Comput. 13(1): 1-36 (2017) - [c159]Zeyuan Allen-Zhu, Yuanzhi Li, Rafael Mendes de Oliveira, Avi Wigderson:
Much Faster Algorithms for Matrix Scaling. FOCS 2017: 890-901 - [c158]Ankit Garg, Leonid Gurvits, Rafael Mendes de Oliveira, Avi Wigderson:
Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling. STOC 2017: 397-409 - [i69]Zeyuan Allen Zhu, Yuanzhi Li, Rafael Mendes de Oliveira, Avi Wigderson:
Much Faster Algorithms for Matrix Scaling. CoRR abs/1704.02315 (2017) - [i68]Klim Efremenko, Ankit Garg, Rafael Mendes de Oliveira, Avi Wigderson:
Barriers for Rank Methods in Arithmetic Complexity. CoRR abs/1710.09502 (2017) - [i67]Avi Wigderson:
Interactions of Computational Complexity Theory and Mathematics. CoRR abs/1710.09780 (2017) - [i66]Peter Bürgisser, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson:
Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory. CoRR abs/1711.08039 (2017) - [i65]Klim Efremenko, Ankit Garg, Rafael Mendes de Oliveira, Avi Wigderson:
Barriers for Rank Methods in Arithmetic Complexity. Electron. Colloquium Comput. Complex. TR17 (2017) - [i64]Or Meir, Avi Wigderson:
Prediction from Partial Information and Hindsight, with Application to Circuit Lower Bounds. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j97]Tali Kaufman, Avi Wigderson:
Symmetric LDPC codes and local testing. Comb. 36(1): 91-120 (2016) - [j96]Avi Wigderson, Amir Yehudayoff:
Population recovery and partial identification. Mach. Learn. 102(1): 29-56 (2016) - [c157]Parikshit Gopalan, Rocco A. Servedio, Avi Wigderson:
Degree and Sensitivity: Tails of Two Distributions. CCC 2016: 13:1-13:23 - [c156]Michael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson:
Proof Complexity Lower Bounds from Algebraic Circuit Complexity. CCC 2016: 32:1-32:17 - [c155]Ankit Garg, Leonid Gurvits, Rafael Mendes de Oliveira, Avi Wigderson:
A Deterministic Polynomial Time Algorithm for Non-commutative Rational Identity Testing. FOCS 2016: 109-117 - [c154]Parikshit Gopalan, Noam Nisan, Rocco A. Servedio, Kunal Talwar, Avi Wigderson:
Smooth Boolean Functions are Easy: Efficient Algorithms for Low-Sensitivity Functions. ITCS 2016: 59-70 - [c153]Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, Avi Wigderson:
Towards Optimal Deterministic Coding for Interactive Communication. SODA 2016: 1922-1936 - [i63]Parikshit Gopalan, Rocco A. Servedio, Avishay Tal, Avi Wigderson:
Degree and Sensitivity: tails of two distributions. CoRR abs/1604.07432 (2016) - [i62]Michael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson:
Proof Complexity Lower Bounds from Algebraic Circuit Complexity. CoRR abs/1606.05050 (2016) - [i61]Ankit Garg, Leonid Gurvits, Rafael Mendes de Oliveira, Avi Wigderson:
Algorithmic aspects of Brascamp-Lieb inequalities. CoRR abs/1607.06711 (2016) - [i60]Michael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson:
Proof Complexity Lower Bounds from Algebraic Circuit Complexity. Electron. Colloquium Comput. Complex. TR16 (2016) - [i59]Parikshit Gopalan, Rocco A. Servedio, Avishay Tal, Avi Wigderson:
Degree and Sensitivity: tails of two distributions. Electron. Colloquium Comput. Complex. TR16 (2016) - [i58]Emanuele Viola, Avi Wigderson:
Local Expanders. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j95]Avi Wigderson, Phokion G. Kolaitis:
Invited Articles Foreword. J. ACM 62(5): 41:1 (2015) - [j94]Emmanuel Abbe, Amir Shpilka, Avi Wigderson:
Reed-Muller Codes for Random Erasures and Errors. IEEE Trans. Inf. Theory 61(10): 5229-5252 (2015) - [j93]Pavel Hrubes, Avi Wigderson:
Non-Commutative Arithmetic Circuits with Division. Theory Comput. 11: 357-393 (2015) - [c152]Oded Goldreich, Emanuele Viola, Avi Wigderson:
On Randomness Extraction in AC0. CCC 2015: 601-668 - [c151]Shay Moran, Amir Shpilka, Avi Wigderson, Amir Yehudayoff:
Compressing and Teaching for Low VC-Dimension. FOCS 2015: 40-51 - [c150]Tengyu Ma, Avi Wigderson:
Sum-of-Squares Lower Bounds for Sparse PCA. NIPS 2015: 1612-1620 - [c149]Raghu Meka, Aaron Potechin, Avi Wigderson:
Sum-of-squares Lower Bounds for Planted Clique. STOC 2015: 87-96 - [c148]Emmanuel Abbe, Amir Shpilka, Avi Wigderson:
Reed-Muller Codes for Random Erasures and Errors. STOC 2015: 297-306 - [i57]Shay Moran, Amir Shpilka, Avi Wigderson, Amir Yehudayoff:
Teaching and compressing for low VC-dimension. CoRR abs/1502.06187 (2015) - [i56]Raghu Meka, Aaron Potechin, Avi Wigderson:
Sum-of-squares lower bounds for planted clique. CoRR abs/1503.06447 (2015) - [i55]Tengyu Ma, Avi Wigderson:
Sum-of-Squares Lower Bounds for Sparse PCA. CoRR abs/1507.06370 (2015) - [i54]Parikshit Gopalan, Noam Nisan, Rocco A. Servedio, Kunal Talwar, Avi Wigderson:
Smooth Boolean functions are easy: efficient algorithms for low-sensitivity functions. CoRR abs/1508.02420 (2015) - [i53]Ankit Garg, Leonid Gurvits, Rafael Mendes de Oliveira, Avi Wigderson:
A deterministic polynomial time algorithm for non-commutative rational identity testing. CoRR abs/1511.03730 (2015) - [i52]Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, Avi Wigderson:
Towards Optimal Deterministic Coding for Interactive Communication. Electron. Colloquium Comput. Complex. TR15 (2015) - [i51]Oded Goldreich, Emanuele Viola, Avi Wigderson:
On Randomness Extraction in AC0. Electron. Colloquium Comput. Complex. TR15 (2015) - [i50]Parikshit Gopalan, Noam Nisan, Rocco A. Servedio, Kunal Talwar, Avi Wigderson:
Smooth Boolean functions are easy: efficient algorithms for low-sensitivity functions. Electron. Colloquium Comput. Complex. TR15 (2015) - [i49]Shay Moran, Amir Shpilka, Avi Wigderson, Amir Yehudayoff:
Teaching and compressing for low VC-dimension. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c147]Pavel Hrubes, Avi Wigderson:
Non-commutative arithmetic circuits with division. ITCS 2014: 49-66 - [c146]Oded Goldreich, Avi Wigderson:
On derandomizing algorithms that err extremely rarely. STOC 2014: 109-118 - [c145]Dmitry Gavinsky, Or Meir, Omri Weinstein, Avi Wigderson:
Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture. STOC 2014: 213-222 - [c144]Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Breaking the quadratic barrier for 3-LCC's over the reals. STOC 2014: 784-793 - [i48]Emmanuel Abbe, Amir Shpilka, Avi Wigderson:
Reed-Muller codes for random erasures and errors. CoRR abs/1411.4590 (2014) - 2013
- [c143]Guy N. Rothblum, Salil P. Vadhan, Avi Wigderson:
Interactive proofs of proximity: delegating computation in sublinear time. STOC 2013: 793-802 - [i47]Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Breaking the quadratic barrier for 3-LCCs over the Reals. CoRR abs/1311.5102 (2013) - [i46]Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Breaking the quadratic barrier for 3-LCCs over the Reals. Electron. Colloquium Comput. Complex. TR13 (2013) - [i45]Dmitry Gavinsky, Or Meir, Omri Weinstein, Avi Wigderson:
Toward Better Formula Lower Bounds: An Information Complexity Approach to the KRW Composition Conjecture. Electron. Colloquium Comput. Complex. TR13 (2013) - [i44]Oded Goldreich, Avi Wigderson:
On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions. Electron. Colloquium Comput. Complex. TR13 (2013) - [i43]Oded Goldreich, Avi Wigderson:
On Derandomizing Algorithms that Err Extremely Rarely. Electron. Colloquium Comput. Complex. TR13 (2013) - [i42]Raghu Meka, Avi Wigderson:
Association schemes, non-commutative polynomial concentration, and sum-of-squares lower bounds for planted clique. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j92]Guy Kindler, Anup Rao, Ryan O'Donnell, Avi Wigderson:
Spherical cubes: optimal foams from computational hardness amplification. Commun. ACM 55(10): 90-97 (2012) - [j91]Russell Impagliazzo, Valentine Kabanets, Avi Wigderson:
New Direct-Product Testers and 2-Query PCPs. SIAM J. Comput. 41(6): 1722-1768 (2012) - [c142]Avi Wigderson, Amir Yehudayoff:
Population Recovery and Partial Identification. FOCS 2012: 390-399 - [c141]Zeev Dvir, Anup Rao, Avi Wigderson, Amir Yehudayoff:
Restriction access. ITCS 2012: 19-33 - [i41]Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Improved rank bounds for design matrices and a new proof of Kelly's theorem. CoRR abs/1211.0330 (2012) - [i40]Albert Ai, Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Sylvester-Gallai type theorems for approximate collinearity. CoRR abs/1211.0331 (2012) - [i39]Albert Ai, Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Sylvester-Gallai type theorems for approximate collinearity. Electron. Colloquium Comput. Complex. TR12 (2012) - [i38]Zeev Dvir, Shubhangi Saraf, Avi Wigderson:
Improved rank bounds for design matrices and a new proof of Kelly's theorem. Electron. Colloquium Comput. Complex. TR12 (2012) - [i37]Avi Wigderson, Amir Yehudayoff:
Population Recovery and Partial Identification. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j90]Xi Chen, Neeraj Kayal, Avi Wigderson:
Partial Derivatives in Arithmetic Complexity and Beyond. Found. Trends Theor. Comput. Sci. 6(1-2): 1-138 (2011) - [j89]Zeev Dvir, Avi Wigderson:
Kakeya Sets, New Mergers, and Old Extractors. SIAM J. Comput. 40(3): 778-792 (2011) - [c140]Boaz Barak, Zeev Dvir, Amir Yehudayoff, Avi Wigderson:
Rank bounds for design matrices with applications toc ombinatorial geometry and locally correctable codes. STOC 2011: 519-528 - [p5]Oded Goldreich, Avi Wigderson:
On the Circuit Complexity of Perfect Hashing. Studies in Complexity and Cryptography 2011: 26-29 - [p4]Oded Goldreich, Salil P. Vadhan, Avi Wigderson:
Simplified Derandomization of BPP Using a Hitting Set Generator. Studies in Complexity and Cryptography 2011: 59-67 - [p3]Oded Goldreich, Noam Nisan, Avi Wigderson:
On Yao's XOR-Lemma. Studies in Complexity and Cryptography 2011: 273-301 - [i36]Zeev Dvir, Anup Rao, Avi Wigderson, Amir Yehudayoff:
Restriction Access. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j88]Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson:
Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors. J. ACM 57(4): 20:1-20:52 (2010) - [j87]Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson:
Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized. SIAM J. Comput. 39(4): 1637-1665 (2010) - [j86]Zeev Dvir, Avi Wigderson:
Monotone Expanders: Constructions and Applications. Theory Comput. 6(1): 291-308 (2010) - [c139]Pavel Hrubes, Avi Wigderson, Amir Yehudayoff:
Relationless Completeness and Separations. CCC 2010: 280-290 - [c138]Tali Kaufman, Avi Wigderson:
Symmetric LDPC Codes and Local Testing. ICS 2010: 406-421 - [c137]Benny Applebaum, Boaz Barak, Avi Wigderson:
Public-key cryptography from different assumptions. STOC 2010: 171-180 - [c136]Pavel Hrubes, Avi Wigderson, Amir Yehudayoff:
Non-commutative circuits and the sum-of-squares problem. STOC 2010: 667-676 - [p2]Tali Kaufman, Avi Wigderson:
Symmetric LDPC Codes and Local Testing. Property Testing 2010: 312-319 - [i35]Boaz Barak, Zeev Dvir, Avi Wigderson, Amir Yehudayoff:
Rank Bounds for Design Matrices with Applications to Combinatorial Geometry and Locally Correctable Codes. CoRR abs/1009.4375 (2010) - [i34]Boaz Barak, Zeev Dvir, Avi Wigderson, Amir Yehudayoff:
Rank Bounds for Design Matrices with Applications to Combinatorial Geometry and Locally Correctable Codes. Electron. Colloquium Comput. Complex. TR10 (2010) - [i33]Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson:
Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers, and Extractors. Electron. Colloquium Comput. Complex. TR10 (2010) - [i32]Pavel Hrubes, Avi Wigderson, Amir Yehudayoff:
Non-commutative circuits and the sum-of-squares problem. Electron. Colloquium Comput. Complex. TR10 (2010) - [i31]Pavel Hrubes, Avi Wigderson, Amir Yehudayoff:
Relationless completeness and separations. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j85]Zeev Dvir, Ariel Gabizon, Avi Wigderson:
Extractors And Rank Extractors For Polynomial Sources. Comput. Complex. 18(1): 1-58 (2009) - [j84]Emanuele Viola, Avi Wigderson:
One-way multiparty communication lower bound for pointer jumping with applications. Comb. 29(6): 719-743 (2009) - [j83]Scott Aaronson, Avi Wigderson:
Algebrization: A New Barrier in Complexity Theory. ACM Trans. Comput. Theory 1(1): 2:1-2:54 (2009) - [c135]Venkatesan Guruswami, James R. Lee, Avi Wigderson:
Expander codes over reals, Euclidean sections, and compressed sensing. Allerton 2009: 1231-1234 - [c134]Arkadev Chattopadhyay, Avi Wigderson:
Linear Systems over Composite Moduli. FOCS 2009: 43-52 - [c133]Avi Wigderson:
Randomness extractors -- applications and constructions. FSTTCS 2009: 471-473 - [c132]Sanjeev Arora, David Steurer, Avi Wigderson:
Towards a Study of Low-Complexity Graphs. ICALP (1) 2009: 119-131 - [c131]Avi Wigderson:
The work of Leslie Valiant. STOC 2009: 1-2 - [c130]Russell Impagliazzo, Valentine Kabanets, Avi Wigderson:
New direct-product testers and 2-query PCPs. STOC 2009: 131-140 - [i30]Arkadev Chattopadhyay, Avi Wigderson:
Linear systems over composite moduli. Electron. Colloquium Comput. Complex. TR09 (2009) - [i29]Zeev Dvir, Avi Wigderson:
Monotone expanders - constructions and applications. Electron. Colloquium Comput. Complex. TR09 (2009) - [i28]Russell Impagliazzo, Valentine Kabanets, Avi Wigderson:
New Direct-Product Testers and 2-Query PCPs. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j82]Gil Kalai, Avi Wigderson:
Neighborly Embedded Manifolds. Discret. Comput. Geom. 40(3): 319-324 (2008) - [j81]Avi Wigderson, David Xiao:
Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications. Theory Comput. 4(1): 53-76 (2008) - [j80]Emanuele Viola, Avi Wigderson:
Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols. Theory Comput. 4(1): 137-168 (2008) - [c129]Venkatesan Guruswami, James R. Lee, Avi Wigderson:
Euclidean Sections of with Sublinear Randomness and Error-Correction over the Reals. APPROX-RANDOM 2008: 444-454 - [c128]Avi Wigderson:
Randomness - A Computational Complexity Perspective. CSR 2008: 1-2 - [c127]Guy Kindler, Ryan O'Donnell, Anup Rao, Avi Wigderson:
Spherical Cubes and Rounding in High Dimensions. FOCS 2008: 189-198 - [c126]Zeev Dvir, Avi Wigderson:
Kakeya Sets, New Mergers and Old Extractors. FOCS 2008: 625-633 - [c125]Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson:
Uniform direct product theorems: simplified, optimized, and derandomized. STOC 2008: 579-588 - [c124]Scott Aaronson, Avi Wigderson:
Algebrization: a new barrier in complexity theory. STOC 2008: 731-740 - [i27]Scott Aaronson, Avi Wigderson:
Algebrization: A New Barrier in Complexity Theory. Electron. Colloquium Comput. Complex. TR08 (2008) - [i26]Zeev Dvir, Avi Wigderson:
Kakeya sets, new mergers and old extractors. Electron. Colloquium Comput. Complex. TR08 (2008) - [i25]Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson:
Uniform Direct-Product Theorems: Simplified, Optimized, and Derandomized. Electron. Colloquium Comput. Complex. TR08 (2008) - [i24]Boaz Barak, Avi Wigderson:
Public Key Cryptography from Different Assumptions. IACR Cryptol. ePrint Arch. 2008: 335 (2008) - 2007
- [j79]Johan Håstad, Avi Wigderson:
The Randomized Communication Complexity of Set Disjointness. Theory Comput. 3(1): 211-219 (2007) - [c123]Emanuele Viola, Avi Wigderson:
Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols. CCC 2007: 141-154 - [c122]Zeev Dvir, Ariel Gabizon, Avi Wigderson:
Extractors and Rank Extractors for Polynomial Sources. FOCS 2007: 52-62 - [c121]Emanuele Viola, Avi Wigderson:
One-Way Multi-Party Communication Lower Bound for Pointer Jumping with Applications. FOCS 2007: 427-437 - [i23]Zeev Dvir, Ariel Gabizon, Avi Wigderson:
Extractors and Rank Extractors for Polynomial Sources. Electron. Colloquium Comput. Complex. TR07 (2007) - [i22]Emanuele Viola, Avi Wigderson:
One-way multi-party communication lower bound for pointer jumping with applications. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j78]Paul Beame, Toniann Pitassi, Nathan Segerlind, Avi Wigderson:
A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness. Comput. Complex. 15(4): 391-432 (2006) - [j77]Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson:
Reducing The Seed Length In The Nisan-Wigderson Generator. Comb. 26(6): 647-681 (2006) - [j76]Omer Reingold, Ronen Shaltiel, Avi Wigderson:
Extracting Randomness via Repeated Condensing. SIAM J. Comput. 35(5): 1185-1209 (2006) - [j75]Boaz Barak, Russell Impagliazzo, Avi Wigderson:
Extracting Randomness Using Few Independent Sources. SIAM J. Comput. 36(4): 1095-1118 (2006) - [j74]Amir Shpilka, Avi Wigderson:
Derandomizing Homomorphism Testing in General Groups. SIAM J. Comput. 36(4): 1215-1230 (2006) - [j73]Eyal Rozenman, Aner Shalev, Avi Wigderson:
Iterative Construction of Cayley Expander Graphs. Theory Comput. 2(5): 91-120 (2006) - [c120]Irit Dinur, Madhu Sudan, Avi Wigderson:
Robust Local Testability of Tensor Products of LDPC Codes. APPROX-RANDOM 2006: 304-315 - [c119]Avi Wigderson:
Applications of the Sum-Product Theorem in Finite Fields. CCC 2006: 111 - [c118]Avi Wigderson:
The Power and Weakness of Randomness in Computation. LATIN 2006: 28-29 - [c117]Boaz Barak, Anup Rao, Ronen Shaltiel, Avi Wigderson:
2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction. STOC 2006: 671-680 - [i21]Irit Dinur, Madhu Sudan, Avi Wigderson:
Robust Local Testability of Tensor Products of LDPC Codes. Electron. Colloquium Comput. Complex. TR06 (2006) - [i20]Avi Wigderson, David Xiao:
Derandomizing the AW matrix-valued Chernoff bound using pessimistic estimators and applications. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j72]Michael Luby, Avi Wigderson:
Pairwise Independence and Derandomization. Found. Trends Theor. Comput. Sci. 1(4) (2005) - [c116]Paul Beame, Toniann Pitassi, Nathan Segerlind, Avi Wigderson:
A Direct Sum Theorem for Corruption and the Multiparty NOF Communication Complexity of Set Disjointness. CCC 2005: 52-66 - [c115]Avi Wigderson, David Xiao:
A Randomness-Efficient Sampler for Matrix-valued Functions and Applications. FOCS 2005: 397-406 - [c114]Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson:
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors. STOC 2005: 1-10 - [i19]Avi Wigderson, David Xiao:
A Randomness-Efficient Sampler for Matrix-valued Functions and Applications. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j71]Eli Ben-Sasson, Russell Impagliazzo, Avi Wigderson:
Near Optimal Separation Of Tree-Like And General Resolution. Comb. 24(4): 585-603 (2004) - [j70]Roy Meshulam, Avi Wigderson:
Expanders In Group Algebras. Comb. 24(4): 659-680 (2004) - [j69]Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson:
Pseudorandom Generators in Propositional Proof Complexity. SIAM J. Comput. 34(1): 67-88 (2004) - [c113]Boaz Barak, Russell Impagliazzo, Avi Wigderson:
Extracting Randomness Using Few Independent Sources. FOCS 2004: 384-393 - [c112]Amir Shpilka, Avi Wigderson:
Derandomizing homomorphism testing in general groups. STOC 2004: 427-435 - [c111]Eyal Rozenman, Aner Shalev, Avi Wigderson:
A new family of Cayley expanders (?). STOC 2004: 445-454 - [c110]Avi Wigderson:
Depth through breadth, or why should we attend talks in other areas? STOC 2004: 579 - [p1]Avi Wigderson:
Average case complexity. Computational Complexity Theory 2004: 89-99 - [e2]Steven Rudich, Avi Wigderson:
Computational Complexity Theory. IAS / Park City mathematics series 10, AMS Chelsea Publishing 2004, ISBN 978-0-8218-2872-4 [contents] - 2003
- [j68]Johan Håstad, Avi Wigderson:
Simple analysis of graph tests for linearity and PCP. Random Struct. Algorithms 22(2): 139-160 (2003) - [j67]Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson:
The Quantum Communication Complexity of Sampling. SIAM J. Comput. 32(6): 1570-1585 (2003) - [c109]Avi Wigderson:
Zigzag Products, Expander Constructions, Connections, and Applications. FSTTCS 2003: 443 - [c108]Boaz Barak, Ronen Shaltiel, Avi Wigderson:
Computational Analogues of Entropy. RANDOM-APPROX 2003: 200-215 - [c107]Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wigderson:
Extractors: optimal up to constant factors. STOC 2003: 602-611 - [c106]Eli Ben-Sasson, Madhu Sudan, Salil P. Vadhan, Avi Wigderson:
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. STOC 2003: 612-621 - 2002
- [j66]Oded Goldreich, Salil P. Vadhan, Avi Wigderson:
On interactive proofs with a laconic prover. Comput. Complex. 11(1-2): 1-53 (2002) - [j65]Alexander A. Razborov, Avi Wigderson, Andrew Chi-Chih Yao:
Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus. Comb. 22(4): 555-574 (2002) - [j64]Russell Impagliazzo, Valentine Kabanets, Avi Wigderson:
In search of an easy witness: exponential time vs. probabilistic polynomial time. J. Comput. Syst. Sci. 65(4): 672-694 (2002) - [j63]Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson:
Space Complexity in Propositional Calculus. SIAM J. Comput. 31(4): 1184-1211 (2002) - [c105]Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson:
Randomness Conductors and Constant-Degree Lossless Expanders. CCC 2002: 15 - [c104]Roy Meshulam, Avi Wigderson:
Expanders from Symmetric Codes. CCC 2002: 16 - [c103]Ehud Friedgut, Jeff Kahn, Avi Wigderson:
Computing Graph Properties by Randomized Subcube Partitions. RANDOM 2002: 105-113 - [c102]Oded Goldreich, Avi Wigderson:
Derandomization That Is Rarely Wrong from Short Advice That Is Typically Good. RANDOM 2002: 209-223 - [c101]Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson:
Randomness conductors and constant-degree lossless expanders. STOC 2002: 659-668 - [c100]Roy Meshulam, Avi Wigderson:
Expanders from symmetric codes. STOC 2002: 669-677 - [i18]Oded Goldreich, Avi Wigderson:
Derandomization that is rarely wrong from short advice that is typically good. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [j62]Amir Shpilka, Avi Wigderson:
Depth-3 arithmetic circuits over fields of characteristic zero. Comput. Complex. 10(1): 1-27 (2001) - [j61]Eli Ben-Sasson, Avi Wigderson:
Short proofs are narrow - resolution made simple. J. ACM 48(2): 149-169 (2001) - [j60]Russell Impagliazzo, Avi Wigderson:
Randomness vs Time: Derandomization under a Uniform Assumption. J. Comput. Syst. Sci. 63(4): 672-688 (2001) - [c99]Russell Impagliazzo, Valentine Kabanets, Avi Wigderson:
In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time. CCC 2001: 2-12 - [c98]Johan Håstad, Avi Wigderson:
Simple Analysis of Graph Tests for Linearity and PCP. CCC 2001: 244-254 - [c97]Noga Alon, Alexander Lubotzky, Avi Wigderson:
Semi-Direct Product in Groups and Zig-Zag Product in Graphs: Connections and Applications. FOCS 2001: 630-637 - [c96]Oded Goldreich, Salil P. Vadhan, Avi Wigderson:
On Interactive Proofs with a Laconic Prover. ICALP 2001: 334-345 - [i17]Omer Reingold, Salil P. Vadhan, Avi Wigderson:
Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors. Electron. Colloquium Comput. Complex. TR01 (2001) - [i16]Oded Goldreich, Salil P. Vadhan, Avi Wigderson:
On Interactive Proofs with a Laconic Prover. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j59]Nathan Linial, Alex Samorodnitsky, Avi Wigderson:
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents. Comb. 20(4): 545-568 (2000) - [j58]Roy Armoni, Amnon Ta-Shma, Avi Wigderson, Shiyu Zhou:
An O(log(n)4/3) space algorithm for (s, t) connectivity in undirected graphs. J. ACM 47(2): 294-311 (2000) - [c95]Omer Reingold, Salil P. Vadhan, Avi Wigderson:
Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors. FOCS 2000: 3-13 - [c94]Omer Reingold, Ronen Shaltiel, Avi Wigderson:
Extracting Randomness via Repeated Condensing. FOCS 2000: 22-31 - [c93]Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson:
Pseudorandom Generators in Propositional Proof Complexity. FOCS 2000: 43-53 - [c92]Oded Goldreich, Avi Wigderson:
On Pseudorandomness with respect to Deterministic Observes. ICALP Satellite Workshops 2000: 77-84 - [c91]Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson:
Extractors and pseudo-random generators with optimal seed length. STOC 2000: 1-10 - [c90]Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson:
Space complexity in propositional calculus. STOC 2000: 358-367 - [i15]Oded Goldreich, Salil P. Vadhan, Avi Wigderson:
Simplified derandomization of BPP using a hitting set generator. Electron. Colloquium Comput. Complex. TR00 (2000) - [i14]Eli Ben-Sasson, Russell Impagliazzo, Avi Wigderson:
Near-Optimal Separation of Treelike and General Resolution. Electron. Colloquium Comput. Complex. TR00 (2000) - [i13]Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson:
Extractors and pseudo-random generators with optimal seed length. Electron. Colloquium Comput. Complex. TR00 (2000) - [i12]Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson:
Pseudorandom Generators in Propositional Proof Complexity. Electron. Colloquium Comput. Complex. TR00 (2000) - [i11]Oded Goldreich, Avi Wigderson:
On Pseudorandomness with respect to Deterministic Observers. Electron. Colloquium Comput. Complex. TR00 (2000) - [i10]Omer Reingold, Ronen Shaltiel, Avi Wigderson:
Extracting Randomness via Repeated Condensing. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [j57]Avi Wigderson, David Zuckerman:
Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications. Comb. 19(1): 125-138 (1999) - [j56]László Babai, Anna Gál, Avi Wigderson:
Superpolynomial Lower Bounds for Monotone Span Programs. Comb. 19(3): 301-319 (1999) - [j55]Yuri Rabinovich, Avi Wigderson:
Techniques for bounding the convergence rate of genetic algorithms. Random Struct. Algorithms 14(2): 111-138 (1999) - [c89]Eli Ben-Sasson, Avi Wigderson:
Short Proofs Are Narrow - Resolution Made Simple (Abstract). CCC 1999: 2 - [c88]Avi Wigderson:
De-Randomizing BPP: The State of the Art. CCC 1999: 76- - [c87]Amir Shpilka, Avi Wigderson:
Depth-3 Arithmetic Formulae over Fields of Characteristic Zero. CCC 1999: 87- - [c86]Ziv Bar-Yossef, Oded Goldreich, Avi Wigderson:
Deterministic Amplification of Space-Bounded Probabilistic Algorithms. CCC 1999: 188- - [c85]Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson:
Near-Optimal Conversion of Hardness into Pseudo-Randomness. FOCS 1999: 181-190 - [c84]Avi Wigderson:
Probabilistic and Deterministic Approximations of the Permanent (abstract). RANDOM-APPROX 1999: 130 - [c83]Oded Goldreich, Avi Wigderson:
Improved Derandomization of BPP Using a Hitting Set Generator. RANDOM-APPROX 1999: 131-137 - [c82]Eli Ben-Sasson, Avi Wigderson:
Short Proofs are Narrow - Resolution Made Simple. STOC 1999: 517-526 - [i9]Eli Ben-Sasson, Avi Wigderson:
Short Proofs are Narrow - Resolution made Simple. Electron. Colloquium Comput. Complex. TR99 (1999) - [i8]Amir Shpilka, Avi Wigderson:
Depth-3 Arithmetic Formulae over Fields of Characteristic Zero. Electron. Colloquium Comput. Complex. TR99 (1999) - [i7]Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson:
Space Complexity in Propositional Calculus. Electron. Colloquium Comput. Complex. TR99 (1999) - 1998
- [j54]Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi Wigderson:
On Data Structures and Asymmetric Communication Complexity. J. Comput. Syst. Sci. 57(1): 37-49 (1998) - [j53]Anne Condon, Lisa Hellerstein, Samuel Pottle, Avi Wigderson:
On the Power of Finite Automata with Both Nondeterministic and Probabilistic States. SIAM J. Comput. 27(3): 739-762 (1998) - [c81]Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson:
The Quantum Communication Complexity of Sampling. FOCS 1998: 342-351 - [c80]Russell Impagliazzo, Avi Wigderson:
Randomness vs. Time: De-Randomization under a Uniform Assumption. FOCS 1998: 734-743 - [c79]Avi Wigderson:
Do Probabilistic Algorithms Outperform Deterministic Ones? ICALP 1998: 212-214 - [c78]Harry Buhrman, Richard Cleve, Avi Wigderson:
Quantum vs. Classical Communication and Computation. STOC 1998: 63-68 - [c77]Nathan Linial, Alex Samorodnitsky, Avi Wigderson:
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents. STOC 1998: 644-652 - [i6]Ziv Bar-Yossef, Oded Goldreich, Avi Wigderson:
Deterministic Amplification of Space Bounded Probabilistic Algorithms. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [j52]Noam Nisan, Avi Wigderson:
Lower Bounds on Arithmetic Circuits Via Partial Derivatives. Comput. Complex. 6(3): 217-234 (1997) - [j51]Oded Goldreich, Avi Wigderson:
Tiny families of functions with random properties: A quality-size trade-off for hashing. Random Struct. Algorithms 11(4): 315-343 (1997) - [j50]Oded Goldreich, Avi Wigderson:
Theory of computing: a scientific perspective (extended abstract). SIGACT News 28(3): 100-102 (1997) - [c76]Russell Impagliazzo, Avi Wigderson:
P = BPP if E Requires Exponential Circuits: Derandomizing the XOR Lemma. STOC 1997: 220-229 - [c75]Roy Armoni, Amnon Ta-Shma, Avi Wigderson, Shiyu Zhou:
SL <= L4/3. STOC 1997: 230-239 - [c74]Itzhak Parnafes, Ran Raz, Avi Wigderson:
Direct Product Results and the GCD Problem, in Old and New Communication Models. STOC 1997: 363-372 - [c73]Alexander A. Razborov, Avi Wigderson, Andrew Chi-Chih Yao:
Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus. STOC 1997: 739-748 - 1996
- [j49]Helmut Alt, Leonidas J. Guibas, Kurt Mehlhorn, Richard M. Karp, Avi Wigderson:
A Method for Obtaining Randomized Algorithms with Small Tail Probabilities. Algorithmica 16(4/5): 543-547 (1996) - [j48]Oded Goldreich, Avi Wigderson:
Theory of Computing: A Scientific Perspective. ACM Comput. Surv. 28(4es): 218 (1996) - [j47]Anna Gál, Avi Wigderson:
Boolean complexity classes vs. their arithmetic analogs. Random Struct. Algorithms 9(1-2): 99-111 (1996) - [j46]Joseph Gil, Friedhelm Meyer auf der Heide, Avi Wigderson:
The Tree Model for Hashing: Lower and Upper Bounds. SIAM J. Comput. 25(5): 936-955 (1996) - [j45]Christos H. Papadimitriou, Oded Goldreich, Avi Wigderson, Alexander A. Razborov, Michael Sipser:
The future of computational complexity theory: part I. SIGACT News 27(3): 6-12 (1996) - [c72]Roy Armoni, Michael E. Saks, Avi Wigderson, Shiyu Zhou:
Discrepancy Sets and Pseudorandom Generators for Combinatorial Rectangles. FOCS 1996: 412-421 - [c71]Roded Sharan, Avi Wigderson:
A New NCAlgorithm for Perfect Matching in Bipartite Cubic Graphs. ISTCS 1996: 202-207 - [c70]László Babai, Anna Gál, János Kollár, Lajos Rónyai, Tibor Szabó, Avi Wigderson:
Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs. STOC 1996: 603-611 - [i5]Oded Goldreich, Avi Wigderson:
On the Circuit Complexity of Perfect Hashing. Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [j44]Noga Alon, Uriel Feige, Avi Wigderson, David Zuckerman:
Derandomized Graph Products. Comput. Complex. 5(1): 60-75 (1995) - [j43]Mauricio Karchmer, Ran Raz, Avi Wigderson:
Super-Logarithmic Depth Lower Bounds Via the Direct Sum in Communication Complexity. Comput. Complex. 5(3/4): 191-204 (1995) - [j42]Joel Friedman, Avi Wigderson:
On the Second Eigenvalue of Hypergraphs. Comb. 15(1): 43-65 (1995) - [j41]Noam Nisan, Avi Wigderson:
On Rank vs. Communication Complexity. Comb. 15(4): 557-565 (1995) - [j40]László Lovász, Moni Naor, Ilan Newman, Avi Wigderson:
Search Problems in the Decision Tree Model. SIAM J. Discret. Math. 8(1): 119-132 (1995) - [j39]Ilan Newman, Avi Wigderson:
Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy. SIAM J. Discret. Math. 8(4): 536-542 (1995) - [c69]Ivan Damgård, Oded Goldreich, Tatsuaki Okamoto, Avi Wigderson:
Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs. CRYPTO 1995: 325-338 - [c68]Noam Nisan, Avi Wigderson:
Lower Bounds for Arithmetic Circuits via Partial Serivatives (Preliminary Version). FOCS 1995: 16-25 - [c67]Avi Wigderson:
Computational Pseudo-Randomness. ISTCS 1995: 218-219 - [c66]Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi Wigderson:
On data structures and asymmetric communication complexity. STOC 1995: 103-111 - [c65]Noam Nisan, Avi Wigderson:
On the complexity of bilinear forms: dedicated to the memory of Jacques Morgenstern. STOC 1995: 723-732 - [i4]Anna Gál, Avi Wigderson:
Boolean Complexity Classes vs. Their Arithmetic Analogs. Electron. Colloquium Comput. Complex. TR95 (1995) - [i3]Oded Goldreich, Noam Nisan, Avi Wigderson:
On Yao's XOR-Lemma. Electron. Colloquium Comput. Complex. TR95 (1995) - 1994
- [j38]Shai Ben-David, Allan Borodin, Richard M. Karp, Gábor Tardos, Avi Wigderson:
On the Power of Randomization in On-Line Algorithms. Algorithmica 11(1): 2-14 (1994) - [j37]Noam Nisan, Avi Wigderson:
Hardness vs Randomness. J. Comput. Syst. Sci. 49(2): 149-167 (1994) - [j36]Mauricio Karchmer, Ilan Newman, Michael E. Saks, Avi Wigderson:
Non-Deterministic Communication Complexity with Few Witnesses. J. Comput. Syst. Sci. 49(2): 247-257 (1994) - [c64]Avi Wigderson:
NL/poly <= +/poly (Preliminary Version). SCT 1994: 59-62 - [c63]Russell Impagliazzo, Ran Raz, Avi Wigderson:
A Direct Product Theorem. SCT 1994: 88-96 - [c62]Noam Nisan, Avi Wigderson:
On Rank vs. Communication Complexity. FOCS 1994: 831-836 - [c61]Avi Wigderson:
The Wonders of the Digital Envelope - A Crash Course in Modern Cryptography. IFIP Congress (1) 1994: 235-238 - [c60]Russell Impagliazzo, Noam Nisan, Avi Wigderson:
Pseudorandomness for network algorithms. STOC 1994: 356-364 - [c59]Oded Goldreich, Avi Wigderson:
Tiny families of functions with random properties (preliminary version): a quality-size trade-off for hashing. STOC 1994: 574-584 - [c58]Avi Wigderson:
The amazing power of pairwise independence (abstract). STOC 1994: 645-647 - [c57]Anne Condon, Lisa Hellerstein, Samuel Pottle, Avi Wigderson:
On the power of finite automata with both nondeterministic and probabilistic states (preliminary version). STOC 1994: 676-685 - [i2]Noam Nisan, Avi Wigderson:
On Rank vs. Communication Complexity. Electron. Colloquium Comput. Complex. TR94 (1994) - [i1]Oded Goldreich, Avi Wigderson:
Tiny Families of Functions with Random Properties: A Quality-Size Trade-off for Hashing. Electron. Colloquium Comput. Complex. TR94 (1994) - 1993
- [j35]László Babai, Lance Fortnow, Noam Nisan, Avi Wigderson:
BPP Has Subexponential Time Simulations Unless EXPTIME has Publishable Proofs. Comput. Complex. 3: 307-318 (1993) - [j34]Alexander A. Razborov, Endre Szemerédi, Avi Wigderson:
Constructing Small Sets that are Uniform in Arithmetic Progressions. Comb. Probab. Comput. 2: 513-518 (1993) - [j33]Mauricio Karchmer, Nathan Linial, Ilan Newman, Michael E. Saks, Avi Wigderson:
Combinatorial characterization of read-once formulae. Discret. Math. 114(1-3): 275-282 (1993) - [j32]Alexander A. Razborov, Avi Wigderson:
n^Omega(log n) Lower Bounds on the Size of Depth-3 Threshold Circuits with AND Gates at the Bottom. Inf. Process. Lett. 45(6): 303-307 (1993) - [j31]Shlomo Hoory, Avi Wigderson:
Universal Traversal Sequences for Expander Graphs. Inf. Process. Lett. 46(2): 67-69 (1993) - [j30]Noam Nisan, Avi Wigderson:
Rounds in Communication Complexity Revisited. SIAM J. Comput. 22(1): 211-219 (1993) - [j29]Rafi Heiman, Ilan Newman, Avi Wigderson:
On Read-Once Threshold Formulae and Their Randomized Decision in Tree Complexity. Theor. Comput. Sci. 107(1): 63-76 (1993) - [c56]Mauricio Karchmer, Avi Wigderson:
On Span Programs. SCT 1993: 102-111 - [c55]Rafail Ostrovsky, Avi Wigderson:
One-Way Fuctions are Essential for Non-Trivial Zero-Knowledge. ISTCS 1993: 3-17 - [c54]Michael Luby, Boban Velickovic, Avi Wigderson:
Deterministic Approximate Counting of Depth-2 Circuits. ISTCS 1993: 18-24 - [c53]Avi Wigderson, David Zuckerman:
Expanders that beat the eigenvalue bound: explicit construction and applications. STOC 1993: 245-251 - [c52]Mauricio Karchmer, Avi Wigderson:
Characterizing non-deterministic circuit size. STOC 1993: 532-540 - 1992
- [j28]Joseph Gil, William L. Steiger, Avi Wigderson:
Geometric medians. Discret. Math. 108(1-3): 37-51 (1992) - [j27]Ran Raz, Avi Wigderson:
Monotone Circuits for Matching Require Linear Depth. J. ACM 39(3): 736-744 (1992) - [c51]Mauricio Karchmer, Ilan Newman, Michael E. Saks, Avi Wigderson:
Non-deterministic Communication Complexity with Few Witness. SCT 1992: 275-281 - [c50]Noam Nisan, Endre Szemerédi, Avi Wigderson:
Undirected Connectivity in O(log ^1.5 n) Space. FOCS 1992: 24-29 - [c49]Yuri Rabinovich, Alistair Sinclair, Avi Wigderson:
Quadratic Dynamical Systems (Preliminary Version). FOCS 1992: 304-313 - [c48]Avi Wigderson:
The Complexity of Graph Connectivity. MFCS 1992: 112-132 - [e1]S. Rao Kosaraju, Mike Fellows, Avi Wigderson, John A. Ellis:
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, May 4-6, 1992, Victoria, British Columbia, Canada. ACM 1992, ISBN 0-89791-511-9 [contents] - 1991
- [j26]Alok Aggarwal, Maria M. Klawe, David Lichtenstein, Nathan Linial, Avi Wigderson:
A Lower Bound on the Area of Permutation Layouts. Algorithmica 6(2): 241-255 (1991) - [j25]Rafi Heiman, Avi Wigderson:
Randomized VS. Deterministic Decision Tree Complexity for Read-Once Boolean Functions. Comput. Complex. 1: 311-329 (1991) - [j24]Prabhakar Ragde, Avi Wigderson:
Linear-Size Constant-Depth Polylog-Treshold Circuits. Inf. Process. Lett. 39(3): 143-146 (1991) - [j23]Oded Goldreich, Silvio Micali, Avi Wigderson:
Proofs that Yield Nothing But Their Validity for All Languages in NP Have Zero-Knowledge Proof Systems. J. ACM 38(3): 691-729 (1991) - [c47]Rafi Heiman, Avi Wigderson:
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions. SCT 1991: 172-179 - [c46]Mauricio Karchmer, Ran Raz, Avi Wigderson:
Super-logarithmic Depth Lower Bounds via Direct Sum in Communication Coplexity. SCT 1991: 299-304 - [c45]László Lovász, Moni Naor, Ilan Newman, Avi Wigderson:
Search Problems in the Decision Tree Model (Preliminary Version). FOCS 1991: 576-585 - [c44]Yuri Rabinovich, Avi Wigderson:
An Analysis of a Simple Genetic Algorithm. ICGA 1991: 215-221 - [c43]Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld, Madhu Sudan, Avi Wigderson:
Self-Testing/Correcting for Polynomials and for Approximate Functions. STOC 1991: 32-42 - [c42]Noam Nisan, Avi Wigderson:
Rounds in Communication Complexity Revisited. STOC 1991: 419-429 - 1990
- [j22]Faith E. Fich, Avi Wigderson:
Toward Understanding Exclusive Read. SIAM J. Comput. 19(4): 718-727 (1990) - [j21]Noga Alon, Mauricio Karchmer, Avi Wigderson:
Linear Circuits over GF(2). SIAM J. Comput. 19(6): 1064-1067 (1990) - [j20]Mauricio Karchmer, Avi Wigderson:
Monotone Circuits for Connectivity Require Super-Logarithmic Depth. SIAM J. Discret. Math. 3(2): 255-265 (1990) - [c41]Rafi Heiman, Ilan Newman, Avi Wigderson:
On Read-Once Threshold Formulae and Their Randomized Decision Tree Complexity. SCT 1990: 78-87 - [c40]Ilan Newman, Prabhakar Ragde, Avi Wigderson:
Perfect Hashing, Graph Entropy, and Circuit Complexity. SCT 1990: 91-99 - [c39]Johan Håstad, Avi Wigderson:
Composition of the Universal Relation. Advances In Computational Complexity Theory 1990: 119-134 - [c38]Joseph Gil, Friedhelm Meyer auf der Heide, Avi Wigderson:
Not All Keys Can Be Hashed in Constant Time (Preliminary Version). STOC 1990: 244-253 - [c37]Ran Raz, Avi Wigderson:
Monotone Circuits for Matching Require Linear Depth. STOC 1990: 287-292 - [c36]Shai Ben-David, Allan Borodin, Richard M. Karp, Gábor Tardos, Avi Wigderson:
On the Power of Randomization in Online Algorithms (Extended Abstract). STOC 1990: 379-386
1980 – 1989
- 1989
- [j19]Miklós Ajtai, Avi Wigderson:
Deterministic Simulation of Probabilistic Constant Depth Circuits. Adv. Comput. Res. 5: 199-222 (1989) - [j18]Bettina Just, Friedhelm Meyer auf der Heide, Avi Wigderson:
On Computations with Integer Division. RAIRO Theor. Informatics Appl. 23(1): 101-111 (1989) - [c35]Noam Nisan, Avi Wigderson:
Hardness vs. Randomness - A Survey (abstract). SCT 1989: 54 - [c34]Michael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson:
Efficient Identification Schemes Using Two Prover Interactive Proofs. CRYPTO 1989: 498-506 - [c33]Aviad Cohen, Avi Wigderson:
Dispersers, Deterministic Amplification, and Weak Random Sources (Extended Abstract). FOCS 1989: 14-19 - [c32]Ran Raz, Avi Wigderson:
Probabilistic Communication Complexity of Boolean Relations (Extended Abstract). FOCS 1989: 562-567 - [c31]Faith E. Fich, Avi Wigderson:
Towards Understanding Exclusive Read. SPAA 1989: 76-82 - 1988
- [j17]Faith E. Fich, Prabhakar Ragde, Avi Wigderson:
Simulations Among Concurrent-Write PRAMs. Algorithmica 3: 43-51 (1988) - [j16]Nathan Linial, László Lovász, Avi Wigderson:
Rubber bands, convex embeddings and graph connectivity. Comb. 8(1): 91-102 (1988) - [j15]Richard M. Karp, Eli Upfal, Avi Wigderson:
The Complexity of Parallel Search. J. Comput. Syst. Sci. 36(2): 225-253 (1988) - [j14]Douglas L. Long, Avi Wigderson:
The Discrete Logarithm Hides O(log n) Bits. SIAM J. Comput. 17(2): 363-372 (1988) - [j13]Faith E. Fich, Prabhakar Ragde, Avi Wigderson:
Relations Between Concurrent-Write Models of Parallel Computation. SIAM J. Comput. 17(3): 606-627 (1988) - [j12]Prabhakar Ragde, William L. Steiger, Endre Szemerédi, Avi Wigderson:
The Parallel Complexity of Element Distinctness is Omega (sqrt(log n)). SIAM J. Discret. Math. 1(3): 399-410 (1988) - [j11]Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson:
A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem. Theor. Comput. Sci. 58: 57-68 (1988) - [c30]Noam Nisan, Avi Wigderson:
Hardness vs. Randomness (Extended Abstract). FOCS 1988: 2-11 - [c29]Bettina Just, Friedhelm Meyer auf der Heide, Avi Wigderson:
On Computations with Integer Division. STACS 1988: 29-37 - [c28]Michael Ben-Or, Shafi Goldwasser, Avi Wigderson:
Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract). STOC 1988: 1-10 - [c27]Michael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson:
Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions. STOC 1988: 113-131 - [c26]Mauricio Karchmer, Avi Wigderson:
Monotone Circuits for Connectivity Require Super-logarithmic Depth. STOC 1988: 539-550 - 1987
- [j10]Eli Upfal, Avi Wigderson:
How to share memory in a distributed system. J. ACM 34(1): 116-127 (1987) - [j9]Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson:
A Time-Space Tradeoff for Element Distinctness. SIAM J. Comput. 16(1): 97-99 (1987) - [j8]Friedhelm Meyer auf der Heide, Avi Wigderson:
The Complexity of Parallel Sorting. SIAM J. Comput. 16(1): 100-107 (1987) - [c25]Oded Goldreich, Silvio Micali, Avi Wigderson:
How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. STOC 1987: 218-229 - 1986
- [j7]Richard M. Karp, Eli Upfal, Avi Wigderson:
Constructing a perfect matching is in random NC. Comb. 6(1): 35-48 (1986) - [c24]Oded Goldreich, Silvio Micali, Avi Wigderson:
How to Prove all NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design. CRYPTO 1986: 171-185 - [c23]Richard M. Karp, Michael E. Saks, Avi Wigderson:
On a Search Problem Related to Branch-and-Bound Procedures. FOCS 1986: 19-28 - [c22]Michael E. Saks, Avi Wigderson:
Probabilistic Boolean Decision Trees and the Complexity of Evaluating Game Trees. FOCS 1986: 29-38 - [c21]Nathan Linial, László Lovász, Avi Wigderson:
A Physical Interpretation of Graph Connectivity, and Its Algorithmic Applications. FOCS 1986: 39-48 - [c20]Oded Goldreich, Silvio Micali, Avi Wigderson:
Proofs that Yield Nothing But their Validity and a Methodology of Cryptographic Protocol Design (Extended Abstract). FOCS 1986: 174-187 - [c19]Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson:
A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem. ICALP 1986: 50-59 - [c18]Oded Goldreich, Silvio Micali, Avi Wigderson:
Proofs that Release Minimum Knowledge. MFCS 1986: 639-650 - [c17]Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson:
A Time-Space Tradeoff for Element Distinctness. STACS 1986: 353-358 - [c16]Nimrod Megiddo, Avi Wigderson:
On Play by Means of Computing Machines. TARK 1986: 259-274 - 1985
- [j6]Richard M. Karp, Avi Wigderson:
A Fast Parallel Algorithm for the Maximal Independent Set Problem. J. ACM 32(4): 762-773 (1985) - [j5]Uzi Vishkin, Avi Wigderson:
Trade-Offs Between Depth and Width in Parallel Computation. SIAM J. Comput. 14(2): 303-314 (1985) - [j4]Gopalakrishnan Vijayan, Avi Wigderson:
Rectilinear Graphs and their Embeddings. SIAM J. Comput. 14(2): 355-372 (1985) - [c15]Miklós Ajtai, Avi Wigderson:
Deterministic Simulation of Probabilistic Constant Depth Circuits (Preliminary Version). FOCS 1985: 11-19 - [c14]Alok Aggarwal, Maria M. Klawe, David Lichtenstein, Nathan Linial, Avi Wigderson:
Multi-Layer Grid Embeddings. FOCS 1985: 186-196 - [c13]Friedhelm Meyer auf der Heide, Avi Wigderson:
The Complexity of Parallel Sorting. FOCS 1985: 532-540 - [c12]Richard M. Karp, Eli Upfal, Avi Wigderson:
The Complexity of Parallel Computation on Matroids. FOCS 1985: 541-550 - [c11]Richard M. Karp, Eli Upfal, Avi Wigderson:
Constructing a Perfect Matching is in Random NC. STOC 1985: 22-32 - [c10]Faith E. Fich, Friedhelm Meyer auf der Heide, Prabhakar Ragde, Avi Wigderson:
One, Two, Three \dots Infinity: Lower Bounds for Parallel Computation. STOC 1985: 48-58 - [c9]Richard M. Karp, Eli Upfal, Avi Wigderson:
Are Search and Decision Problems Computationally Equivalent? STOC 1985: 464-475 - 1984
- [c8]Eli Upfal, Avi Wigderson:
How to Share Memory in a Distributed System (A Preliminary Version). FOCS 1984: 171-180 - [c7]Faith E. Fich, Prabhakar Ragde, Avi Wigderson:
Relations Between Concurrent-Write Models of Parallel Computation. PODC 1984: 179-189 - [c6]Richard M. Karp, Avi Wigderson:
A Fast Parallel Algorithm for the Maximal Independent Set Problem. STOC 1984: 266-272 - 1983
- [j3]Uzi Vishkin, Avi Wigderson:
Dynamic Parallel Memories. Inf. Control. 56(3): 174-182 (1983) - [j2]Hana Galperin, Avi Wigderson:
Succinct Representations of Graphs. Inf. Control. 56(3): 183-198 (1983) - [j1]Avi Wigderson:
Improving the Performance Guarantee for Approximate Graph Coloring. J. ACM 30(4): 729-735 (1983) - [c5]Uzi Vishkin, Avi Wigderson:
Trade-Offs between Depth and Width in Parallel Computation (Preliminary Version). FOCS 1983: 146-153 - [c4]Danny Dolev, Cynthia Dwork, Nicholas Pippenger, Avi Wigderson:
Superconcentrators, Generalizers and Generalized Connectors with Limited Depth (Preliminary Version). STOC 1983: 42-51 - [c3]Douglas L. Long, Avi Wigderson:
How Discreet is the Discrete Log? STOC 1983: 413-420 - 1982
- [c2]Danny Dolev, Avi Wigderson:
On the Security of Multi-Party Protocols in Distributed Systems. CRYPTO 1982: 167-175 - [c1]Avi Wigderson:
A New Approximate Graph Coloring Algorithm. STOC 1982: 325-329
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 22:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
