An external theorem on divisors of a number. - Mihály Geréb-Graus (Discret. Math., 1983)

The Complexity of Parallel Comparison Merging - Mihály Geréb-Graus; Danny Krizanc (FOCS, 1987)

On the Influence of Single Participant in Coin Flipping Schemes. - Benny Chor; Mihály Geréb-Graus (SIAM J. Discret. Math., 1988)

There are no p-Complete Families of Symmetric Boolean Functions. - Mihály Geréb-Graus; Ramamohan Paturi; Endre Szemerédi (Inf. Process. Lett., 1989)

Private Computations Over the Integers (Extended Abstract) - Benny Chor; Mihály Geréb-Graus; Eyal Kushilevitz (FOCS, 1990)

Efficient Optical Communication in Parallel Computers. - Mihály Geréb-Graus; Thanasis Tsantilas (SPAA, 1992)

The Average Complexity of Parallel Comparison Merging. - Mihály Geréb-Graus; Danny Krizanc (SIAM J. Comput., 1992)

Three One-Way Heads Cannot Do String Matching. - Mihály Geréb-Graus; Ming Li 001 (J. Comput. Syst. Sci., 1994)

On the Structure of the Privacy Hierarchy. - Benny Chor; Mihály Geréb-Graus; Eyal Kushilevitz (J. Cryptol., 1994)

Private Computations over the Integers. - Benny Chor; Mihály Geréb-Graus; Eyal Kushilevitz (SIAM J. Comput., 1995)