Journals in DBLP
Ching Yu Hung , Behrooz Parhami Fast RNS Division Algorithms for Fixed Divisors with Application to RSA Encrytion. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1994, v:51, n:4, pp:163-169 [Journal ] André Raspaud , Eric Sopena Good and Semi-Strong Colorings of Oriented Planar Graphs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1994, v:51, n:4, pp:171-174 [Journal ] Dominique Barth , André Raspaud Two Edge-Disjoint Hamiltonian Cycles in the Butterfly Graph. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1994, v:51, n:4, pp:175-179 [Journal ] K. Sridharan , Harry E. Stephanou , K. C. Craig , S. Sathiya Keerthi Distance Measures on Intersecting Objects and Their Applications. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1994, v:51, n:4, pp:181-188 [Journal ] Paul Fischer , Klaus-Uwe Höffgen Computing a Maximum Axis-Aligned Rectangle in a Convex Polygon. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1994, v:51, n:4, pp:189-193 [Journal ] Peng Chen , Shigeru Masuyama On the Equivalence in Complexity Among Three Computation Problems on Maximum Number of Edge-Disjoint s-t Paths in a Probabilistic Graph. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1994, v:51, n:4, pp:195-199 [Journal ] Robert Harper A Simplified Account of Polymorphic References. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1994, v:51, n:4, pp:201-206 [Journal ] David Eppstein Arboricity and Bipartite Subgraph Listing Algorithms. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1994, v:51, n:4, pp:207-211 [Journal ] Xiao-Dong Hu , P. D. Chen , Frank K. Hwang A New Competitive Algorithm for the Counterfeit Coin Problem. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1994, v:51, n:4, pp:213-218 [Journal ]