Mihály Geréb-Graus

Publication Activity (10 Years)

Years Active: 1983-1995
Publications (10 Years): 0

Publications

Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz
Private Computations over the Integers. SIAM J. Comput. 24 (2) (1995)
Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz
On the Structure of the Privacy Hierarchy. J. Cryptol. 7 (1) (1994)
Mihály Geréb-Graus, Ming Li
Three One-Way Heads Cannot Do String Matching. J. Comput. Syst. Sci. 48 (1) (1994)
Mihály Geréb-Graus, Danny Krizanc
The Average Complexity of Parallel Comparison Merging. SIAM J. Comput. 21 (1) (1992)
Mihály Geréb-Graus, Thanasis Tsantilas
Efficient Optical Communication in Parallel Computers. SPAA (1992)
Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz
Private Computations Over the Integers (Extended Abstract) FOCS (1990)
Mihály Geréb-Graus, Ramamohan Paturi, Endre Szemerédi
There are no p-Complete Families of Symmetric Boolean Functions. Inf. Process. Lett. 30 (1) (1989)
Benny Chor, Mihály Geréb-Graus
On the Influence of Single Participant in Coin Flipping Schemes. SIAM J. Discret. Math. 1 (4) (1988)
Mihály Geréb-Graus, Danny Krizanc
The Complexity of Parallel Comparison Merging FOCS (1987)
Mihály Geréb-Graus
An external theorem on divisors of a number. Discret. Math. 46 (3) (1983)