Mihály Geréb-Graus

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1995
Private Computations over the Integers.
SIAM J. Comput., 1995

1994
On the Structure of the Privacy Hierarchy.
J. Cryptol., 1994

Three One-Way Heads Cannot Do String Matching.
J. Comput. Syst. Sci., 1994

1992
The Average Complexity of Parallel Comparison Merging.
SIAM J. Comput., 1992

Efficient Optical Communication in Parallel Computers.
Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992

1990
Private Computations Over the Integers (Extended Abstract)
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989
There are no p-Complete Families of Symmetric Boolean Functions.
Inf. Process. Lett., 1989

1988
On the Influence of Single Participant in Coin Flipping Schemes.
SIAM J. Discret. Math., 1988

1987
The Complexity of Parallel Comparison Merging
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1983
An external theorem on divisors of a number.
Discret. Math., 1983


  Loading...