logo

05 mai - 09 mai 2025

Classement: C (CORE2023)Offline

International Conference on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms

Mis à jour le : about 2 months ago
2.5 (10 Évaluations)

Aucun abonné pour le moment.

Aperçu

The International Conference on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA 2025) will be held from May 5-9, 2025, at The Fields Institute in Toronto, Canada. This conference, the 36th edition of the AofA series, focuses on the precise understanding of asymptotic, average-case characteristics of algorithms and data structures using probabilistic, combinatorial, and analytic methods.

Appel à communications

AofA 2025: Call for Papers

The International Conference on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA 2025) will be held from May 5 to May 9, 2025, at The Fields Institute, Room 230, Toronto, Canada.

This conference is the 36th edition of the AofA series and the second one held in Canada.

About Analysis of Algorithms (AofA)

Analysis of Algorithms (AofA) is a field at the boundary of computer science and mathematics. Its goal is to obtain a precise understanding of the asymptotic, average-case characteristics of algorithms and data structures, employing a unifying theme of probabilistic, combinatorial, and analytic methods. The objects studied include random branching processes, graphs, permutations, trees, and strings.

Topics of Interest

The conference aims to study discrete objects that appear as data structures or algorithms using mathematical methods, particularly probabilistic, combinatorial, and asymptotic methods. Topics include, but are not limited to:

  • Properties of large random data structures
  • Probabilistic methods for the analysis of algorithms
  • Combinatorial methods for the analysis of algorithms
  • Analytic tools for the analysis of algorithms
  • Average case analysis of classical or new algorithms
  • Analytic and enumerative combinatorics
  • Random trees and graphs
  • Branching processes
  • Stochastic processes in relation to random discrete structures
  • Random walks
  • Discrete probabilities
  • Random generation of combinatorial structures
  • Performance evaluation

Invited Speakers

  • Omer Angel (University of British Columbia)
  • Yuliy Baryshnikov (University of Illinois Urbana-Champaign)
  • Anna Ben-Hamou (Sorbonne Université)
  • Laura Eslava (UNAM)
  • Vincent Jugé (Université Gustave Eiffel and CNRS)
  • Greta Panova (University of Southern California)
  • Sebastian Wild (University of Marburg)
  • Karen Yeats (University of Waterloo)

Participation

Participation is encouraged from students and early-career researchers, both domestic and international.

Organizing Committee

  • Stephen Melczer - University of Waterloo
  • Daniel Panario - Carleton University
  • Shane Liu - Toronto Metropolitan University

Registration

Register Here (Note: This link appears to be from a different conference in the provided text. Please refer to the Fields Institute website for actual registration details.)

Dates importantes

Dates de la conférence

Conference Date

5 mai 20259 mai 2025

Classement source

Source: CORE2023

Classement: C

Domaine de recherche: Theory of computation, Plus utilisé

Carte

Loading feedback section...