The Longest Almost-increasing Subsequence

Local TagsRelease HistoryDetailsSummary

The Longest Almost-increasing Subsequence

Elmasry, A. (2010). The Longest Almost-increasing Subsequence. Information Processing Letters, 110(16), 655-658. doi:10.1016/j.ipl.2010.05.022.

Item is Released

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-1702-D Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-2855-7

Genre: Journal Article

show

show

hide

Creators:
Elmasry, Amr¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

show

show

hide

Language(s): eng - English

Dates: Published Online: 2010Date issued: 2010

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 536813
DOI: 10.1016/j.ipl.2010.05.022
URI: http://dx.doi.org/10.1016/j.ipl.2010.05.022
Other: Local-ID: C1256428004B93B8-3E05E11DB8A6128DC1257830004A61F2-Elmasry2010a

Degree: -

show

show

show

show

hide

Title: Information Processing Letters

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: Amsterdam : Elsevier

Pages: - Volume / Issue: 110 (16) Sequence Number: - Start / End Page: 655 - 658 Identifier: ISSN: 0020-0190