Journals in DBLP

Inf. Process. Lett.
1994, volume: 51, number: 2

1. Norbert Blum, Henning Rochow
   A Lower Bound on the Single-Operation Worst-Case Time Complexity of the Union-Find Problem on Intervals. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:51, n:2, pp:57-60 [Journal]
   
2. David A. Basin
   A Term Equality Problem Equivalent to Graph Isomorphism. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:51, n:2, pp:61-66 [Journal]
   
3. Michael Frazier, C. David Page Jr.
   Prefix Grammars: An Alternative Characterization of the Regular Languages. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:51, n:2, pp:67-71 [Journal]
   
4. Simon R. Blackburn
   Increasing the Rate of Output of m-Sequences. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:51, n:2, pp:73-77 [Journal]
   
5. Edith Hemaspaandra
   Census Techniques Collapse Space Classes. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:51, n:2, pp:79-84 [Journal]
   
6. Eun-Jung Lee, Kwang-Moo Choe
   Grammar Coverings of a Deterministic Parser with Action Conflicts. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:51, n:2, pp:85-92 [Journal]
   
7. Abhijit Sengupta, Suresh Viswanathan
   On Fault-Tolerant Fixed Routing in Hypercubes. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:51, n:2, pp:93-99 [Journal]
   
8. Gianfranco Bilardi, Shiva Chaudhuri, Devdatt P. Dubhashi, Kurt Mehlhorn
   A Lower Bound for Area-Universal Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:51, n:2, pp:101-105 [Journal]
   
9. Peter Kirrinnis
   An Optimal Bound for Path Weights in Huffman Trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:51, n:2, pp:107-110 [Journal]