Isaac Goldstein

Orcid: 0000-0003-2747-9253

According to our database1, Isaac Goldstein authored at least 8 papers between 2011 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Methods for Large-Scale Quantitative Analysis of Scribe Impacts on Clinical Documentation.
Proceedings of the AMIA 2020, 2020

2019
On the Hardness of Set Disjointness and Set Intersection with Bounded Universe.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2018
Improved Space-Time Tradeoffs for kSUM.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017
Conditional Lower Bounds for Space/Time Tradeoffs.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Orthogonal Vectors Indexing.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016
How Hard is it to Find (Honest) Witnesses?.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2014
Quick greedy computation for minimum common string partition.
Theor. Comput. Sci., 2014

2011
Quick Greedy Computation for Minimum Common String Partitions.
Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011


  Loading...