
Journals in DBLP
 Dimitris J. Kavvadias, Elias C. Stavropoulos
Monotone Boolean dualization is in coNP[log^{2}n]. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:85, n:1, pp:16 [Journal]
 JunKi Min, JaeYong Ahn, ChinWan Chung
Efficient extraction of schemas for XML documents. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:85, n:1, pp:712 [Journal]
 Wilfried Meidl, Arne Winterhof
On the linear complexity profile of explicit nonlinear pseudorandom numbers. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:85, n:1, pp:1318 [Journal]
 Elvira Albert, Michael Hanus, Germán Vidal
A residualizing semantics for the partial evaluation of functional logic programs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:85, n:1, pp:1925 [Journal]
 ChengYuan Ku, DinYuen Chan, LainChyr Hwang
Optimal reservation policy for two queues in tandem. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:85, n:1, pp:2730 [Journal]
 JaeHoon Kim, KyungYong Chwa
Online deadline scheduling on faster machines. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:85, n:1, pp:3137 [Journal]
 Edgar Chávez, Gonzalo Navarro
Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:85, n:1, pp:3946 [Journal]
 Idit Keidar, Sergio Rajsbaum
A simple proof of the uniform consensus synchronous lower bound. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:85, n:1, pp:4752 [Journal]
 Francis Y. L. Chin, Fu Lee Wang
Erratum to: "Efficient algorithm for transversal of disjoint convex polygons". [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:85, n:1, pp:53 [Journal]
 Francis Y. L. Chin, Hong Shen, Fu Lee Wang
Transversal of disjoint convex polygons. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:85, n:1, pp:5560 [Journal]
