Journals in DBLP

Inf. Process. Lett.
1985, volume: 21, number: 5

1. Bertrand Meyer
   Incremental String Matching. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1985, v:21, n:5, pp:219-227 [Journal]
   
2. Jan Magott
   Performance Evaluation of Dystems of Cyclic Sequential Processes with Mutual Exclusion Using Petri Nets. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1985, v:21, n:5, pp:229-232 [Journal]
   
3. A. J. Kfoury
   The Unwind Property for Programs with Bounded Memory. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1985, v:21, n:5, pp:233-238 [Journal]
   
4. Wlodzimierz Dobosiewicz
   A Note on Natural Selection. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1985, v:21, n:5, pp:239-243 [Journal]
   
5. Pavol Duris, Ondrej Sýkora, Imrich Vrto, Clark D. Thompson
   Tight Chip Area Lower Bounds for Discrete Fourier and Walsh-Hadamard Transformations. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1985, v:21, n:5, pp:245-247 [Journal]
   
6. Kenneth J. Supowit
   Decomposing a Set of Points into Chains, with Applications to Permutation and Circle Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1985, v:21, n:5, pp:249-252 [Journal]
   
7. Ulrich Derigs
   An Efficient Dijkstra-like Labeling Method for Computing Shortest Odd/Even Paths. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1985, v:21, n:5, pp:253-258 [Journal]
   
8. Ingrid J. M. Birkhoff
   A Direct Routing Algorithm for the Bit-Reversal Permutation on a Shuffle-Exchange Network. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1985, v:21, n:5, pp:259-268 [Journal]
   
9. Heikki Mannila, Kurt Mehlhorn
   A Fast Algorithm for Renaming a Set of Clauses as a Horn Set. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1985, v:21, n:5, pp:269-272 [Journal]