Journal: Inf. Process. Lett.

Volume 46, Issue 6

263 -- 268Krishnaprasad Thirunarayan. Locality in Inheritance Networks
269 -- 274Klaus-Uwe Höffgen. Computational Limitations on Training Sigmoid Neural Networks
275 -- 280Fouad B. Chedid, Riad B. Chedid. A New Variation on Hypercubes with Smaller Diameter
281 -- 287Martin Middendorf. Minimum Broadcast Time is NP-Complete for 3-Regular Planar Graphs and Deadline 2
289 -- 294Tommaso Bolognesi. Deriving Graphical Representations of Process Networks from Algebraic Expressions
295 -- 300Arne Andersson, Stefan Nilsson. Improved Behaviour of Tries by Adaptive Branching
301 -- 308Edmund M. Clarke, I. A. Draghicescu, Robert P. Kurshan. A Unified Approch for Showing Language Inclusion and Equivalence Between Various Types of omega-Automata
309 -- 311Helmut Prodinger, Wojciech Szpankowski. A Note on Binomial Recurrences Arising in the Analysis of Algorithms

Volume 46, Issue 5

211 -- 217A. Bijlsma. Calculating with Procedure Calls
219 -- 224George D. Stamoulis, John N. Tsitsiklis. An Efficient Algorithm for Multiple Simultaneous Broadcasts in the Hypercube
225 -- 230Haiko Müller, Falk Nicolai. Polynomial Time Algorithms for Hamiltonian Problems on Bipartite Distance-Hereditary Graphs
231 -- 237S.-C. Chang, M. W. Du. Diamond Deque: A Simple Data Structure for Priority Deques
239 -- 241Uwe Schöning. On Random Reductions from Sparse Sets to Tally Sets
243 -- 249David S. Wise. Stop-and-Copy and One-Bit Reference Counting
251 -- 256Myoung-Ho Kim, Joon Ho Lee, Yoon-Joon Lee. Analysis of Fuzzy Operators for High Quality Information Retrieval
257 -- 262Wayne Snyder. On the Complexity of Recursive Path Orderings

Volume 46, Issue 4

159 -- 162Maxime Crochemore, Leszek Gasieniec, Wojciech Rytter. Two-Dimensional Pattern Matching by Sampling
163 -- 168Ludmila Kuncheva. Genetic Algorithm for Feature Selection for Parallel Classifiers
169 -- 172Magnús M. Halldórsson. Approximating the Minimum Maximal Independence Number
173 -- 178Antoni W. Mazurkiewicz. Distributed Disassembly of Mosaics
179 -- 184János Demetrovics, Vu Duc Thi. Some Problems Concerning Keys for Relation Schemes and Relations in the Relational Datamodel
185 -- 191Marc J. van Kreveld. The Power of Parallel Projection
193 -- 198Jyh-Jong Tsay. An Efficient Implemention of Priority Queues Using Fixed-Sized Systolic Coprocessors
199 -- 209Uday Kumar Chakraborty, D. Ghosh Dastidar. Using Reliability Analysis to Estimate the Number of Generations to Convergence in Genetic Algorithms

Volume 46, Issue 3

109 -- 113Lucio Bianco, Jacek Blazewicz, Paolo Dell Olmo, Maciej Drozdowski. Preemptive Scheduling of Multiprocessor Tasks on the Dedicated Processor System Subject to Minimal Lateness
115 -- 118Ted Fischer, Andrew V. Goldberg, David J. Haglin, Serge A. Plotkin. Approximating Matchings in Parallel
119 -- 123Ricard Gavaldà. A Positive Relativization of Polynomial Time Versus Polylog Space
125 -- 128Gen-Huey Chen, Yung-Chen Hung. On the Quickest Path Problem
129 -- 133Lung-Tien Liu, Gen-Huey Chen, Kwei-Jay Lin. An Algorithm for Coalescing Operations with Precedence Constraints in Real-Time Systems
135 -- 141Robert Davis, Armand Prieditis. The Expected Length of a Shortest Path
143 -- 150Shahram Latifi. On the Fault-Diameter of the Star Graph
151 -- 155Tadakazu Sato. Decidability for Some Problems of Linear Cellular Automata Over Finite Commutative Rings
157 -- 0Vincent A. Fischetti, Gad M. Landau, Jeanette P. Schmidt, Peter H. Sellers. Corrigendum: Identifying Periodic Occurences of a Template with Applications to Protein Structure

Volume 46, Issue 2

55 -- 61Chris Ho-Stuart, Hussein S. M. Zedan, Ming Fang. Congruent Weak Bisimulation with Dense Real-Time
63 -- 66Hiroshi Ohtsuka. A Proof of the Substitution Lemma in de Bruijn s Notation
67 -- 69Shlomo Hoory, Avi Wigderson. Universal Traversal Sequences for Expander Graphs
71 -- 77Alistair Moffat, Justin Zobel. Supporting Random Access in Files of Variable Length Records
79 -- 83Alexander Zelikovsky. A Faster Approximation Algorithm for the Steiner Tree Problem in Graphs
85 -- 87Ingo Wegener. Optimal Lower Bounds on the Depth of Polynomial-Size Threshold Circuits for Some Arithmetic Functions
89 -- 94Palanivel Thangavel, Vasantha P. Muthuswamy. Parallel Algorithms for Addition and Multiplication on Processor Arrays with Reconfigurable Bus Systems
95 -- 100Luc Longpré, Sarah Mocas. Symmetry of Information and One-Way Functions
101 -- 0Xiaojun Shen, Qing Hu. A Note on Minimal Visibility Graphs
103 -- 107Fillia Makedon, Dafna Sheinwald, Yaron Wolfsthal. A Simple Linear-Time Algorithm for the Recognition of Bandwidth-2 Biconnected Graphs

Volume 46, Issue 1

1 -- 6Jer-Shyan Wu, Rong-Jaye Chen. The Towers of Hanoi Problem with Cyclic Parallel Moves
7 -- 11Ming-Shing Yu, Lin Yu Tseng, Shoe-Jane Chang. Sequential and Parallel Algorithms for the Maximum-Weight Independent Set Problem on Permutation Graphs
13 -- 18Graham M. Megson. Systolic Partitioning Algorithms
19 -- 20Rafael Dueire Lins. Generational Cyclic Reference Counting
21 -- 26Ten-Hwang Lai, Shu-Shang Wei. The Edge Hamiltonian Path Problem is NP-Complete for Bipartite Graphs
27 -- 29Yi Xian Yang. New Binary Sequences with Perfect Staircase Profile of Linear Complexity
31 -- 36Ramachandran Vaidyanathan, Carlos R. P. Hartmann, Pramod K. Varshney. Running ASCEND, DESCEND and PIPELINE Algorithms in Parallel Using Small Processors
37 -- 42Kojiro Kobayashi. Sigma^0_n-Complete Properties of Programs and Martin-Löf Randomness
43 -- 50Shin Cha, In Sang Chung, Yong Rae Kwon. Complexity Measures for Concurrent Programs Based on Information-Theoretic Metrics
51 -- 54Sang-Bong Oh. An Analytical Evidence for Kalé s Heuristic for the N Queens Problem