|
Volumn 11, Issue 1, 1975, Pages 29-35
|
On computing the length of longest increasing subsequences
|
Author keywords
[No Author keywords available]
|
Indexed keywords
|
EID: 0003638065
PISSN: 0012365X
EISSN: None
Source Type: Journal
DOI: 10.1016/0012-365X(75)90103-X Document Type: Article |
Times cited : (209)
|
References (2)
|