|
|
Journals in DBLP
J. Algorithms
1994, volume: 16, number: 2
- Livio Colussi
Fastest Pattern Matching in Strings. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1994, v:16, n:2, pp:163-189 [Journal]
- Kazuo Iwama, Yahiko Kambayashi
A Simpler Parallel Algorithm for Graph Conectivity. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1994, v:16, n:2, pp:190-217 [Journal]
- Jean-Paul Doignon, Jean-Claude Falmagne
A Polynomial Time Algorithm for Unidimensional Unfolding Representations. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1994, v:16, n:2, pp:218-233 [Journal]
- Marek Chrobak, Lawrence L. Larmore
Generosity Helps or an 11-Competitive Algorithm for Three Servers. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1994, v:16, n:2, pp:234-263 [Journal]
- Jeremy Spinrad
Recognition of Circle Graphs. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1994, v:16, n:2, pp:264-282 [Journal]
- Andrzej Ehrenfeucht, Harold N. Gabow, Ross M. McConnell, Stephen J. Sullivan
An O(n²) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1994, v:16, n:2, pp:283-294 [Journal]
- Tal Goldberg, Uri Zwick
Faster Parallel String Matching via Larger Deterministic Samples. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1994, v:16, n:2, pp:295-308 [Journal]
- Michael Filaseta, M. L. Robinson, Ferrell S. Wheeler
The Minimal Euclidean Norm of an Algebraic Number Is Effectively Computable. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1994, v:16, n:2, pp:309-333 [Journal]
|
