Mihály Geréb-Graus

Follow

Generating author description...

All published works

Action	Title	Year	Authors
+	The Average Complexity of Parallel Comparison Merging	1992	Mihály Geréb-Graus Danny Kriz̧anc
+	On the influence of single participant in coin flipping schemes * (extended abstract)	1990	Benny Chor Mihály Geréb-Graus
+	There are no p-complete families of symmetric boolean functions	1989	Mihály Geréb-Graus Ramamohan Paturi Endre Szemerédi
+	On the Influence of Single Participant in Coin Flipping Schemes	1988	Benny Chor Mihály Geréb-Graus
+	The complexity of parallel comparison merging	1987	Mihály Geréb-Graus Danny Kriz̧anc
+	An external theorem on divisors of a number	1983	Mihály Geréb-Graus

Common Coauthors

Coauthor	Papers Together
Danny Kriz̧anc	2
Benny Chor	2
Endre Szemerédi	1
Ramamohan Paturi	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms	1988	Noga Alon Yossi Azar	2
+	An extremal problem on the set of noncoprime divisors of a number	1970	P. Erdős Marcel Herzog J. Schönheim	1
+ PDF Chat	INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS	1961	Péter L. Erdős Chao Ko R. Rado	1
+	Sperner systems consisting of pairs of complementary subsets	1973	Béla Bollobás	1
+	Extremal theorems on divisors of a number	1978	Shuo Li	1
+	The average complexity of deterministic and randomized parallel comparison sorting algorithms	1987	Noga Alon Yossi Azar	1
+	The tail of the hypergeometric distribution	1979	Vašek Chvátal	1
+	Completeness classes in algebra	1979	Leslie G. Valiant	1
+ PDF Chat	Extensions of the Erdös‐Ko‐Rado Theorem	1976	Casey S. Greene Gyula O. H. Katona Daniel J. Kleitman	1
+ PDF Chat	Sorting and Selecting in Rounds	1987	Nicholas Pippenger	1
+	An Introduction to Probability Theory and its Applications	1967	Frank E. Grubbs	1