Abstract: We consider the approximate pattern matching problem under the edit distance. Given a text T of length n, a pattern P of length m, and a threshold k, the task is to find the starting ...

This repository contains code for our SPAA paper "Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable" (SPAA'18). It includes implementations of the following parallel graph ...

Quantum computing offers new heuristics for combinatorial problems. With small- and intermediate-scale quantum devices becoming available, it is possible to implement and test these heuristics on ...

An elastic-degenerate (ED) string is a sequence of sets of strings. It can also be seen as a directed acyclic graph whose edges are labeled by strings. The notion of ED strings was introduced as a ...

String theory captured the hearts and minds of many physicists decades ago because of a beautiful simplicity. Zoom in far enough on a patch of space, the theory says, and you won’t see a menagerie of ...

Centre for Quantum Engineering, Research and Education (CQuERE), TCG Centres for Research and Education in Science and Technology (TCG CREST), Sector V, Salt Lake, Kolkata700091, India ...

Edit distance—a classical problem in computer science—has received ongoing attention from both practitioners and theoreticians. Given two strings A and B, the edit distance is the minimum number of ...

I originally created this as a short to-do list of study topics for becoming a software engineer, but it grew to the large list you see today. After going through this study plan, I got hired as a ...

Pattern matching is one of the core algorithms in computer science that stand to benefit from quantum computers 1,2. Pattern matching algorithms are used ubiquitously used in image processing 3,4, the ...

When editor-in-chief Moshe Vardi asked me to write this piece for Communications, my first reaction was the article could be written in two words: Nevertheless, the computer science landscape has ...