How to Use Undiscovered Information Inequalities: Direct Applications of the Copy Lemma. - Emirhan Gürpinar; Andrei E. Romashchenko (ISIT, 2019)

Symmetries in Linear Programming for Information Inequalities. - Emirhan Gürpinar (ISIT, 2022)

Tight approximation bounds for maximum multi-coverage. - Siddharth Barman; Omar Fawzi; Suprovat Ghoshal; Emirhan Gürpinar (Math. Program., 2022)

The inference of non classiсal information inequalities and their applications. (Inférence d'inégalités d'information non classiques et leurs applications). - Emirhan Gürpinar (2022)

Bounds on guessing numbers and secret sharing combining information theory methods. - Emirhan Gürpinar (Kybernetika, 2024)

Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory. - Emirhan Gürpinar; Andrei E. Romashchenko (ACM Trans. Comput. Theory, 2024)