The greedy algorithm is optimal for on-line edge coloring
- Amotz Bar-Noy
- Rajeev Motwani
- et al.
- 1992
- Information Processing Letters
Publications
Date
Featured collections
Popular topics
81 results at Information Processing Letters
On independent spanning trees
- Samir Khuller
- Baruch Schieber
- 1992
- Information Processing Letters
A note on approximate linear programming
- Nimrod Megiddo
- 1992
- Information Processing Letters
Optimal time bounds for some proximity problems in the plane
- Alok Aggarwal
- Herbert Edelsbrunner
- et al.
- 1992
- Information Processing Letters
An efficient algorithm for the All Pairs Suffix-Prefix Problem
- Dan Gusfield
- Gad M. Landau
- et al.
- 1992
- Information Processing Letters
Parallel complexity of computing a maximal set of disjoint paths
- Alok Aggarwal
- 1992
- Information Processing Letters
Deferred data structure for the nearest neighbor problem
- Alok Aggarwal
- Prabhakar Raghavan
- 1991
- Information Processing Letters
Preserving liveness: Comments on "safety and liveness from a methodological point of view"
- Martín Abadi
- Bowen Alpern
- et al.
- 1991
- Information Processing Letters
Systematic choice of initial points in local search: Extensions and application to Neural Networks
- Robert J.T. Morris
- Wing Shing Wong
- 1991
- Information Processing Letters
A tight lower bound for the train reversal problem
- Alok Aggarwal
- Tom Leighton
- 1990
- Information Processing Letters