7.5k citations
- X. He2 profiles46 · h 52
- M. Csanád2 profiles36 · h 76
- T. Csörgő2 profiles33 · h 42
- B. Cole2 profiles29 · h 52
- R. Lacey4 profiles29 · h 65
- S. Sato8 profiles29 · h 51
- V. Pantuev2 profiles29 · h 54
- A. Malakhov8 profiles28 · h 115
- A. Ster5 profiles28 · h 42
- D. d’Enterria2 profiles28 · h 127
- J. Alexander5 profiles28 · h 100
- M. Issah3 profiles28 · h 63
- Hungarian Academy of SciencesHU88 papers
- Institute for Particle and Nuclear PhysicsHU48 papers
- Columbia UniversityUS45 papers
- Centre National de la Recherche ScientifiqueFR39 papers
- Konkoly ObservatoryHU37 papers
- Stony Brook UniversityUS35 papers
- Brookhaven National LaboratoryUS33 papers
- Joint Institute for Nuclear ResearchRU31 papers
- CEA Paris-SaclayFR30 papers
- Charles UniversityCZ30 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR30 papers
- Iowa State UniversityUS30 papers
Showing 2009 · math.COShow all
2 papers · 2 filters
math.CO2009★ 1 cited
Borel oracles. An analytical approach to constant-time algorithms
Gabor Elek, Gabor Lippner
Nguyen and Onak constructed the first constant-time algorithm for the approximation of the size of the maximum matching in bounded degree graphs. The Borel oracle machinery is a to…
math.CO2009★ 2 cited
Limits of randomly grown graph sequences
C. Borgs, J. Chayes, L. Lovász +2
Motivated in part by various sequences of graphs growing under random rules (like internet models), convergent sequences of dense graphs and their limits were introduced by Borgs,…