Zhijun Zhang

According to our database, Zhijun Zhang authored at least 9 papers between 2020 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Better Diameter Bounds for Efficient Shortcuts and a Structural Criterion for Constructiveness.

Bernhard Haeupler, Antti Roeyskoe, Zhijun Zhang

CoRR, February, 2026

White-Box Adversarial Streaming Lower Bounds beyond Two-Party Communication.

Klim Efremenko, Gillat Kol, Raghuvansh Saxena, Zhijun Zhang

Electron. Colloquium Comput. Complex., 2026

Universally Optimal Streaming Algorithm for Random Walks in Dense Graphs.

Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena, Zhijun Zhang

Proceedings of the 17th Innovations in Theoretical Computer Science Conference, 2026

2025

Stronger Directed Low-Diameter Decompositions with Sub-Logarithmic Diameter and Separation.

Bernhard Haeupler, Richard Hladík, Shengzhe Wang, Zhijun Zhang

CoRR, September, 2025

Round-Vs-Resilience Tradeoffs for Binary Feedback Channels.

Mark Braverman, Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena, Zhijun Zhang

Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

2024

Optimal Multi-pass Lower Bounds for MST in Dynamic Streams.

Sepehr Assadi, Gillat Kol, Zhijun Zhang

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2022

Binary Codes with Resilience Beyond 1/4 via Interaction.

Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena, Zhijun Zhang

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

Rounds vs Communication Tradeoffs for Maximal Independent Sets.

Sepehr Assadi, Gillat Kol, Zhijun Zhang

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2020

The Communication Complexity of Set Intersection and Multiple Equality Testing.

Dawei Huang, Seth Pettie, Yixiang Zhang, Zhijun Zhang

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020