AofA

Home
call
call
dates
submission
submission
programm
speakers
committees
registration
venue
travel
events
sponsors
contact
vienna





This conference is the first joint meeting of two previous conference and seminar series on "Mathematics and Computer Science" and "Analysis of Algorithms". The common aim of these and the present meeting is to study discrete objects that appear as data structures or algorithms (including graphs, networks etc.) by mathematical methods, in particular by probabilistic, combinatorial and asymptotic methods.

  • Properties of large randomly formed data structures,
  • Probabilistic methods for the analysis of algorithms,
  • Combinatorial methods for the analysis of algorithms,
  • Analytic tools for the analysis of algorithms
  • New results concerning average case analysis of classical or new algorithms
  • Analytical and enumerative combinatorics
  • Random trees and graphs
  • Branching processes
  • Stochastic processes in relation with random discrete structures
  • Random walks
  • Discrete probabilities
  • Random generation of combinatorial structures
  • Data compression and language-modeling methods.
  • Performance evaluation

    Please download the Conference-Poster: