György Elekes

According to our database, György Elekes authored at least 18 papers between 1984 and 2012.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2012

How to find groups? (and how to use them in Erdős geometry?).

György Elekes, Endre Szabó

Comb., 2012

2011

On lines, joints, and incidences in three dimensions.

György Elekes, Haim Kaplan, Micha Sharir

J. Comb. Theory, Ser. A, 2011

Incidences in Three Dimensions and Distinct Distances in the Plane.

György Elekes, Micha Sharir

Comb. Probab. Comput., 2011

2009

A note on a problem of Erdos on right angles.

György Elekes

Discret. Math., 2009

A Combinatorial Distinction Between Unit Circles and Straight Lines: How Many Coincidences Can they Have?

György Elekes, Miklós Simonovits, Endre Szabó

Comb. Probab. Comput., 2009

2006

The structure of sets with few sums along a graph.

György Elekes, Imre Z. Ruzsa

J. Comb. Theory, Ser. A, 2006

2005

Incidences of not-too-degenerate hyperplanes.

György Elekes, Csaba D. Tóth

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

2004

Structural Results For Planar Sets With Many Similar Subsets.

Bernardo M. Ábrego, György Elekes, Silvia Fernández-Merchant

Comb., 2004

2000

A Combinatorial Problem on Polynomials and Rational Functions.

György Elekes, Lajos Rónyai

J. Comb. Theory, Ser. A, 2000

1999

On Linear Combinatorics III. Few Directions and Distorted Lattices.

György Elekes

Comb., 1999

1998

A Combinatorial Problem on Polynomials.

György Elekes

Discret. Comput. Geom., 1998

On Linear Combinatorics II. Structure Theorems via Additive Number Theory.

György Elekes

Comb., 1998

1997

On Linear Combinatorics I. Concurrency - An Algebraic Approach.

György Elekes

Comb., 1997

On the structure of large homothetic subsets.

György Elekes

Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

1995

Circle Grids and Bipartite Graphs of Distances.

György Elekes

Comb., 1995

1994

Generalized Breadths, Circular Cantor Sets, and the Least Area UCC.

György Elekes

Discret. Comput. Geom., 1994

1986

A Geometric Inequality and the Complexity of Computing Volume.

György Elekes

Discret. Comput. Geom., 1986

1984

n points in the plane can determine n ^3/2 unit circles.

György Elekes

Comb., 1984