Theory Dish

Theory Dish

Stanford's CS Theory Research Blog

  • About

Does Pigeonhole Degrade Gracefully?

May 30, 2017 // 11 Comments

No Picture
By Steve Mussmann and Jacob Steinhardt. The celebrated pigeonhole principle says that if we have disjoint sets  each of size , then (the number of sets) is at most . [...]

Theory – a Dish Best Served Warm

May 9, 2017 // 1 Comment

Theory Dish – A new research blog by the warm theory of computing community here at Stanford. Enjoy!

[...]

Posts pagination

« 1 … 11 12
Follow Theory Dish on WordPress.com
  • RSS - Posts
  • RSS - Comments

Recent Comments

Roy Andrews's avatarRoy Andrews on Prediction with a short m…
Multiparty Computati… on A few lessons from the history…
Arick Grootveld's avatarArick Grootveld on Trace Reconstruction from Comp…
Unknown's avatarDNF Minimization, Pa… on DNF Minimization, Part I
Hao Sun's avatarHao Sun on RANDOM & APPROX 2023
Yet another backprop… on Backpropagation ≠ Chain R…
Boaz Barak's avatarBoaz Barak on Backpropagation ≠ Chain R…
Lunjia Hu's avatarLunjia Hu on Backpropagation ≠ Chain R…
Boaz Barak's avatarBoaz Barak on Backpropagation ≠ Chain R…
kodlu's avatarkodlu on Average-Case Fine-Grained Hard…

Copyright © 2025 Create a website or blog at WordPress.com

  • Subscribe Subscribed
    • Theory Dish
    • Join 78 other subscribers
    • Already have a WordPress.com account? Log in now.
    • Theory Dish
    • Subscribe Subscribed
    • Sign up
    • Log in
    • Report this content
    • View site in Reader
    • Manage subscriptions
    • Collapse this bar
 

Loading Comments...