default search action
Theoretical Computer Science, Volume 53
Volume 53, 1987
- Eric G. Wagner:
A Categorical Treatment of Pre- and Post-Conditions. 3-24 - Gilberto Filé:
Classical and Incremental Attribute Evaluation by Means of Recursive Procedures. 25-65 - David de Frutos-Escrig:
Probabilistic Ianov's Schemes. 67-97 - Guy Louchard:
Random Walks, Gaussian Processes and List Structures. 99-124 - Alex Pelin, Jean H. Gallier:
Building Exact Computation Sequences. 125-150 - Alberto Pettorossi:
Derivation of Efficient Programs for Computing Sequences of Actions. 151-167 - Hagit Attiya, Yishay Mansour:
Language Complexity on the Synchronous Anonymous Ring. 169-185 - Igor Litovsky, Erick Timmerman:
On Generators of Rational omega-Power Languages. 187-200 - Claus-Peter Schnorr:
A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms. 201-224 - Samson Abramsky:
Observation Equivalence as a Testing Equivalence. 225-241 - Zoltán Ésik, Ferenc Gécseg:
On a Representation of Tree Automata. 243-255 - Haiko Müller, Andreas Brandstädt:
The NP-Completeness of Steiner Tree and Dominating Set for Chordal Bipartite Graphs. 257-265 - Meurig Beynon, John Buckle:
On the Planar Monotone Computation of Boolean Functions. 267-279 - David Peleg, Eli Upfal:
The Generalized Packet Routing Problem. 281-293 - Wojciech Rytter, Raffaele Giancarlo:
Optimal Parallel Parsing of Bracket Languages. 295-306 - Max H. Garzon:
Cyclic Automata. 307-317 - Taishin Y. Nishida, Youichi Kobuchi:
Repeatable Words for Substitution. 319-333 - Lars Hallnäs:
An Intensional Characterization of the Largest Bisimulation. 335-343 - Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney, Jorge Urrutia:
Geometric Containment and Vector Dominance. 345-352
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.