English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Dynamic programming problems have wide applications in real world and havebeen studied extensively in both serial and parallel settings. In 1994, Galiland Park developed work-efficient and sublinear-time algorithms for severalimportant dynamic programming problems based on the closure method and matrixproduct method. However, in the same paper, they raised an open questionwhether such an algorithm exists for the general GAP problem. % In this paper,we answer their question by developing the first work-efficient andsublinear-time GAP algorithm based on the closure method and Nested Dataflowmethod. % We also improve the time bounds of classic work-efficient,cache-oblivious and cache-efficient algorithms for the 1D problem and GAPproblem, respectively.

Nested Dataflow Algorithms for Dynamic Programming Recurrences with more than O(1) Dependency