Asaf Petruschka

Orcid: 0009-0003-2325-2454

According to our database1, Asaf Petruschka authored at least 13 papers between 2022 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
Connectivity Labeling in Faulty Colored Graphs.
Distributed Comput., June, 2026

New Oracles and Labeling Schemes for Vertex Cut Queries.
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025
Preserving Distances in Faulty Colored Graphs.
CoRR, April, 2025

Parks and Recreation: Color Fault-Tolerant Spanners Made Local.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Near-Optimal Vertex Fault-Tolerant Labels for Steiner Connectivity.
Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

2024
Fault-Equivalent Lowest Common Ancestors.
CoRR, 2024

Connectivity Labeling in Faulty Colored Graphs.
Proceedings of the 38th International Symposium on Distributed Computing, 2024

Connectivity Labeling and Routing with Multiple Vertex Failures.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Color Fault-Tolerant Spanners.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023
Connectivity Labeling for Multiple Vertex Failures.
CoRR, 2023

2022
Õptimal Dual Vertex Failure Connectivity Labels.
Proceedings of the 36th International Symposium on Distributed Computing, 2022

Near-Optimal Distributed Computation of Small Vertex Cuts.
Proceedings of the 36th International Symposium on Distributed Computing, 2022

Lazy Regular Sensing.
Proceedings of the Descriptional Complexity of Formal Systems, 2022


  Loading...