| 1995 |
|---|
| 10 | | Benny Chor,
Mihály Geréb-Graus,
Eyal Kushilevitz:
Private Computations over the Integers.
SIAM J. Comput. 24(2): 376-386 (1995) |
| 1994 |
|---|
| 9 | | Mihály Geréb-Graus,
Ming Li:
Three One-Way Heads Cannot Do String Matching.
J. Comput. Syst. Sci. 48(1): 1-8 (1994) |
| 8 | | Benny Chor,
Mihály Geréb-Graus,
Eyal Kushilevitz:
On the Structure of the Privacy Hierarchy.
J. Cryptology 7(1): 53-60 (1994) |
| 1992 |
|---|
| 7 | EE | Mihály Geréb-Graus,
Thanasis Tsantilas:
Efficient Optical Communication in Parallel Computers.
SPAA 1992: 41-48 |
| 6 | | Mihály Geréb-Graus,
Danny Krizanc:
The Average Complexity of Parallel Comparison Merging.
SIAM J. Comput. 21(1): 43-47 (1992) |
| 1990 |
|---|
| 5 | | Benny Chor,
Mihály Geréb-Graus,
Eyal Kushilevitz:
Private Computations Over the Integers (Extended Abstract)
FOCS 1990: 335-344 |
| 1989 |
|---|
| 4 | | 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): 47-49 (1989) |
| 1988 |
|---|
| 3 | | Benny Chor,
Mihály Geréb-Graus:
On the Influence of Single Participant in Coin Flipping Schemes.
SIAM J. Discrete Math. 1(4): 411-415 (1988) |
| 1987 |
|---|
| 2 | | Mihály Geréb-Graus,
Danny Krizanc:
The Complexity of Parallel Comparison Merging
FOCS 1987: 195-201 |
| 1983 |
|---|
| 1 | EE | Mihály Geréb-Graus:
An external theorem on divisors of a number.
Discrete Mathematics 46(3): 241-248 (1983) |
