Volume 6, Number 1, 2003
- Cedric Chauve: Constellations are Lagrangian objects: a bijective proof. 13-40
- Vince Grolmusz: A Note on Set Systems with no Union of Cardinality 0 Modulo m. 41-44
- Johann Cigler: Some Algebraic Aspects of Morse Code Sequences. 55-68
- Klaus Dohmen, André Poenitz, Peter Tittmann: A new two-variable generalization of the chromatic polynomial. 69-90
- Charles Knessl: Numerical Studies of the Asymptotic Height Distribution in Binary Search Trees. 91-100
- Wei-Mei Chen, Hsien-Kuei Hwang, Tsung-Hsi Tsai: Efficient maxima-finding algorithms for random planar samples. 107-122
- Andreas Weiermann: An application of results by Hardy, Ramanujan and Karamata to Ackermannian functions.
Volume 6, Number 2, 2004
- Narjes Berregeb, Riadh Robbana, Ashish Tiwari: Towards automated proofs of observational properties. 143-162
- Vladimir E. Alekseev, Alastair Farrugia, Vadim V. Lozin: New Results on Generalized Graph Coloring. 215-222
- Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto: On Locating-Dominating Codes in Binary Hamming Spaces. 265-282
- Frédéric Chazal, Véronique Maume-Deschamps: Statistical properties of general Markov dynamical sources: applications to information theory. 283-314
- Karell Bertet, Mirabelle Nebut: Efficient Algorithms on the Family Associated to an Implicational System. 315-338
- Rajendra M. Pawale: A Note on t-designs with t Intersection Numbers. 359-364
- Carsten Schneider: The Summation Package Sigma: Underlying Principles and a Rhombus Tiling Application. 365-386
- Michael Drmota, Bernhard Gittenberger: The Width of Galton-Watson Trees Conditioned by the Size. 387-400
- P. Mark Kayll: Well-spread sequences and edge-labellings with constant Hamilton-weight. 401-408
- Wolfgang Steiner: The distribution of m-ary search trees generated by van der Corput sequences. 409-424
- Vincent Puyhaubert: Generating functions and the satisfiability threshold. 425-436
- Alois Panholzer, Helmut Prodinger: Analysis of some statistics for increasing tree families. 437-460
- Toufik Mansour: On an open problem of Green and Losonczy: exact enumeration of freely braided permutations. 461-470
- Hon-Chan Chen: Optimal Sequential and Parallel Algorithms for Cut Vertices and Bridges on Trapezoid Graphs. 483-496
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T214307 by the dblp team