Matches in SemOpenAlex for { <https://semopenalex.org/work/W4247697132> ?p ?o ?g. }
Showing items 1 to 62 of
62
with 100 items per page.
- W4247697132 abstract "In this paper, we give a parallel algorithm for the longest increasing subsequence problem on a LARPBS, one of the recently proposed parallel model based on optical bus. For a sequence of n integers, we solve the longest increasing subsequence problem in O(k) time using n processors where k is the length of the solution. Then, we give an algorithm for the maximal layers problem that runs in O(k+log(n)) time for a set of n points where k is the number of layers on a n-processor array. To our knowledge, this is the fastest algorithm for that problem." @default.
- W4247697132 created "2022-05-12" @default.
- W4247697132 creator A5088357366 @default.
- W4247697132 creator A5088513104 @default.
- W4247697132 date "2007-12-01" @default.
- W4247697132 modified "2023-09-23" @default.
- W4247697132 title "An Efficient Parallel Algorithm for the Longest Increasing Subsequence Problem on a LARPBS" @default.
- W4247697132 doi "https://doi.org/10.1109/pdcat.2007.4420178" @default.
- W4247697132 hasPublicationYear "2007" @default.
- W4247697132 type Work @default.
- W4247697132 citedByCount "0" @default.
- W4247697132 crossrefType "proceedings-article" @default.
- W4247697132 hasAuthorship W4247697132A5088357366 @default.
- W4247697132 hasAuthorship W4247697132A5088513104 @default.
- W4247697132 hasConcept C11413529 @default.
- W4247697132 hasConcept C114614502 @default.
- W4247697132 hasConcept C120098539 @default.
- W4247697132 hasConcept C120373497 @default.
- W4247697132 hasConcept C134306372 @default.
- W4247697132 hasConcept C137877099 @default.
- W4247697132 hasConcept C170006305 @default.
- W4247697132 hasConcept C173608175 @default.
- W4247697132 hasConcept C177264268 @default.
- W4247697132 hasConcept C199360897 @default.
- W4247697132 hasConcept C2778112365 @default.
- W4247697132 hasConcept C33923547 @default.
- W4247697132 hasConcept C34388435 @default.
- W4247697132 hasConcept C41008148 @default.
- W4247697132 hasConcept C54355233 @default.
- W4247697132 hasConcept C86803240 @default.
- W4247697132 hasConceptScore W4247697132C11413529 @default.
- W4247697132 hasConceptScore W4247697132C114614502 @default.
- W4247697132 hasConceptScore W4247697132C120098539 @default.
- W4247697132 hasConceptScore W4247697132C120373497 @default.
- W4247697132 hasConceptScore W4247697132C134306372 @default.
- W4247697132 hasConceptScore W4247697132C137877099 @default.
- W4247697132 hasConceptScore W4247697132C170006305 @default.
- W4247697132 hasConceptScore W4247697132C173608175 @default.
- W4247697132 hasConceptScore W4247697132C177264268 @default.
- W4247697132 hasConceptScore W4247697132C199360897 @default.
- W4247697132 hasConceptScore W4247697132C2778112365 @default.
- W4247697132 hasConceptScore W4247697132C33923547 @default.
- W4247697132 hasConceptScore W4247697132C34388435 @default.
- W4247697132 hasConceptScore W4247697132C41008148 @default.
- W4247697132 hasConceptScore W4247697132C54355233 @default.
- W4247697132 hasConceptScore W4247697132C86803240 @default.
- W4247697132 hasLocation W42476971321 @default.
- W4247697132 hasOpenAccess W4247697132 @default.
- W4247697132 hasPrimaryLocation W42476971321 @default.
- W4247697132 hasRelatedWork W1492464344 @default.
- W4247697132 hasRelatedWork W1631586975 @default.
- W4247697132 hasRelatedWork W2141255597 @default.
- W4247697132 hasRelatedWork W2375943101 @default.
- W4247697132 hasRelatedWork W2541327307 @default.
- W4247697132 hasRelatedWork W2560137734 @default.
- W4247697132 hasRelatedWork W2560667474 @default.
- W4247697132 hasRelatedWork W4225349735 @default.
- W4247697132 hasRelatedWork W4285255549 @default.
- W4247697132 hasRelatedWork W4301184965 @default.
- W4247697132 isParatext "false" @default.
- W4247697132 isRetracted "false" @default.
- W4247697132 workType "article" @default.