ITCS 2022 Session 18
Chair: Xue Chen
Probing to minimize
Weina Wang, Anupam Gupta, and Jalani Williams (Carnegie Mellon University)
Double Coverage with Machine-Learned Advice
Alexander Lindermayr and Nicole Megow (Department of Mathematics and Computer Science, University of Bremen, Germany.); Bertrand Simon (IN2P3 Computing Center, CNRS, Villeurbanne, France.)
Faster Sparse Matrix Inversion and Rank Computation in Finite Fields
Sílvia Casacuberta (Harvard University); Rasmus Kyng (ETH Zurich)
Uniform Bounds for Scheduling with Job Size Estimates
Ziv Scully and Isaac Grosof (Carnegie Mellon University); Michael Mitzenmacher (Harvard University)
Counting and Sampling Perfect Matchings in Regular Expanding Non-Bipartite Graphs
Farzam Ebrahimnejad, Ansh Nagda, and Shayan Oveis Gharan (University of Washington)
13th Innovations in Theoretical Computer Science (ITCS) Conference
Other Videos By Simons Institute for the Theory of Computing
2022-02-11 | Information, Learning, And Incentive Design For Societal Networks |
2022-02-11 | Fair And Reliable Machine Learning For High-Stakes Applications:approaches Using Information Theory |
2022-02-11 | Mechanism Design Via Machine Learning: Overfitting, Incentives, and Privacy |
2022-02-11 | Efficient Universal Estimators For Symmetric Property Estimation |
2022-02-04 | ITCS 2022 Session 24 |
2022-02-04 | ITCS 2022 Session 23 |
2022-02-04 | ITCS 2022 Session 22 |
2022-02-04 | ITCS 2022 Session 21 |
2022-02-03 | ITCS 2022 Session 19 |
2022-02-03 | ITCS 2022 Session 20 |
2022-02-03 | ITCS 2022 Session 18 |
2022-02-03 | ITCS 2022 Session 17 |
2022-02-03 | ITCS 2022 Session 16 |
2022-02-02 | ITCS 2022 Session 15 |
2022-02-02 | ITCS 2022 Session 14 |
2022-02-02 | ITCS 2022 Session 13 |
2022-02-02 | ITCS 2022 Graduating Bits |
2022-02-02 | ITCS 2022 Session 12 |
2022-02-02 | ITCS 2022 Session 11 |
2022-02-02 | ITCS 2022 Session 10 |
2022-02-02 | ITCS 2022 Session 9 |