Computational thinking for life scientists von Chor, Benny 1956-2021, Rubinstein, Amir 1977-

Volltext öffnen

Unbiased bits from sources of weak randomness and probabilistic communication complexity von Chor, Benny, Goldreich, Oded 1957-

RSA Rabin least significant bits are 1 2 + 1 poly log N secure von Chor, Benny, Goldreich, Oded 1957-

Computational thinking for life scientists von Chor, Benny 1956-2021, Rubinstein, Amir 1977-

The random oracle hypothesis is false von Chor, Benny 1956-2021, Goldreich, Oded 1957-, Håstad, Torkel Johan 1960-

A simple and efficient randomized Byzantine agreement algorithm von Chor, Benny, Coan, Brian A.

On the structure of the privacy hierarchy von Chor, Benny, Geréb-Graus, Mihaly, Qûšileviṣ, Eyāl