|
|
Journals in DBLP
- Vlady Ravelomanana, Loÿs Thimonier
Patchworks and metablocks enumeration. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2000, v:73, n:3-4, pp:77-86 [Journal]
- Jean Marcel Pallo
An efficient upper bound of the rotation distance of binary trees. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2000, v:73, n:3-4, pp:87-92 [Journal]
- Shahrokh Saeednia
On the security of a convertible group signature scheme. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2000, v:73, n:3-4, pp:93-96 [Journal]
- Min-Shiang Hwang
Cryptanalysis of YCN key assignment scheme in a hierarchy. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2000, v:73, n:3-4, pp:97-101 [Journal]
- Tzung-Shi Chen
Task migration in 2D wormhole-routed mesh multicomputers. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2000, v:73, n:3-4, pp:103-110 [Journal]
- Alberto Caprara, Hans Kellerer, Ulrich Pferschy
A PTAS for the Multiple Subset Sum Problem with different knapsack capacities. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2000, v:73, n:3-4, pp:111-118 [Journal]
- Ferdinando Cicalese, Ugo Vaccaro
An improved heuristic for "Ulam-Rényi game". [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2000, v:73, n:3-4, pp:119-124 [Journal]
- Rolf Niedermeier, Peter Rossmanith
A general method to speed up fixed-parameter-tractable algorithms. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2000, v:73, n:3-4, pp:125-129 [Journal]
- Guillaume Fertin
Hierarchical broadcast and gossip networks. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2000, v:73, n:3-4, pp:131-136 [Journal]
- David Avis, Luc Devroye
Estimating the number of vertices of a polyhedron. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2000, v:73, n:3-4, pp:137-143 [Journal]
- Sukumar Ghosh, Xin He
Fault-containing self-stabilization using priority scheduling. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2000, v:73, n:3-4, pp:145-151 [Journal]
|
