default search action
Theoretical Computer Science, Volume 191
Volume 191, Numbers 1-2, 30 January 1998
- Patrice Naudin, Claude Quitté:
Univariate Polynomial Factorization Over Finite Fields. 1-36 - Victor L. Selivanov:
Fine Hierarchy of Regular Omega-Languages. 37-59 - Christiane Frougny, Jacques Sakarovitch:
Synchronisation déterministe des automates à délai borné. 61-77 - Douadi Mihoubi:
Characterization and Closure Properties of Linear Omega-Languages. 79-95 - Rodney G. Downey, Michael R. Fellows, Kenneth W. Regan:
Parameterized Circuit Complexity and the W Hierarchy. 97-115 - Véronique Bruyère, Denis Derencourt, Michel Latteux:
The Meet Operation in the Lattice of Codes. 117-129 - Dany Breslauer:
The Suffix Tree of a Tree and Minimizing Sequential Transducers. 131-144 - Antoni Koscielski, Leszek Pacholski:
Makanin's Algorithm is not Primitive Recursive. 145-156 - Thomas S. Ferguson:
Some Chip Transfer Games. 157-171 - Valtteri Niemi, Ari Renvall:
Secure Multiparty Computations Without Computers. 173-183 - Steven M. Kautz:
An Improved Zero-One Law for Algorithmically Random Sequences. 185-192 - Gerd Eriksson, Henrik Eriksson, Kimmo Eriksson:
Moving a Food Trolley Around a Corner. 193-203 - Martin Middendorf:
Shortest Common Superstrings and Scheduling with Coordinated Starting Times. 205-214 - Oded Goldreich, Bernd Meyer:
Computational Indistinguishability: Algorithms vs. Circuits. 215-218 - Jing Wang:
Finite Derivation Type for Semi-Direct Products of Monoids. 219-228 - Eric Angel, Vassilis Zissimopoulos:
Autocorrelation Coefficient for the Graph Bipartitioning Problem. 229-243 - Richard Beigel, William I. Gasarch, Ming Li, Louxin Zhang:
Addition in log2n + O(1) Steps on Average: A Simple Analysis. 245-248
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.