


default search action
Journal of Algorithms, Volume 35
Volume 35, Number 1, April 2000
- Jeffery R. Westbrook:

Load Balancing for Response Time. 1-16 - Martin E. Dyer

, Catherine S. Greenhill:
On Markov Chains for Independent Sets. 17-49 - Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen:

A Faster Implementation of a Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs. 50-81 - Amihood Amir, Moshe Lewenstein, Noa Lewenstein:

Pattern Matching in Hypertext. 82-99 - Dominique Roelants van Baronaigien:

A Loopless Gray-Code Algorithm for Listing k-ary Trees. 100-107 - Piotr Berman, Moses Charikar

, Marek Karpinski:
On-Line Load Balancing for Related Machines. 108-121 - Gilles Villard:

Processor Efficient Parallel Solution of Linear Systems of Equations. 122-126
Volume 35, Number 2, May 2000
- Norbert Blum:

Speeding Up Dynamic Programming without Omitting any Optimal Solution and Some Applications in Molecular Biology. 129-168 - Stephen Alstrup, Mikkel Thorup

:
Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees. 169-188 - Mikkel Thorup:

Floats, Integers, and Single Source Shortest Paths. 189-201 - Tsan-sheng Hsu:

On Four-Connecting a Triconnected Graph. 202-234 - Zhivko Prodanov Nedev, Peter T. Wood

:
A Polynomial-Time Algorithm for Finding Regular Simple Paths in Outerplanar Graphs. 235-259

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














