- 2003
- Ali Aberkane:
Words whose complexity satisfies lim p(n)/n = 1. Theor. Comput. Sci. 307(1): 31-46 (2003) - Boris Adamczewski:
Balances for fixed points of primitive substitutions. Theor. Comput. Sci. 307(1): 47-75 (2003) - Jean-Paul Allouche
, Jeffrey O. Shallit:
The ring of k-regular sequences, II. Theor. Comput. Sci. 307(1): 3-29 (2003) - Dimitry S. Ananichev, Alessandra Cherubini, Mikhail V. Volkov:
Image reducing words and subgroups of free groups. Theor. Comput. Sci. 307(1): 77-92 (2003) - Didier Arquès, Anne Micheli:
A generalization of the language of ukasiewicz coding rooted planar hypermaps. Theor. Comput. Sci. 307(2): 221-239 (2003) - Sergei L. Bezrukov, Robert Elsässer:
Edge-isoperimetric problems for cartesian powers of regular graphs. Theor. Comput. Sci. 307(3): 473-492 (2003) - Béla Bollobás, Imre Leader:
Union of shadows. Theor. Comput. Sci. 307(3): 493-502 (2003) - Nicolas Bonichon, Mohamed Mosbah:
Watermelon uniform random generation with applications. Theor. Comput. Sci. 307(2): 241-256 (2003) - Mireille Bousquet-Mélou, Marko Petkovsek:
Walks confined in a quadrant are not always D-finite. Theor. Comput. Sci. 307(2): 257-276 (2003) - Michel Bousquet, Cédric Chauve, Gilbert Labelle, Pierre Leroux:
Two bijective proofs for the arborescent form of the Good-Lagrange formula and some applications to colored rooted trees and cacti. Theor. Comput. Sci. 307(2): 277-302 (2003) - Tiziana Calamoneri, Annalisa Massini, Imrich Vrto:
New results on edge-bandwidth. Theor. Comput. Sci. 307(3): 503-513 (2003) - E. Rodney Canfield:
Integer partitions and the Sperner property. Theor. Comput. Sci. 307(3): 515-529 (2003) - Tullio Ceccherini-Silberstein, Antonio Machi, Fabio Scarabotti:
On the entropy of regular languages. Theor. Comput. Sci. 307(1): 93-102 (2003) - Tullio Ceccherini-Silberstein, Wolfgang Woess:
Growth-sensitivity of context-free languages. Theor. Comput. Sci. 307(1): 103-116 (2003) - L. Sunil Chandran, Louis Ibarra, Frank Ruskey, Joe Sawada:
Generating and characterizing the perfect elimination orderings of a chordal graph. Theor. Comput. Sci. 307(2): 303-317 (2003) - Emeric Deutsch, Helmut Prodinger:
A bijection between directed column-convex polyominoes and ordered trees of height at most three. Theor. Comput. Sci. 307(2): 319-325 (2003) - Josep Díaz, Norman Do, Maria J. Serna, Nicholas C. Wormald:
Bounds on the max and min bisection of random cubic and random 4-regular graphs. Theor. Comput. Sci. 307(3): 531-547 (2003) - Robert Elsässer, Rastislav Kralovic, Burkhard Monien:
Sparse topologies with small spectrum size. Theor. Comput. Sci. 307(3): 549-565 (2003) - Luca Ferrari, Elisabetta Grazzini, Elisa Pergola, Simone Rinaldi:
Some bijective results about the area of Schröder paths. Theor. Comput. Sci. 307(2): 327-335 (2003) - Wit Forys, Tomasz Krawczyk, James A. Anderson:
Semiretracts--a counterexample and some results. Theor. Comput. Sci. 307(1): 117-127 (2003) - Yannick Guesnet:
On maximal synchronous codes. Theor. Comput. Sci. 307(1): 129-138 (2003) - Tero Harju, Dirk Nowotka:
On the independence of equations in three variables. Theor. Comput. Sci. 307(1): 139-172 (2003) - Lawrence H. Harper:
Accidental combinatorist, an autobiography. Theor. Comput. Sci. 307(3): 457-472 (2003) - Christophe Hohlweg, Christophe Reutenauer:
Lyndon words, permutations and trees. Theor. Comput. Sci. 307(1): 173-178 (2003) - Gilbert Labelle, Cédric Lamathe, Pierre Leroux:
A classification of plane and planar 2-trees. Theor. Comput. Sci. 307(2): 337-363 (2003) - David Muradian:
The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete. Theor. Comput. Sci. 307(3): 567-572 (2003) - Marc Noy:
Graphs determined by polynomial invariants. Theor. Comput. Sci. 307(2): 365-384 (2003) - Dominique Poulalhon, Gilles Schaeffer:
A bijection for triangulations of a polygon with interior points and multiple edges. Theor. Comput. Sci. 307(2): 385-401 (2003) - Patrice Séébold:
Lyndon factorization of the Prouhet words. Theor. Comput. Sci. 307(1): 179-197 (2003) - Louis W. Shapiro:
Bijections and the Riordan group. Theor. Comput. Sci. 307(2): 403-413 (2003)
