{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q2934612","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q2934612","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q2934612","kernelVersion":"v1","immutable":true,"modified":"2026-01-21T01:47:25Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q2934612","name":"The communication and streaming complexity of computing the longest common and increasing subsequences","headline":"The communication and streaming complexity of computing the longest common and increasing subsequences","description":"scientific article; zbMATH DE number 6381660","url":"https://portal.mardi4nfdi.de/entity/Q2934612","datePublished":"2014-12-18","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q369427"},{"@id":"https://portal.mardi4nfdi.de/entity/Q343862"}]},"provenance":{"prov:generatedAtTime":"2026-01-21T01:47:25Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}