UID:
almahu_9948153766902882
Format:
PDFs (137 pages) :
,
illustrations
ISBN:
9781611973761
Content:
The aim of ANALCO is to provide a forum for the presentation of original research in the analysis of algorithms and associated combinatorial structures. We invite both papers that study properties of fundamental combinatorial structures that arise in practical computational applications (such as permutations, trees, strings, tries, and graphs) and papers that address the precise analysis of algorithms for processing such structures, including: average-case analysis; analysis of moments, extrema, and distributions; probabilistic analysis of randomized algorithms, and so on. Submissions that present significant new information about classic algorithms are welcome, as are new analyses of new algorithms that present unique analytic challenges. We also invite submissions that address tools and techniques for the analysis of algorithms and combinatorial structures, both mathematical and computational.
Note:
On k-connectivity and minimum vertex degree in random s-intersection graphs / Jun Zhao, Osman Yağan, and Virgil Gligor -- On the algorithmic Lovász local lemma and acyclic edge coloring / Ioannis Giotis, Lefteris Kirousis, Kostas I. Psaromiligkos, and Dimitrios M. Thilikos -- A bound for the diameter of random hyperbolic graphs / Marcos Kiwi and Dieter Mitsche -- Analytic samplers and the combinatorial rejection method / Olivier Bodini, Jérémie Lumbroso, and Nicolas Rolin -- Linear-time generation of inhomogeneous random directed walks / Frédérique Bassino and Andrea Sportiello -- Cuts in increasing trees / Olivier Bodini and Antoine Genitrini -- Repeated fringe subtrees in random rooted trees / Dimbinaina Ralaivaosaona and Stephan Wagner -- Bootstrap percolation on periodic trees / Milan Bradonjić and Iraj Saniee -- Variance of size in regular graph tries / Philippe Jacquet and Abram Magner -- Lattice paths of slope 2/5 / Cyril Banderier and Michael Wallner -- Analysis of branch misses in quicksort / Conrado Martínez, Markus E. Nebel, and Sebastian Wild -- On distributed cardinality estimation : random arcs recycled / Marcin Kardas, Miroslaw Kutylowski, and Jakub Lemiesz.
,
Mode of access: World Wide Web.
,
System requirements: Adobe Acrobat Reader.
Language:
Undetermined
