Theoretical Computer Science, Volume 123

Volume 123, Number 1, 17 January 1994

• Jean-Paul Allouche:
  Note on the Cyclic Towers of Hanoi. 3-7
  
• Marc Roland Assous, Vincent Bouchitté, Christine Charretton, Brigitte Rozoy:
  Finite Labelling Problem in Event Structures. 9-19
  
• A. Bertrand:
  Sur une conjecture d'Yves Métivier. 21-30
  
• Claude Bertrand:
  A Natural Semantics of First-Order Type Dependency. 31-53
  
• François Blanchard, S. Fabre:
  Quelques procédés engendrant des suites infinies. 55-60
  
• Jean-Pierre Borel:
  Symbolic Representation of Piecewise Linear Functions on the Unit Interval and Application to Discrepancy. 61-87
  
• Claude Chaunier, Nik Lygeros:
  Le nombre de posets à isomorphie près ayant 12 èlèments. 89-94
  
• Hervé Daudé, Brigitte Vallée:
  An Upper Bound on the Average Number of Iterations of the LLL Algorithm. 95-115
  
• Dominique Duval, Pascale Sénéchaud:
  Sketches and Parametrization. 117-130
  
• Henri Faure:
  Méthodes quasi-Monte-Carlo multidimensionnelles. 131-137
  
• Zbigniew S. Kowalski:
  Multiple Returns Under a Bounded Number of Iterations. 139-144
  
• Maurice Mignotte:
  Sur l'équation de Catalan, II. 145-149
  
• Eric Rémila:
  A Linear Algorithm to Tile the Trapezes with h_m and v_n. 151-165
  
• Xiangdong Ye:
  Coexistence of Uniquely Ergodic Subsystems of Interval Mapping. 167-181
  

Volume 123, Number 2, 31 January 1994

• Dung T. Huynh, Lu Tian:
  Deciding Bisimilarity of Normed Context-Free Processes is in Sigma^p_2. 183-197
  
• Bruno Martin:
  A Universal Cellular Automaton in Quasi-Linear Time and its S-m-n Form. 199-237
  
• Francine Blanchet-Sadri:
  Equations and Monoid Varieties of Dot-Depth One and Two. 239-258
  
• Mireille Clerbout, D. Gonzalez:
  Atomic Semicommutations. 259-272
  
• Jean-Camille Birget, Stuart W. Margolis, John C. Meakin:
  The Word Problem for Inverse Monoids Presented by One Idempotent Relator. 273-289
  
• Philippe Flajolet, Peter J. Grabner, Peter Kirschenhofer, Helmut Prodinger, Robert F. Tichy:
  Mellin Transforms and Asymptotics: Digital Sums. 291-314
  
• Kunimasa Aoki, Juichi Shinoda, Teruko Tsuda:
  On Pi_2 Theories of hp-T Degrees of Low Sets. 315-327
  
• Shigeki Iwata, Takumi Kasai:
  The Othello game on an n*n board is PSPACE-complete. 329-340
  
• Daniel Mey:
  Finite Games for a Predicate Logic Without Contractions. 341-349
  
• Grahame Bennett:
  Double Dipping: the Case of the Missing Binomial Coefficient Identities. 351-375
  
• Dexter Kozen, Shmuel Zaks:
  Optimal Bounds for the Change-Making Problem. 377-388
  
• Maria M. Klawe:
  Shallow Grates. 389-395
  
• Serge Burckel:
  Functional Equations Associated with Congruential Functions. 397-406
  
• Edith Hemaspaandra, Lane A. Hemaspaandra:
  Quasi-injective Reductions. 407-413
  
• Naomi Nishimura:
  Restricted CRCW PRAM. 415-426
  
• Burkhard Monien, Wojciech Rytter, Helmut Schäpers:
  Corrigendum: Fast Recognition of Deterministic CFL's with a Smaller Number of Processors. 427-428, (see: TCS 116: 421-429 (1993))

Last update Fri May 24 20:53:05 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page