Mihály Geréb-Graus

According to our database, Mihály Geréb-Graus authored at least 10 papers between 1983 and 1995.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

1995

Private Computations over the Integers.

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

SIAM J. Comput., 1995

1994

On the Structure of the Privacy Hierarchy.

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

J. Cryptol., 1994

Three One-Way Heads Cannot Do String Matching.

Mihály Geréb-Graus, Ming Li

J. Comput. Syst. Sci., 1994

1992

The Average Complexity of Parallel Comparison Merging.

Mihály Geréb-Graus, Danny Krizanc

SIAM J. Comput., 1992

Efficient Optical Communication in Parallel Computers.

Mihály Geréb-Graus, Thanasis Tsantilas

Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992

1990

Private Computations Over the Integers (Extended Abstract)

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

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989

There are no p-Complete Families of Symmetric Boolean Functions.

Mihály Geréb-Graus, Ramamohan Paturi, Endre Szemerédi

Inf. Process. Lett., 1989

1988

On the Influence of Single Participant in Coin Flipping Schemes.

Benny Chor, Mihály Geréb-Graus

SIAM J. Discret. Math., 1988

1987

The Complexity of Parallel Comparison Merging

Mihály Geréb-Graus, Danny Krizanc

Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1983

An external theorem on divisors of a number.

Mihály Geréb-Graus

Discret. Math., 1983