Journal: Inf. Process. Lett.

Volume 28, Issue 6

275 -- 280Alan A. Bertossi. On the Domatic Number of Interval Graphs
281 -- 286D. W. Wang, Yue-Sun Kuo. A Study on Two Geometric Location Problems
287 -- 290K. Vidyasankar. Converting Lamport s Regular Register to Atomic Register
291 -- 295Juris Hartmanis, Lane A. Hemachandra. On Sparse Oracles Separating Feasible Complexity Classes
297 -- 299Gen-Huey Chen, M. S. Yu, Lung-Tien Liu. Two Algorithms for Constructing a Binary Tree from its Traversals
301 -- 309Chin-Wen Ho, Richard C. T. Lee. Efficient Parallel Algorithms for Finding Maximal Cliques, Clique Trees, and Minimum Coloring on Chordal Graphs
311 -- 316Maciej Liskiewicz, Krzysztof Lorys. Alternating Real-Time Computations
317 -- 326Edward P. F. Chan, Héctor J. Hernández. Testing Unboundedness of Database Schemes and Functional Dependencies
327 -- 0Michael C. Loui, Teresa A. Matsushita, Douglas B. West. Election in a Complete Network with a Sense of Direction

Volume 28, Issue 5

221 -- 224Antoni W. Mazurkiewicz. Solvability of the Asynchronous Ranking Problem
225 -- 229Ananth V. Iyer, H. Donald Ratliff, Gopalakrishnan Vijayan. Optimal Node Ranking of Trees
231 -- 234Don Platt, A. Magdy. Adaptive Control Using Switched Capacitor Filters
235 -- 240Shuo-Yen Robert Li. Reconstruction of Polygons from Projections
241 -- 243Howard J. Karloff, Ramamohan Paturi, Janos Simon. Universal Traversal Sequences of Length n^O(log n) for Cliques
245 -- 248Jean-François Romeuf. Shortest Path Under Rational Constraint
249 -- 251Lance Fortnow, Michael Sipser. Are There Interactive Protocols for CO-NP Languages?
253 -- 257Paolo Ciaccia, Dario Maio, Paolo Tiberio. A Unifying Approach to Evaluating Block Accesses in Database Organizations
259 -- 268P. K. Das, D. Q. M. Fay. Fault-Tolerant and Flexible Interconnection of Multiple Processors
269 -- 274Leslie L. Miller, Shashi K. Gadia, Suresh C. Kothari, K. C. Liu. Completeness Issues for Join Dependencies Derived from the Universal Relation Join Dependency

Volume 28, Issue 4

165 -- 170Colm Ó Dúnlaing. A Tight Lower Bound for the Complexity of Path-Planning for a Disc
171 -- 175Makoto Imase, Yoshifumi Manabe. Fault-Tolerant Routings in a kappa-Connected Network
177 -- 181Moon-Jung Chung, Mukkai S. Krishnamoorthy. Algorithms of Placing Recovery Points
183 -- 188Jianzhong Du, Joseph Y.-T. Leung. Scheduling Tree-Structured Tasks with Restricted Execution Times
189 -- 192Daniel J. Rosenkrantz, Harry B. Hunt III. Matrix Multiplication for Finite Algebraic Systems
193 -- 199Yuji Takada. Grammatical Interface for Even Linear Languages Based on Control Sets
201 -- 206Guan-Ing Chen, Ten-Hwang Lai. Preemptive Scheduling of Independent Jobs on a Hypercube
207 -- 212Gilles Brassard, Sampath Kannan. The Generation of Random Permutations on the Fly
213 -- 214Ichiro Suzuki. Proving Properties of a Ring of Finite-State Machines
215 -- 219Katsushi Inoue, Itsuo Takanami. Some Considerations About NPRIORITY(1) Without ROM

Volume 28, Issue 3

111 -- 119Alexandre Brandwajn. Load Imbalance in DASD Dynamic Reconnection
121 -- 125Prateek Mishra. Strictness Analysis of the Untyped lambda-Calculus
127 -- 132Joseph Aguilar-Martin, Claudi Alsina. Characterizations of Some Rescaling Functions
133 -- 136Mark Allen Weiss, Robert Sedgewick. Bad Cases for Shaker-Sort
137 -- 140John F. Morrison. Parallel p-adic Computation
141 -- 147Fabrizio Luccio, Geppino Pucci, Andrea Pietracaprina. A Probabilistic Simulation of PRAMs on a Bounded Degree Network
149 -- 155M. Y. Chan, W. L. Chung. Optimal Multidisk Partial Match File Designs
157 -- 163Hasan Ural, Bo Yang. A Structural Test Selection Criterion

Volume 28, Issue 2

55 -- 59Walter W. Kirchherr. Transposition of an 1*1 Matrix Requires O(log 1) Reversals on Conservative Turing Machines
61 -- 65Hillel Gazit, Gary L. Miller. An Improved Parallel Algorithm that Computes the BFS Numbering of a Directed Graph
67 -- 70Frank K. H. A. Dehne, Ivan Stojmenovic. An O(sqrt(n)) Time Algorithm for the ECDF Searching Problem for Arbitrary Dimensions on a Mesh-of-Processors
71 -- 75Victor Y. Pan. Computing the Determinant and the Characteristic Polynomial of a Matrix via Solving Linear Systems of Equations
77 -- 79Joost Engelfriet, Hendrik Jan Hoogeboom. Prefix and Equality Languages of Rational Functions are Co-Context-Free
81 -- 85Daniel P. Bovet, Sergio De Agostino, Rossella Petreschi. Parallelism and the Feedback Vertex Set Problem
87 -- 92Yves Auffray. Linear Strategy for Propositional Modal Resolution
93 -- 97Jürgen Ebert. Computing Eulerian Trails
99 -- 103James H. Anderson, Mohamed G. Gouda. Atomic Semantics of Nonatomic Programs
105 -- 110Catherine A. Schevon, Jeffrey Scott Vitter. A Parallel Algorithm for Recognizing Unordered Depth-First Search

Volume 28, Issue 1

1 -- 4Michel Latteux, Erick Timmerman. Bifaithful Starry Transductions
5 -- 11Giuseppe F. Italiano. Finding Paths and Deleting Edges in Directed Acyclic Graphs
13 -- 19Wojciech Szpankowski. The Evaluation of an Alternative Sum With Applications to the Analysis of Some Data Structures
21 -- 25David Alex Lamb, Robin W. Dawes. Testing for Class Membership in Multi-Parent Hierarchies
27 -- 31José D. P. Rolim, Sheila A. Greibach. On the IO-Complexity and Approximation Languages
33 -- 37Joanna Jedrzejowicz. Infinite Hierarchy of Expressions Containing Shuffle Closure Operator
39 -- 44Wei-pang Chin. Optimum Watchman Routes
45 -- 51Andrew Dwelly. Synchronizing the I/O Behavior of Functional Programs with Feedback
53 -- 54Stephan Olariu. Paw-Fee Graphs