Journals in DBLP
Rainer Kemp A One-to-One Correspondence Between a Class of Leftist Trees and Binary Trees. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1999, v:71, n:3-4, pp:97-105 [Journal ] Maxime Crochemore , Artur Czumaj , Leszek Gasieniec , Thierry Lecroq , Wojciech Plandowski , Wojciech Rytter Fast Practical Multi-Pattern Matching. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1999, v:71, n:3-4, pp:107-113 [Journal ] Mark Levene , George Loizou How to Prevent Interaction of Functional and Inclusion Dependencies. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1999, v:71, n:3-4, pp:115-125 [Journal ] Moshe Dror , Wieslaw Kubiak , Joseph Y.-T. Leung Tree Precedence in Scheduling: The Strong-Weak Distinction. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1999, v:71, n:3-4, pp:127-134 [Journal ] Amotz Bar-Noy , Magnús M. Halldórsson , Guy Kortsarz A Matched Approximation Bound for the Sum of a Greedy Coloring. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1999, v:71, n:3-4, pp:135-140 [Journal ] P. C. P. Bhatt An Interesting Way to Partition a Number. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1999, v:71, n:3-4, pp:141-148 [Journal ] Subhamoy Maitra , Palash Sarkar Hamming Weights of Correlation Immune Boolean Functions. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1999, v:71, n:3-4, pp:149-153 [Journal ] Marcos Kawazoe Aguilera , Sam Toueg A Simple Bivalency Proof that t -Resilient Consensus Requires t + 1 Rounds. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1999, v:71, n:3-4, pp:155-158 [Journal ] David A. Plaisted , Gregory Kucherov The Complexity of Some Complementation Problems. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1999, v:71, n:3-4, pp:159-165 [Journal ] Prasad Jayanti , Tushar Deepak Chandra , Sam Toueg The Cost of Graceful Degradation for Omission Failures. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1999, v:71, n:3-4, pp:167-172 [Journal ]