Yotam Kenneth-Mordoch

According to our database, Yotam Kenneth-Mordoch authored at least 6 papers between 2025 and 2026.

Collaborative distances:

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

2026

Faster Pseudo-Deterministic Minimum Cut.

Yotam Kenneth-Mordoch

CoRR, February, 2026

Faster All-Pairs Minimum Cut: Bypassing Exact Max-Flow.

Yotam Kenneth-Mordoch, Robert Krauthgamer

Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

Simple Algorithms for Fully Dynamic Edge Connectivity.

Yotam Kenneth-Mordoch, Robert Krauthgamer

Proceedings of the 2026 Symposium on Simplicity in Algorithms, 2026

All-Pairs Minimum Cut using Õ(n^7/4) Cut Queries.

Yotam Kenneth-Mordoch, Robert Krauthgamer

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025

On the Adversarial Robustness of Online Importance Sampling.

Yotam Kenneth-Mordoch, Shay Sapir

CoRR, July, 2025

Cut-Query Algorithms with Few Rounds.

Yotam Kenneth-Mordoch, Robert Krauthgamer

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025