STCS Seminar
A Parameterized View on P-matchings
Load Balancing under Data Locality: Extending Mean-Field Framework to Constrained Large-Scale Systems
To be Announced
Toward Large Kernel Models
A sublinear time algorithm for approximately perfect matchings in regular graphs
Fast Algorithms for Regression Problems
Dynamic Pricing and Matching for Online Marketplaces
Majority-3SAT in Polynomial Time
Strong bounds for three-term progressions (Part II)
Pages
