Information Processing Letters, Volume 60

Volume 60, Number 1, 14 October 1996

Sandrine Julia, Igor Litovsky, Bruno Patrou:
On Codes, omega-Codes and omega-Generators. 1-5
Electronic Edition (link) BibTeX
S. A. M. Makki, George Havas:
Distributed Algorithms for Depth-First Search. 7-12
Electronic Edition (link) BibTeX
Alfredo García Olaverri, Javier Tejel:
Using Total Monotonicity for Two Optimization Problems on the Plane. 13-17
Electronic Edition (link) BibTeX
Dong-Tsan Lee:
Semantic Data Modelling Using Linear Logic. 19-27
Electronic Edition (link) BibTeX
Vassilis Giakoumakis:
P_4-laden Graphs: A New Class of Brittle Graphs. 29-36
Electronic Edition (link) BibTeX
Martin Otto, Jan Van den Bussche:
First-Order Queries on Databases Embedded in an Infinite Structure. 37-41
Electronic Edition (link) BibTeX
A. Kh. Al Jabri:
The Unicity Distance: An Upper Bound on the Probability of an Eavesdropper Successfully Estimating the Secret Key. 43-47
Electronic Edition (link) BibTeX
Ingo Wegener:
On the Complexity of Encoding in Analog Circuits. 49-52
Electronic Edition (link) BibTeX

Guy Melançon:
Viennot Factorization of Infinite Words. 53-57
Electronic Edition (link) BibTeX
Paulo A. S. Veloso:
On Pushout Consistency, Modularity and Interpolation for Logical Specifications. 59-66
Electronic Edition (link) BibTeX
Kaisa Sere:
Procedures and Atomicity Refinement. 67-74
Electronic Edition (link) BibTeX
Nick Reingold, Jeffery Westbrook:
Off-Line Algorithms for the List Update Problem. 75-80
Electronic Edition (link) BibTeX
Shyue-Horng Shiau, Chang-Biau Yang:
A Fast Maximum Finding Algorithm on Broadcast Communication. 81-89
Electronic Edition (link) BibTeX
K. Gopalakrishnan, Douglas R. Stinson:
A Simple Analysis of the Error Probability of Two-Point Based Sampling. 91-96
Electronic Edition (link) BibTeX
Peter Eades, Charles Stirk, Sue Whitesides:
The Techniques of Komolgorov and Bardzin for Three-Dimensional Orthogonal Graph Drawings. 97-103
Electronic Edition (link) BibTeX
Danny Z. Chen, Kevin S. Klenk:
Erratum: Rectilinear Short Path Queries Among Rectangular Obstacles. 105
Electronic Edition (link) BibTeX , ->Inf. Process. Lett. 57(6): 313-319(1996) BibTeX
Thomas Natschläger, Michael Schmitt:
Erratum: Exact VC-Dimension of Boolean Monomials. 107
Electronic Edition (link) BibTeX , ->Inf. Process. Lett. 59(1): 19-20(1996) BibTeX

Richard Banach:
Transitive Term Graph Rewriting. 109-114
Electronic Edition (link) BibTeX
Úlfar Erlingsson, Mukkai S. Krishnamoorthy, T. V. Raman:
Efficient Multiway Radix Search Trees. 115-120
Electronic Edition (link) BibTeX
Otfried Schwarzkopf, Jules Vleugels:
Range Searching in Low-Density Environments. 121-127
Electronic Edition (link) BibTeX
Ching-Tsun Chou:
Simple Proof Techniques for Property Preservation via Simulation. 129-134
Electronic Edition (link) BibTeX
Tsong Yueh Chen, Man Fai Lau:
Dividing Strategies for the Optimization of a Test Suite. 135-141
Electronic Edition (link) BibTeX
Ronald E. Prather:
The Subprogram Problem for Software Metric Design. 143-149
Electronic Edition (link) BibTeX
Galen C. Hunt, Maged M. Michael, Srinivasan Parthasarathy, Michael L. Scott:
An Efficient Algorithm for Concurrent Priority Queue Heaps. 151-157
Electronic Edition (link) BibTeX
Y. Daniel Liang, Chongkye Rhee:
Finding Biconnected Components in O(n) Time for a Class of Graphs. 159-163
Electronic Edition (link) BibTeX

David A. Christie:
Sorting Permutations by Block-Interchanges. 165-169
Electronic Edition (link) BibTeX
Eric T. Bax, Joel Franklin:
A Finite-Difference Sieve to Count Paths and Cycles by Length. 171-176
Electronic Edition (link) BibTeX
Meghanad D. Wagh, Jianchen Mo:
Hamilton Cycles in Trivalent Cayley Graphs. 177-181
Electronic Edition (link) BibTeX
Yen-Chun Lin:
Perfectly Overlapped Merging and Sorting on a Two-Way Linear Array. 183-187
Electronic Edition (link) BibTeX
Bahram Alidaee, Ahmad Ahmadian:
Scheduling on a Single Processor with Variable Speed. 189-193
Electronic Edition (link) BibTeX
Nectarios Kitsios, Athanasios K. Tsakalidis:
Space-Optimal Hidden Line Elimination for Rectangles. 195-200
Electronic Edition (link) BibTeX
Ulrich Nitsche, Peter Ochsenschläger:
Approximaely Satisfied Properties of Systems and Simple Language Homomorphisms. 201-206
Electronic Edition (link) BibTeX
D. S. Buhaceanu, W. H. J. Feijen:
Formal Derivation of an Algorithm for Distributed Phase Synchronization. 207-213
Electronic Edition (link) BibTeX
Thomas W. Cusick, Pantelimon Stanica:
Bounds on the Number of Functions Satisfying the Strict Avalanche Criterion. 215-219
Electronic Edition (link) BibTeX
Ton Kloks:
K_1, 3-Free and W_4-Free Graphs. 221-223
Electronic Edition (link) BibTeX

Janka Chlebíková:
Approximating the Maximally Balanced Connected Partition Problem in Graphs. 223-230 BibTeX
David B. Skillicorn:
A Parallel Tree Difference Algorithm. 231-235
Electronic Edition (link) BibTeX
Yong Sun:
Term Rewriting and Hoare Logic- Coded Rewriting. 237-242
Electronic Edition (link) BibTeX
Sven Venema, Hong Shen, Francis Suraweera:
NC Algorithms for the Single Most Vital Edge Problem with Respect to Shortest Path. 243-248
Electronic Edition (link) BibTeX
G. Venkatesan, C. Pandu Rangan:
Approximate Triclique Coloring for Register Allocation. 249-253
Electronic Edition (link) BibTeX
Nayla Nassif, Nader Bagherzadeh:
A Grid Embedding into the Star Graph for Image Analysis Solutions. 255-260
Electronic Edition (link) BibTeX
Jinn-ke Jan, Yuh-Min Tseng:
On the Security of Image Encryption Method. 261-265
Electronic Edition (link) BibTeX
Masayuki Ito, Naofumi Takagi, Shuzo Yajima:
Square Rooting by Iterative Multiply-Additions. 267-269
Electronic Edition (link) BibTeX
Amr M. Youssef, Stafford E. Tavares:
Comment on "Bounds on the Number of Functions Satisfying the Strict Avalanche Criterion". 271-275
Electronic Edition (link) BibTeX
Josep Domingo-Ferrer:
A New Privacy Homomorphism and Applications. 277-282
Electronic Edition (link) BibTeX

Christian Germain, Jean Marcel Pallo:
Two Shortest Path Metrics on Well-Formed Parentheses Strings. 283-287
Electronic Edition (link) BibTeX
Sven-Olof Nyström:
There is no Fully Abstract Fixpoint Semantics for Non-Deterministic Languages with Infinite Computations. 289-293
Electronic Edition (link) BibTeX
David A. Grable:
Nearly-Perfect Hypergraph Packing is in NC. 295-299
Electronic Edition (link) BibTeX
Kaoru Kurosawa, Koji Okada:
Combinatorial Lower Bounds for Secret Sharing Schemes. 301-304
Electronic Edition (link) BibTeX
Seyit Kocberber, Fazli Can:
Partial Evaluation of Queries for Bit-Sliced Signature Files. 305-311
Electronic Edition (link) BibTeX
Margus Veanes, Jonas Barklund:
Construction of Natural Cycletrees. 313-318
Electronic Edition (link) BibTeX
Mitchell L. Neilsen, Masaaki Mizuno:
Erratum to "Nondominated k-coteries for Multiple Mutual Exclusion". 319
Electronic Edition (link) BibTeX , ->Inf. Process. Lett. 50(5): 247-252(1994) BibTeX