Publisher： Elsevier
Founded in： 1971
Total resources： 4
E-ISSN： 1872-6119
ISSN： 0020-0190
Subject： TP3 Computers
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Information Processing Letters
Menu
A simple recognition of maximal planar graphs
By Nagamochi H., Suzuki T., Ishii T. in (2004)
Information Processing Letters , Vol. 89, Iss. 5, 2004-03 , pp.
Access to resources
Recommend
A linear-time algorithm to compute a MAD tree of an interval graph
By Dahlhaus E., Dankelmann P., Ravi R. in (2004)
Information Processing Letters , Vol. 89, Iss. 5, 2004-03 , pp.A Kleene theorem for splitable signals
Information Processing Letters , Vol. 89, Iss. 5, 2004-03 , pp.Approximation algorithms for a hierarchically structured bin packing problem
By Codenotti B., De Marco G., Leoncini M., Montangero M., Santini M. in (2004)
Information Processing Letters , Vol. 89, Iss. 5, 2004-03 , pp.Universal forgery on a group signature scheme using self-certified public keys
Information Processing Letters , Vol. 89, Iss. 5, 2004-03 , pp.Ready, Set, Go! The Voronoi diagram of moving points that start from a line
Information Processing Letters , Vol. 89, Iss. 5, 2004-03 , pp.A completed hierarchy of true concurrent equivalences
Information Processing Letters , Vol. 89, Iss. 5, 2004-03 , pp.On the hardness of approximating label-cover
By Dinur I., Safra S. in (2004)
Information Processing Letters , Vol. 89, Iss. 5, 2004-03 , pp.On the security of the verifiably-encrypted signature scheme of Boneh, Gentry, Lynn and Shacham
Information Processing Letters , Vol. 89, Iss. 3, 2004-02 , pp.Computing all large sums-of-pairs in R n and the discrete planar two-watchtower problem
By Ben-Moshe B., Carmi P., Katz M.J. in (2004)
Information Processing Letters , Vol. 89, Iss. 3, 2004-02 , pp.
Previous
Next