LOGO
27th International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms
 
Main Page Programme Registration Participants list
Steering Committee  
Scientific Committee  
About Krakow  
Useful information  
Hotels  
Steering Committee
Scientific Committee
Organizing Committee
Confirmed keynote speakers
Important dates
For Authors
Accepted papers
About Krakow
History
Excursions
Useful Information
Accomodation
Venue
Download poster

Call for papers

Submission

Proceedings

 

 

 


The 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods
for the Analysis of Algorithms, AofA’16,
will be held in Krakow, Poland on July 4–8, 2016.


It aims at studying discrete objects that appear as data structures or algorithms (including graphs, networks etc.) by mathematical methods, in particular by probabilistic, combinatorial and asymptotic methods.

Poster Topics include :
  • 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 with random discrete structures
  • Random walks
  • Discrete probabilities
  • Random generation of combinatorial structures
  • Data compression and language-modeling methods.
  • Performance evaluation
Welcome to Kraków / watch the movie