Journals in DBLP
Béatrice Bérard , Catherine Dufourd Timed automata and additive clock constraints. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:75, n:1-2, pp:1-7 [Journal ] Charles J. Colbourn , Alan C. H. Ling Quorums from difference covers. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:75, n:1-2, pp:9-12 [Journal ] Mayer Goldberg Gödelization in the lambda calculus. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:75, n:1-2, pp:13-16 [Journal ] Jacob M. Howe , Andy King Abstracting numeric constraints with Boolean functions. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:75, n:1-2, pp:17-23 [Journal ] Meghanad D. Wagh , Prakash Math , Osman Guzide Cyclic-cubes and wrap-around butterflies. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:75, n:1-2, pp:25-27 [Journal ] Michal Penn , Moshe Tennenholtz Constrained multi-object auctions and b-matching. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:75, n:1-2, pp:29-34 [Journal ] Ju-Hong Lee , Deok-Hwan Kim , Seok-Lyong Lee , Chin-Wan Chung , Guang-Ho Cha Distributed similarity search algorithm in distributed heterogeneous multimedia databases. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:75, n:1-2, pp:35-42 [Journal ] Ari Freund , Howard J. Karloff A lower bound of 8/(7+(1/k)-1) on the integrality ratio of the Calinescu-Karloff-Rabani relaxation for multiway cut. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:75, n:1-2, pp:43-50 [Journal ] A. Benjamin Premkumar On the optimal utilization of all available states in the 2n moduli set. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:75, n:1-2, pp:51-56 [Journal ] Gerth Stølting Brodal , Srinivasan Venkatesh Improved bounds for dictionary look-up with one error. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:75, n:1-2, pp:57-59 [Journal ] Keh-Ning Chang , Shi-Chun Tsai Exact solution of a minimal recurrence. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:75, n:1-2, pp:61-64 [Journal ] Krzysztof Giaro , Marek Kubale Edge-chromatic sum of trees and bounded cyclicity graphs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:75, n:1-2, pp:65-69 [Journal ] Toru Hasunuma On edge-disjoint spanning trees with small depths. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:75, n:1-2, pp:71-74 [Journal ] Marek Chrobak , Jiri Sgall A simple analysis of the harmonic algorithm for two servers. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:75, n:1-2, pp:75-77 [Journal ] Yaoyun Shi Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:75, n:1-2, pp:79-83 [Journal ] Poul Frederick Williams , Macha Nikolskaïa , Antoine Rauzy Bypassing BDD construction for reliability analysis. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:75, n:1-2, pp:85-89 [Journal ]