Lajos Rónyai

Polynomial time solutions to some problems in computational
algebra; in:
*Proc. of the 17th Annual ACM Symposium on the Theory of
Computing, Providence (1985), 153-162.* (with K. Friedl)

Norm-graphs and bipartite Turán numbers;
*Combinatorica 16, (1996) 399-406.* (with J.
Kollár, T. Szabó)

Norm-graphs: variations and applications;
*Journal of Combinatorial Theory, Ser. B. 76,
(1999) 280-290.* (with N. Alon and T. Szabó)

A combinatorial problem on polynomials
and rational functions;
*Journal of Combinatorial Theory, Ser. A. 89,
(2000) 1-20.* (with Gy. Elekes)

On the number of zero-patterns of a sequence of polynomials;
*Journal of the AMS 14, (2001), 717-735.* (with L. Babai and M.
Ganapathy)

Algorithms (in Hungarian); TypoTeX Kiadó, 1998, 1-349.
(with G. Ivanyos and R. Szabó)

Seven mutually touching infinite cylinders;
* Computational Geometry: Theory and Applications, 48(2015), 87-93. * (with S Bozoki, T-L. Lee)

May 5, 2015