| 301. | More Needles in the Hay Might Make it Harder to Find One? | 0 | |
|
| 302. | Multi-dimensional Virtual Values and Second-degree Price Discrimination | 0 | |
|
| 303. | Panel Discussion | 0 | |
|
| 304. | Improved Monotonicity Testers via Hypercube Embeddings | 0 | |
|
| 305. | Experimental Evolution II | 0 | |
|
| 306. | Causal Matrix Completion | 0 | |
|
| 307. | Neural Networks And Spurious Correlations | 0 | |
|
| 308. | Lightning Talk | 0 | |
|
| 309. | Monitoring People and Their Vital Signs Using Radio Signals and Machine Learning | 0 | |
|
| 310. | Christina Yu | Fellows Lightning Talks | 6th Annual Industry Day | 0 | |
|
| 311. | Is it easier to count communities than find them? | 0 | |
|
| 312. | ITCS 2022 Session 18 | 0 | |
|
| 313. | List Decoding of Tanner and Expander Amplified Codes... | 0 | |
|
| 314. | On Sampling in Dynamic Networks for Inference, Experiments, and Interventions | 0 | |
|
| 315. | Graphons and Graph Limits 1 | 0 | |
|
| 316. | Noisy Boolean Hidden Matching with Applications | 0 | |
|
| 317. | Genetic Diversity in the Interference Selection Limit | 0 | |
|
| 318. | Holographic Pseudo Entropy and Emergent Spacetime | 0 | Vlog |
|
| 319. | Property Testing for Graphs | 0 | |
|
| 320. | Online Reinforcement Learning and Regret | 0 | |
|
| 321. | On Valuing and Procuring Private Data | 0 | |
|
| 322. | Constant-depth sorting networks | 0 | |
|
| 323. | Exploring the quantum computing frontier with reconfigurable atom arrays | 0 | |
|
| 324. | David Blackwell: Teacher And Colleague And A Sample Of His Work | 0 | |
|
| 325. | ITCS 2022 Session 2 | 0 | |
|
| 326. | On Parallelizing Streaming Algorithms | 0 | |
|
| 327. | Local Minima in Quantum Systems | 0 | |
|
| 328. | Understanding the Geometry of Graph Neural Networks | 0 | |
|
| 329. | Tribes is Hard in the Message Passing Model | 0 | |
|
| 330. | Mackay-Neal Codes For High-Speed Wireless And Free-Space Optical Links | 0 | |
|
| 331. | Panel Discussion | 0 | |
|
| 332. | Relative Discrepancy Does Not Separate Information and Communication Complexity | 0 | Guide |
|
| 333. | A Complete Linear Programming Hierarchy for Linear Codes | 0 | |
|
| 334. | Formal Methods and Proofs of Privacy Properties, Part II | 0 | |
|
| 335. | On the download rate of homomorphic secret sharing | 0 | |
|
| 336. | ITCS 2022 Session 12 | 0 | |
|
| 337. | Going beyond the here and now: Counterfactual simulation in human cognition | 0 | |
|
| 338. | Errorless versus Error-prone Average-Case Complexity | 0 | |
|
| 339. | Certification with an NP Oracle | 0 | |
|
| 340. | Complexity Issues in Rearrangement Evolution | 0 | |
|
| 341. | Lower Bounds on the Critical Density in the Hard Disk Model via Optimized Metrics | 0 | |
|
| 342. | Sparse Random Graphs 1 | 0 | |
|
| 343. | Deterministic Counting of Satisfying Assignments for Juntas of Degree-2 PTFs | 0 | |
|
| 344. | Mechanism Design Via Machine Learning: Overfitting, Incentives, and Privacy | 0 | |
|
| 345. | The Quest for Hardness of Metacomplexity: Progress, Barriers, and Next Steps (Part II) | 0 | |
|
| 346. | Birds of a Feather Flock Together: How Homophily Leads to Segregation, Inequality, and... | 0 | |
|
| 347. | Of Moments and Matching: Trade-offs and Treatments in Imitation Learning | 0 | |
|
| 348. | Graphons and Graph Limits 3 | 0 | |
|
| 349. | Competitive Analysis of Online Algorithms (Part 1) | 0 | |
|
| 350. | How to fault-tolerantly realize any quantum circuit with local operations | 0 | Guide |
|
| 351. | Differentially Private Continual Releases of Streaming Frequency Moment Estimations | 0 | |
|
| 352. | Assumptions of Computer Science Interacting with Assumptions of Text-driven Normativities | 0 | |
|
| 353. | Oracle Separations Between QMA and QCMA | 0 | |
|
| 354. | Lower Bounds Against Non-Commutative Models of Algebraic Computation | 0 | |
|
| 355. | ITCS 2022 Session 8 | 0 | |
|
| 356. | The Quantum Games PCP: Results and Confessions | 0 | |
|
| 357. | Towards General and Tight Hardness Results for Graph Problems | 0 | |
|
| 358. | Algorithmic Advances For The Design And Analysis Of Randomized Control Trials | 0 | |
|
| 359. | Pseudoentanglement | 0 | |
|
| 360. | Designing Samplers is Easy: The Boon of Testers | 0 | |
|
| 361. | Dynamic Matching Algorithms Under Vertex Updates | 0 | |
|
| 362. | Practical Error Control Coding For Data Storage | 0 | |
|
| 363. | Optimal Sub-Gaussian Mean Estimation in Very High Dimensions | 0 | |
|
| 364. | Mechanism Design with Moral Bidders | 0 | |
|
| 365. | An Efficient Quantum Factoring Algorithm | Quantum Colloquium | 0 | |
|
| 366. | Spotlght Talk: Performance Guarantees for Transferring Representations | 0 | |
|
| 367. | Secret Sharing, Slice Formulas, and Monotone Real Circuits | 0 | |
|
| 368. | Direct Products and Parallel Repetition | 0 | |
|
| 369. | Approximating Distributions Using Well-Conditioned Normalizing Flows | 0 | |
|
| 370. | FPT Algorithms for Finding Near-Cliques in $c$-Closed Graphs | 0 | |
|
| 371. | Elucidating Sequence-Structure Binding Motifs by Uncovering Selection Trends in HT-SELEX Experiments | 0 | |
|
| 372. | The Space Complexity of Sampling | 0 | |
|
| 373. | Gilbert and Varshamov meet Johnson: List Decoding Nearly-Optimal Binary Codes | 0 | |
|
| 374. | Word-Measures on Unitary Groups | 0 | |
|
| 375. | Highly Scalable Branch-and-Bound for Maximum Monomial Agreement | 0 | |
|
| 376. | Logical Quantum Processor Based on Reconfigurable Atom Arrays | 0 | Vlog |
|
| 377. | An Efficient Reduction from Non-Malleable Extractors to Two-Source Extractors, and... | 0 | |
|
| 378. | Categories, Representations, and Counting Complexity | 0 | |
|
| 379. | Proof Complexity and Meta-Complexity Tutorial (1) | 0 | |
|
| 380. | Circuits of Bounded Depth | 0 | |
|
| 381. | Descartes' Rule of Signs for Polynomial Systems Supported on Circuits | 0 | |
|
| 382. | Competitive Analysis Meets Stochastic Input: Secretary Problems And Prophet Inequalities | 0 | |
|
| 383. | Networks and Economics 1 | 0 | |
|
| 384. | Harnessing the properties of equivariant neural networks to understand and design materials | 0 | |
|
| 385. | Correlation-Intractable Hash Functions via Shift-Hiding | 0 | |
|
| 386. | Uniform brackets, containers, and combinatorial Macbeath regions | 0 | |
|
| 387. | An Introduction to Distributed, Massively Parallel, and Local Computation Algorithms | 3 | |
|
| 388. | A Survey of Recent Results on Depth Reduction and Lower Bounds for Arithmetic Circuits | 0 | |
|
| 389. | Machine Learning For Algorithm Design | 0 | |
|
| 390. | Graph Algorithms in the MPC Model | 1 | |
|
| 391. | Misinformation, Persuasion, and News Media on Social Networks | 0 | |
|
| 392. | Seeing Faces in Things: A Model and Dataset for Pareidolia | 0 | |
|
| 393. | Individual Fairness in Advertising Auctions through Inverse Proportionality | 0 | |
|
| 394. | Two combinatorial MA-complete problems | 0 | |
|
| 395. | The Role of Prior Data in Rapid Learning of Motor Skills | 0 | |
|
| 396. | The Power of Distinguishing Simple From Random (Part II) | 0 | |
|
| 397. | Modularity and Edge-Sampling | 0 | |
|
| 398. | Binary Error Correcting Codes with Minimal Noiseless Feedback | 0 | |
|
| 399. | Cryptography and Kolmogorov Complexity (Part I) | 0 | |
|
| 400. | Deterministic Approximate Counting for Degree-2 Polynomial Threshold Functions | 0 | |
|
