I am a Ph.D. student in the Department of Computer Sciences at the University of Wisconsin–Madison, advised by Prof. Paris Koutris.
My research primarily focuses on database theory, with a strong interest in applying theoretical insights to practical system design. Beyond databases, I am also interested in traditional systems topics such as operating systems and distributed systems.
Prior to that, I received my B.E. from the School of Information Science and Technology at ShanghaiTech University.
Collaborations, discussions, and chats are welcome!
-- Keep calm & do good research!
class Researcher (CS : Type) (Me : Type) where
week : Me → List (Literature CS) → Project CS → Discussion CS → IO Unit
-- Implementation if far from completion
week me pubs proj comm := do
let learning ← pubs.collect >>= (·.study)
let progress ← proj.hardWork
let insights ← comm.make >>= (·.summarize)
me.meeting learning progress insights
pure ()(Idea by Guanzhou)
Email: zyu379 [AT] wisc [dot] edu, yuzhh1 [AT] shanghaitech [dot] edu [dot] cn
Publications
🥩 Entree
echo "Still cooking. My first database theory paper is underway—stay tuned!"🍽 Appetizer
Accelerating Focal Search in Multi-Agent Path Finding with Tighter Lower Bounds
(IROS 2025, RSS 2025 Workshop on Scalable and Resilient Multi-Robot Systems)
Y Tang, Z Yu, J Li, S Koenig
TL;DR: Traditional bounded-suboptimal MAPF solvers like ECBS suffer from sluggish early search due to slow-growing focal bounds. We introduce a tighter lower-bound strategy that kickstarts the search faster, trims down node expansions, and speeds things up — especially when the map gets crowded.
Education
B.E. in Computer Science · Aug. 2020 to Jun. 2024
VISP in Computer Science · Jan. 2023 to Jan. 2024
Magician
I was a proud member of Magician, the robotics student team of RMUC. It was the starting point of my academic journey, and I’m always grateful and honored to have been part of that team — it’s still my mental home, wherever I go.