Journals in DBLP

Inf. Process. Lett.
1999, volume: 70, number: 5

1. Harry Buhrman, Ronald de Wolf
   A Lower Bound for Quantum Search of an Ordered List. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:70, n:5, pp:205-209 [Journal]
   
2. Paz Morillo, Carles Padró, Germán Sáez, Jorge Luis Villar
   Weighted Threshold Secret Sharing Schemes. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:70, n:5, pp:211-216 [Journal]
   
3. J. D. Emerald, K. G. Subramanian, D. G. Thomas
   A Note on Inferring Uniquely Terminating Code Languages. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:70, n:5, pp:217-222 [Journal]
   
4. Matthew Young-Lai
   Adding State Merging to the DMC Data Compression Algorithm. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:70, n:5, pp:223-228 [Journal]
   
5. Öjvind Johansson
   Simple Distributed Delta+1-coloring of Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:70, n:5, pp:229-232 [Journal]
   
6. David Guijarro, Víctor Lavín, Vijay Raghavan
   Exact Learning when Irrelevant Variables Abound. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:70, n:5, pp:233-239 [Journal]
   
7. Suman Kumar Nath, Rezaul Alam Chowdhury, M. Kaykobad
   On Average Edge Length of Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:70, n:5, pp:241-243 [Journal]
   
8. Deborah S. Franzblau
   Ear Decomposition with Bounds on Ear Length. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:70, n:5, pp:245-249 [Journal]
   
9. Srinivasa Rao Arikati, Kurt Mehlhorn
   A Correctness Certificate for the Stoer-Wagner Min-Cut Algorithm. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1999, v:70, n:5, pp:251-254 [Journal]