Julian Werthmann

Orcid: 0000-0002-5110-5625

According to our database1, Julian Werthmann authored at least 12 papers between 2021 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
Supervised Distributed Computing: Efficiency and Robustness under a Majority of Adversarial Workers.
CoRR, May, 2026

Logarithmic-Time Geodesically Convex Decomposition in Programmable Matter.
CoRR, April, 2026

Fast Distributed Computation of Compact Routing Schemes.
Proceedings of the Structural Information and Communication Complexity, 2026

2025
Simulations between Strongly Sublinear MPC and Node-Capacitated Clique.
CoRR, December, 2025

Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs.
Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

Supervised Distributed Computing.
Proceedings of the Euro-Par 2025: Parallel Processing, 2025

2023
Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs.
CoRR, 2023

Routing Schemes for Hybrid Communication Networks.
Proceedings of the Structural Information and Communication Complexity, 2023

Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs.
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

2022
Routing Schemes for Hybrid Communication Networks in Unit-Disk Graphs.
CoRR, 2022

2021
Time-Optimal Construction of Overlay Networks.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Beep-And-Sleep: Message and Energy Efficient Set Cover.
Proceedings of the Algorithms for Sensor Systems, 2021


  Loading...