Volume 42; Issue 2

Main
Journal of Algorithms
Volume 42; Issue 2

Journal of Algorithms

Volume 42; Issue 2

1

A (2 + ε)-Approximation Scheme for Minimum Domination on Circle Graphs

Mirela Damian-Iordache, Sriram V. Pemmaraju

Journal:

Journal of Algorithms

Year:

2002

Language:

english

File:

PDF, 249 KB

english, 2002

2

Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees

Magnús M. Halldórsson, Guy Kortsarz

Journal:

Journal of Algorithms

Year:

2002

Language:

english

File:

PDF, 240 KB

english, 2002

3

Randomized Sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations

Journal:

Journal of Algorithms

Year:

2002

Language:

english

File:

PDF, 187 KB

english, 2002

4

Some Properties of Nonstar Steps in Addition Chains and New Cases Where the Scholz Conjecture Is True

Hatem M. Bahig, Ken Nakamula

Journal:

Journal of Algorithms

Year:

2002

Language:

english

File:

PDF, 114 KB

english, 2002

5

Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property

Phil Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter

Journal:

Journal of Algorithms

Year:

2002

Language:

english

File:

PDF, 293 KB

english, 2002

6

Sparse Dynamic Programming for Longest Common Subsequence from Fragments

Brenda S. Baker, Raffaele Giancarlo

Journal:

Journal of Algorithms

Year:

2002

Language:

english

File:

PDF, 221 KB

english, 2002

7

Analysis of Carry Propagation in Addition: An Elementary Approach

Nicholas Pippenger

Journal:

Journal of Algorithms

Year:

2002

Language:

english

File:

PDF, 114 KB

english, 2002

8

Papers to Appear in Forthcoming Issues

Journal:

Journal of Algorithms

Year:

2002

File:

PDF, 23 KB

2002

9

Author Index For Volume 42

Journal:

Journal of Algorithms

Year:

2002

File:

PDF, 19 KB

2002