Lyuting Chen

According to our database, Lyuting Chen authored at least 7 papers between 2025 and 2026.

Collaborative distances:

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

2026

Beyond 2-Edge-Connectivity: Algorithms and Impossibility for Content-Oblivious Leader Election.

Yi-Jun Chang, Lyuting Chen, Haoran Zhou

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

2025

Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous Rings.

Jérémie Chalopin, Yi-Jun Chang, Lyuting Chen, Giuseppe Antonio Di Luna, Haoran Zhou

CoRR, September, 2025

Content-Oblivious Leader Election in 2-Edge-Connected Networks.

Yi-Jun Chang, Lyuting Chen, Haoran Zhou

CoRR, July, 2025

The Complexity Landscape of Dynamic Distributed Subgraph Finding.

Yi-Jun Chang, Lyuting Chen, Yanyu Chen, Gopinath Mishra, Mingyang Yang

Proceedings of the 39th International Symposium on Distributed Computing, 2025

Brief Announcement: Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous Rings.

Jérémie Chalopin, Yi-Jun Chang, Lyuting Chen, Giuseppe Antonio Di Luna, Haoran Zhou

Proceedings of the 39th International Symposium on Distributed Computing, 2025

Content-Oblivious Leader Election in 2-Edge-Connected Networks.

Jérémie Chalopin, Yi-Jun Chang, Lyuting Chen, Giuseppe Antonio Di Luna, Haoran Zhou

Proceedings of the 39th International Symposium on Distributed Computing, 2025

Brief Announcement: The Complexity Landscape of Dynamic Distributed Subgraph Finding.

Yi-Jun Chang, Lyuting Chen, Yanyu Chen, Gopinath Mishra, Mingyang Yang

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2025