Information Processing Letters, Volume 50

Volume 50, Number 1, 8 April 1994

Ferruccio Barsi, Maria Cristina Pinotti:
A Fully Parallel Algorithm for Residue to Binary Conversion. 1-8
Yossi Azar, Andrei Z. Broder, Alan M. Frieze:
On the Problem of Approximating the Number of Bases of a Matroid. 9-11
Yi-Bing Lin:
Determining the Global Progress of Parallel Simulation with FIFO Communication Property. 13-17
Marc Demange, Pascal Grisoni, Vangelis Th. Paschos:
Approximation Results for the Minimum Graph Coloring Problem. 19-23
Aviezri S. Fraenkel, Edward M. Reingold, Prashant Saxena:
Efficient Management of Dynamic Tables. 25-30
Pierre Collette:
An Explanatory Presentation of Composition Rules for Assumption-Commitment Specifications. 31-35
Jennifer Seberry, Xian-Mo Zhang, Yuliang Zheng:
Improving the Strict Avalanche Characteristics of Cryptographic Functions. 37-41
Yong-Seok Kim:
An Optimal Scheduling Algorithm for Preemptable Real-Time Tasks. 43-38
Samir Khuller, Balaji Raghavachari, Neal E. Young:
Designing Multi-Commodity Flow Trees. 49-55

Frédéric Maire:
Polyominos and Perfect Graphs. 57-61
Paolo Ferragina:
Static and Dynamic Parallel Computation of Connected Components. 63-68
Her-Kun Chang, Shyan-Ming Yuan:
Message Complexity of Hierarchical Quorum Consensus Algorithm. 69-73
T. Sony Roy, G. Athithan, M. S. Ganagi, A. Sivasankara Reddy:
A New Method to Solve Non-Linear Equations. 75-79
Narsingh Deo, Amit Jain, Muralidhar Medidi:
An Optimal Parallel Algorithm for Merging Using Multiselection. 81-87
Y. L. Chen:
Finding the k Quickset Simple Paths in a Network. 89-92
Giovanni Di Crescenzo, Giuseppe Persiano:
Round-Optimal Perfect Zero-Knowledge Proofs. 93-99
Rani Siromoney, Lisa Mathew, V. Rajkumar Dare, K. G. Subramanian:
Infinite Lyndon Words. 101-104
Rahul Simha, Amitava Majumdar:
On Lookahead in the List Update Problem. 105-110
Himabindu Gurla:
Corrigendum: Leftmost one Computation on Meshes with Row Broadcasting. 111

Yair Bartal, Howard J. Karloff, Yuval Rabani:
A Better Lower Bound for On-Line Scheduling. 113-116
Etsuro Moriya:
On Two-Way Tree Automata. 117-121
Paul F. Dietz, Ioan I. Macarie, Joel I. Seiferas:
Bits and Relative Order From Residues, Space Efficiently. 123-127
Dongseung Kim, Seung-Hoon Kim:
O(log n) Numerical Algorithms on a Mesh with Wormhole Routing. 129-136
Bob P. Weems, Lloyd C. Swayze:
Allocation Techniques for Distributed Reduction Data Elements. 137-142
Yuzheng Ding, Mark Allen Weiss:
On the Complexity of Building an Interval Heap. 143-144
G. Prem Kumar, G. Phanendra Babu:
Optimal Network Partitioning for Fault-Tolerant Network Management Using Evolutionary Programming. 145-149
Dhananjay M. Dhamdhere, Sandeep S. Kulkarni:
A Token Based k-Resilient Mutual Exclusion Algorithm for Distributed Systems. 151-157
Li-Yan Yuan:
Logic Program Semantics and Circumscription of Autoepistemic Theories. 159-164
Roberto Baldoni, Bruno Ciciani:
Distributed Algorithms for Multiple Entries to a Critical Section with Priority. 165-172

Kokichi Sugihara:
Simpler Proof of a Realizability Theorem on Delaunay Triangulations. 173-176
Rodolfo F. Resende, Amr El Abbadi:
On the Serializability Theorem for Nested Transactions. 177-183
R. Ravi:
A Primal-Dual Approximation Algorithm for the Steiner Forest Problem. 185-190
Udi Manber, Sun Wu:
An Algorithm for Approximate Membership checking with Application to Password Security. 191-197
Jaikumar Radhakrishnan, K. V. Subrahmanyam:
Directed Monotone Contact Networks for Threshold Functions. 199-203
Chandrasekhar Narayanaswami, William L. Luken:
Approximating chiⁿ Efficiently. 205-210
Sorin Istrail, Dejan Zivkovic:
Bounded-Width Polynomial-Size Boolean Formulas Compute Exactly Those Functions in AC^0. 211-216
Simon Y. Berkovich:
Multiprocessor Interconnection Network Using Pairwise Balanced Combinatorial Designs. 217-222
Yi-Min Wang, Andy Lowry, W. Kent Fuchs:
Consistent Global Checkpoints Based on Direct Dependency Tracking. 223-230

Giovanni Manzini:
Sparse Matrix Vector Multiplication on Distributed Architectures: Lower Bounds and Average Complexity Results. 231-238
Dennis Moore, William F. Smyth:
An Optimal Algorithm to Compute all the Covers of a String. 239-246
Mitchell L. Neilsen, Masaaki Mizuno:
Nondominated k-Coteries for Multiple Mutual Exclusion. 247-252, (Erratum: Inf. Process. Lett. 60(6): 319 (1996))
Huade Li:
Trajectory Planning in H-Space. 253-258
Xubo Zhang, Z. Meral Özsoyoglu:
Some Results on the Containment and Minimization of (in) Equality Queries. 259-267
Chris H. Perleberg:
Single Character Searching Methods and the shift-or Pattern-Matching Algorithm. 269-275
Shuji Jimbo, Akira Maruoka:
On the Relationship Between the Diameter and the Size of a Boundary of a Directed Graph. 277-282
Abraham P. Punnen, Kunhiraman Nair:
A Fast and Simple Algorithm for the Bottleneck Biconnected Spanning Subgraph Problem. 283-286

Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini:
An Optimal Lower Bound for Nonregular Languages. 289-292, (Corrigendum: Inf. Process. Lett. 52(6): 339 (1994))
Giuseppe Pirillo:
Infinite Words and Biprefix Codes. 293-295
Chiu-Chuan Lin, Ferng-Ching Lin:
Minimal Fully Adaptive Wormhole Routing on Hypercubes. 297-301
José Fortes Gálvez:
A Note on a Proposed LALR Parser for Extended Context-Free Grammars. 303-305
Matti Nykänen, Esko Ukkonen:
Finding Lowest Common Ancestors in Arbitrarily Directed Trees. 307-310
Sridhar Alagar, Subbarayan Venkatesan:
An Optimal Algorithm for Distributed Snapshots with Causal Message Ordering. 311-316
Jordan Gergov, Christoph Meinel:
On the Complexity of Analysis and Manipulation of Boolean Functions in Terms of Decision Graphs. 317-322
M. D. Atkinson, Jörg-Rüdiger Sack:
Uniform Generation of Forests of Restricted Height. 323-327
David A. Naumann:
A Recursion Theorem for Predicate Transformers on Inductive Data Types. 329-336
Linda Pagli, Geppino Pucci:
Counting the Number of Fault Patterns in Redundant VLSI Arrays. 337-342

Last update Sat May 25 20:34:55 2013 CET by the DBLP Team —

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