![Tight bounds for Lp samplers, finding duplicates in streams, and related problems | Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems Tight bounds for Lp samplers, finding duplicates in streams, and related problems | Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems](https://dl.acm.org/cms/attachment/3a3d6a6e-3650-40bb-b107-d3201aab5479/1989284.1989289.key.jpg)
Tight bounds for Lp samplers, finding duplicates in streams, and related problems | Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
![Timothy Gowers on Twitter: "Just uploaded: a video about the amazing proof by Adam Marcus and Gábor Tardos of the Füredi-Hajnal conjecture, which was known to imply the Stanley-Wilf conjecture about permutations Timothy Gowers on Twitter: "Just uploaded: a video about the amazing proof by Adam Marcus and Gábor Tardos of the Füredi-Hajnal conjecture, which was known to imply the Stanley-Wilf conjecture about permutations](https://pbs.twimg.com/profile_images/1259134185991782402/px5R6qGe_400x400.jpg)
Timothy Gowers on Twitter: "Just uploaded: a video about the amazing proof by Adam Marcus and Gábor Tardos of the Füredi-Hajnal conjecture, which was known to imply the Stanley-Wilf conjecture about permutations
![Mini-course by Gábor Tardos “Extremal theory of vertex- and edge-ordered graphs” – Laboratory of Combinatorial and Geometric Structures Mini-course by Gábor Tardos “Extremal theory of vertex- and edge-ordered graphs” – Laboratory of Combinatorial and Geometric Structures](https://mipt.ru/upload/iblock/c24/imgonline_com_ua_resize_xbut3b50uuup4.jpg)