58 citations · 115 across the 15 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.DC2023★ 1 cited
Parallel Longest Common SubSequence Analysis In Chapel
Soroush Vahidi, Baruch Schieber, Zhihui Du +1
One of the most critical problems in the field of string algorithms is the longest common subsequence problem (LCS). The problem is NP-hard for an arbitrary number of strings but c…
cs.DS2023
Quick Minimization of Tardy Processing Time on a Single Machine
Baruch Schieber, Pranav Sitaraman
We consider the problem of minimizing the total processing time of tardy jobs on a single machine. This is a classical scheduling problem, first considered by [Lawler and Moore 196…