{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,25]],"date-time":"2026-09-25T20:08:34Z","timestamp":1790366914660,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T00:00:00Z","timestamp":1529452800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,6,20]]},"DOI":"10.1145\/3188745.3188850","type":"proceedings-article","created":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T16:15:46Z","timestamp":1529511346000},"page":"587-597","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["The Gram-Schmidt walk: a cure for the Banaszczyk blues"],"prefix":"10.1145","author":[{"given":"Nikhil","family":"Bansal","sequence":"first","affiliation":[{"name":"Eindhoven University of Technology, Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Dadush","sequence":"additional","affiliation":[{"name":"CWI, Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shashwat","family":"Garg","sequence":"additional","affiliation":[{"name":"Eindhoven University of Technology, Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shachar","family":"Lovett","sequence":"additional","affiliation":[{"name":"University of California at San Diego, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,6,20]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199807)12:4%3C351::AID-RSA3%3E3.0.CO;2-S"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.7"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20373"},{"key":"e_1_3_2_2_4_1","volume-title":"Springer","author":"B\u00e1r\u00e1ny Imre","year":"2008","unstructured":"{B\u00e1r08} Imre B\u00e1r\u00e1ny . On the power of linear dependencies. In Building bridges, pages 31\u201345 . Springer , 2008 . {B\u00e1r08} Imre B\u00e1r\u00e1ny. On the power of linear dependencies. In Building bridges, pages 31\u201345. Springer, 2008."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.5"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.89"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579452"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(81)90022-6"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055490"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-33461-5_31"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626371"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133160"},{"key":"e_1_3_2_2_13_1","volume-title":"A Panorama of Discrepancy Theory","author":"William Chen CST","year":"2014","unstructured":"{ CST + 14} William Chen , Anand Srivastav , Giancarlo Travaglini , A Panorama of Discrepancy Theory , volume 2107 . Springer , 2014 . {CST + 14} William Chen, Anand Srivastav, Giancarlo Travaglini, et al. A Panorama of Discrepancy Theory, volume 2107. Springer, 2014."},{"key":"e_1_3_2_2_14_1","volume-title":"APPROX\/RANDOM","volume":"60","author":"Dadush Daniel","year":"2016","unstructured":"{DGLN16} Daniel Dadush , Shashwat Garg , Shachar Lovett , and Aleksandar Nikolov . Towards a constructive version of banaszczyk\u2019s vector balancing theorem . In APPROX\/RANDOM , volume 60 , 2016 . {DGLN16} Daniel Dadush, Shashwat Garg, Shachar Lovett, and Aleksandar Nikolov. Towards a constructive version of banaszczyk\u2019s vector balancing theorem. In APPROX\/RANDOM, volume 60, 2016."},{"key":"e_1_3_2_2_15_1","volume-title":"Efficient algorithms for discrepancy minimization in convex sets. CoRR, abs\/1409.2913","author":"Eldan Ronen","year":"2014","unstructured":"{ES14} Ronen Eldan and Mohit Singh . Efficient algorithms for discrepancy minimization in convex sets. CoRR, abs\/1409.2913 , 2014 . {ES14} Ronen Eldan and Mohit Singh. Efficient algorithms for discrepancy minimization in convex sets. CoRR, abs\/1409.2913, 2014."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176996452"},{"issue":"1","key":"e_1_3_2_2_17_1","first-page":"85","article-title":"Extremal properties of orthogonal parallelepipeds and their applications to the geometry of banach spaces. Sbornik","volume":"64","author":"Gluskin Efim Davydovich","year":"1989","unstructured":"{Glu89} Efim Davydovich Gluskin . Extremal properties of orthogonal parallelepipeds and their applications to the geometry of banach spaces. Sbornik : Mathematics , 64 ( 1 ): 85 \u2013 96 , 1989 . {Glu89} Efim Davydovich Gluskin. Extremal properties of orthogonal parallelepipeds and their applications to the geometry of banach spaces. Sbornik: Mathematics, 64(1):85\u201396, 1989.","journal-title":"Mathematics"},{"key":"e_1_3_2_2_18_1","first-page":"273","volume-title":"APPROX\/RANDOM 2014","author":"Harvey Nicholas J. A.","year":"2014","unstructured":"{HSS14} Nicholas J. A. Harvey , Roy Schwartz , and Mohit Singh . Discrepancy without partial colorings . In APPROX\/RANDOM 2014 , pages 258\u2013 273 , 2014 . {HSS14} Nicholas J. A. Harvey, Roy Schwartz, and Mohit Singh. Discrepancy without partial colorings. In APPROX\/RANDOM 2014, pages 258\u2013273, 2014."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/120865240"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.23"},{"key":"e_1_3_2_2_21_1","first-page":"391","volume-title":"IPCO","author":"Levy Avi","year":"2017","unstructured":"{LRR17} Avi Levy , Harishchandra Ramadas , and Thomas Rothvoss . Deterministic discrepancy minimization via the multiplicative weight update method. In Integer Programming and Combinatorial Optimization , IPCO , pages 380\u2013 391 , 2017 . {LRR17} Avi Levy, Harishchandra Ramadas, and Thomas Rothvoss. Deterministic discrepancy minimization via the multiplicative weight update method. In Integer Programming and Combinatorial Optimization, IPCO, pages 380\u2013391, 2017."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/2018773"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(86)80041-5"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1006\/eujc.1997.0162"},{"key":"e_1_3_2_2_25_1","volume-title":"Geometric discrepancy: An illustrated guide","author":"Matousek Jiri","year":"2009","unstructured":"{Mat09} Jiri Matousek . Geometric discrepancy: An illustrated guide . Springer Science , 2009 . {Mat09} Jiri Matousek. Geometric discrepancy: An illustrated guide. Springer Science, 2009."},{"key":"e_1_3_2_2_26_1","volume-title":"Factorization norms and hereditary discrepancy. arXiv preprint arXiv:1408.1376","author":"Matousek Jiri","year":"2014","unstructured":"{MNT14} Jiri Matousek , Aleksandar Nikolov , and Kunal Talwar . Factorization norms and hereditary discrepancy. arXiv preprint arXiv:1408.1376 , 2014 . {MNT14} Jiri Matousek, Aleksandar Nikolov, and Kunal Talwar. Factorization norms and hereditary discrepancy. arXiv preprint arXiv:1408.1376, 2014."},{"key":"e_1_3_2_2_27_1","volume-title":"The koml\u00f3s conjecture holds for vector colorings. arXiv preprint arXiv:1301.4039","author":"Nikolov Aleksandar","year":"2013","unstructured":"{Nik13} Aleksandar Nikolov . The koml\u00f3s conjecture holds for vector colorings. arXiv preprint arXiv:1301.4039 , 2013 . {Nik13} Aleksandar Nikolov. The koml\u00f3s conjecture holds for vector colorings. arXiv preprint arXiv:1301.4039, 2013."},{"key":"e_1_3_2_2_29_1","volume-title":"Tighter bounds for the discrepancy of boxes and polytopes. arXiv preprint arXiv:1701.05532","author":"Nikolov Aleksandar","year":"2017","unstructured":"{Nik17} Aleksandar Nikolov . Tighter bounds for the discrepancy of boxes and polytopes. arXiv preprint arXiv:1701.05532 , 2017 . {Nik17} Aleksandar Nikolov. Tighter bounds for the discrepancy of boxes and polytopes. arXiv preprint arXiv:1701.05532, 2017."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488652"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.11"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.23"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.23"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1985-0784009-0"},{"key":"e_1_3_2_2_35_1","volume-title":"Ten lectures on the probabilistic method","author":"Spencer Joel H","year":"1987","unstructured":"{Spe87} Joel H Spencer . Ten lectures on the probabilistic method , volume 52 . Society for Industrial and Applied Mathematics Philadelphia , PA , 1987 . {Spe87} Joel H Spencer. Ten lectures on the probabilistic method, volume 52. Society for Industrial and Applied Mathematics Philadelphia, PA, 1987."},{"key":"e_1_3_2_2_36_1","volume-title":"Introduction to the non-asymptotic analysis of random matrices. arXiv preprint arXiv:1011.3027","author":"Vershynin Roman","year":"2010","unstructured":"{Ver10} Roman Vershynin . Introduction to the non-asymptotic analysis of random matrices. arXiv preprint arXiv:1011.3027 , 2010 . {Ver10} Roman Vershynin. Introduction to the non-asymptotic analysis of random matrices. arXiv preprint arXiv:1011.3027, 2010."}],"event":{"name":"STOC '18: Symposium on Theory of Computing","location":"Los Angeles CA USA","acronym":"STOC '18","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3188745.3188850","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3188745.3188850","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:07:09Z","timestamp":1750198029000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3188745.3188850"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,20]]},"references-count":35,"alternative-id":["10.1145\/3188745.3188850","10.1145\/3188745"],"URL":"https:\/\/doi.org\/10.1145\/3188745.3188850","relation":{},"subject":[],"published":{"date-parts":[[2018,6,20]]},"assertion":[{"value":"2018-06-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}