2005 International Conference on the Analysis of Algorithms (AofA'05)

Accepted Papers

Talks

  • Furis, Hitczenko, Johnson: Cache Miss Analysis of WHT Algorithms
  • Louchard, Prodinger, Ward: The number of distinct values of some multiplicity in sequences of geometrically distributed random variables.
  • Aguech, Lasmar, Mahmoud: Distribution of Inter-Node Distances in Digital Trees
  • Giménez, Noy: The number of planar graphs and properties of random planar graphs
  • Costermans, Enjalbert, Minh: Algorithmic and combinatoric aspects of multiple harmonic sums
  • Nicodeme: Average profiles: from tries to suffix-trees
  • Archibald: Position of the maximum in a sequence with geometric distribution
  • Fusy: Quadratic and linear-time random generation of planar graphs
  • Pouyanne: Classification of large P'olya-Eggenberger urns with regard to their asymptotics
  • Gittenberger, Panholzer: Some results for monotonically labelled simply generated trees
  • Daireaux, Maume, Vallée: The Lyapounov Tortoise and the Dyadic Hare
  • Gardy, Woods: And/or trees probabilities of Boolean functions
  • Gruebel: A hooray for Poisson approximation
  • Viola: Distributional Analysis of Robin Hood Linear Probing Hashing with Buckets
  • Cherng, Ladner: Cache Efficient Simple Dynamic Programming
  • Balogh, Pittel, Salazar: Near-perfect harmonic matchingsin randomly labeled planar point sets
  • Giroire: Order Statistics and Estimating Cardinalities of massive Data Sets.
  • Fayolle, Ward: Analysis of the Average Depth in a Suffix Tree under a Markov Model
  • Ward, Szpankowski: Analysis of the Multiplicity Matching Parameter in Suffix Trees
  • Shachnai, Zhang: The Master Ring Problem
  • Wilson: Asymptotics of generalized Riordan arrays
  • Berend, Braverman: Convex hull for intersections of random lines
  • Baryshnikov, Coffman, Feng, Momcilovic: Asymptotic Analysis of a Nonlinear AIMD Algorithm
  • Hwang: Profile of random trees: plane-oriented recursive trees
  • Kok: Pattern distribution in various types of random trees
  • Park, Szpankowski: Analysis of Biclusters with Applications to Gene Expression Data
  • Fill, Kapur: A repertoire for additive functionals of uniformly distributed m-ary search trees
  • Gittenberger: The Profile of Unlabeled Trees
  • Jelenkovic, Kang, Radovanovic: Near Optimality of the Discrete Persistent Access Caching Algorithm

Posters

  • Elmasry: Set Multi-partitioning
  • Brennan, Knopfmacher: The distribution of ascents of size d or more in samples of geometric random variables
  • Merlini, Sprugnoli, Verri: Human proof of combinatorial identities
  • Ryabko, Astola: Application of data compression methods to hypothesis testing for ergodic and stationary processes
  • Berend, Korach, Zucker: 2-Anticoloring of Planar and Related Graphs
  • Györfi, Gyori: Analysis of Tree Algorithm for Collision Resolution
  • Kijima, Matsui: Rapidly Mixing Chain and Perfect Sampler for Logarithmic Separable Concave Distribution on Simplex
  • Morita, Ota: A Tight Upper Bound on Size of Antidictionary of a Binary String
  • Jacquet, Naimi, Rodolakis: Performance of binary exponential backoff CSMA in WiFi and optimal routing in mobile ad hoc networks
  • Weiermann: Analytic combinatorics for a certain well-ordered class of iterated exponential terms