Journals in DBLP

Inf. Process. Lett.
1995, volume: 54, number: 3

1. Teofilo F. Gonzalez
   A Simple LP-Free Approximation Algorithm for the Minimum Weight Vertex Cover Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:54, n:3, pp:129-131 [Journal]
   
2. John S. Schlipf, Fred S. Annexstein, John V. Franco, Ramjee P. Swaminathan
   On Finding Solutions for Extended Horn Formulas. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:54, n:3, pp:133-137 [Journal]
   
3. Guillermo A. Alvarez, Marcelo O. Fernández
   Efficient Management of Multiple Outstanding Timeouts. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:54, n:3, pp:139-145 [Journal]
   
4. Robert Snelick, Joseph JáJá, Raghu Kacker, Gordon Lyon
   Using Synthetic Perturbations and Statistical Screening to Assay Shared-Memory Programs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:54, n:3, pp:147-153 [Journal]
   
5. Gerhard J. Woeginger
   Scheduling with Time-Dependent Execution Times. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:54, n:3, pp:155-156 [Journal]
   
6. Robert H. Sloan
   Four Types of Noise in Data for PAC Learning. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:54, n:3, pp:157-162 [Journal]
   
7. Ravi Jain, John Werth
   Analysis of Approximate Algorithms for Edge-Coloring Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:54, n:3, pp:163-168 [Journal]
   
8. Birgit Jenner
   Knapsack Problems for NL. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:54, n:3, pp:169-174 [Journal]
   
9. Stanislaw Gawiejnowicz, Lidia Pankowska
   Scheduling Jobs with Varying Processing Times. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:54, n:3, pp:175-178 [Journal]
   
10. Rajesh P. N. Rao
    A Note on P-Selective Sets and Closeness. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:54, n:3, pp:179-185 [Journal]