![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)
Mini-course by Gábor Tardos “Extremal theory of vertex- and edge-ordered graphs” – Laboratory of Combinatorial and Geometric Structures
![Entropy, Search, Complexity (Bolyai Society Mathematical Studies (16)): Csiszár, Imre, Katona, Gyula O.H., Tardos, Gabor: 9783642068997: Amazon.com: Books Entropy, Search, Complexity (Bolyai Society Mathematical Studies (16)): Csiszár, Imre, Katona, Gyula O.H., Tardos, Gabor: 9783642068997: Amazon.com: Books](https://images-na.ssl-images-amazon.com/images/I/41U2Y2Ik9vL._SY344_BO1,204,203,200_.jpg)
Entropy, Search, Complexity (Bolyai Society Mathematical Studies (16)): Csiszár, Imre, Katona, Gyula O.H., Tardos, Gabor: 9783642068997: Amazon.com: Books
![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
![Gábor SIMONYI | Hungarian Academy of Sciences, Budapest | HAS | Combinatorics and Discrete Mathematics Research Division Gábor SIMONYI | Hungarian Academy of Sciences, Budapest | HAS | Combinatorics and Discrete Mathematics Research Division](https://i1.rgstatic.net/ii/profile.image/276433503256577-1442918292108_Q512/Gabor_Simonyi.jpg)