


default search action
Information and Control, Volume 63
Volume 63, Number 1-2, 1984
- Benjamin Arazi

:
An Approach for Generating Different Types of Gray Codes. 1-10 - Yishai A. Feldman:

A Decidable Propositional Dynamic Logic with Explicit Probabilities. 11-38 - Richard Cole, Chee-Keng Yap:

Geometric Retrieval Problems. 39-57 - Paliath Narendran, Friedrich Otto, Karl Winklmann:

The Uniform Conjugacy Problem for Finite Church-Rosser Thue Systems is NP-Complete. 58-66 - J. M. Robson:

Fast Probabilistic RAM Simulation of Single Tape Turing Machine Computations. 67-87 - A. Prasad Sistla, Edmund M. Clarke, Nissim Francez, Albert R. Meyer

:
Can Message Buffers Be Axiomatized in Linear Temporal Logic? 88-112 - H. C. M. Kleijn, Martti Penttonen, Grzegorz Rozenberg, Kai Salomaa:

Direction Independent Context-Sensitive Grammars. 113-117 - David Harel, Dexter Kozen:

A Programming Language for the Inductive Sets, and Applications. 118-139
Volume 63, Number 3, 1984
- Ralf Hartmut Güting:

Dynamic C-Oriented Polygonal Intersections Searching. 143-163 - Deborah S. Franzblau, Daniel J. Kleitman:

An Algorithm for Covering Polygons with Rectangles. 164-189 - Andrzej Ehrenfeucht, Grzegorz Rozenberg:

An Easy Proof of Greibach Normal Form. 190-199 - Mohamed G. Gouda, Eric G. Manning, Yao-Tin Yu:

On the Progress of Communications between Two Finite State Machines. 200-216 - Miklós Ajtai, Michael L. Fredman, János Komlós:

Hash Functions for Priority Queues. 217-225

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














