Mihály Geréb-Graus

The complexity of parallel comparison merging

Danny Krizanc, Mihály Geréb-Graus, 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

On the Influence of Single Participant in Coin Flipping Schemes

Benny Chor, Mihály Geréb-Graus, 1988, SIAM J. Discret. Math..

Private computations over the integers

Eyal Kushilevitz, Benny Chor, Mihály Geréb-Graus, 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

Efficient optical communication in parallel computers

Thanasis Tsantilas, Mihály Geréb-Graus, 1992, SPAA '92.

Private Computations Over the Integers (extended abstract )

Eyal Kushilevitz, Benny Chor, Mihály Geréb-Graus, 1990, FOCS 1990.

An external theorem on divisors of a number

Mihály Geréb-Graus, 1983, Discret. Math..

There are no p-Complete Families of Symmetric Boolean Functions

Endre Szemerédi, Ramamohan Paturi, Mihály Geréb-Graus, 1989, Inf. Process. Lett..

On the structure of the privacy hierarchy

Eyal Kushilevitz, Benny Chor, Mihály Geréb-Graus, 2004, Journal of Cryptology.

Three One-Way Heads Cannot Do String Matching

Ming Li, Mihály Geréb-Graus, Ming Li, 1994, J. Comput. Syst. Sci..

Private Computations over the Integers

Eyal Kushilevitz, Benny Chor, Mihály Geréb-Graus, 1995, SIAM J. Comput..

The Average Complexity of Parallel Comparison Merging

Danny Krizanc, Mihály Geréb-Graus, 1992, SIAM J. Comput..