Combinatorics, Groups, Algorithms, and Complexity: Conference in honor of Laci Babai's 60th birthday

Akos Seress (1, 2) , Mario Szegedy (3)

1 School of Mathematics and Statistics [Crawley, Perth]
2 Department of Mathematics [Colombus]
3 Department of Computer Science [Camden]

Honoring László (Laci) Babai's 60th birthday, the conference "Combinatorics, Groups, Algorithms, and Complexity" (Ohio State University, March 15-25, 2010) explored the links between the areas mentioned in the title. These areas represent Laci's wide interests in mathematics and theoretical computer science; his work has revealed and enriched many of the interconnections between them. The conference had 109 participants from North America, Europe, Asia, and Australia (31 of them from overseas), including 3 Nevanlinna prize winners, 32 students, 13 postdocs, 20 females, and 18 former and current students of Laci Babai. The program consisted of 73 talks and a problem session. The full list of talks can be found in the introductory article by the guest editors of this special issue who also served as the organizers of the conference. We thank all participants and speakers for the success of the conference. We wish to express our gratitude to the National Science Foundation, National Security Agency, and The Ohio State Mathematical Research Institute for their generous support. This special issue contains papers in the conference topics, but not necessarily coinciding with the authors' talks at the conference. Each paper has been peer-reviewed. Toniann Pitassi, László Pyber, Uwe Schöning, Jiří Sgall, and Aner Shalev served with us as editors of this special issue. We thank for their work as well as for the assistance of the anonymous referees.

Domaines: Mathématique discrète [cs.DM]

Akos Seress, Mario Szegedy. Combinatorics, Groups, Algorithms, and Complexity: Conference in honor of Laci Babai's 60th birthday. Discrete Mathematics and Theoretical Computer Science, 2010, special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and Complexity, Vol. 13 no. 4 (4), pp.1-4. ⟨10.46298/dmtcs.529⟩. ⟨hal-00993123⟩