Dr. David Wajc
Faculty:
Computer Science
Main energy field:
Energy Storage and Conversion
About:
PostDoc – 2020 – 2022 – Stanford, Computer Science
PhD – 2014 – 2020 – Carnegie Mellon University, Computer Science
MSc – 2010 – 2013 – Technion, Computer Science
BSc – 2006 – 2010 – Technion, Computer Science
Roles, Chairs, prizes…
Taub Family Foundation “Leaders in Science & Technology” Fellow
SODA 2023 best paper award
Stanford Motwani Postdoctoral Fellowship
Research Area in Energy:
Adapt methods from Computer Science Theory to address optimization and grid coordination in the power grid. Questions addressing distributed and online aspects: when should energy be created? Where? Where should it be stored?
Selected Publications:
“Online Edge Coloring is (Nearly) as Easy as Offline”
with Joakim Blikstad, Ola Svensson & Radu Vintan. In ACM Symposium on Theory of Computing, 2024. (STOC 24)
Invited to SICOMP Special Issue for STOC24
“Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs” with Sayan Bhattacharya, Peter Kiss & Aaron Sidford. In ACM Symposium on Theory of Computing, 2024 (STOC 24)
“Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time”
with Sayan Bhattacharya, Peter Kiss & Thatchaphol Saranurak. In ACM-SIAM Symposium on Discrete Algorithms, 2023. (SODA 23)
Best paper award
Invited to TALG Special Issue for SODA23 (declined in favor of J.ACM)
Invited to Highlights of Algorithms 2024 (HALG 24)
“Universally-Optimal Distributed Algorithms for Known Topologies”
with Bernhard Haeupler & Goran Zuzic. In ACM Symposium on Theory of Computing, 2021 (STOC 21)
“Streaming Submodular Matching Meets the Primal-Dual Method”
with Roie Levin. In ACM-SIAM Symposium on Discrete Algorithms, 2021. (SODA 21)
“Network Coding Gaps for Completion Times of Multiple Unicasts”
with Bernhard Haeupler & Goran Zuzic. In IEEE Symposium on Foundations of Computer Science, 2020. (FOCS 20)
“Rounding Dynamic Matchings Against an Adaptive Adversary”
David Wajc. In ACM Symposium on Theory of Computing, 2020. (STOC 20)
“Online Matching with General Arrivals”
with Buddhima Gamlath, Michael Kapralov, Andreas Maggiori & Ola Svensson. In IEEE Symposium on Foundations of Computer Science, 2019. (FOCS 19)
“Tight Bounds for Online Edge Coloring”
with Ilan R. Cohen & Binghui Peng. In IEEE Symposium on Foundations of Computer Science, 2019. (FOCS 19)
Invited to Highlights of Algorithms 2024 (HALG 20)