Zvi Galil

Generating author description...

All published works

Action	Title	Year	Authors
+	A Generalization of a Lower Bound Technique due to Fredman and Saks	2001	Amir M. Ben-Amram Zvi Galil
+	Lower bounds on algebraic random access machines	1995	Amir M. Ben-Amram Zvi Galil
+	Witnesses for Boolean Matrix Multiplication and for Transitive Closure	1993	Zvi Galil Olded Margalit
+	An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem	1991	Zvi Galil Oded Margalit
+	Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. Part II: The algebra G[u]/〈un〉	1991	Amir Averbuch Zvi Galil S. Winograd
+	An almost linear-time algorithm for the dense subset-sum problem	1991	Zvi Galil Oded Margalit
+	Solving dense subset-sum problems by using analytical number theory	1989	Mark Chaimovich Gregory A. Freiman Zvi Galil
+	Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial, part I: The algebra G[u]<Q(u)l>, l>1	1988	Amir Averbuch Zvi Galil S. Winograd
+	Better expanders and superconcentrators	1987	Noga Alon Zvi Galil Vitali Milman
+ PDF Chat	An <i>O</i> ( <i>n</i> <sup>3</sup> log <i>n</i> ) deterministic and an <i>O</i> ( <i>n</i> <sup>3</sup> ) Las Vegs isomorphism test for trivalent graphs	1987	Zvi Galil Christoph M. Hoffmann Eugene M. Luks C. P. Schnorr Andreas Weber⋆
+	Extrapolation Designs and Φ p -Optimum Designs for Cubic Regression on the q-Ball	1985	Zvi Galil J. Kiefer
+	Comparison of Rotatable Designs for Regression on Balls, I (Quadratic)	1985	Zvi Galil J. Kiefer
+	Comparison of designs equivalent under one or two criteria	1983	Zvi Galil J. Kiefer
+	An O(n3 log n) deterministic and an O (n 3) probabilistic isomorphism test for trivalent graphs	1982	Zvi Galil Christof M. Hoffmann Eugene M. Luks C. P. Schnorr Andreas Weber⋆
+	Time- and Space-Saving Computer Methods, Related to Mitchell's DETMAX, for Finding D-Optimum Designs	1980	Zvi Galil J. Kiefer
+	Explicit constructions of linear size superconcentrators	1979	Ofer Gabber Zvi Galil
+	Comparison of Simplex Designs for Quadratic Mixture Models	1977	Zvi Galil J. Kiefer
+	Monotone switching circuits and boolean matrix product	1976	Kurt Mehlhorn Zvi Galil

Common Coauthors

Coauthor	Papers Together
J. Kiefer	5
Amir M. Ben-Amram	2
Eugene M. Luks	2
Oded Margalit	2
S. Winograd	2
C. P. Schnorr	2
Amir Averbuch	2
Andreas Weber⋆	2
Kurt Mehlhorn	1
Vitali Milman	1
Ofer Gabber	1
Christof M. Hoffmann	1
Mark Chaimovich	1
Gregory A. Freiman	1
Noga Alon	1
Christoph M. Hoffmann	1
Olded Margalit	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Finite addition theorems, I	1989	Andràs Sárközy	3
+	On two additive problems	1990	P. Erdős Gregory A. Freiman	3
+ PDF Chat	On sums of subsets of a set of integers	1988	N. Alon Gregory A. Freiman	3
+ PDF Chat	The Equivalence of Two Extremum Problems	1960	J. Kiefer J. Wolfowitz	3
+ PDF Chat	On representation of r-th powers by subset sums	1989	E. Lipkin	3
+	On systems of bilinear forms whose minimal division-free algorithms are all bilinear	1981	Ephraim Feig	2
+	Discrete-Variable Extremum Problems	1957	George B. Dantzig	2
+ PDF Chat	Polynomial-time algorithms for permutation groups	1980	Merrick L. Furst John E. Hopcroft Eugene M. Luks	2
+	On multiplication in algebraic extension fields	1979	S. Winograd	2
+	Solving dense subset-sum problems by using analytical number theory	1989	Mark Chaimovich Gregory A. Freiman Zvi Galil	2
+	Certain systems of bilinear forms whose minimal algorithms are all quadratic	1983	Ephraim Feig	2
+	On varieties of optimal algorithms for the computation of bilinear mappings III. Optimal algorithms for the computation of xy and yx where x, yϵM2(K)	1978	Hans F. de Groote	2
+	On varieties of optimal algorithms for the computation of bilinear mappings I. the isotropy group of a bilinear mapping	1978	Hans F. de Groote	2
+	Some bilinear forms whose multiplicative complexity depends on the field of constants	1976	S. Winograd	2
+ PDF Chat	Quasi-Newton methods and their application to function minimisation	1967	C. G. Broyden	1
+	Subset-sum problems with different summands: computation	1990	Mark Chaimovich	1
+	Isomorphism of graphs of bounded valence can be tested in polynomial time	1980	Eugene M. Luks	1
+	Expanders obtained from affine transformations	1985	Shuji Jimbo Akira Maruoka	1
+	A note on a construction of Margulis	1979	Dana Angluin	1
+	Expanders and Diffusers	1986	Marshall W. Buck	1
+	Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial, part I: The algebra G[u]<Q(u)l>, l>1	1988	Amir Averbuch Zvi Galil S. Winograd	1
+	A note on time-space tradeoffs for computing continuous functions	1979	Harold Abelson	1
+	Fine Addition Theorems, II	1994	Andràs Sárközy	1
+	Asymptotically invariant sequences and an action of SL (2,Z) on the 2-sphere	1980	Klaus Schmidt	1
+	ON FOUNDATIONS OF CONVEX ANALYSIS	1980	A. D. Ioffe	1
+ PDF Chat	On the Theory of Connected Designs: Characterization and Optimality	1974	J. A. Eccleston A. Hedayat	1
+	On genuinely time bounded computations	2005	Friedhelm Meyer auf der Heide	1
+	A family of cubical graphs	1947	W. T. Tutte	1
+ PDF Chat	A lower bound for integer greatest common divisor computations	1991	Yishay Mansour Baruch Schieber Prasoon Tiwari	1
+ PDF Chat	Optimum Designs in Regression Problems, II	1961	J. Kiefer	1
+ PDF Chat	Inequalities - Theory of Majorization and Its Applications	1979		1
+	From expanders to better superconcentrators without cascading	1984	Eli Shamir	1
+ PDF Chat	Eigenvalues and expanders	1986	Ilan Alon	1
+	D-Optimal Fractions of Three-Level Factorial Designs	1978	Toby J. Mitchell C.K. Bayne	1
+	Isomorphism of graphs of bounded valence can be tested in polynomial time	1982	Eugene M. Luks	1
+	On varieties of optimal algorithms for the computation of bilinear mappings II. optimal algorithms for 2 × 2-matrix multiplication	1978	Hans F. de Groote	1
+	Explicit expanders and the Ramanujan conjectures	1986	Alexander Lubotzky Ralph S. Phillips Peter Sarnak	1
+	λ1, Isoperimetric inequalities for graphs, and superconcentrators	1985	Noga Alon Vitali Milman	1
+	Confidence Bands for the Weibull Distribution	1975	R. Srinivasan Robert M. Wharton	1
+ PDF Chat	Inequalities: Theory of Majorization and its Applications.	1981	Barry C. Arnold Albert W. Marshall Ingram Olkin	1
+ PDF Chat	Optimal Spacing and Weighting in Polynomial Prediction	1964	Paul G. Hoel A. Levine	1
+	AN EFFECTIVE FORMULA FOR THE NUMBER OF SOLUTIONS OF A SYSTEM OF 0, 1 LINEAR EQUATIONS	1983	P. L. Buzytsky Gregory A. Freiman	1
+	Graph isomorphism, general remarks	1979	Gary L. Miller	1
+	Saturated Fractions of 2<sup><i>n</i></sup>and 3<sup><i>n</i></sup>Factorial Designs	1967	R. L. Rechtschaffner	1