Duri Janett

Orcid: 0000-0002-7279-807X

According to our database1, Duri Janett authored at least 4 papers between 2022 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Average-Case Hardness of Binary-Encoded Clique in Proof and Communication Complexity.
CoRR, May, 2026

2025
Truly Supercritical Trade-Offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler-Leman.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

2023
Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions.
Proceedings of the Genetic and Evolutionary Computation Conference, 2023

2022
Two-Dimensional Drift Analysis: - Optimizing Two Functions Simultaneously Can Be Hard.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022


  Loading...