researchr
explore
Tags
Journals
Conferences
Authors
Profiles
Groups
calendar
New Conferences
Events
Deadlines
search
search
You are not signed in
Sign in
Sign up
External Links
Journal: J. Comput. Syst. Sci.
Home
Index
Info
Volume
Volume
29
, Issue
3
303
--
311
Paul M. B. Vitányi
.
On Two-Tape Real-Time Computation and Queues
312
--
329
Tatsuya Motoki
.
An Application of Cohen s Result on Star Height to the Theory of Control Structures
330
--
337
Mikhail J. Atallah
,
Uzi Vishkin
.
Finding Euler Tours in Parallel
338
--
358
Nathan Goodman
,
Oded Shmueli
,
Y. C. Tay
.
GYO Reductions, Canonical Connections, Tree and Cyclic Schemas, and Tree Projections
359
--
365
David Harel
,
Mike Paterson
.
Undecidability of PDL with L={a^(2i)|i>=0}
366
--
408
Joost Engelfriet
,
Giora Slutzki
.
Extended Macro Grammars and Stack Controlled Machines
409
--
445
Clement T. Yu
,
Z. Meral Özsoyoglu
,
K. Lam
.
Optimization of Distributed Tree Queries
Volume
29
, Issue
2
133
--
152
W.-J. Hsu
,
M. W. Du
.
New Algorithms for the LCS Problem
153
--
159
Antonio Restivo
,
Christophe Reutenauer
.
On Cancellation Properties of Languages which are Supports of Ration Power Series
160
--
170
Albert R. Meyer
,
Jerzy Tiuryn
.
Equivalences among Logics of Programs
171
--
182
Hiromi Miyajima
,
Masateru Harao
,
Shoichi Noguchi
.
Indecomposable Maps in Tessellation Structures of Arbitrary Dimension
183
--
197
Yaacov Yesha
.
Time-Space Tradeoffs for Matrix Multiplication and the Discrete Fourier Transform on any General Sequential Random-Access Computer
198
--
206
Sara Porat
,
Michael Yoeli
.
Towards a Hierarchy of Nets
207
--
224
Shojiro Muro
,
Tiko Kameda
,
Toshimi Minoura
.
Multi-version Concurrency Control Scheme for a Database System
225
--
242
Simeon C. Ntafos
,
Teofilo F. Gonzalez
.
On the Computational Complexity of Path Cover Problems
243
--
273
John E. Savage
.
The Performance of Multilective VLSI Algorithms
274
--
301
John H. Reif
.
The Complexity of Two-Player Games of Incomplete Information
Volume
29
, Issue
1
1
--
7
Luc Devroye
.
Exponential Bounds for the Running Time of a Selection Algorithm
8
--
35
David A. Plaisted
.
Complete Problems in the First-Order Predicate Calculus
36
--
47
Kokichi Sugihara
.
An n log n Algorithm for Determining the Congruity of Polyhedra
48
--
53
Jan K. Pachl
.
Finding Pseudoperipheral Nodes in Graphs
54
--
57
Michel Latteux
,
Grzegorz Rozenberg
.
Commutative One-Counter Languages are Regular
58
--
79
Tsong Yueh Chen
.
On the Fixpoints of Nondeterministic Recursive Definitions
80
--
98
Fred Kröger
.
A Generalized Nexttime Operator in Temporal Logic
99
--
117
Douglas R. Troeger
.
Weak Equivalence in a Class of Structured Program Schemes
118
--
132
Walter J. Savitch
,
Patrick W. Dymond
.
Consistency in Nondeterministic Storage