UID:
almahu_9948153767402882
Format:
PDFs (106 pages) :
,
illustrations
ISBN:
9781611973037
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:
Extremal parameters in sub-critical graph classes / Michael Drmota and Marc Noy -- The number of ways to assemble a graph / Miklós Bóna and Andrew Vince -- Bootstrap percolation on random geometric graphs (extended abstract) / Milan Bradonjić and Iraj Saniee -- Approximating fault-tolerant domination in general graphs / Klaus-Tycho Foerster -- Analysis of parameters of trees corresponding to huffman codes and sums of unit fractions / Clemens Heuberger, Daniel Krenn, and Stephan Wagner -- The variance of the number of 2-protected nodes in a trie / Jeffrey Gaither and Mark Daniel Ward -- Exact-size sampling for Motzkin trees in linear time via Boltzmann samplers and holonomic specification / A. Bacher, O. Bodini, and A. Jacquot -- Perpetuities in fair leader election algorithms / Ravi Kalpathy and Hosam M. Mahmoud -- Approximate counting of matchings in sparse uniform hypergraphs / Marek Karpinski, Andrzej Rucinski, and Edyta Szymanska -- When is it worthwhile to propagate a constraint? A probabilistic analysis of AllDifferent / Jérémie du Boisberranger, Danièle Gardy, Xavier Lorca, and Charlotte Truchet -- On delta-method of moments and probabilistic sums / Jacek Cichoń, Zbigniew Gołębiewski, Marcin Kardas, and Marek Klonowski -- Unlabeled equivalence for matroids representable over finite fields / S.R. Kingan.
,
Also available in print version.
,
Mode of access: World Wide Web.
,
System requirements: Adobe Acrobat Reader.
Additional Edition:
Print version: ISBN 9781611972542
Language:
English
Bookmarklink
