Publications Alcophys

Les références de cette page sont disponibles aussi au format BibTeX.

• Akhavi (Ali) and Vallée (Brigitte). - Average bit-complexity of Euclidean algorithms. In ICALP'00, Lecture Notes in Computer Science. - 2000. [ps].
• Allouche (J.-P.). - Transcendence of formal power series with rational coefficients. Theoretical Computer Science, vol. 218, n°1, 1999, pages 143--160. - WORDS (Rouen, 1997). [preprint].
• Allouche (J.-P.). - Nouveaux résultats de transcendance de réels à développement non aléatoire. Gazette des Mathématiciens, vol. 84, 2000, pages 19--34. - [preprint].
• Allouche (J.-P.) and Cosnard (M.). - The Komornik-Loreti constant is transcendental. American Mathematical Monthly, vol. 107, 2000, pages 447--448. - [preprint].
• Allouche (J.-P.) and Shallit (J.). - The ubiquitous Prouhet-Thue-Morse sequence. In Ding (C.), Helleseth (T.), and Niederreiter (H.) (editors), Sequences and their applications. pages 1--16. - Springer-Verlag, 1999. Proceedings SETA'98. [preprint].
• Allouche (J.-P.) and Shallit (J.). - Sums of digits, overlaps, and palindromes. Discrete Mathematics & Theoretical Computer Science, vol. 4, n°1, 2000, pages 1--10. - On-line.
• Allouche (J.-P.) and Skordev (G.). - Schur congruences, Carlitz sequences of polynomials and automaticity. Discrete Mathematics, vol. 214, n°1-3, 2000, pages 21--49. - [preprint].
• Allouche (J.-P.), Mendès France (M.), and Peyrière (J.). - Automatic Dirichlet series. Journal of Number Theory, vol. 81, n°2, 2000, pages 359--373. - [preprint].
• Allouche (J.-P.), Scheicher (K.), and Tichy (R. F.). - Regular maps in generalized number systems. Mathematica Slovaca, vol. 50, 2000, pages 41--58. - [preprint].
• Allouche (Jean-Paul) and Thakur (Dinesh S.). - Automata and transcendence of the Tate period in finite characteristic. Proceedings of the American Mathematical Society, vol. 127, n°5, 1999, pages 1309--1312. - [preprint].
• Banderier (Cyril), Bousquet-Mélou (Mireille), Denise (Alain), Flajolet (Philippe), Gardy (Danièle), and Gouyou-Beauchamps (Dominique). - On generating functions of generating trees. In FPSAC'99. - 1999. [ps].
• Banderier (Cyril), Flajolet (Philippe), Schaeffer (Gilles), and Soria (Michèle). - Planar maps and airy phenomena. In ICALP'00. Lecture Notes in Computer Science. - Springer-Verlag, January 2000. [ps].
• Barraez (Daniel), Boucheron (Stéphane), and Fernandez de la Vega (Wenceslas). - On the fluctuations of the giant component. Combinatorics, Probability and Computing, 2000. - To appear. [ps].
• Bazgan (C.) and Fernandez de~laVega (W.). - A polynomial time approximation scheme for dense {\sc min 2sat}. In Ciobanu (G.) and Paun (G.) (editors), Fundamentals of Computation Theory. Lecture Notes in Computer Science, vol. 1684, pages 91--99. - Springer-Verlag, 1999. Proceedings of FCT'99, Iasi, Romania.
• Biroli (Giulio), Monasson (Remi), and Weigt (Martin). - A variational description of the ground state structure in random satisfiability problems. European Physical Journal B, vol. 14, n°3, 2000, pages 551--568. - [on-line].
• Boucheron (Stéphane) and Fernandez de la Vega (Wenceslas). - On the independence number of random interval graphs. Combinatorics, Probability and Computing, 2000. - To appear. [ps].
• Bourdon (Jérémie), Nebel (Markus), and Vallée (Brigitte). - On the stack-size of general tries. - Preprint, 2000. [ps].
• Bousquet-Mélou (M.), Guttmann (A. J.), Orrick (W. P.), and Rechnitzer (A.). - Inversion relations, reciprocity and polyominoes. Annals of Combinatorics, vol. 3, n°2-4, 1999, pages 223--249. - [ps].
• Bousquet-Mélou (Mireille) and Schaeffer (Gilles). - Enumeration of planar constellations. Advances in Applied Mathematics, 2000. - To appear. [Preliminary version].
• Bouya (Driss) and Zvonkin (Alexander). - Topological classification of complex polynomials: new experimental results. - Preprint, May 1999.
• Chyzak (Frédéric), Gutman (Ivan), and Paule (Peter). - Predicting the number of hexagonal systems with 24 and 25 hexagons. Communications in Mathematical and Computer Chemistry, n°40, 1999, pages 139--151. - [ps].
• Clément (Julien), Flajolet (Philippe), and Vallée (Brigitte). - Dynamical sources in information theory: A general analysis of trie structures. Algorithmica, 2000, page 61 pages. - To appear. Preliminary version.
• Cori (Robert), Rossin (Dominique), and Salvy (Bruno). - Polynomial Ideals for Sandpiles and their Gröbner Bases. - Research Report n°3946, Institut National de Recherche en Informatique et en Automatique, June 2000. [ps].
• Corteel (Sylvie) and Gouyou-Beauchamps (Dominique). - Énumérations de piles de sable. In Colloque LACIM 2000, Les publications du Lacim. - 2000. À paraître. [ps].
• Corteel (Sylvie), Denise (Alain), and Gouyou-Beauchamps (Dominique). - The Bousquet-Conway directed animals. - Preprint, 2000. [ps].
• Csirik (Janos), Johnson (David S.), and Kenyon (Claire). - Better approximation algorithms for bin covering. - Preprint, July 2000. [ps].
• Csirik (Janos), Johnson (David S.), Kenyon (Claire), Orlin (James B.), Shor (Peter W.), and Weber (Richard R.). - On the sum-of-squares algorithm for bin packing. In Theory of Computing. pages 208--217. - ACM, 2000. Proceedings of the thirty-second annual ACM symposium on Theory of computing, STOC'2000, May 21--23, 2000, Portland. [ps].
• Csirik (Janos), Johnson (David S.), Kenyon (Claire), Shor (Peter W.), and Weber (Richard R.). - A self organizing bin packing heuristic. In Goodrich (M. T.) and McGeoch (C. C.) (editors), Algorithm Engineering and Experimentation. Lecture Notes in Computer Science, vol. 1619, Springer-Verlag, 1999. Proceedings of the International Workshop ALENEX'99 Baltimore, MD, January 15-16, 1999. [ps].
• Dantzer (Jean-François), Mitrani (Isi), and Robert (Philippe). - Large Scale and Heavy Traffic Asymptotics for Systems with Unreliable Servers. - Research Report n°3807, Institut National de Recherche en Informatique et en Automatique, November 1999. [ps].
• Dubois (O.), Boufkhad (Y.), and Mandler (J.). - Typical random 3-sat formulae and the satisfiability threshold. In Proceedings of the Eleventh ACM-SIAM Symposium on Discrete Algorithms, pages 124--126. - 2000. [ps].
• Duchon (P.). - $Q$-grammars and wall polyominoes. Annals of Combinatorics, vol. 3, 1999, pages 311--321.
• Fernandez de la Vega (Wenceslas). - On random 2-SAT. - Conference invitée au Workshop "Satisfiability and Phase Transitions", Abdus Salam International Center for Theoretical Physics, Trieste, September 1999.
• Flajolet (Philippe) and Louchard (Guy). - Analytic variations on the Airy distribution. Algorithmica, 2000, page 16 pages. - To appear in a special issue on Analysis of Algorithms. [ps].
• Flajolet (Philippe) and Noy (Marc). - Analytic Combinatorics of Chord Diagrams. - Research Report n°3914, Institut National de Recherche en Informatique et en Automatique, March 2000. 9 pages. To appear in Formal Power Series and Algebraic Combinatorics (FPSAC'2000, June 2000, Moscow), Lecture Notes in Computer Science. [ps].
• Flajolet (Philippe) and Vallée (Brigitte). - Continued fractions, comparison algorithms, and fine structure constants. In Théra (M.) (editor), Analysis and Applications, Conference Proceedings, Canadian Mathematical Society. - 2000. [ps].
• Houdayer (J.) and Martin (O.). - A geometrical picture for finite dimensional spin glasses. Europhysics Letters, vol. 49, 2000, pages 794--800. - [ps].
• Kenyon (Claire) and Barbay (Jérémy). - On the discrete Bak-Sneppen model of self-organized criticality. - Preprint, July 2000. [ps].
• Kenyon (Claire) and Mitzenmacher (Michael). - Linear waste of best fit bin packing on skewed distributions. In Foundations of Computer Science. - 2000. To appear. [ps].
• Kenyon (Claire) and Randall (Dana). - Glauber dynamics are rapidly mixing for one-dimensional hard-core statistical physics models. - Preprint, April 2000. [ps].
• Krattenthaler (Christian), Guttmann (Anthony J.), and Viennot (Xavier G.). - Vicious walkers, friendly walkers and Young tableaux II: with a wall. - Preprint, May 2000. [ps].
• Krzakala (F.) and Martin (O. C.). - Trivial link but non-trivial spin overlaps in 3-dimensional spin glasses. - Preprint, 2000. [ps].
• Monasson (Rémi), Zecchina (Riccardo), Kirkpatrick (Scott), Selman (Bart), and Troyansky (Lidror). - $2+p$-SAT: relation of typical-case complexity to the nature of the phase transition. Random Structures & Algorithms, vol. 15, n°3-4, 1999, pages 414--435. - Statistical physics methods in discrete probability, combinatorics, and theoretical computer science (Princeton, NJ, 1997). [ps].
• Monasson (Rémi), Zecchina (Riccardo), Kirkpatrick (Scott), Selman (Bart), and Troyansky (Lidror). - Determining computational complexity from characteristic ``phase transitions''. Nature, vol. 400, n°6740, 1999, pages 133--137. - [ps].
• Nicodème (Pierre), Salvy (Bruno), and Flajolet (Philippe). - Motif statistics. In Ne\v setril (J.) (editor), Algorithms, Lecture Notes in Computer Science, vol. 1643, pages 194--211. - 1999. Proceedings of 7th Annual European Symposium on Algorithms ESA'99, Prague, July 1999. Preliminary version [Html|BW postscript|Color postscript].
• Orrick (W.~P.), Nickel (B.~G.), Guttmann (A.~J.), and Perk (J. H.~H.). - Critical behavior of the two-dimensional {I}sing susceptibility. - 2000. Preprint. Available here.
• Orrick (W.~P.), Nickel (B.~G.), Guttmann (A.~J.), and Perk (J. H.~H.). - The susceptibility of the square lattice {I}sing model: {N}ew developments. Journal of Statistical Physics, 2000. - To appear.
• Penaud (J. G.), Pergola (E.), Pinzani (R.), and Roques (O.). - Chemins de Schroeder et hiérarchies aléatoires. Theoretical Computer Science, 1999. - À paraître. [ps].
• Penaud (J. G.) and Roques (O.). - Génération de chemins de Dyck à pics croissants. In SFCA'99, pages 438--449. - 1999. Soumis à Discrete Mathematics. [ps].
• Penaud (J. G.) and Roques (O.). - Tirage à pile ou face de mots de Fibonacci. In Colloque Lacim2000 (Montréal). - 2000. À paraître dans les Publications du Lacim. [ps].
• Vallée (Brigitte). - Digits and continuants in Euclidean algorithms. Ergodic versus Tauberian theorems. - Preprint, 2000. [ps].
• Vallée (Brigitte). - Dynamical sources in information theory: Fundamental intervals and word prefixes. Algorithmica, 2000. - To appear. [ps].
• Vallée (Brigitte). - A unifying framework for the analysis of a class of Euclidean algorithms. In Latin'00. Lecture Notes in Computer Science. - Springer-Verlag, 2000. To appear. [ps].
• Viennot (X. G.). - A combinatorial interpretation of the quotient-difference algorithm. In Formal power series and algebraic combinatorics. - 2000. Proceedings FPSAC'00, Moscow.
• Viennot (X. G.). - A Strahler bijection between planar trees and Dyck paths. In Formal power series and algebraic combinatorics, pages 573--584. - 1999. Proceedings FPSAC'99, Barcelona. [ps].
• Zvonkin (Alexander). - Towards topological classification of univariate complex polynomials. In FPSAC'00. -2000.