Rafael Pass | DeepAI

AI Chat

Featured Co-authors

Joseph Y. Halpern
86 publications
Elaine Shi
18 publications
Ling Ren
14 publications
Kartik Nayak
14 publications
T-H. Hubert Chan
11 publications
Andrew Morgan
4 publications
Yanyi Liu
3 publications
Muthuramakrishnan Venkitasubramaniam
2 publications
Gilad Asharov
2 publications
Lior Seeman
1 publication

∙ 09/24/2020

On One-way Functions and Kolmogorov Complexity

We prove that the equivalence of two fundamental problems in the theory ...

0 Yanyi Liu, et al. ∙

∙ 08/04/2020

Bucket Oblivious Sort: An Extremely Simple Oblivious Sort

We propose a conceptually simple oblivious sort and oblivious random per...

0 Gilad Asharov, et al. ∙

∙ 07/22/2019

A Conceptually Well-Founded Characterization of Iterated Admissibility Using an "All I Know" Operator

Brandenburger, Friedenberg, and Keisler provide an epistemic characteriz...

1 Joseph Y. Halpern, et al. ∙

∙ 06/26/2019

A Round-Collapse Theorem for Computationally-Sound Protocols; or, TFNP is Hard (on Average) in Pessiland

Consider the following two fundamental open problems in complexity theor...

0 Rafael Pass, et al. ∙

∙ 05/09/2018

Communication-Efficient Byzantine Agreement without Erasures

Byzantine agreement (BA) is one of the most fundamental building blocks ...

0 T-H. Hubert Chan, et al. ∙

∙ 11/29/2017

Paradoxes in Fair Computer-Aided Decision Making

Computer-aided decision making, where some classifier (e.g., an algorith...

0 Andrew Morgan, et al. ∙

∙ 08/17/2013

Decision Theory with Resource-Bounded Agents

There have been two major lines of research aimed at capturing resource-...

0 Joseph Y. Halpern, et al. ∙

∙ 06/23/2009

A Logical Characterization of Iterated Admissibility

Brandenburger, Friedenberg, and Keisler provide an epistemic characteriz...

0 Joseph Y. Halpern, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world