2021 Abel Prize Laureates Announced

The Norwegian Academy of Science and Letters has announced the recipients of the 2021 Abel Prize as László Lovász of Alfréd Rényi Institute of Mathematics (ELKH, MTA Institute of Excellence) and Eötvös Loránd University in Budapest, Hungary, and Avi Wigderson of the Institute for Advanced Study, Princeton, USA “for their foundational contributions to theoretical computer science and discrete mathematics, and their leading role in shaping them into central fields of modern mathematics.”

László Lovász has published the following articles in Wiley journals:

Random Structures and Algorithms

Borgs, C., Chayes, J., Kahn, J. and Lovász, L. (2013), Left and right convergence of graphs with bounded degree. Random Struct. Alg., 42: 1-28. https://doi.org/10.1002/rsa.20414

Lovász, L. and Vempala, S. (2007), The geometry of logconcave functions and sampling algorithms. Random Struct. Alg., 30: 307-358. https://doi.org/10.1002/rsa.20135

Kannan, R., Lovász, L. and Simonovits, M. (1997), Random walks and an O*(n5) volume algorithm for convex bodies. Random Struct. Alg., 11: 1-50. https://doi.org/10.1002/(SICI)1098-2418(199708)11:1<1::AID-RSA1>3.0.CO;2-X

Journal of Graph Theory

Lovász, L. and Szegedy, B. (2012), Random graphons and a weak Positivstellensatz for graphs. J. Graph Theory, 70: 214-225. https://doi.org/10.1002/jgt.20611

Lovász, L. and Szegedy, B. (2009), Contractors and connectors of graph algebras. J. Graph Theory, 60: 11-30. https://doi.org/10.1002/jgt.20343

Beveridge, A. and Lovász, L. (1998), Random walks and the regeneration time. J. Graph Theory, 29: 57-62. https://doi.org/10.1002/(SICI)1097-0118(199810)29:2<57::AID-JGT1>3.0.CO;2-B

Kotlov, A. and Lovász, L. (1996), The rank and size of graphs. J. Graph Theory, 23: 185-189. https://doi.org/10.1002/(SICI)1097-0118(199610)23:2<185::AID-JGT9>3.0.CO;2-P


Brieden, A., Gritzmann, P., Kannan, R., Klee, V., Lovász, L. and Simonovits, M. (2001), Deterministic and randomized polynomial‐time approximation of radii. Mathematika, 48: 63-105. https://doi.org/10.1112/S0025579300014364

Avi Wigderson has published the following articles in Random Structures and Algorithms:

Håstad, J. and Wigderson, A. (2003), Simple analysis of graph tests for linearity and PCP. Random Struct. Alg., 22: 139-160. https://doi.org/10.1002/rsa.10068

Rabinovich, Y. and Wigderson, A. (1999), Techniques for bounding the convergence rate of genetic algorithms. Random Struct. Alg., 14: 111-138. https://doi.org/10.1002/(SICI)1098-2418(199903)14:2<111::AID-RSA1>3.0.CO;2-6

Goldreich, O. and Wigderson, A. (1997), Tiny families of functions with random properties: A quality‐size trade‐off for hashing. Random Struct. Alg., 11: 315-343. https://doi.org/10.1002/(SICI)1098-2418(199712)11:4<315::AID-RSA3>3.0.CO;2-1

Gál, A. and Wigderson, A. (1996), Boolean complexity classes vs. their arithmetic analogs. Random Struct. Alg., 9: 99-111. https://doi.org/10.1002/(SICI)1098-2418(199608/09)9:1/2<99::AID-RSA7>3.0.CO;2-6