Personensuche
X
?
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) ,
1
Polynomial-Time Pseudodeterministic Construction of Primes:
, In:
?
Proceedings of the 55th Annual ACM Symposium on Theory of Computing ,
2
Range Avoidance, Remote Point, and Hard Partial Truth Table..:
, In:
?
Proceedings of the 55th Annual ACM Symposium on Theory of Computing ,
3
NP-Hardness of Approximating Meta-Complexity: A Cryptograph..:
, In:
?
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing ,
7
Robustness of average-case meta-complexity via pseudorandom..:
, In:
?
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) ,
10
On the Range Avoidance Problem for Circuits:
, In:
?
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing ,
11
Maintaining exact distances under multiple edge failures:
, In:
?
Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms ,
12
Approximate distance oracles subject to multiple vertex fai..:
, In:
?
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) ,
14
Approximate Distance Oracles Subject to Multiple Vertex Fai..:
, In:
?
Proceedings of the 36th Computational Complexity Conference ,
15