Skip to main content

Publications

2001

ELEMENTE DER MATHEMATIK, 56, pp. 62-70.

Disjoint empty convex polygons in planar point sets

Authors
Gulyás, A.
Szabó, L.
Read more
2000

JOURNAL OF STATISTICAL PLANNING AND INFERENCE, 83 (1)., pp. 91-100.

Lower bounds on the rate of convergence of nonparametric regression estimates

Authors
Antos, András
Györfi, László
Kohler, M.
Read more
2001

EUROPEAN JOURNAL OF COMBINATORICS, 22, pp. 85-90.

Finite contractions of graphs with polynomial growth

Authors
Lukács, András
Seifter, N.
Read more
2000

In: ISSAC 2000. International symposium on symbolic and algebraic computation. St. Andrews, 2000..

Fast randomized algorithms for the structure of matrix algebras over finite fields

Authors
Ivanyos, Gábor
Read more
2001

In: ISIT 2001. IEEE international symposium on information theory. Proceedings. Washington. 2001..

Estimating the entropy of discrete distributions

Authors
Antos, András
Kontoyiannis, I.
Read more
2000

Basel, Birkhauser, pp. 3-15.

Rawa trees

Authors
Antos, András
Devroye, L.
Editors
Gardy, D
Mokkadem, A
Read more
2001

STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA, 37 (3-4)., pp. 343-354.

Relative Newton numbers of regular polygons with equal side lengths

Authors
Kemnitz, A.
Szabó, L.
Read more
2000

JOURNAL OF COMBINATORIAL THEORY SERIES A, 89 (1)., pp. 1-20.

A combinatorial problem on polynomials and rational functions

Authors
Elekes, GY
Rónyai, Lajos
Read more
2000

COMBINATORICA, 20 (4)., pp. 569-573.

On a conjecture of Kemnitz

Authors
Rónyai, Lajos
Read more
2001

In: 13th annual symposium on parallal algorithms and architectures. SPAA 2001. Crete Island, Proceedings..

Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem

Authors
Ivanyos, Gábor
Magniez, F.
Sántha, M.
Read more