Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDZhenjian Lu
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[i10]Zhenjian Lu, Igor Carboni Oliveira, Rahul Santhanam:
Pseudodeterministic Algorithms and the Structure of Probabilistic Time. CoRR abs/2103.08539 (2021)- [i9]Zhenjian Lu, Igor Carboni Oliveira, Rahul Santhanam:
Pseudodeterministic Algorithms and the Structure of Probabilistic Time. Electron. Colloquium Comput. Complex. 28: 39 (2021) - [i8]Lijie Chen, Zhenjian Lu, Xin Lyu, Igor Carboni Oliveira:
Majority vs. Approximate Linear Sum and Average-Case Complexity Below NC1. Electron. Colloquium Comput. Complex. 28: 40 (2021) - [i7]Zhenjian Lu, Igor Carboni Oliveira:
An Efficient Coding Theorem via Probabilistic Representations and its Applications. Electron. Colloquium Comput. Complex. 28: 41 (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 Oliveira:
Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates. Computational Complexity Conference 2020: 15:1-15:41 - [i6]Valentine Kabanets, Sajin Koroth, Zhenjian Lu, Dimitrios Myrisiotis, Igor 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 Oliveira:
Algorithms and Lower Bounds for de Morgan Formulas of Low-Communication Leaf Gates. Electron. Colloquium Comput. Complex. 27: 18 (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. 26: 22 (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. 25: 12 (2018) - [i2]Valentine Kabanets, Zhenjian Lu:
Satisfiability and Derandomization for Small Polynomial Threshold Circuits. Electron. Colloquium Comput. Complex. 25: 115 (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. 24: 26 (2017)
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2021-04-08 11:07 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 has been originally created in 1993 at:
since 2018, dblp is operated and maintained by:
the dblp computer science bibliography is funded and supported by:
