Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhenjian Lu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j4]Bruno Pasqualotto Cavalar
, Zhenjian Lu:
Algorithms and Lower Bounds for Comparator Circuits from Shrinkage. Algorithmica 85(7): 2131-2155 (2023)- [c12]Shuichi Hirahara, Zhenjian Lu, Hanlin Ren:
Bounded Relativization. CCC 2023: 6:1-6:45 - [c11]Shuichi Hirahara, Rahul Ilango, Zhenjian Lu, Mikito Nanashima, Igor C. Oliveira:
A Duality between One-Way Functions and Average-Case Symmetry of Information. STOC 2023: 1039-1050 - [i22]Lijie Chen, Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam:
Polynomial-Time Pseudodeterministic Construction of Primes. CoRR abs/2305.15140 (2023) - [i21]Lijie Chen, Zhenjian Lu, Igor Carboni Oliveira, Hanlin Ren, Rahul Santhanam:
Polynomial-Time Pseudodeterministic Construction of Primes. Electron. Colloquium Comput. Complex. TR23 (2023) - [i20]Shuichi Hirahara, Rahul Ilango, Zhenjian Lu, Mikito Nanashima, Igor Carboni Oliveira:
A Duality Between One-Way Functions and Average-Case Symmetry of Information. Electron. Colloquium Comput. Complex. TR23 (2023) - [i19]Shuichi Hirahara, Zhenjian Lu, Hanlin Ren:
Bounded Relativization. Electron. Colloquium Comput. Complex. TR23 (2023) - [i18]Shuichi Hirahara, Rahul Ilango, Zhenjian Lu, Mikito Nanashima, Igor C. Oliveira:
A Duality Between One-Way Functions and Average-Case Symmetry of Information. IACR Cryptol. ePrint Arch. 2023: 424 (2023) - 2022
- [j3]Zhenjian Lu, Igor C. Oliveira:
Theory and Applications of Probabilistic Kolmogorov Complexity. Bull. EATCS 137 (2022) - [c10]Halley Goldberg, Valentine Kabanets, Zhenjian Lu, Igor C. Oliveira:
Probabilistic Kolmogorov Complexity with Applications to Average-Case Complexity. CCC 2022: 16:1-16:60 - [c9]Zhenjian Lu, Igor C. Oliveira, Marius Zimand:
Optimal Coding Theorems in Time-Bounded Kolmogorov Complexity. ICALP 2022: 92:1-92:14 - [c8]Bruno Pasqualotto Cavalar, Zhenjian Lu:
Algorithms and Lower Bounds for Comparator Circuits from Shrinkage. ITCS 2022: 34:1-34:21 - [i17]Zhenjian Lu, Igor C. Oliveira, Marius Zimand:
Optimal Coding Theorems in Time-Bounded Kolmogorov Complexity. CoRR abs/2204.08312 (2022) - [i16]Zhenjian Lu, Igor C. Oliveira:
Theory and Applications of Probabilistic Kolmogorov Complexity. CoRR abs/2205.14718 (2022) - [i15]Halley Goldberg, Valentine Kabanets, Zhenjian Lu, Igor C. Oliveira:
Probabilistic Kolmogorov Complexity with Applications to Average-Case Complexity. Electron. Colloquium Comput. Complex. TR22 (2022) - [i14]Zhenjian Lu, Igor C. Oliveira:
Theory and Applications of Probabilistic Kolmogorov Complexity. Electron. Colloquium Comput. Complex. TR22 (2022) - [i13]Zhenjian Lu, Igor Carboni Oliveira, Marius Zimand:
Optimal Coding Theorems in Time-Bounded Kolmogorov Complexity. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j2]Valentine Kabanets, Sajin Koroth, Zhenjian Lu, Dimitrios Myrisiotis, Igor C. Oliveira:
Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates. ACM Trans. Comput. Theory 13(4): 23:1-23:37 (2021) - [c7]Lijie Chen, Zhenjian Lu, Xin Lyu, Igor C. Oliveira:
Majority vs. Approximate Linear Sum and Average-Case Complexity Below NC¹. ICALP 2021: 51:1-51:20 - [c6]Zhenjian Lu, Igor C. Oliveira:
An Efficient Coding Theorem via Probabilistic Representations and Its Applications. ICALP 2021: 94:1-94:20 - [c5]Zhenjian Lu, Igor C. Oliveira, Rahul Santhanam:
Pseudodeterministic algorithms and the structure of probabilistic time. STOC 2021: 303-316 - [i12]Zhenjian Lu, Igor C. Oliveira, Rahul Santhanam:
Pseudodeterministic Algorithms and the Structure of Probabilistic Time. CoRR abs/2103.08539 (2021) - [i11]Bruno Pasqualotto Cavalar, Zhenjian Lu:
Algorithms and Lower Bounds for Comparator Circuits from Shrinkage. CoRR abs/2111.14974 (2021) - [i10]Bruno Pasqualotto Cavalar, Zhenjian Lu:
Algorithms and Lower Bounds for Comparator Circuits from Shrinkage. Electron. Colloquium Comput. Complex. TR21 (2021) - [i9]Lijie Chen, Zhenjian Lu, Xin Lyu, Igor Carboni Oliveira:
Majority vs. Approximate Linear Sum and Average-Case Complexity Below NC1. Electron. Colloquium Comput. Complex. TR21 (2021) - [i8]Zhenjian Lu, Igor Carboni Oliveira:
An Efficient Coding Theorem via Probabilistic Representations and its Applications. Electron. Colloquium Comput. Complex. TR21 (2021) - [i7]Zhenjian Lu, Igor Carboni Oliveira, Rahul Santhanam:
Pseudodeterministic Algorithms and the Structure of Probabilistic Time. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j1]Mahdi Cheraghchi, Valentine Kabanets, Zhenjian Lu, Dimitrios Myrisiotis:
Circuit Lower Bounds for MCSP from Local Pseudorandom Generators. ACM Trans. Comput. Theory 12(3): 21:1-21:27 (2020) - [c4]Valentine Kabanets, Sajin Koroth, Zhenjian Lu, Dimitrios Myrisiotis, Igor C. Oliveira:
Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates. CCC 2020: 15:1-15:41 - [i6]Valentine Kabanets, Sajin Koroth, Zhenjian Lu, Dimitrios Myrisiotis, Igor C. Oliveira:
Algorithms and Lower Bounds for de Morgan Formulas of Low-Communication Leaf Gates. CoRR abs/2002.08533 (2020) - [i5]Valentine Kabanets, Sajin Koroth, Zhenjian Lu, Dimitrios Myrisiotis, Igor C. Oliveira:
Algorithms and Lower Bounds for de Morgan Formulas of Low-Communication Leaf Gates. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c3]Mahdi Cheraghchi, Valentine Kabanets, Zhenjian Lu, Dimitrios Myrisiotis:
Circuit Lower Bounds for MCSP from Local Pseudorandom Generators. ICALP 2019: 39:1-39:14 - [i4]Mahdi Cheraghchi, Valentine Kabanets, Zhenjian Lu, Dimitrios Myrisiotis:
Circuit Lower Bounds for MCSP from Local Pseudorandom Generators. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c2]Valentine Kabanets, Zhenjian Lu:
Satisfiability and Derandomization for Small Polynomial Threshold Circuits. APPROX-RANDOM 2018: 46:1-46:19 - [i3]Valentine Kabanets, Zhenjian Lu:
Nisan-Wigderson Pseudorandom Generators for Circuits with Polynomial Threshold Gates. Electron. Colloquium Comput. Complex. TR18 (2018) - [i2]Valentine Kabanets, Zhenjian Lu:
Satisfiability and Derandomization for Small Polynomial Threshold Circuits. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c1]Valentine Kabanets, Daniel M. Kane, Zhenjian Lu:
A polynomial restriction lemma with applications. STOC 2017: 615-628 - [i1]Valentine Kabanets, Daniel M. Kane, Zhenjian Lu:
A Polynomial Restriction Lemma with Applications. Electron. Colloquium Comput. Complex. TR17 (2017)
Coauthor Index
aka: Igor Carboni Oliveira
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 2023-10-01 22:24 CEST 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:
