Discrete Mathematics & Theoretical Computer Science, Volume 4

Volume 4, Number 1, 2000

• Jean-Paul Allouche, Jeffrey Shallit:
  Sums of Digits, Overlaps, and Palindromes. 1-10
  
• Alexandre Boudet:
  Unification of Higher-order Patterns modulo Simple Syntactic Equational Theories. 11-30
  
• Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani:
  Permutations avoiding an increasing number of length-increasing forbidden subsequences. 31-44
  
• Ross M. McConnell, Jeremy Spinrad:
  Ordered Vertex Partitioning. 45-60
  
• Klaus Dohmen:
  Improved inclusion-exclusion identities via closure operators. 61-66
  
• Toufik Mansour, Alek Vainshtein:
  Avoiding maximal parabolic subgroups of S_k. 81-90
  

Volume 4, Number 2, 2001

• Anna Bernasconi:
  On a hierarchy of Boolean functions hard to compute in constant depth. 79-90
  
• Johannes Grassberger, Günther Hörmann:
  A note on representations of the finite Heisenberg group and sums of greatest common divisors. 91-100
  
• Roberto Mantaci, Fanja Rakotondrajao:
  A permutations representation that knows what "Eulerian" means. 101-108
  
• Chính T. Hoàng, Van Bang Le:
  P4-Colorings and P4-Bipartite Graphs. 109-122
  
• Eugene Curtin:
  Cubic Cayley graphs with small diameter. 123-132
  
• C. R. Subramanian:
  Paths of specified length in random k-partite graphs. 133-138
  
• Nir Menakerman, Raphael Rom:
  Analysis of Transmissions Scheduling with Packet Fragmentation. 139-156
  
• David W. Krumme, Paraskevi Fragopoulou:
  Minimum Eccentricity Multicast Trees. 157-172
  
• Michel Habib, Christophe Paul, Laurent Viennot:
  Linear time recognition of P4-indifference graphs. 173-178
  
• Timo Peichl, Heribert Vollmer:
  Finite Automata with Generalized Acceptance Criteria. 179-192
  
• Martin Müller, Joachim Niehren, Ralf Treinen:
  The first-order theory of ordering constraints over feature trees. 193-234
  
• C. D. Randazzo, Henrique Pacca Loureiro Luna, P. Mahey:
  Benders decomposition for local access network design with two technologies. 235-246
  
• Vince Grolmusz:
  A Degree-Decreasing Lemma for (MOD q - MOD p) Circuits. 247-254
  
• Damien Magoni, Jean-Jacques Pansiot:
  Oriented multicast routing algorithm applied to network-level agent search. 255-272
  
• Ján Manuch:
  Defect Effect of Bi-infinite Words in the Two-element Case. 273-290
  
• Lawrence S. Moss:
  Simple Equational Specifications of Rational Arithmetic. 291-300
  
• Jessica H. Fong, Martin Strauss:
  An Approximate Lp Difference Algorithm for Massive Data Streams. 301-322
  
• Gabrielle Assunta Grün:
  An Efficient Algorithm for the Maximum Distance Problem. 323-350
  
• Pascal Koiran:
  The topological entropy of iterated piecewise affine maps is uncomputable. 351-356
  
• Anna E. Frid:
  Overlap-free symmetric D0L words. 357-362
  
• Werner Schachinger:
  Asymptotic normality of recursive algorithms via martingale difference arrays. 363-398