Angelos Pelecanos

Orcid: 0009-0005-6329-1786

According to our database1, Angelos Pelecanos authored at least 11 papers between 2023 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
The Debiased Keyl's Algorithm: A New Unbiased Estimator for Full State Tomography.
Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

Beating full state tomography for unentangled spectrum estimation.
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

When Simple Permutations Mix Poorly - Limited Independence does not Imply Pseudorandomness.
Proceedings of the Advances in Cryptology - EUROCRYPT 2026, 2026

2025
On the Computational Hardness of Quantum One-Wayness.
Quantum, 2025

More Efficient Approximate <i>k</i>-wise Independent Permutations from Random Reversible Circuits via log-Sobolev Inequalities.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024
How Fast Does the Inverse Walk Approximate a Random Permutation?
IACR Cryptol. ePrint Arch., 2024

More Efficient Approximate k-wise Independent Permutations from Random Reversible Circuits via log-Sobolev Inequalities.
IACR Cryptol. ePrint Arch., 2024

More Efficient <i>k</i>-wise Independent Permutations from Random Reversible Circuits via log-Sobolev Inequalities.
CoRR, 2024

Classical vs Quantum Advice and Proofs Under Classically-Accessible Oracle.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023
Classical vs Quantum Advice under Classically-Accessible Oracle.
CoRR, 2023

Layout Graphs, Random Walks and the t-Wise Independence of SPN Block Ciphers.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023


  Loading...