Survey propagation: An algorithm for satisfiability

A simple approach is presented to study the asymptotic behavior of some algorithms with an underlying tree structure. It is shown that some asymptotic oscillating behaviors can be precisely analyzed without resorting to complex analysis techniques as it is usually done in this context. A new explicit representation of periodic functions involved is obtained at the same time. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2005

[1]  Helmut Prodinger,et al.  Analysis of a splitting process arising in probabilistic counting and other related algorithms , 1996 .

[2]  Philippe Jacquet,et al.  Analytical Depoissonization and its Applications , 1998, Theor. Comput. Sci..

[3]  David J. Aldous.  Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels , 1987, IEEE Trans. Inf. Theory.

[4]  F. Guillemin,et al.  A Markovian analysis of additive-increase multiplicative-decrease algorithms , 2002, Advances in Applied Probability.

[5]  Hosam M. Mahmoud,et al.  Evolution of random search trees , 1991, Wiley-Interscience series in discrete mathematics and optimization.

[6]  N. Litvak,et al.  On the minimal travel time needed to collect n items on a circle , 2002, math/0405294.

[7]  M. V. Wilkes,et al.  The Art of Computer Programming, Volume 3, Sorting and Searching , 1974 .

[8]  Philippe Flajolet,et al.  Mellin Transforms and Asymptotics: Harmonic Sums , 1995, Theor. Comput. Sci..

[9]  Philippe Jacquet,et al.  Analytic Models for Tree Communication Protocols , 1987 .

[10]  John Capetanakis,et al.  Tree algorithms for packet broadcast channels , 1979, IEEE Trans. Inf. Theory.

[11]  Robert Metcalfe,et al.  Ethernet: distributed packet switching for local computer networks , 1976, CACM.

[12]  Nicholas Pippenger.  An Elementary Approach to Some Analytic Asymptotics , 1993 .

[13]  Philippe Robert.  Stochastic Networks and Queues , 2003 .

[14]  Philippe Robert,et al.  A Probabilistic Analysis of Some Tree Algorithms , 2005 .

[15]  Anthony Ephremides,et al.  Information Theory and Communication Networks: An Unconsummated Union , 1998, IEEE Trans. Inf. Theory.

[16]  Philippe Flajolet,et al.  Probabilistic Counting Algorithms for Data Base Applications , 1985, J. Comput. Syst. Sci..

[17]  Philippe Flajolet,et al.  Approximate counting: A detailed analysis , 1985, BIT.