( en | de | ru )

 

Disambiguation of "Pass, Rafael"

Author of the publication

copydeleteadd this publication to your clipboard
The truth behind the myth of the Folk theorem.

, , and . Games Econ. Behav., (2019)

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.

Rafael Pass

Albert Pass

Albert Pass

Bruno Pass

Georg Pass

 

Other publications of authors with the same name

Sequential Equilibrium in Games of Imperfect Recall., and . ACM Trans. Economics and Comput., 9 (4): 22:1-22:26 (2021)Decision Theory with Resource-Bounded Agents., , and . Top. Cogn. Sci., 6 (2): 245-257 (2014)Parallelizable Delegation from LWE., , and . TCC (2), volume 13748 of Lecture Notes in Computer Science, page 623-652. Springer, (2022)Characterizing Derandomization Through Hardness of Levin-Kolmogorov Complexity., and . CCC, volume 234 of LIPIcs, page 35:1-35:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)A Direct PRF Construction from Kolmogorov Complexity., and . Electron. Colloquium Comput. Complex., (2024)Unprovability of Leakage-Resilient Cryptography Beyond the Information-Theoretic Limit.. IACR Cryptol. ePrint Arch., (2021)Paradoxes in Fair Computer-Aided Decision Making., and . AIES, page 85-90. ACM, (2019)Cryptography from sublinear-time average-case hardness of time-bounded Kolmogorov complexity., and . STOC, page 722-735. ACM, (2021)Non-malleable Codes for Bounded Parallel-Time Tampering., , and . CRYPTO (3), volume 12827 of Lecture Notes in Computer Science, page 535-565. Springer, (2021)On One-Way Functions, the Worst-Case Hardness of Time-Bounded Kolmogorov Complexity, and Computational Depth., and . TCC (1), volume 15364 of Lecture Notes in Computer Science, page 222-252. Springer, (2024)