Random Necklaces Require Fewer Cuts-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Random Necklaces Require Fewer Cuts

Published:2024-04-26 Issue:2 Volume:38 Page:1381-1408
ISSN:0895-4801
Container-title:SIAM Journal on Discrete Mathematics
language:en
Short-container-title:SIAM J. Discrete Math.

Author:

Alon Noga¹,Elboim Dor¹^ORCID,Pach János²,Tardos Gábor²

Affiliation:

1. Department of Mathematics, Princeton University, Princeton, NJ 08544 USA, and Schools of Mathematics and Computer Science, Tel Aviv University, Tel Aviv, Israel.

2. Discrete Geometry, Rényi Institute, Budapest 1053, Hungary, and MIPT, Moscow, 141701 Russia.

Funder

National Science Foundation

United States - Israel Binational Science Foundation

European Research Council

Ministry of Education and Science of the Russian Federation

National Research, Development and Innovation Office

Austrian Science Fund

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Reference19 articles.

1. Splitting necklaces

2. LIPIcs. Leibniz Int. Proc. Inform. 198;Alon N.,2021

3. Wiley Ser. Discrete Math. Optim.;Alon N.,2016

4. Some heuristics for the binary paint shop problem and their expected number of colour changes

5. On the application of the Borel-Cantelli lemma

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP