Shay Sapir
Scholar

Shay Sapir

Google Scholar ID: Xz1RV6AAAAAJ
PhD student
Algorithms
Citations & Impact
All-time
Citations
48
 
H-index
5
 
i10-index
1
 
Publications
15
 
Co-authors
0
 
Resume (English only)
Academic Achievements
  • Published multiple papers, including:
  • - 'Dimension reduction for clustering: The curious case of discrete centers'
  • - 'On the Adversarial Robustness of Online Importance Sampling'
  • - 'Randomized Dimensionality Reduction for Euclidean Maximization and Diversity Measures'
  • - 'The Power of Recursive Embedding for ℓ_p Metrics'
  • - 'Parks and Recreation: Color Fault-Tolerant Spanners Made Local'
  • - 'Connectivity Labeling in Faulty Colored Graphs'
  • - 'Moderate Dimension Reduction for k-Center Clustering'
  • - 'Color Fault-Tolerant Spanners'
  • - 'Lower Bounds for Pseudo-Deterministic Counting in a Stream'
  • - 'Comparison of Matrix Norm Sparsification'
  • - 'Smoothness of Schatten Norms and Sliding-Window Matrix Streams'
  • - 'Near-Optimal Entrywise Sampling of Numerically Sparse Matrices'
  • - 'Four-dimensional conserved topological charge vectors in plasmonic quasicrystals' (Science, 2025)
Research Experience
  • Currently on the postdoc job market!
Education
  • PhD student at the Weizmann Institute, Faculty of Mathematics and Computer Science, advised by Prof. Robert Krauthgamer; previously earned an MSc in computer science at Weizmann and a double BSc in electrical engineering and physics at the Technion.
Background
  • Research interest is in analyzing algorithms with a memory constraint, often not even allowed to store the entire input (aka sublinear space algorithms), such as sketching, streaming, labeling, and sparsification algorithms.
Miscellany
  • Contact: shay.sapir@weizmann.ac.il
Co-authors
0 total
Co-authors: 0 (list not available)