Journals in DBLP

Inf. Process. Lett.
2002, volume: 83, number: 4

1. Boris Aronov
   A lower bound on Voronoi diagram complexity. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:83, n:4, pp:183-185 [Journal]
   
2. Fabian Schwarzer, Achim Schweikard
   On the complexity of one-shot translational separability. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:83, n:4, pp:187-194 [Journal]
   
3. Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel
   Steiner trees in uniformly quasi-bipartite graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:83, n:4, pp:195-200 [Journal]
   
4. Jean-Luc Fouquet
   No odd pairs in minimal imperfect NP₅ graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:83, n:4, pp:201-204 [Journal]
   
5. Eduardo Sany Laber, Leonardo Gomes Holanda
   Improved bounds for asymmetric communication protocols. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:83, n:4, pp:205-209 [Journal]
   
6. John D. Holt, Soon Myoung Chung
   Mining association rules using inverted hashing and pruning. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:83, n:4, pp:211-220 [Journal]
   
7. Paul C. Attie
   Wait-free Byzantine consensus. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:83, n:4, pp:221-227 [Journal]
   
8. Mikhail Y. Kovalyov, Marcus Pattloch, Günter Schmidt
   A polynomial algorithm for lot-size scheduling of two type tasks. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:83, n:4, pp:229-235 [Journal]