Information Processing Letters, Volume 46

Volume 46, Number 1, 29 April 1993

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

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

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

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

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

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

Last update Sat May 18 16:38:17 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page