Lyuting Chen

Orcid: 0009-0002-8836-6607

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Beyond 2-Edge-Connectivity: Algorithms and Impossibility for Content-Oblivious Leader Election.
Proceedings of the 17th Innovations in Theoretical Computer Science Conference, 2026

2025
Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous Rings.
CoRR, September, 2025

Content-Oblivious Leader Election in 2-Edge-Connected Networks.
CoRR, July, 2025

The Complexity Landscape of Dynamic Distributed Subgraph Finding.
Proceedings of the 39th International Symposium on Distributed Computing, 2025

Brief Announcement: Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous Rings.
Proceedings of the 39th International Symposium on Distributed Computing, 2025

Content-Oblivious Leader Election in 2-Edge-Connected Networks.
Proceedings of the 39th International Symposium on Distributed Computing, 2025

Brief Announcement: The Complexity Landscape of Dynamic Distributed Subgraph Finding.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2025


  Loading...