default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBIT, Volume 26, 1986
Volume 26, Number 1, 1986
- Becky Chan, Selim G. Akl:
Generating Combinations in Parallel. 1-6 - R. C. Chang, Richard C. T. Lee:
An O(N log N) Minimal Spanning Tree Algorithm for N Points in the Plane. 7-16 - Guy Louchard:
Brownian Motion and Algorithm Complexity. 17-34 - Michael J. Quinn, Narsingh Deo:
An Upper Bound for the Speedup of Parallel Best-Bound Branch-And-Bound Algorithms. 35-43 - Pawel Winter:
An Algorithm for the Enumeration of Spanning Trees. 44-62
Volume 26, Number 2, 1986
- Hung-Chang Du:
Disk Allocation Methods for Binary Cartesian Product Files. 138-147 - Anders Edenbrandt:
Quotient Tree Partitioning of Undirected Graphs. 148-155 - Jeffrey H. Kingston:
The Amortized Complexity of Henriksen's Algorithm. 156-163 - Sigurd Meldal:
An Axiomatic Semantics for Nested Concurrency. 164-174 - Peter Naur:
Thinking and Turing's Test. 175-187 - Heikki Saikkonen, Stefan Rönn:
Distributed Termination on a Ring. 188-194 - Yixin Zhang:
A Note on Parallel Depth First Search. 195-198
Volume 26, Number 3, 1986
- Alfs T. Berztiss:
A Taxonomy of Binary Tree Traversals. 266-276 - Gen-Huey Chen, Maw-Sheng Chern:
Parallel Generation of Permutations and Conbinations. 277-283 - Jakob Krarup, Peter M. Pruzan:
Assessment of Approximate Algorithms: The Error Measure's Crucial Role. 284-294 - Sigurd Meldal:
Partial Correctness of Exits from Concurrent Structures. 295-302 - Robert Schreiber:
On Systolic Array Methods for Band Matrix Factorizations. 303-316
Volume 26, Number 4, 1986
- Keith Brinck:
Computing Parent Nodes in Threaded Binary Trees. 401-409 - Chin-Chen Chang:
On the Design of a Key-Lock-Pair Mechanism in Information Protection Systems. 410-417 - Pranay Chaudhuri, Ratan K. Ghosh:
Parallel Algorithms for Analyzing Activity Networks. 418-429 - Wm. Randolph Franklin, Varol Akman
:
Reconstructing Visible Regions from Visible Segments. 430-441 - Shou-Hsuan Stephen Huang:
Ordered Priority Queues. 442-450 - Robert Schreiber, Wei-Pai Tang:
On On Systolic Arrays for Updating the Cholesky Factorization. 451-466 - D. Yun Yeh:
A Dynamic Programming Approach to the Complete Set Partitioning Problem. 467-474
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 2025-12-04 22:09 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:
