Quick Greedy Computation for Minimum Common String Partitions. - Isaac Goldstein; Moshe Lewenstein (CPM, 2011)

Quick greedy computation for minimum common string partition. - Isaac Goldstein; Moshe Lewenstein (Theor. Comput. Sci., 2014)

How Hard is it to Find (Honest) Witnesses?. - Isaac Goldstein; Tsvi Kopelowitz; Moshe Lewenstein; Ely Porat (ESA, 2016)

Orthogonal Vectors Indexing. - Isaac Goldstein; Moshe Lewenstein; Ely Porat (ISAAC, 2017)

Conditional Lower Bounds for Space/Time Tradeoffs. - Isaac Goldstein; Tsvi Kopelowitz; Moshe Lewenstein; Ely Porat (WADS, 2017)

Improved Space-Time Tradeoffs for kSUM. - Isaac Goldstein; Moshe Lewenstein; Ely Porat (ESA, 2018)

On the Hardness of Set Disjointness and Set Intersection with Bounded Universe. - Isaac Goldstein; Moshe Lewenstein; Ely Porat (ISAAC, 2019)

Methods for Large-Scale Quantitative Analysis of Scribe Impacts on Clinical Documentation. - Michelle R. Hribar; Haley Dusek; Isaac Goldstein; Adam Rule; Michael F. Chiang (AMIA, 2020)