Journals in DBLP
Gianfranco Bilardi , Franco P. Preparata The VLSI Optimality of the AKS Sorting Network. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1985, v:20, n:2, pp:55-59 [Journal ] David A. Plaisted The Undecidability of Self-Embedding for Term Rewriting Systems. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1985, v:20, n:2, pp:61-64 [Journal ] Jan L. A. van de Snepscheut Evaluating Expressions with a Queue. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1985, v:20, n:2, pp:65-66 [Journal ] John McLean A Comment on the `Basic Security Theorem' of Bell and LaPadula. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1985, v:20, n:2, pp:67-70 [Journal ] Kohei Noshita Translation of Turner Combinators in O(n log n) Space. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1985, v:20, n:2, pp:71-74 [Journal ] Peter Widmayer , C. K. Wong An Optimal Algorithm for the Maximum Alignment of Terminals. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1985, v:20, n:2, pp:75-82 [Journal ] Satish R. Thatte On the Correspondence Metween Two Classes of Reduction Systems. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1985, v:20, n:2, pp:83-85 [Journal ] David Harel , David Peleg More on Looping vs. Repeating in Dynamic Logic. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1985, v:20, n:2, pp:87-90 [Journal ] Andrejs J. Auzins , Efim B. Kinber On Separation of the Emptiness and Equivalence Problems for Program Schemes. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1985, v:20, n:2, pp:91-93 [Journal ] Danièle Beauquier , Dominique Perrin Codeterministic Automata on Infinite Words. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1985, v:20, n:2, pp:95-98 [Journal ] Esko Ukkonen Upper Bounds on the Size of LR(k) Parsers. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1985, v:20, n:2, pp:99-103 [Journal ] Michael G. Main An Infinite Square-Free co-CFL. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1985, v:20, n:2, pp:105-107 [Journal ] Subhash C. Kak How to Detect Tampering of Data. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1985, v:20, n:2, pp:109-110 [Journal ]