


default search action
Theoretical Computer Science, Volume 148
Volume 148, Number 1, 21 August 1995
- Phil Diamond, Peter Kloeden, Victor S. Kozyakin

, Alexei Pokrovskii:
On the Fragmentary Complexity of Symbolic Sequences. 1-17 - Bruno Durand:

A Random NP-Complete Problem for Inversion of 2D Cellular Automata. 19-32 - Liming Cai, Jianer Chen:

On Input Read-Modes of Alternating Turing Machines. 33-55 - Takayoshi Shoudai, Satoru Miyano:

Using Maximal Independent Sets to Solve Problems in Parallel. 57-65 - Ratnesh Kumar, Vijay K. Garg:

Extremal Solutions of Inequations over Lattices with Applications to Supervisory Control. 67-92 - Hans L. Bodlaender

, Klaus Jansen:
Restrictions of Graph Partition Problems. Part I. 93-109 - Ingo Althöfer, Jörg Bültermann:

Superlinear Period Lengths in Some Subtraction Games. 111-119 - André Arnold:

An Initial Semantics for the mu-Calculus on Trees and Rabin's Complementation Lemma. 121-132 - Devdatt P. Dubhashi, Grammati E. Pantziou

, Paul G. Spirakis, Christos D. Zaroliagis
:
The Fourth Moment in Luby's Distribution. 133-140 - Don Kimber, Philip M. Long:

On-Line Learning of Smooth Functions of a Single Variable. 141-156 - Kenichi Morita

:
Reversible Simulation of One-Dimensional Irreversible Cellular Automata. 157-163 - Uri Zwick:

The Smallest Networks on Which the Ford-Fulkerson Maximum Flow Procedure may Fail to Terminate. 165-170 - Maria Cristina Pinotti

, Geppino Pucci
:
Parallel Algorithms for Priority Queue Operations. 171-180
Volume 148, Number 2, 4 September 1995
- Carme Àlvarez, Birgit Jenner:

On Adaptive DLOGTIME and POLYLOGTIME Reductions. 183-205 - Bernd Borchert:

On the Acceptance Power of Regular Languages. 207-225 - Véronique Bruyère, Clelia de Felice

, Giovanna Guaiana:
On Some Decision Problems for Trace Codings. 227-260 - Kousha Etessami, Neil Immerman:

Reachability and the Power of Local Ordering. 261-279 - Petr Jancar

:
Undecidability of Bisimilarity for Petri Nets and Some Related Problems. 281-301 - François Laroussinie, Philippe Schnoebelen:

A Hierarchy of Temporal Logics with Past. 303-324 - Ashish V. Naik, Kenneth W. Regan, D. Sivakumar:

On Quasilinear-Time Complexity Theory. 325-349

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














