Journals in DBLP

Inf. Process. Lett.
1998, volume: 67, number: 4

1. Martin Löbbing, Detlef Sieling, Ingo Wegener
   Parity OBDDs Cannot be Handled Efficiently Enough. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:67, n:4, pp:163-168 [Journal]
   
2. Roland Carl Backhouse
   Pair Algebras and Galois Connections. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:67, n:4, pp:169-175 [Journal]
   
3. Eric Bonabeau, Florian Hénaux
   Self-Organizing Maps for Drawing Large Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:67, n:4, pp:177-184 [Journal]
   
4. Fabio Martinelli
   An Improvement of Algorithms for Solving Interface Equations. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:67, n:4, pp:185-190 [Journal]
   
5. Satoshi Fujita
   A Quorum Based k-Mutual Exclusion by Weighted k-Quorum Systems. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:67, n:4, pp:191-197 [Journal]
   
6. G. Greco
   Embeddings and the Trace of Finite Sets. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:67, n:4, pp:199-203 [Journal]
   
7. Oded Goldreich, Johan Håstad
   On the Complexity of Interactive Proofs with Bounded Communication. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:67, n:4, pp:205-214 [Journal]
   
8. Franz Baader
   On the Complexity of Boolean Unification. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:67, n:4, pp:215-220 [Journal]