
Journals in DBLP
 Sanjay Jain
On a Question About Learning Nearly Minimal Programs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1995, v:53, n:1, pp:14 [Journal]
 Martin Fränzle, Bernhard von Stengel, Arne Wittmüss
A Generalized Notion of Semantic Independence. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1995, v:53, n:1, pp:59 [Journal]
 Angelo Monti, Alessandro Roncato
Completeness Results Concerning Systolic Tree Automata and EOL Languages. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1995, v:53, n:1, pp:1116 [Journal]
 Ran Canetti, Guy Even, Oded Goldreich
Lower Bounds for Sampling Algorithms for Estimating the Average. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1995, v:53, n:1, pp:1725 [Journal]
 Andrea E. F. Clementi, Russell Impagliazzo
The Reachability Problem for Finite Cellular Automata. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1995, v:53, n:1, pp:2731 [Journal]
 Priyalal Kulasinghe, Saïd Bettayeb
MultiplyTwisted Hypercube with Five or More Dimensions is not VertexTransitive. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1995, v:53, n:1, pp:3336 [Journal]
 Charu C. Aggarwal, N. Jain, P. Gupta
An Efficient Selection Algorithm on the Pyramid. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1995, v:53, n:1, pp:3747 [Journal]
 Yuliang Zheng
On Key Agreement Protocols Based on TamperProof Hardware. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1995, v:53, n:1, pp:4954 [Journal]
 YungCheng Chang, LihHsing Hsu
Element Perturbation Problems of Optimum Spanning Trees with TwoParameter Objectives. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1995, v:53, n:1, pp:5559 [Journal]
