Ying Feng

me.jpeg

Hi!

I am a second-year PhD student at MIT, where I am fortunate to be advised by Piotr Indyk. Before that, I was an undergrad at CMU.

My interest is theoretical computer science. Currently, I’m particularly interested in algorithms for massive or high-dimensional data.

Email: yingggfeng(at)gmail.com


Publications

2026

  1. Fast and Compact Random Mappings with Uniform Guarantees and Applications
    with Piotr Indyk
    To appear in STOC 2026

2025

  1. On Differential Privacy for Adaptively Solving Search Problems via Sketching
    with Shiyuan Feng, George Z. Li, Zhao Song, David P. Woodruff, and Lichen Zhang
    In ICML 2025 (Selected for Oral Presentation)
    arXiv
  2. Even Faster Algorithm for the Chamfer Distance
    with Piotr Indyk
    In ICALP 2025
    arXiv

2024

  1. Fast White-Box Adversarial Streaming Without a Random Oracle
    with Aayush Jain, and David P. Woodruff
    In ICML 2024
    arXiv
  2. A Real-Time Rescheduling Algorithm for Multi-Robot Plan Execution
    with Adittyo Paul, Zhe Chen, and Jiaoyang Li
    In ICAPS 2024
    arXiv

2023

  1. Improved Algorithms for White-Box Adversarial Streams
    with David P. Woodruff
    In ICML 2023
    arXiv
  2. A Fast Rescheduling Algorithm for Real-Time Multi-Robot Coordination (Extended Abstract)
    with Adittyo Paul, and Jiaoyang Li
    In SoCS 2023
    Link