132 citations
- University of MichiganUS3 papers
- University of Southern MississippiUS3 papers
- National Institute of Standards and TechnologyUS2 papers
- Brookhaven National LaboratoryUS1 paper
- Centre Inria de l'université de BordeauxFR1 paper
- Centre Inria de l'Université de LorraineFR1 paper
- Dartmouth CollegeUS1 paper
- Howard UniversityUS1 paper
- Hungarian Academy of SciencesHU1 paper
- HUN-REN Alfréd Rényi Institute of MathematicsHU1 paper
- Institut national de recherche en sciences et technologies du numériqueFR1 paper
- IT University of CopenhagenDK1 paper
Showing 2013Show all
2 papers · 1 filter
math.CO2013★ 2 cited
Coverings by few monochromatic pieces - a transition between two Ramsey problems
András Gyárfás, Gábor N. Sárközy, Stanley Selkow
The typical problem in (generalized) Ramsey theory is to find the order of the largest monochromatic member of a family F (for example matchings, paths, cycles, connected subgraphs…
cs.IT2013★ 4 cited
Quickest Search Over Multiple Sequences with Mixed Observations
Jun Geng, Weiyu Xu, Lifeng Lai
The problem of sequentially finding an independent and identically distributed (i.i.d.) sequence that is drawn from a probability distribution by searching over multiple sequ…