Author of the publication

Quantum and randomized lower bounds for local search on vertex-transitive graphs.

, and . Quantum Inf. Comput., 10 (7&8): 636-652 (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Ofelimos: Combinatorial Optimization via Proof-of-Useful-Work - A Provably Secure Blockchain Protocol., , , and . CRYPTO (2), volume 13508 of Lecture Notes in Computer Science, page 339-369. Springer, (2022)Efficient Steganography with Provable Security Guarantees., , and . Information Hiding, volume 3727 of Lecture Notes in Computer Science, page 118-130. Springer, (2005)McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks., , and . CRYPTO, volume 6841 of Lecture Notes in Computer Science, page 761-779. Springer, (2011)Normal subgroup reconstruction and quantum computation using group representations., , and . STOC, page 627-635. ACM, (2000)Handling Correlated Errors: Hardness of LWE in the Exponent., , and . IACR Cryptol. ePrint Arch., (2018)The Combinatorics of the Longest-Chain Rule: Linear Consistency for Proof-of-Stake Blockchains., , , , and . SODA, page 1135-1154. SIAM, (2020)Failure sensitive analysis for parallel algorithm with controlled memory access concurrency., , and . OPODIS, volume 3 of Studia Informatica Universalis, page 125-136. Suger, Saint-Denis, rue Catulienne, France, (2002)The Generals' Scuttlebutt: Byzantine-Resilient Gossip Protocols., , , and . CCS, page 595-608. ACM, (2022)The Symmetric Group Defies Strong Fourier Sampling., , and . FOCS, page 479-490. IEEE Computer Society, (2005)Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol., , , and . CRYPTO (1), volume 10401 of Lecture Notes in Computer Science, page 357-388. Springer, (2017)