Gergely Harcos

Orcid: 0000-0003-0642-4982

According to our database¹, Gergely Harcos authored at least 5 papers between 1999 and 2025.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of one.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2025

A tight lower bound on non-adaptive group testing estimation.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2025

2023

A Tight Lower Bound of Ω(log n) for the Estimation of the Number of Defective Items.

[BibT_eX]

[DOI]

Nader H. Bshouty

Gergely Harcos

Electron. Colloquium Comput. Complex., 2023

2020

New Bounds on Even Cycle Creating Hamiltonian Paths Using Expander Graphs.

[BibT_eX]

[DOI]

Gergely Harcos

Daniel Soltész

Comb., 2020

2002

Covering lattice points by subspaces.

[BibT_eX]

[DOI]

Period. Math. Hung., 2002

1999

Popular distances in 3-space.

[BibT_eX]

[DOI]

Paul Erdös

Gergely Harcos

János Pach

Discret. Math., 1999

Gergely Harcos

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...