Journal: Inf. Process. Lett.

Volume 35, Issue 6

277 -- 279A. J. M. van Gasteren, Gerard Tel. Comments on On the Proof of a Distributed Algorithm : Always-Tru is not Invariant
281 -- 285David B. Shmoys, David P. Williamson. Analyzing the Held-Karp TSP Bound: A Monotonicity Property with Application
287 -- 290Andrzej Wlodzimierz Mostowski. Alternating Automata with Start Formulas
291 -- 293Georg Karner. A Note on Terminal Balancing of Algebraic Systems
295 -- 299Chain-Chin Yen, Richard C. T. Lee. The Weighted Perfect Domination Problem
301 -- 304Alok Aggarwal, Frank Thomson Leighton. A Tight Lower Bound for the Train Reversal Problem
305 -- 311Chwan-Hwa John Wu, Chia-Jiu Wang, Heng-Ming Tai. Application of Exponential Hetero-Associative Memory on Frequency Classifier
313 -- 316Jang-Ping Sheu, Jyh-Shyan Tang. Efficient Parallel k Selection Algorithm
317 -- 323Sun Wu, Udi Manber, Gene Myers, Webb Miller. An O(NP) Sequence Comparison Algorithm
325 -- 328Andrew Chin. On the Depth Complexity of the Counting Functions

Volume 35, Issue 5

219 -- 222Kenneth Block, Tai-Kuo Woo. A More Efficient Generalization of Petersons s Mutual Exclusion Algorithm
223 -- 228Michael C. Loui, Milind A. Sohoni. An Algorithm for Load Balancing in Multiprocessor Systems
229 -- 233Seinosuke Toda. On the Complexity of Topological Sorting
235 -- 238Erich Grädel. Simple Interpretations Among Complicated Theories
239 -- 248Ken Grigg, Serge Miguet, Yves Robert. Symmetric Matrix-Vector Product on a Ring of Processors
249 -- 254Robert J. Cimikowski. Finding Hamiltonian Cycles in Certain Planar Graphs
255 -- 260Maw-Shang Chang, Nen-Fu Huang, Chuan Yi Tang. An Optimal Algorithm for Constructing Oriented Voronoi Diagrams and Geographic Neighborhood Graphs
261 -- 267Lisa Hellerstein, Philip N. Klein, Robert Wilber. On the Time-Space Complexity of Reachability Queries for Preprocessed Graphs
269 -- 273Matthew Dickerson, Robert L. (Scot) Drysdale III. Fixed-Radius Near Neighbors Search Algorithms for Points and Segments
275 -- 0Nissim Francez. Corrigenda: Cooperating Proofs for Distributed Programs with Multiparty Interactions

Volume 35, Issue 4

167 -- 170Chau-Jy Lin. Parallel Algorithm for Generating Permutations on Linear Array
171 -- 175Mohamed G. Gouda, Ted Herman. Stabilizing Unison
177 -- 182Shyan-Ming Yuan. The Communication Complexity for Decentralized Evaluation of Functions
183 -- 189Kurt Mehlhorn, Stefan Näher. Bounded Ordered Dictionaries in O(log log N) Time and O(n) Space
191 -- 199Paola Inverardi, Monica Nesi. A Rewriting Strategy to Verify Observational Congruence
201 -- 204Noga Alon. Generating Pseudo-Random Permutations and Maximum Flow Algorithms
205 -- 211Glenn K. Manacher, Terrance A. Mankus, Carol Joan Smith. An Optimum Theta (n log n) Algorithm for Finding a Canonical Hamiltonian Path and a Canonical Hamiltonian Circuit in a Set of Intervals
213 -- 217Xiaotie Deng. An Optimal Parallel Algorithm for Linear Programming in the Plane

Volume 35, Issue 3

111 -- 114Tom Altman, George Logothetis. A Note on Ambiguity in Context-Free Grammars
115 -- 120Erik Lambrichts, Peter Nees, Jan Paredaens, Peter Peelman, Letizia Tanca. Checking Functional Consistency in Deductive Databases
121 -- 128Maxime Crochemore, Wojciech Rytter. Parallel Construction of Minimal Suffix and Factor Automata
129 -- 135Marta Z. Kwiatkowska. A Metric for Traces
137 -- 143Kurt Mehlhorn, Stefan Näher, Christian Uhrig. Hidden Line Elimination for Isooriented Rectangels
145 -- 148Moshe Y. Vardi. Endmarkers can Make a Difference
149 -- 153Srinivasa Rao Arikati, C. Pandu Rangan. Linear Algorithm for Optimal Path Cover Problem on Interval Graphs
155 -- 159John Launchbury. Strictness Analysis Aids Inductive Proofs
161 -- 166Jerzy A. Piotrowski. A Functional Model of a Simplified Sequential Machine

Volume 35, Issue 2

57 -- 61Anna Lubiw. Counterexample to a Conjecture of Szymanski on Hypercube Routing
63 -- 67Ted Herman. Probabilistic Self-Stabilization
69 -- 72G. R. Guenther. Efficient Expansion of Factored Expressions
73 -- 78Maurice Maes. On a Cyclic String-To-String Correction Problem
79 -- 84David T. Barnard, David B. Skillicorn. Pipelining Tree-Structured Algorithms on Simd Architectures
85 -- 92Khun Yee Fung, Tina M. Nicholl, Robert Endre Tarjan, Christopher J. Van Wyk. Simplified Linear-Time Jordan Sorting and Polygon Clipping
93 -- 97Ching-Lin Wang. Obtaining Lazy Evaluation with Continuations in Scheme
99 -- 102Ingo Wegener. Efficient Simulation of Circuits by Erew Prams
103 -- 109Martha Sideri. On Attribute Grammars Without Atribute Synthesis

Volume 35, Issue 1

1 -- 5Mitchell Wand. A Short Proof of the Lexical Addressing Algorithm
7 -- 11Mohan Ahuja, Yahui Zhu. An O(n log n) Feasibility Algorithm for Preemptive Scheduling of n Independent Jobs on a Hypercube
13 -- 18Alok Aggarwal, Subhash Suri. Computing the Longest Diagonal of a Simple Polygon
19 -- 22Jeremy Jacob. A Model of Reconfiguration in Communicating Sequential Processes
23 -- 32Chandrajit L. Bajaj, Tamal K. Dey. Polygon Nesting and Robustness
33 -- 36Rani Siromoney, Lisa Mathew. A Public Key Cryptosystem Based on Lyndon Words
37 -- 40Yu-Tai Ching, Kurt Mehlhorn, Michiel H. M. Smid. Dynamic Deferred Data Structuring
41 -- 48Elena Lodi, Fabrizio Luccio, Linda Pagli. Routing in Times Square Mode
49 -- 51Ronitt Rubinfeld. The Cover Time of a Regular Expander is O(n log n)
53 -- 0Laurence Boxer. Corrigenda: Common Intersections of Polygons
55 -- 56Devendra Kumar, S. Sitharama Iyengar, Mohan B. Sharma. Corrigenda: Corrections to a Distributed Depth-First Search Algorithm