default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation 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 - S. A. M. Makki, George Havas:
Distributed Algorithms for Depth-First Search. 7-12 - Alfredo García Olaverri, Javier Tejel
:
Using Total Monotonicity for Two Optimization Problems on the Plane. 13-17 - Dong-Tsan Lee:
Semantic Data Modelling Using Linear Logic. 19-27 - Vassilis Giakoumakis:
P_4-laden Graphs: A New Class of Brittle Graphs. 29-36 - Martin Otto, Jan Van den Bussche:
First-Order Queries on Databases Embedded in an Infinite Structure. 37-41 - A. Kh. Al Jabri:
The Unicity Distance: An Upper Bound on the Probability of an Eavesdropper Successfully Estimating the Secret Key. 43-47 - Ingo Wegener:
On the Complexity of Encoding in Analog Circuits. 49-52
Volume 60, Number 2, 28 October 1996
- Guy Melançon:
Viennot Factorization of Infinite Words. 53-57 - Paulo A. S. Veloso:
On Pushout Consistency, Modularity and Interpolation for Logical Specifications. 59-66 - Kaisa Sere:
Procedures and Atomicity Refinement. 67-74 - Nick Reingold, Jeffery R. Westbrook:
Off-Line Algorithms for the List Update Problem. 75-80 - Shyue-Horng Shiau, Chang-Biau Yang:
A Fast Maximum Finding Algorithm on Broadcast Communication. 81-89 - K. Gopalakrishnan, Douglas R. Stinson:
A Simple Analysis of the Error Probability of Two-Point Based Sampling. 91-96 - Peter Eades, Charles Stirk, Sue Whitesides:
The Techniques of Komolgorov and Bardzin for Three-Dimensional Orthogonal Graph Drawings. 97-103 - Danny Z. Chen, Kevin S. Klenk:
Erratum: Rectilinear Short Path Queries Among Rectangular Obstacles. 105 - Thomas Natschläger, Michael Schmitt:
Erratum: Exact VC-Dimension of Boolean Monomials. 107
Volume 60, Number 3, 11 November 1996
- Richard Banach:
Transitive Term Graph Rewriting. 109-114 - Úlfar Erlingsson, Mukkai S. Krishnamoorthy, T. V. Raman:
Efficient Multiway Radix Search Trees. 115-120 - Otfried Schwarzkopf, Jules Vleugels:
Range Searching in Low-Density Environments. 121-127 - Ching-Tsun Chou:
Simple Proof Techniques for Property Preservation via Simulation. 129-134 - Tsong Yueh Chen, Man Fai Lau:
Dividing Strategies for the Optimization of a Test Suite. 135-141 - Ronald E. Prather:
The Subprogram Problem for Software Metric Design. 143-149 - Galen C. Hunt, Maged M. Michael, Srinivasan Parthasarathy, Michael L. Scott:
An Efficient Algorithm for Concurrent Priority Queue Heaps. 151-157 - Y. Daniel Liang, Chongkye Rhee:
Finding Biconnected Components in O(n) Time for a Class of Graphs. 159-163
Volume 60, Number 4, 25 November 1996
- David A. Christie:
Sorting Permutations by Block-Interchanges. 165-169 - Eric T. Bax, Joel Franklin:
A Finite-Difference Sieve to Count Paths and Cycles by Length. 171-176 - Meghanad D. Wagh, Jianchen Mo:
Hamilton Cycles in Trivalent Cayley Graphs. 177-181 - Yen-Chun Lin:
Perfectly Overlapped Merging and Sorting on a Two-Way Linear Array. 183-187 - Bahram Alidaee, Ahmad Ahmadian:
Scheduling on a Single Processor with Variable Speed. 189-193 - Nectarios Kitsios, Athanasios K. Tsakalidis:
Space-Optimal Hidden Line Elimination for Rectangles. 195-200 - Ulrich Nitsche, Peter Ochsenschläger:
Approximaely Satisfied Properties of Systems and Simple Language Homomorphisms. 201-206 - D. S. Buhaceanu, W. H. J. Feijen:
Formal Derivation of an Algorithm for Distributed Phase Synchronization. 207-213 - Thomas W. Cusick, Pantelimon Stanica:
Bounds on the Number of Functions Satisfying the Strict Avalanche Criterion. 215-219 - Ton Kloks:
K_1, 3-Free and W_4-Free Graphs. 221-223
Volume 60, Number 5, 9 December 1996
- Janka Chlebíková:
Approximating the Maximally Balanced Connected Partition Problem in Graphs. 223-230 - David B. Skillicorn:
A Parallel Tree Difference Algorithm. 231-235 - Yong Sun:
Term Rewriting and Hoare Logic- Coded Rewriting. 237-242 - Sven Venema, Hong Shen, Francis Suraweera:
NC Algorithms for the Single Most Vital Edge Problem with Respect to Shortest Path. 243-248 - G. Venkatesan, C. Pandu Rangan:
Approximate Triclique Coloring for Register Allocation. 249-253 - Nayla Nassif, Nader Bagherzadeh:
A Grid Embedding into the Star Graph for Image Analysis Solutions. 255-260 - Jinn-ke Jan, Yuh-Min Tseng:
On the Security of Image Encryption Method. 261-265 - Masayuki Ito, Naofumi Takagi, Shuzo Yajima:
Square Rooting by Iterative Multiply-Additions. 267-269 - Amr M. Youssef, Stafford E. Tavares:
Comment on "Bounds on the Number of Functions Satisfying the Strict Avalanche Criterion". 271-275 - Josep Domingo-Ferrer:
A New Privacy Homomorphism and Applications. 277-282
Volume 60, Number 6, 23 December 1996
- Christian Germain, Jean Marcel Pallo:
Two Shortest Path Metrics on Well-Formed Parentheses Strings. 283-287 - Sven-Olof Nyström:
There is no Fully Abstract Fixpoint Semantics for Non-Deterministic Languages with Infinite Computations. 289-293 - David A. Grable:
Nearly-Perfect Hypergraph Packing is in NC. 295-299 - Kaoru Kurosawa, Koji Okada:
Combinatorial Lower Bounds for Secret Sharing Schemes. 301-304 - Seyit Kocberber, Fazli Can:
Partial Evaluation of Queries for Bit-Sliced Signature Files. 305-311 - Margus Veanes, Jonas Barklund:
Construction of Natural Cycletrees. 313-318 - Mitchell L. Neilsen, Masaaki Mizuno:
Erratum to "Nondominated k-coteries for Multiple Mutual Exclusion". 319
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-12 20:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
