Analysis of an Approximation Algorithm for Scheduling Independent Parallel Tasks
Author(s): Keqin Li
Volume: 3
Issue: 4
Year: 1999




Accelerated series for universal constants, by the W Zmethod
Author(s): Herbert S. Wilf
Volume: 3
Issue: 4
Year: 1999




A characterization for all interval doubling schemes of the lattice of permutations
Author(s): Nathalie Caspard
Volume: 3
Issue: 4
Year: 1999




Permutations Containing and Avoiding 123and 132Patterns
Author(s): Aaron Robertson
Volume: 3
Issue: 4
Year: 1999




Classes of graphs with restricted interval models
Author(s): Andrzej Proskurowski | Jan Arne Telle
Volume: 3
Issue: 4
Year: 1999




Convergence of some leader election algorithms
Author(s): Svante Janson | Christian Lavault | Guy Louchard
Volume: 10
Issue: 3
Year: 2008




Waiting Time Distribution for Pattern Occurrence in a Constrained Sequence: an Embedding Markov Chain Approach
Author(s): Gregory Nuel
Volume: 10
Issue: 3
Year: 2008




A note on compact and compact circular edge-colorings of graphs
Author(s): Dariusz Dereniowski | Adam Nadolski
Volume: 10
Issue: 3
Year: 2008




On the k-Structure Ratio in Planar and Outerplanar Graphs
Author(s): Gruia Calinescu | Cristina G. Fernandes
Volume: 10
Issue: 3
Year: 2008




Shifts with Decidable Language and Non-Computable Entropy
Author(s): Peter Hertling | Christoph Spandl
Volume: 10
Issue: 3
Year: 2008




On-line Ramsey Numbers for Paths and Stars
Author(s): Jaroslaw Grytczuk | Hal Kierstead | Pawel Prałat
Volume: 10
Issue: 3
Year: 2008




An Optimal Permutation Routing Algorithm on Full-Duplex Hexagonal Networks
Author(s): Janez Zerovnik | Ignasi Sau
Volume: 10
Issue: 3
Year: 2008




Counting descents, rises, and levels, with prescribed first element, in words
Author(s): Sergey Kitaev | Toufik Mansour | Jeff Remmel
Volume: 10
Issue: 3
Year: 2008




Local Normal Forms for First-Order Logic with Applications to Games and Automata
Author(s): Thomas Schwentick | Klaus Barthelmann
Volume: 3
Issue: 3
Year: 1999




On the Structure of Valiant's Complexity Classes
Author(s): Peter Bürgisser
Volume: 3
Issue: 3
Year: 1999




Simultaneous generation for zeta values by the Markov-WZ method
Author(s): Khodabakhsh Hessami Pilehrood | Tatiana Hessami Pilehrood
Volume: 10
Issue: 3
Year: 2008




Progress on the Traceability Conjecture for Oriented Graphs
Author(s): Marietjie Frick | Peter Katrenič
Volume: 10
Issue: 3
Year: 2008




Multidimensional cellular automata and generalization of Fekete's lemma
Author(s): Silvio Capobianco
Volume: 10
Issue: 3
Year: 2008




Extremal K (s,t)-free bipartite graphs
Author(s): C. Balbuena | P. Garcia-Vazquez | X. Marcote | J.C. Valenzuela
Volume: 10
Issue: 3
Year: 2008




The location of the first maximum in the first sojourn of a Dyck path
Author(s): Helmut Prodinger
Volume: 10
Issue: 3
Year: 2008




Partially persistent search trees with transcript operations
Author(s): Kim S. Larsen
Volume: 3
Issue: 3
Year: 1999




Editors foreword
Author(s): Daniel Krob | Christoph Meinel | Michel Morvan
Volume: 3
Issue: 3
Year: 1999




Neighbor discovery in multi-hop wireless networks: evaluation and dimensioning with interferences considerations
Author(s): Elyes Ben Hamida | Guillaume Chelius | Anthony Busson | Eric Fleury
Volume: 10
Issue: 2
Year: 2008




On the size of induced acyclic subgraphs in random digraphs
Author(s): Joel Spencer | C. R. Subramanian
Volume: 10
Issue: 2
Year: 2008




Regular Languages and Associative Language Descriptions
Author(s): Marcella Anselmo | Alessandra Cherubini | Pierluigi San Pietro
Volume: 9
Issue: 2
Year: 2007




Infinite special branches in words associated with beta-expansions
Author(s): Christiane Frougny | Zuzana Masáková | Edita Pelantová
Volume: 9
Issue: 2
Year: 2007




Addition and multiplication of beta-expansions in generalized Tribonacci base
Author(s): Petr Ambrož | Zuzana Masáková | Edita Pelantová
Volume: 9
Issue: 2
Year: 2007




Improved Expansion of Random Cayley Graphs
Author(s): Po-Shen Loh | Leonard J. Schulman
Volume: 6
Issue: 2
Year: 2004




Track Layouts of Graphs
Author(s): Vida Dujmović | Attila Pór | David R. Wood
Volume: 6
Issue: 2
Year: 2004




Analysis of some statistics for increasing tree families
Author(s): Alois Panholzer | Helmut Prodinger
Volume: 6
Issue: 2
Year: 2004




Generating functions and the satisfiability threshold
Author(s): Vincent Puyhaubert
Volume: 6
Issue: 2
Year: 2004




Well-spread sequences and edge-labellings with constant Hamilton-weight
Author(s): P. Mark Kayll
Volume: 6
Issue: 2
Year: 2004




The Summation Package Sigma: Underlying Principles and a Rhombus Tiling Application
Author(s): Carsten Schneider
Volume: 6
Issue: 2
Year: 2004




Efficient Algorithms on the Family Associated to an Implicational System
Author(s): Karell Bertet | Mirabelle Nebut
Volume: 6
Issue: 2
Year: 2004




Statistical properties of general Markov dynamical sources: applications to information theory
Author(s): Frédéric Chazal | Véronique Maume-Deschamps
Volume: 6
Issue: 2
Year: 2004




On Cheating Immune Secret Sharing
Author(s): Josef Pieprzyk | Xian-Mo Zhang
Volume: 6
Issue: 2
Year: 2004




New Results on Generalized Graph Coloring
Author(s): Vladimir E. Alekseev | Alastair Farrugia | Vadim V. Lozin
Volume: 6
Issue: 2
Year: 2004




Rare Events and Conditional Events on Random Strings
Author(s): Mireille Régnier | Alain Denise
Volume: 6
Issue: 2
Year: 2004




Some lattices of closure systems on a finite set
Author(s): Nathalie Caspard | Bernard Monjardet
Volume: 6
Issue: 2
Year: 2004




Towards automated proofs of observational properties
Author(s): Narjes Berregeb | Riadh Robbana | Ashish Tiwari
Volume: 6
Issue: 2
Year: 2004




The first-order theory of ordering constraints over feature trees
Author(s): Martin Müller | Joachim Niehren | Ralf Treinen
Volume: 4
Issue: 2
Year: 2001




A Degree-Decreasing Lemma for (M O D q- M O D p) Circuits
Author(s): Vince Grolmusz
Volume: 4
Issue: 2
Year: 2001




An Approximate L p Difference Algorithm for Massive Data Streams
Author(s): Jessica H. Fong | Martin Strauss
Volume: 4
Issue: 2
Year: 2001




An Efficient Algorithm for the Maximum Distance Problem
Author(s): Gabrielle Assunta Grün
Volume: 4
Issue: 2
Year: 2001




Asymptotic normality of recursive algorithms via martingale difference arrays
Author(s): Werner Schachinger
Volume: 4
Issue: 2
Year: 2001




Analysis of Transmissions Scheduling with Packet Fragmentation
Author(s): Nir Menakerman | Raphael Rom
Volume: 4
Issue: 2
Year: 2001




Minimum Eccentricity Multicast Trees
Author(s): David Krumme | Paraskevi Fragopoulou
Volume: 4
Issue: 2
Year: 2001




Benders decomposition for local access network design with two technologies
Author(s): C. D. Randazzo | H. P. L. Luna | P. Mahey
Volume: 4
Issue: 2
Year: 2001




Oriented multicast routing algorithm applied to network-level agent search
Author(s): Damien Magoni | Jean-Jacques Pansiot
Volume: 4
Issue: 2
Year: 2001




On symmetric structures of order two
Author(s): Michel Bousquet | Cedric Lamathe
Volume: 10
Issue: 2
Year: 2008




A Determinant of Stirling Cycle Numbers Counts Unlabeled Acyclic Single-Source Automata
Author(s): David Callan
Volume: 10
Issue: 2
Year: 2008




Spanning forests on the Sierpinski gasket
Author(s): Shu-Chiuan Chang | Lung-Chi Chen
Volume: 10
Issue: 2
Year: 2008




Leftmost Derivations of Propagating Scattered Context Grammars: A New Proof
Author(s): Tomas Masopust | Jiri Techet
Volume: 10
Issue: 2
Year: 2008




Analysis of some parameters for random nodes in priority trees
Author(s): Alois Panholzer
Volume: 10
Issue: 2
Year: 2008




Tiling a Pyramidal Polycube with Dominoes
Author(s): Olivier Bodini | Damien Jamet
Volume: 9
Issue: 2
Year: 2007




A geometrical approach to Palindromic Factors of Standard Billiard Words
Author(s): Jean-Pierre Borel
Volume: 9
Issue: 2
Year: 2007




On morphisms preserving infinite Lyndon words
Author(s): Gwénaël Richomme
Volume: 9
Issue: 2
Year: 2007




A generating algorithm for Ribbon Tableaux and Spin Polynomials
Author(s): Francois Descouens
Volume: 9
Issue: 2
Year: 2007




Noncommutative symmetric functions associated with a code, Lazard elimination, and Witt vectors
Author(s): Jean-Gabriel Luque | Jean-Yves Thibon
Volume: 9
Issue: 2
Year: 2007




Foreword to the special issue dedicated to the 10 th Journées montoises d'informatique théorique
Author(s): Michel Rigo | Véronique Bruyère
Volume: 9
Issue: 2
Year: 2007




Optimal Sequential and Parallel Algorithms for Cut Vertices and Bridges on Trapezoid Graphs
Author(s): Hon-Chan Chen
Volume: 6
Issue: 2
Year: 2004




Characterisations of Ideal Threshold Schemes
Author(s): Josef Pieprzyk | Xian-Mo Zhang
Volume: 6
Issue: 2
Year: 2004




On an open problem of Green and Losonczy: exact enumeration of freely braided permutations
Author(s): Toufik Mansour
Volume: 6
Issue: 2
Year: 2004




The distribution of m-ary search trees generated by van der Corput sequences
Author(s): Wolfgang Steiner
Volume: 6
Issue: 2
Year: 2004




The Width of Galton- Watson Trees Conditioned by the Size
Author(s): Michael Drmota | Bernhard Gittenberger
Volume: 6
Issue: 2
Year: 2004




A Note on t-designs with t Intersection Numbers
Author(s): Rajendra M. Pawale
Volume: 6
Issue: 2
Year: 2004




On Locating-Dominating Codes in Binary HammingSpaces
Author(s): Iiro Honkala | Tero Laihonen | Sanna Ranto
Volume: 6
Issue: 2
Year: 2004




On a hierarchy of Booleanfunctions hard to compute in constant depth
Author(s): Anna Bernasconi
Volume: 4
Issue: 2
Year: 2001




A note on representations of the finite Heisenberggroup and sums of greatest common divisors
Author(s): Johannes Grassberger | Günther Hörmann
Volume: 4
Issue: 2
Year: 2001




A permutations representation that knows what " Eulerian" means
Author(s): Roberto Mantaci | Fanja Rakotondrajao
Volume: 4
Issue: 2
Year: 2001




P 4-Colorings and P 4-Bipartite Graphs
Author(s): Chính T. Hoàng | Van Bang Le
Volume: 4
Issue: 2
Year: 2001




Paths of specified length in random k-partite graphs
Author(s): C. R. Subramanian
Volume: 4
Issue: 2
Year: 2001




Finite Automata with Generalized Acceptance Criteria
Author(s): Timo Peichl | Heribert Vollmer
Volume: 4
Issue: 2
Year: 2001




Defect Effect of Bi-infinite Words in the Two-element Case
Author(s): Ján Maňuch
Volume: 4
Issue: 2
Year: 2001




Simple Equational Specifications of Rational Arithmetic
Author(s): Lawrence S. Moss
Volume: 4
Issue: 2
Year: 2001




The topological entropy of iterated piecewise affine maps is uncomputable
Author(s): Pascal Koiran
Volume: 4
Issue: 2
Year: 2001




Linear time recognition of P 4-indifference graphs
Author(s): Michel Habib | Christophe Paul | Laurent Viennot
Volume: 4
Issue: 2
Year: 2001




The Optimal Lower Bound for Generators of Invariant Rings without Finite SAGBIBases with Respect to Any Admissible Order
Author(s): Manfred Göbel
Volume: 3
Issue: 2
Year: 1999




The Number of Sides of a Parallelogram
Author(s): Elisha Falbel | Pierre-Vincent Koseleff
Volume: 3
Issue: 2
Year: 1999




Computation of L ⊕ for several cubic Pisot numbers
Author(s): Julien Bernat
Volume: 9
Issue: 2
Year: 2007




Ambiguity in the m-bonacci numeration system
Author(s): Petra Kocábová | Zuzana Masáková | Edita Pelantová
Volume: 9
Issue: 2
Year: 2007




Properties of the extremal infinite smooth words
Author(s): Srecko Brlek | Guy Melançon | Geneviève Paquin
Volume: 9
Issue: 2
Year: 2007




The Černý Conjecture for Aperiodic Automata
Author(s): Avraham N. Trahtman
Volume: 9
Issue: 2
Year: 2007




Words and bisimulations of dynamical systems
Author(s): Thomas Brihaye
Volume: 9
Issue: 2
Year: 2007




Quicksort algorithm again revisited
Author(s): Charles Knessl | Wojciech Szpankowski
Volume: 3
Issue: 2
Year: 1999




VC-dimensions of random function classes
Author(s): Bernard Ycart | Joel Ratsaby
Volume: 10
Issue: 1
Year: 2008




Strong oriented chromatic number of planar graphs without short cycles
Author(s): Mickaël Montassier | Pascal Ochem | Alexandre Pinlou
Volume: 10
Issue: 1
Year: 2008




Exponential bounds and tails for additive random recursive sequences
Author(s): Ludger Rüschendorf | Eva-Maria Schopp
Volume: 9
Issue: 1
Year: 2007




Waiting Time Distributions for Pattern Occurrence in a Constrained Sequence
Author(s): Valeri Stefanov | Wojciech Szpankowski
Volume: 9
Issue: 1
Year: 2007




On the k th Eigenvalues of Trees with Perfect Matchings
Author(s): Wai Chee Shiu | An Chang
Volume: 9
Issue: 1
Year: 2007




Asymptotic behaviour of a non-commutative rational series with a nonnegative linear representation
Author(s): Philippe Dumas | Helger Lipmaa | Johan Wallén
Volume: 9
Issue: 1
Year: 2007




On the complexity of the balanced vertex ordering problem
Author(s): Jan Kara | Jan Kratochvil | David R. Wood
Volume: 9
Issue: 1
Year: 2007




Approximation and Inapproximability Results on Balanced Connected Partitions of Graphs
Author(s): Yoshiko Wakabayashi | Frédéric Chataigner | Liliane Benning Salgado
Volume: 9
Issue: 1
Year: 2007




A combinatorial and probabilistic study of initial and end heights of descents in samples of geometrically distributed random variables and in permutations
Author(s): Helmut Prodinger | Guy Louchard
Volume: 9
Issue: 1
Year: 2007




Complexity Results on Graphs with Few Cliques
Author(s): Bill Rosgen | Lorna Stewart
Volume: 9
Issue: 1
Year: 2007




On the Tileability of Polygons with Colored Dominoes
Author(s): Chris Mark Worman | Boting Yang
Volume: 9
Issue: 1
Year: 2007




A perimeter enumeration of column-convex polyominoes
Author(s): Svjetlan Feretic
Volume: 9
Issue: 1
Year: 2007




FP/FIFO scheduling: coexistence of deterministic and probabilistic QoS guarantees
Author(s): Pascale Minet | Steven Martin | Leila Azouz Saidane | Skander Azzaz
Volume: 9
Issue: 1
Year: 2007




Enumeration of Binary Trees and Universal Types
Author(s): Charles Knessl | Wojciech Szpankowski
Volume: 7
Issue: 1
Year: 2005




On the number of spanning trees of K n m ± Ggraphs
Author(s): Stavros D. Nikolopoulos | Charis Papadopoulos
Volume: 8
Issue: 1
Year: 2006




P 6- and triangle-free graphs revisited: structure and bounded clique-width
Author(s): Andreas Brandstädt | Tilo Klembt | Suhail Mahfud
Volume: 8
Issue: 1
Year: 2006




Approximation Algorithms for Multicoloring Planar Graphs and Powers of Square and Triangular Meshes
Author(s): Mustapha Kchikech | Olivier Togni
Volume: 8
Issue: 1
Year: 2006




Optimal L(h,k)-Labeling of Regular Grids
Author(s): Tiziana Calamoneri
Volume: 8
Issue: 1
Year: 2006




Recognizing HH-free, HHD-free, and Welsh-Powell Opposition Graphs
Author(s): Stavros D. Nikolopoulos | Leonidas Palios
Volume: 8
Issue: 1
Year: 2006




On Sampling Colorings of Bipartite Graphs
Author(s): R. Balasubramanian | C. R. Subramanian
Volume: 8
Issue: 1
Year: 2006




New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks
Author(s): Enrico Angelelli | Maria Grazia Speranza | Tsolt Tuza
Volume: 8
Issue: 1
Year: 2006




An application of results by Hardy, Ramanujan and Karamata to Ackermannian functions
Author(s): Andreas Weiermann
Volume: 6
Issue: 1
Year: 2003




Minimum survivable graphs with bounded distance increase
Author(s): Selma Djelloul | Mekkia Kouider
Volume: 6
Issue: 1
Year: 2003




A new two-variable generalization of the chromatic polynomial
Author(s): Klaus Dohmen | André Poenitz | Peter Tittmann
Volume: 6
Issue: 1
Year: 2003




A Note on Set Systems with no Union of Cardinality 0 modulo m
Author(s): Vince Grolmusz
Volume: 6
Issue: 1
Year: 2003




A bijection between planar constellations and some colored Lagrangian trees
Author(s): Cedric Chauve
Volume: 6
Issue: 1
Year: 2003




Partially Complemented Representations of Digraphs
Author(s): Elias Dahlhaus | Jens Gustedt | Ross M. McConnell
Volume: 5
Issue: 1
Year: 2002




Recognizing the P 4-structure of claw-free graphs and a larger graph class
Author(s): Luitpold Babel | Andreas Brandstädt | Van Bang Le
Volume: 5
Issue: 1
Year: 2002




A Unified Framework to Compute over Tree Synchronized Grammars and Primal Grammars
Author(s): Frédéric Saubion | Igor Stéphan
Volume: 5
Issue: 1
Year: 2002




Upper bounds on the non- 3-colourability threshold of random graphs
Author(s): Nikolaos Fountoulakis | Colin McDiarmid
Volume: 5
Issue: 1
Year: 2002




The Cycles of the Multiway Perfect Shuffle Permutation
Author(s): John Ellis | Hongbing Fan | Jeffrey Shallit
Volume: 5
Issue: 1
Year: 2002




Synthesis of space-time optimal systolic algorithms for the Choleskyfactorization
Author(s): Clémentin Tayou Djamegni
Volume: 5
Issue: 1
Year: 2002




Probabilistic Analysis of CarlitzCompositions
Author(s): Guy Louchard | Helmut Prodinger
Volume: 5
Issue: 1
Year: 2002




Graph Decompositions and Factorizing Permutations
Author(s): Christian Capelle | Michel Habib | Fabien de Montgolfier
Volume: 5
Issue: 1
Year: 2002




Permutations avoiding an increasing number of length-increasing forbidden subsequences
Author(s): Elena Barcucci | Alberto Del Lungo | Elisa Pergola | Renzo Pinzani
Volume: 4
Issue: 1
Year: 2000




SOURgraphs for efficient completion
Author(s): Christopher Lynch | Polina Strogova
Volume: 2
Issue: 1
Year: 1998




An algorithm for analysis of the structure of finitely presented Lie algebras
Author(s): Vladimir P. Gerdt | Vladimir V. Kornyak
Volume: 1
Issue: 1
Year: 1997




A Lie connection between Hamiltonian and Lagrangian optics
Author(s): Alex J. Dragt
Volume: 1
Issue: 1
Year: 1997




Computations in finite-dimensional Lie algebras
Author(s): A. M. Cohen | W. A. de Graaf | L. Rónyai
Volume: 1
Issue: 1
Year: 1997




Finely homogeneous computations in free Lie algebras
Author(s): Philippe Andary
Volume: 1
Issue: 1
Year: 1997




Descendants and ascendants in binary trees
Author(s): Alois Panholzer | Helmut Prodinger
Volume: 1
Issue: 1
Year: 1997




Acyclic, Star and Oriented Colourings of Graph Subdivisions
Author(s): David R. Wood
Volume: 7
Issue: 1
Year: 2005




Stacks, Queues and Tracks: Layouts of Graph Subdivisions
Author(s): Vida Dujmović | David R. Wood
Volume: 7
Issue: 1
Year: 2005




Karp-Miller Trees for a Branching Extension of VASS
Author(s): Kumar Neeraj Verma | Jean Goubault-Larrecq
Volume: 7
Issue: 1
Year: 2005




On the Recognition of Bipolarizable and P 4-simplicial Graphs
Author(s): Stavros D. Nikolopoulos | Leonidas Palios
Volume: 7
Issue: 1
Year: 2005




On P 4-tidy graphs
Author(s): Vassilis Giakoumakis | Florian Roussel | Henri Thuillier
Volume: 1
Issue: 1
Year: 1997




Computing nilpotent quotients in finitely presented Lie rings
Author(s): Csaba Schneider
Volume: 1
Issue: 1
Year: 1997




Connectedness of number theoretical tilings
Author(s): Shigeki Akiyama | Nertila Gjini
Volume: 7
Issue: 1
Year: 2005




Sufficient Conditions for Labelled 0-1 Laws
Author(s): Stanley Burris | Karen Yeats
Volume: 10
Issue: 1
Year: 2008




On quadratic residue codes and hyperelliptic curves
Author(s): David Joyner
Volume: 10
Issue: 1
Year: 2008




Interaction properties of relational periods
Author(s): Tomi Kärki | Tero Harju | Vesa Halava
Volume: 10
Issue: 1
Year: 2008




The Laplacian Spread of a Tree
Author(s): Yi-Zheng Fan | Jing Xu | Yi Wang | Dong Liang
Volume: 10
Issue: 1
Year: 2008




On Hereditary Helly classes of graphs
Author(s): Marina Groshaus | Jayme Luiz Szwarcfiter
Volume: 10
Issue: 1
Year: 2008




Minimum Feedback Vertex Sets in Distance Graphs and Circulant Graphs
Author(s): Hamamache Kheddouci | Olivier Togni
Volume: 10
Issue: 1
Year: 2008




Recurrence among trees with most numerous efficient dominating sets
Author(s): Dorota Bród | Zdzisław Skupień
Volume: 10
Issue: 1
Year: 2008




Total domination in K 5- and K 6-covered graphs
Author(s): Odile Favaron | Hosein Karami | Seyed Mahmoud Sheikholeslami
Volume: 10
Issue: 1
Year: 2008




Bounded-Degree Graphs have Arbitrarily Large Queue-Number
Author(s): David R. Wood
Volume: 10
Issue: 1
Year: 2008




On the Critical Exponent of Generalized Thue-Morse Words
Author(s): Alexandre Blondin-Massé | Srečko Brlek | Amy Glen | Sébastien Labbé
Volume: 9
Issue: 1
Year: 2007




Tribes of cubic partial cubes
Author(s): Sandi Klavžar | Sergey Shpectorov
Volume: 9
Issue: 1
Year: 2007




Latin Square Thue-Morse Sequences are Overlap-Free
Author(s): Christopher Robinson Tompkins
Volume: 9
Issue: 1
Year: 2007




TrivializingGeneralizations of some Izergin-Korepin-type Determinants
Author(s): Tewodros Amdeberhan | Doron Zeilberger
Volume: 9
Issue: 1
Year: 2007




Independent Sets in Graphs with an Excluded Clique Minor
Author(s): David R. Wood
Volume: 9
Issue: 1
Year: 2007




A lower bound for approximating grundy numbering
Author(s): Guy Kortsarz
Volume: 9
Issue: 1
Year: 2007




A Cartesian closed category of event structures with quotients
Author(s): Samy Abbes
Volume: 8
Issue: 1
Year: 2006




The first descent in samples of geometric random variables and permutations
Author(s): Arnold Knopfmacher | Helmut Prodinger
Volume: 8
Issue: 1
Year: 2006




Common intervals in permutations
Author(s): Sylvie Corteel | Guy Louchard | R. Pemantle
Volume: 8
Issue: 1
Year: 2006




On randomly colouring locally sparse graphs
Author(s): Alan Frieze | Juan Vera
Volume: 8
Issue: 1
Year: 2006




On the Computability of the Topological Entropy of Subshifts
Author(s): Jakob Grue Simonsen
Volume: 8
Issue: 1
Year: 2006




Generalized connected domination in graphs
Author(s): M. Kouider | P.D. Vestergaard
Volume: 8
Issue: 1
Year: 2006




Survey of Multivariate Aspects of the Contraction Method
Author(s): Ludger Rüschendorf | Ralf Neininger
Volume: 8
Issue: 1
Year: 2006




Efficient maxima-finding algorithms for random planar samples
Author(s): Wei-Mei Chen | Hsien-Kuei Hwang | Tsung-Hsi Tsai
Volume: 6
Issue: 1
Year: 2003




Fountains, histograms, and q-identities
Author(s): Peter Paule | Helmut Prodinger
Volume: 6
Issue: 1
Year: 2003




Numerical Studies of the Asymptotic Height Distribution in Binary Search Trees
Author(s): Charles Knessl
Volume: 6
Issue: 1
Year: 2003




Some Algebraic Aspects of MorseCode Sequences
Author(s): Johann Cigler
Volume: 6
Issue: 1
Year: 2003




The b-chromatic number of power graphs
Author(s): Brice Effantin | Hamamache Kheddouci
Volume: 6
Issue: 1
Year: 2003




Counting occurrences of some subword patterns
Author(s): Alexander Burstein | Toufik Mansour
Volume: 6
Issue: 1
Year: 2003




Performance analysis of demodulation with diversity -- A combinatorial approach I: Symmetric function theoretical methods
Author(s): Jean-Louis Dornstetter | Daniel Krob | Jean-Yves Thibon | Ekaterina A. Vassilieva
Volume: 5
Issue: 1
Year: 2002




On a Unimodality Conjecture in Matroid Theory
Author(s): W. M. B. Dukes
Volume: 5
Issue: 1
Year: 2002




Multicolored isomorphic spanning trees in complete graphs
Author(s): Gregory Constantine
Volume: 5
Issue: 1
Year: 2002




Lyndon factorization of generalized words of Thue
Author(s): Anton Černý
Volume: 5
Issue: 1
Year: 2002




The Stack-Size of Combinatorial Tries Revisited
Author(s): Markus E. Nebel
Volume: 5
Issue: 1
Year: 2002




Avoiding maximal parabolic subgroups of S k
Author(s): Toufik Mansour | Alek Vainshtein
Volume: 4
Issue: 1
Year: 2000




Improved inclusion-exclusion identities via closure operators
Author(s): Klaus Dohmen
Volume: 4
Issue: 1
Year: 2000




Object grammars and random generation
Author(s): I. Dutour | J. M. Fédou
Volume: 2
Issue: 1
Year: 1998




Right-cancellability of a family of operations on binary trees
Author(s): Philippe Duchon
Volume: 2
Issue: 1
Year: 1998




Controllability of affine right-invariant systems on solvable Lie groups
Author(s): Yuri L. Sachkov
Volume: 1
Issue: 1
Year: 1997




Special issue: 'Lie Computations'
Author(s): Gérard Jacob | Pierre-Vincent Koseleff
Volume: 1
Issue: 1
Year: 1997




Infinite families of accelerated series for some classical constants by the Markov-WZ Method
Author(s): Mohamud Mohammed
Volume: 7
Issue: 1
Year: 2005




Graphs of low chordality
Author(s): L. Sunil Chandran | Vadim V. Lozin | C. R. Subramanian
Volume: 7
Issue: 1
Year: 2005




Dihedral f-tilings of the sphere by rhombi and triangles
Author(s): Ana M. Breda | Altino F. Santos
Volume: 7
Issue: 1
Year: 2005




Tilings from some non-irreducible, Pisot substitutions
Author(s): Shunji Ito | Hiromi Ei
Volume: 7
Issue: 1
Year: 2005




An extremal problem on potentially K p,1,1-graphic sequences
Author(s): Chunhui Lai
Volume: 7
Issue: 1
Year: 2005




Some equinumerous pattern-avoiding classes of permutations
Author(s): M. D. Atkinson
Volume: 7
Issue: 1
Year: 2005




Algebraic elimination of ε-transitions
Author(s): Gérard H. E. Duchamp | Hatem Hadj Kacem | Éric Laugerotte
Volume: 7
Issue: 1
Year: 2005




Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete
Author(s): Nesrine Abbas | Joseph Culberson | Lorna Stewart
Volume: 7
Issue: 1
Year: 2005




On the maximum average degree and the incidence chromatic number of a graph
Author(s): Mohammad Hosseini Dolama | Eric Sopena
Volume: 7
Issue: 1
Year: 2005




Lyndon factorization of the Thue- Morse word and its relatives
Author(s): Augustin Ido | Guy Melançon
Volume: 1
Issue: 1
Year: 1997




A direct bijective proof of the hook-length formula
Author(s): Jean-Christophe Novelli | Igor Pak | Alexander V. Stoyanovskii
Volume: 1
Issue: 1
Year: 1997




Note on the weighted internal path length of b-ary trees
Author(s): Ludger Rüschendorf | Eva-Maria Schopp
Volume: 9
Issue: 1
Year: 2007




Some new optimal and suboptimal infinite families of undirected double-loop networks
Author(s): Bao Xing Chen | Ji Xiang Meng | Wen Jun Xiao
Volume: 8
Issue: 1
Year: 2006




Counting ℓ-letter subwords in compositions
Author(s): Toufik Mansour | Basel Sirhan
Volume: 8
Issue: 1
Year: 2006




d-records in geometrically distributed random variables
Author(s): Helmut Prodinger
Volume: 8
Issue: 1
Year: 2006




Ordered Vertex Partitioning
Author(s): Ross M. McConnell | Jeremy P. Spinrad
Volume: 4
Issue: 1
Year: 2000




Unification of Higher-order Patterns modulo Simple Syntactic Equational Theories
Author(s): Alexandre Boudet
Volume: 4
Issue: 1
Year: 2000




Sums of Digits, Overlaps, and Palindromes
Author(s): Jean-Paul Allouche | Jeffrey Shallit
Volume: 4
Issue: 1
Year: 2000




NP-Completeness Results for Minimum Planar Spanners
Author(s): Ulrik Brandes | Dagmar Handke
Volume: 3
Issue: 1
Year: 1998




Lower bounds for sparse matrix vector multiplication on hypercubic networks
Author(s): Giovanni Manzini
Volume: 2
Issue: 1
Year: 1998




On the bialgebra of functional graphs and differential algebras
Author(s): Maurice Ginocchio
Volume: 1
Issue: 1
Year: 1997




Noncommutative symmetric functions III: Deformations of Cauchy and convolution algebras
Author(s): Gérard H. E. Duchamp | Alexander Klyachko | Daniel Krob | Jean-Yves Thibon
Volume: 1
Issue: 1
Year: 1997




BERGMAN under MS-DOS and Anick's resolution
Author(s): S. Cojocaru | V. Ufnarovski
Volume: 1
Issue: 1
Year: 1997




E-unification by means of tree tuple synchronized grammars
Author(s): Sébastien Limet | Pierre Réty
Volume: 1
Issue: 1
Year: 1997




The height of q-Binary Search Trees
Author(s): Michael Drmota | Helmut Prodinger
Volume: 5
Issue: 1
Year: 2002



