On the longest increasing subsequence of a circular list
type: Item
instance of: scholarly article
title: On the longest increasing subsequence of a circular list
zbMATH Open document ID: 1185.68840
author: N. E. Zubov
published in: Information Processing Letters
publication date: 2010-01-29T00:00:00Z
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 5664733
zbMATH Keywords: combinatorial problems
zbMATH Keywords: randomized algorithms
Wikidata QID: Q62037472
describes a project that uses: MUMMER
MaRDI profile type: Publication
full work available at URL: j.ipl.2006.08.003
OpenAlex ID: W2042983118
cites work: Q4432944
cites work: Longest increasing subsequences in sliding windows
cites work: Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
cites work: On the distribution of the length of the longest increasing subsequence of random permutations
cites work: Q3619797
cites work: On computing the length of longest increasing subsequences
cites work: Q3925859
cites work: Q3992671
cites work: Longest Increasing and Decreasing Subsequences
cites work: Q5691080
DBLP publication ID: journals/ipl/AlbertANSS07
DOI: 10.1016/J.IPL.2006.08.003
description: scientific article; zbMATH DE number 5664733