Journal: Theoretical Computer Science

Volume 1, Issue 4

269 -- 288Sheila A. Greibach. Remarks on the Complexity of Nondeterministic Counter Languages
289 -- 295Claus-Peter Schnorr. The Combinational Complexity of Equivalence
297 -- 316Emily P. Friedman. The Inclusion Problem for Simple Languages
317 -- 323Juhani Karhumäki. Two Theorems Concerning Recognizable N-Subsets of sigma*
325 -- 330Andrzej Ehrenfeucht, Grzegorz Rozenberg, Sven Skyum. A Relationship between ET0L and EDT0L Languages
331 -- 354V. Wiktor Marek, Zdzislaw Pawlak. Information Storage and Retrieval Systems: Mathematical Foundations
355 -- 361Michael L. Fredman. How Good is the Information Theory Bound in Sorting?

Volume 1, Issue 303

3 -- 5Danièle Beauquier, Dimitri Grigoriev, Yuri Matiyasevich. Biography of A.O. Slissenko
7 -- 34André Arnold, Aymeric Vincent, Igor Walukiewicz. Games for synthesis of controllers with partial observation
35 -- 51Alessandra Carbone, Misha Gromov. Functional labels and syntactic entropy on DNA strings and proteins
53 -- 62Patrick Cégielski, François Heroult, Denis Richard. On the amplitude of intervals of natural numbers whose every element has a common prime divisor with at least an extremity
63 -- 81Michael I. Dekhtyar, Alexander Ja. Dikovsky, Mars K. Valiev. On feasible cases of checking multi-agent systems behavior
83 -- 102Dima Grigoriev, Edward A. Hirsch. Algebraic proof systems over formulas
103 -- 133Irène Guessarian, Eugénie Foustoucos, Theodore Andronikos, Foto N. Afrati. On temporal logic versus datalog
135 -- 156Roman M. Kolpakov, Gregory Kucherov. Finding approximate repetitions under Hamming distance
157 -- 170Johann A. Makowsky, Julian Mariño. Tree-width and the monadic quantifier hierarchy
171 -- 185Larisa Maksimova. Complexity of some problems in positive and related calculi
187 -- 213Grigori Mints. A termination proof for epsilon substitution using partial derivations
215 -- 231Damian Niwinski, Igor Walukiewicz. A gap property of deterministic tree languages
233 -- 243Alexander A. Razborov. Resolution lower bounds for the weak functional pigeonhole principle
245 -- 260Sergei Soloviev, Vladimir Orevkov. On categorical equivalence of Gentzen-style derivations in IMLL

Volume 1, Issue 3

193 -- 198Robert Moll. An Operator Embedding Theorem for Complexity Classes of Recursive Functions
199 -- 214Jan van Leeuwen, Derick Wood. A Decomposition Theorem for Hyper-Algebraic Extensions of Language Families
215 -- 226Ronald V. Book. Translational Lemmas, Polynomial Time, and (log n)^j-Space
227 -- 235Maurice Mignotte. Algorithmes rélatifs á la décomposition dds oolynômes
237 -- 267M. R. Garey, David S. Johnson, Larry J. Stockmeyer. Some Simplified NP-Complete Graph Problems

Volume 1, Issue 298

5 -- 19Akihiro Yamamoto. Hypothesis finding based on upward refinement of residue hypotheses
21 -- 50Hiroshi Sakamoto, Kouichi Hirata, Hiroki Arimura. Learning elementary formal systems with queries
51 -- 70Steffen Lange, Gunter Grieser, Klaus P. Jantke. Advanced elementary formal systems
71 -- 87Steffen Lange, Jochen Nessel. Decision lists over regular patterns
89 -- 110Yasuhito Mukouchi, Masako Sato. Refutable language learning with a neighbor system
111 -- 143Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas Zeugmann. On learning of functions refutably
145 -- 177Wolfgang Merkle, Frank Stephan. Refuting learning revisited
179 -- 206Takashi Yokomori. Polynomial-time identification of very simple grammars from positive data
207 -- 233Seishi Okamoto, Nobuhiro Yugami. Effects of domain characteristics on instance-based learning algorithms
235 -- 251Tatsuya Akutsu, Satoru Kuhara, Osamu Maruyama, Satoru Miyano. Identification of genetic networks by strategic gene disruptions and gene overexpressions under a boolean model
253 -- 272Takuya Kida, Tetsuya Matsumoto, Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa. Collage system: a unifying framework for compressed pattern matching

Volume 1, Issue 2

95 -- 101Antonio Restivo. A Combinatorial Property of Codes Having Finite Synchronization Delay
103 -- 123Richard E. Ladner, Nancy A. Lynch, Alan L. Selman. A Comparison of Polynomial Time Reducibilities
125 -- 159Gordon D. Plotkin. Call-by-Name, Call-by-Value and the lambda-Calculus
161 -- 183L. H. Harper, W. N. Hsieh, S. E. Savage. A Class of Boolean Functions with Linear Combinational Complexity
185 -- 190Franco P. Preparata. A Fast Stable Sorting Algorithm with Absolutely Minimum Storage

Volume 1, Issue 1

1 -- 12A. A. Schönhage. A Lower Bound for the Length of Addition Chains
13 -- 20Mike Paterson. Complexity of Monotone Networks for Boolean Matrix Product
21 -- 25Volker Strassen. Die Berechnungskomplexität der Symbolischen Differentiation von Interpolationspolynomen
27 -- 57Gérard P. Huet. A Unification Algorithm for Typed lambda-Calculus
59 -- 75Andrzej Ehrenfeucht, K. P. Lee, Grzegorz Rozenberg. Subword Complexities of Various Classes of Deterministic Developmental Languages without Interactions
77 -- 91Ann Reedy, Walter J. Savitch. The Turing Degree of the Inherent Ambiguity Problem for Context-Free Languages