@article {:2002:0020-0190:CO2,
	title = "Board of Editors",
	journal = "Information Processing Letters",
	volume = "84",
	number = "3",
	year = "2002",
	pages = "CO2-CO2",
	url = "http://www.ingentaconnect.com/content/els/00200190/2002/00000084/00000003/art00397",
	doi = "doi:10.1016/S0020-0190(02)00397-6"
}

@article {Biham:2002:0020-0190:117,
	author = "Biham E.",
	title = "How to decrypt or even substitute DES-encrypted messages in 228 steps",
	journal = "Information Processing Letters",
	volume = "84",
	number = "3",
	year = "2002",
	pages = "117-124",
	url = "http://www.ingentaconnect.com/content/els/00200190/2002/00000084/00000003/art00269",
	doi = "doi:10.1016/S0020-0190(02)00269-7"
}

@article {Cho:2002:0020-0190:125,
	author = "Cho S.M. and Kim H.H. and Cha S.D. and Bae D.H.",
	title = "A semantics of sequence diagrams",
	journal = "Information Processing Letters",
	volume = "84",
	number = "3",
	year = "2002",
	pages = "125-130",
	url = "http://www.ingentaconnect.com/content/els/00200190/2002/00000084/00000003/art00270",
	doi = "doi:10.1016/S0020-0190(02)00270-3"
}

@article {Fertin:2002:0020-0190:131,
	author = "Fertin G. and Godard E. and Raspaud A.",
	title = "Minimum feedback vertex set and acyclic coloring",
	journal = "Information Processing Letters",
	volume = "84",
	number = "3",
	year = "2002",
	pages = "131-139",
	url = "http://www.ingentaconnect.com/content/els/00200190/2002/00000084/00000003/art00265",
	doi = "doi:10.1016/S0020-0190(02)00265-X"
}

@article {Chen:2002:0020-0190:141,
	author = "Chen Z.-Z. and Zhang S.",
	title = "Tight upper bound on the number of edges in a bipartite K3,3-free or K5-free graph with an application",
	journal = "Information Processing Letters",
	volume = "84",
	number = "3",
	year = "2002",
	pages = "141-145",
	url = "http://www.ingentaconnect.com/content/els/00200190/2002/00000084/00000003/art00268",
	doi = "doi:10.1016/S0020-0190(02)00268-5"
}

@article {Kleine:2002:0020-0190:147,
	author = "Kleine Buning H. and Zhao X.",
	title = "Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency",
	journal = "Information Processing Letters",
	volume = "84",
	number = "3",
	year = "2002",
	pages = "147-151",
	url = "http://www.ingentaconnect.com/content/els/00200190/2002/00000084/00000003/art00267",
	doi = "doi:10.1016/S0020-0190(02)00267-3"
}

@article {Regev:2002:0020-0190:153,
	author = "Regev O.",
	title = "Priority algorithms for makespan minimization in the subset model",
	journal = "Information Processing Letters",
	volume = "84",
	number = "3",
	year = "2002",
	pages = "153-157",
	url = "http://www.ingentaconnect.com/content/els/00200190/2002/00000084/00000003/art00264",
	doi = "doi:10.1016/S0020-0190(02)00264-8"
}

@article {Baldoni:2002:0020-0190:159,
	author = "Baldoni R. and Melideo G.",
	title = "On the minimal information to encode timestamps in distributed computations",
	journal = "Information Processing Letters",
	volume = "84",
	number = "3",
	year = "2002",
	pages = "159-166",
	url = "http://www.ingentaconnect.com/content/els/00200190/2002/00000084/00000003/art00241",
	doi = "doi:10.1016/S0020-0190(02)00241-7"
}

@article {Nakano:2002:0020-0190:167,
	author = "Nakano S.-i.",
	title = "Efficient generation of plane trees",
	journal = "Information Processing Letters",
	volume = "84",
	number = "3",
	year = "2002",
	pages = "167-172",
	url = "http://www.ingentaconnect.com/content/els/00200190/2002/00000084/00000003/art00240",
	doi = "doi:10.1016/S0020-0190(02)00240-5"
}

@article {Araki:2002:0020-0190:173,
	author = "Araki T. and Shibata Y.",
	title = "Erratum to ''Pancyclicity of recursive circulant graphs'' - [Inform. Process. Lett. 81 (2002) 187-190]",
	journal = "Information Processing Letters",
	volume = "84",
	number = "3",
	year = "2002",
	pages = "173-173",
	url = "http://www.ingentaconnect.com/content/els/00200190/2002/00000084/00000003/art00371",
	doi = "doi:10.1016/S0020-0190(02)00371-X"
}