}} - *Simple and fast derandomization from very hard functions: Eliminating randomness at almost no cost* [https://eccc.weizmann.ac.il/report/2020/148/ \[eccc\]] [optimalderand-2020-ICT-CAS.pptx \[slides by me\]] [roei-slides-fast-derand.pdf \[slides by Roei\]] [https://www.youtube.com/watch?v=ZSGfxuga0fo \[video by Roei Tell at STOC 2021\]] {{ [short highlight]

[longer summary]

}} - *Almost Everywhere Circuit Lower Bounds from Non-Trivial Derandomization* [https://eccc.weizmann.ac.il/report/2020/150/ \[eccc\]] [https://www.youtube.com/watch?v=vpyoZdv--nw&list=PL3DbynX8gwfJLYrm4EoZn6aK7IAACiTKa&index=6 \[video by Xin Lyu at FOCS 2020\]] [Ryan-slides-ae-lowerbound.pdf \[slides by Ryan\]] {{ [short highlight]

}} - *Majority vs. Approximate Linear Sum and average-case complexity below NC1* [https://eccc.weizmann.ac.il/report/2021/040/ \[eccc\]] [MAJ-apxSUM-dagstuhl.ppsx \[slides by Igor\]] [https://www.youtube.com/watch?v=3sA1lfwfHO8 \[video by Xin\]] {{ [short highlight]

}} - *Almost Optimal Super-Constant-Pass Streaming Lower Bounds for Reachability* [https://eccc.weizmann.ac.il/report/2021/027/ \[eccc]] [https://www.youtube.com/watch?v=mXMh2T1To2w \[video by Raghuvansh Saxena at STOC 2021\]] {{ [short highlight]

}} - *Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs* [https://arxiv.org/abs/2102.11251 \[arxiv\]] [https://www.youtube.com/watch?v=NbI1lbcjfDg \[video by Raghuvansh\]] == *Selected Publications* - *Hardness vs Randomness, Revised: Uniform, Non-Black-Box, and Instance-Wise* [https://eccc.weizmann.ac.il/report/2021/080/ \[eccc\]] [nonbb-derand-final.pptx \[slides\] ] {{ [short summary]

}} Lijie Chen, [https://sites.google.com/site/roeitell/ Roei Tell]\n /Foundations of Computer Science/ (FOCS 2021)\n - *Majority vs. Approximate Linear Sum and average-case complexity below NC1* [https://eccc.weizmann.ac.il/report/2021/040/ \[eccc\]] [MAJ-apxSUM-dagstuhl.ppsx \[slides by Igor\]] [https://www.youtube.com/watch?v=3sA1lfwfHO8 \[video by Xin\]] {{ [short highlight]

}} Lijie Chen, Zhenjian Lu, Xin Lyu, Igor Oliveira\n /International Colloquium on Automata, Languages and Programming/ (ICALP), 2021 \n - *Simple and fast derandomization from very hard functions: Eliminating randomness at almost no cost* [https://eccc.weizmann.ac.il/report/2020/148/ \[eccc\]] [http://www.wisdom.weizmann.ac.il/~oded/MC/294.html \[Oded's choice\]] [optimalderand-2020-ICT-CAS.pptx \[slides by me\]] [roei-slides-fast-derand.pdf \[slides by Roei\]] {{ [short highlight]

[longer summary]

}} Lijie Chen, [https://sites.google.com/site/roeitell/ Roei Tell]\n /Symposium on the Theory of Computing/ (STOC 2021)\n - *Almost Everywhere Circuit Lower Bounds from Non-Trivial Derandomization* [https://eccc.weizmann.ac.il/report/2020/150/ \[eccc\]] [https://www.youtube.com/watch?v=vpyoZdv--nw&list=PL3DbynX8gwfJLYrm4EoZn6aK7IAACiTKa&index=6 \[video by Xin Lyu in FOCS 2020\]] [Ryan-slides-ae-lowerbound.pdf \[slides by Ryan\]] {{ [short highlight]

}} Lijie Chen, Xin Lyu, Ryan Williams\n /Foundations of Computer Science/ (FOCS 2020)\n - *Strong Average-Case Circuit Lower Bounds from Non-trivial Derandomization* [https://eccc.weizmann.ac.il/report/2020/010/ \[eccc\]] [Reunion_Talk.pptx \[slides at Simons (for complexity theorist)\]] [IAS_Talk.pptx \[slides at IAS (intense version)\]] [Warwick_Talk.pptx \[slides at Warwick (lightweight version)\]] {{ [short highlight]

}} Lijie Chen, [https://hanlin-ren.github.io/ Hanlin Ren]\n /Symposium on the Theory of Computing/ (STOC 2020). Invited to the SICOMP Special Issue for STOC 2020\n - *Beyond Natural Proofs: Hardness Magnification and Locality* [https://eccc.weizmann.ac.il/report/2019/168/ \[eccc\]] [https://arxiv.org/abs/1911.08297 \[arxiv\]] [https://www.dcs.warwick.ac.uk/~igorcarb/documents/papers/magnification-note.pdf \[notes by Igor\]] {{ [short highlight]

}} Lijie Chen, [https://researchmap.jp/shuichi.hirahara/ Shuichi Hirahara],[https://www.dcs.warwick.ac.uk/~igorcarb/ Igor Oliveira], [http://users.ox.ac.uk/~coml0742/ Jan Pich], [https://www.cs.ox.ac.uk/people/ninad.rajgopal/ Ninad Rajgopal], [https://www.cs.ox.ac.uk/people/rahul.santhanam/ Rahul Santhanam]\n /Innovations in Theoretical Computer Science/ (ITCS 2020)\n - *Efficient Construction of Rigid Matrices Using an NP Oracle* [FOCS_2019_rigidmatrix.pdf \[pdf\]] [FOCS_2019_rigidmatrix_slides.pptx \[slides\]] [http://www.wisdom.weizmann.ac.il/~oded/MC/281.html \[Oded's choice\]] {{ [short highlight]

}} [http://joshalman.com/ Josh Alman], Lijie Chen\n /Foundations of Computer Science/ (FOCS 2019). Machtey Award for Best Student Paper. Invited to the SICOMP Special Issue for FOCS 2019\n - *Bootstrapping Results for Threshold Circuits "Just Beyond" Known Lower Bounds* [https://eccc.weizmann.ac.il/report/2018/199/ \[eccc\]] [http://www.wisdom.weizmann.ac.il/~oded/MC/256.html \[Oded's choice\]] {{ [short highlight]

}} Lijie Chen, [https://sites.google.com/site/roeitell/ Roei Tell]\n /Symposium on the Theory of Computing/ (STOC 2019). Danny Lewin Best Student Paper Award\n - *Complexity-Theoretic Foundations of Quantum Supremacy Experiments* [http://eccc.hpi-web.de/report/2016/200/ \[eccc\]] [https://arxiv.org/abs/1612.05903 \[arxiv\]] [CCC_2017_QuantumSupremacy.pdf \[slides\]]\n [https://www.scottaaronson.com/ Scott Aaronson], Lijie Chen\n /Computational Complexity Conference/ (CCC 2017). Invited to the Toc Special Issue for CCC 2017\n == [papersYear.html *Full Publications*]\n