default search action
Theoretical Computer Science, Volume 249
Volume 249, Number 1, 17 October 2000
- Klaus Keimel, Michael W. Mislove, Constantine Tsinakis:
Modern Algebra - Foreword. 1 - Jan J. M. M. Rutten:
Universal coalgebra: a theory of systems. 3-80 - Chantal Berline:
From computation to foundations via functions and application: The -calculus and its webbed models. 81-161 - Frank J. Oles:
An application of lattice theory to knowledge representation. 163-196 - Antonino Salibra:
On the algebraic models of lambda calculus. 197-240
Volume 249, Number 2, 28 October 2000
- Costas S. Iliopoulos:
Combinatorial Algorithms - Preface. 241 - Paul E. Dunne, Alan Gibbons, Michele Zito:
Complexity-theoretic models of phase transitions in search problems. 243-263 - Aviezri S. Fraenkel:
Recent results and questions in combinatorial game complexities. 265-288 - Frantisek Franek, Ayse Karaman, W. F. Smyth:
Repetitions in Sturmian strings. 289-303 - Jan Holub, Borivoj Melichar:
Approximate string matching using factor automata. 305-311 - Laurent Mouchard:
Normal forms of quasiperiodic strings. 313-324 - Somasundaram Ravindran, Alan Gibbons, Mike Paterson:
Dense edge-disjoint embedding of complete binary trees in interconnection networks. 325-342 - W. F. Smyth:
Repetitive perhaps, but certainly not boring. 343-355 - Sanming Zhou:
Bounding the bandwidths for graphs. 357-368
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.