Discrepancy of hypergraphs (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Discrepancy of hypergraphs" in English language version.

refsWebsite

Global rank English rank

2^nd place

2^nd place

207^th place

136^th place

low place

6,473^rd place

5^th place

5^th place

doi.org (Global: 2^nd place; English: 2^nd place)

Banaszczyk, W. (1998), "Balancing vectors and Gaussian measure of n-dimensional convex bodies", Random Structures & Algorithms, 12: 351–360, doi:10.1002/(SICI)1098-2418(199807)12:4<351::AID-RSA3>3.0.CO;2-S.
Bansal, Nikhil; Dadush, Daniel; Garg, Shashwat (January 2019). "An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound". SIAM Journal on Computing. 48 (2): 534–553. doi:10.1137/17M1126795. ISSN 0097-5397.

psu.edu (Global: 207^th place; English: 136^th place)

citeseerx.ist.psu.edu

P. Erdős and J. Spencer: "Imbalances in k-colorations", pages 379–385. Networks 1, 1972.

siam.org (Global: low place; English: 6,473^rd place)

epubs.siam.org

Bansal, Nikhil; Dadush, Daniel; Garg, Shashwat (January 2019). "An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound". SIAM Journal on Computing. 48 (2): 534–553. doi:10.1137/17M1126795. ISSN 0097-5397.

worldcat.org (Global: 5^th place; English: 5^th place)

search.worldcat.org

Bansal, Nikhil; Dadush, Daniel; Garg, Shashwat (January 2019). "An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound". SIAM Journal on Computing. 48 (2): 534–553. doi:10.1137/17M1126795. ISSN 0097-5397.