default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Algorithms, Volume 20
Volume 20, Number 1, January 1996
- Danny Krizanc:
Time-Randomness Trade-offs in Parallel Computation. 1-19 - Jens Lagergren:
Efficient Parallel Algorithms for Graphs of Bounded Tree-Width. 20-44 - Jonathan F. Buss, Paris C. Kanellakis, Prabhakar Ragde, Alexander A. Shvartsman
:
Parallel Algorithms with Processor Failures and Delays. 45-86 - David M. Cohen, Michael L. Fredman:
Weighted Binary Trees for Concurrent Searching. 87-112 - André van Vliet:
On the Asymptotic Worst Case Behavior of Harmonic Fit. 113-136 - Yair Caro, András Sebö, Michael Tarsi:
Recognizing Greedy Structures. 137-156 - Jan Karel Lenstra, Marinus Veldhorst, Bart Veltman:
The Complexity of Scheduling Trees with Communication Delays. 157-173 - Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki:
A Linear Algorithm for Edge-Coloring Series-Parallel Multigraphs. 174-201
Volume 20, Number 2, March 1996
- Alexander A. Shvartsman:
In Memoriam: Paris C. Kanellakis (1953-1995). 203-204 - Béla Bollobás, Trevor I. Fenner, Alan M. Frieze:
On the Best Case of Heapsort. 205-217 - Alon Itai, Hadas Shachnai:
Adaptive Source Routing in High-Speed Networks. 218-243 - Shreesh Jadhav, Asish Mukhopadhyay, Binay K. Bhattacharya:
An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons. 244-267 - Charles J. Colbourn, Wendy J. Myrvold, Eugene Neufeld:
Two Algorithms for Unranking Arborescences. 268-281 - Pallab Dasgupta, P. P. Chakrabarti, S. C. De Sarkar:
Multiobjektive Heuristic Search in AND/OR Graphs. 282-311 - Alan M. Frieze, Stephen Suen:
Analysis of Two Simple Heuristics on a Random Instance of k-SAT. 312-355 - Alessandro Panconesi, Aravind Srinivasan:
On the Complexity of Distributed Network Decomposition. 356-374 - Volker Heun, Ernst W. Mayr:
A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube. 375-399 - David R. Karger, Steven J. Phillips, Eric Torng:
A Better Algorithm for an Ancient Scheduling Problem. 400-430 - Donald E. Knuth:
An Exact Analysis of Stable Allocation. 431-442
Volume 20, Number 3, May 1996
- Shietung Peng, Win-Tsung Lo:
Efficient Algorithms for Finding a Core of a Tree with a Specified Length. 445-458 - Danny Z. Chen:
Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon. 459-478 - William R. Burley:
Traversing Layered Graphs Using the Work Function Algorithm. 479-511 - Ashok Subramanian:
An Explanation of Splaying. 512-525 - Kazuo Iwama, Chuzo Iwamoto:
alpha-Connectivity: A Gradually Nonparallel Graph Problem. J. Algorithms 20(3): 526-544 (1996) - Jirí Matousek:
Derandomization in Computational Geometry. 545-580 - Pankaj K. Agarwal, Sandeep Sen:
Selection in Monotone Matrices and Computing kth Nearest Neighbors. 581-601 - Mikkel Thorup:
Efficient Preprocessing of Simple Binay Pattern Forests. 602-612 - Kazuo Iwama, Eiji Miyano, Yahiko Kambayashi:
Routing Problems on the Mesh of Buses. 613-631
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-05 22:23 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:
