Debarati Das

Researcher

University of Copenhagen

1 standalone talk · 1 total lecture · 1h recorded

Algorithms & Theoretical CS

Standalone talks by Debarati Das

Self-contained public lectures, keynote addresses, and research seminars.

Beyond Naïve Approximation for Longest Common Subsequence

17:16

Theory & Algos·Research Seminar

Beyond Naïve Approximation for Longest Common Subsequence

Debarati Das·University of Copenhagen

An advanced inquiry into approximation algorithms for the Longest Common Subsequence problem, moving beyond conventional methods to explore more sophisticated solutions.