default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhijun Zhang 0007
Person information
- affiliation: Sofia University St. Kliment Ohridski, INSAIT, Sofia, Bulgaria
- affiliation: Princeton University, Department of Computer Science, Princeton, NJ, USA
Other persons with the same name
- Zhijun Zhang — disambiguation page
- Zhijun Zhang 0001 — Oregon Health and Science University, Portland, OR, USA (and 1 more)
- Zhijun Zhang 0002
![[0000-0002-9532-7158]](/%20https://reactormag.com/five-https-dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-9532-7158")
— Shandong Jianzhu University, School of Computer Science and Technology, Jinan, China - Zhijun Zhang 0003 — South China University of Technology, School of Automation Science and Engineering, Guangzhou, China (and 2 more)
- Zhijun Zhang 0004 — Northeastern University, School of Mechanical Engineering and Automation, Shenyang, China
- Zhijun Zhang 0005 — Tsinghua University, Tsinghua National Laboratory for Information Science and Technology, Beijing, China
- Zhijun Zhang 0006 — Nanjing University of Posts and Telecommunications, College of Automation / College of Artificial Intelligence, China
- Zhijun Zhang 0008 — Yangzhou University, Yangzhou, China
- Zhijun Zhang 0009 — Huazhong University of Science and Technology, Wuhan, China
- Zhijun Zhang 0010 — Southeast University, Nanjing, Jiangsu, China
- Zhijun Zhang 0011 — China University of Geosciences, Wuhan, China
- Zhijun Zhang 0012 — Beijing University of Posts and Telecommunications, Key Laboratory of Universal Wireless Communications, China
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[c8]Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena, Zhijun Zhang:
White-Box Adversarial Streaming Lower Bounds Beyond Two-Party Communication. ICALP 2026: 87:1-87:22- [c7]Bernhard Haeupler, Antti Roeyskoe, Zhijun Zhang:
Better Diameter Bounds for Efficient Shortcuts and a Structural Criterion for Constructiveness. ICALP 2026: 105:1-105:23 - [c6]Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena, Zhijun Zhang:
Universally Optimal Streaming Algorithm for Random Walks in Dense Graphs. ITCS 2026: 55:1-55:20 - [i11]Bernhard Haeupler, Antti Roeyskoe, Zhijun Zhang:
Better Diameter Bounds for Efficient Shortcuts and a Structural Criterion for Constructiveness. CoRR abs/2602.10747 (2026) - [i10]Klim Efremenko, Gillat Kol, Raghuvansh Saxena, Zhijun Zhang:
White-Box Adversarial Streaming Lower Bounds beyond Two-Party Communication. Electron. Colloquium Comput. Complex. TR26: Article TR26-060 (2026) - 2025
- [j2]Sepehr Assadi, Gillat Kol, Zhijun Zhang:
Rounds vs. Communication Tradeoffs for Maximal Independent Sets. SIAM J. Comput. 54(5): S22-20 (2025) - [c5]Mark Braverman, Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena, Zhijun Zhang:
Round-Vs-Resilience Tradeoffs for Binary Feedback Channels. ITCS 2025: 22:1-22:23 - [i9]Bernhard Haeupler, Richard Hladík, Shengzhe Wang, Zhijun Zhang:
Stronger Directed Low-Diameter Decompositions with Sub-Logarithmic Diameter and Separation. CoRR abs/2509.24565 (2025) - [i8]Klim Efremenko, Gillat Kol, Raghuvansh Saxena, Zhijun Zhang:
Universally Optimal Streaming Algorithm for Random Walks in Dense Graphs. Electron. Colloquium Comput. Complex. TR25: Article TR25-216 (2025) - 2024
- [c4]Sepehr Assadi, Gillat Kol, Zhijun Zhang:
Optimal Multi-pass Lower Bounds for MST in Dynamic Streams. STOC 2024: 835-846 - 2023
- [i7]Sepehr Assadi, Gillat Kol, Zhijun Zhang:
Optimal Multi-Pass Lower Bounds for MST in Dynamic Streams. CoRR abs/2312.04674 (2023) - [i6]Sepehr Assadi, Gillat Kol, Zhijun Zhang:
Optimal Multi-Pass Lower Bounds for MST in Dynamic Streams. Electron. Colloquium Comput. Complex. TR23: Article TR23-197 (2023) - 2022
- [c3]Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena, Zhijun Zhang:
Binary Codes with Resilience Beyond 1/4 via Interaction. FOCS 2022: 1-12 - [c2]Sepehr Assadi, Gillat Kol, Zhijun Zhang:
Rounds vs Communication Tradeoffs for Maximal Independent Sets. FOCS 2022: 1193-1204 - [i5]Sepehr Assadi, Gillat Kol, Zhijun Zhang:
Rounds vs Communication Tradeoffs for Maximal Independent Sets. CoRR abs/2209.09049 (2022) - [i4]Sepehr Assadi, Gillat Kol, Zhijun Zhang:
Rounds vs Communication Tradeoffs for Maximal Independent Sets. Electron. Colloquium Comput. Complex. TR22: Article TR22-136 (2022) - [i3]Mark Braverman, Klim Efremenko, Gillat Kol, Raghuvansh Saxena, Zhijun Zhang:
Round-vs-Resilience Tradeoffs for Binary Feedback Channels. Electron. Colloquium Comput. Complex. TR22: Article TR22-179 (2022) - [i2]Klim Efremenko, Gillat Kol, Raghuvansh Saxena, Zhijun Zhang:
Binary Codes with Resilience Beyond 1/4 via Interaction. Electron. Colloquium Comput. Complex. TR22: Article TR22-129 (2022) - 2021
- [j1]Dawei Huang, Seth Pettie, Yixiang Zhang, Zhijun Zhang:
The Communication Complexity of Set Intersection and Multiple Equality Testing. SIAM J. Comput. 50(2): 674-717 (2021) - 2020
- [c1]Dawei Huang, Seth Pettie, Yixiang Zhang, Zhijun Zhang:
The Communication Complexity of Set Intersection and Multiple Equality Testing. SODA 2020: 1715-1732
2010 – 2019
- 2019
- [i1]Dawei Huang, Seth Pettie, Yixiang Zhang, Zhijun Zhang:
The Communication Complexity of Set Intersection and Multiple Equality Testing. CoRR abs/1908.11825 (2019)
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 2026-07-28 01:34 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
