Emirhan Gürpinar

13 papers B 4Journal 8

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Bounds on guessing numbers and secret sharing combining information theory methods. Kybernetika Emirhan Gürpinar
2024	J	`jnl`	Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory. ACM Trans. Comput. Theory Emirhan Gürpinar, Andrei Romashchenko
2023	J	`jnl`	Bounds on Guessing Numbers and Secret Sharing Combining Information Theory Methods. CoRR Emirhan Gürpinar
2022	B	`conf`	Symmetries in Linear Programming for Information Inequalities. ISIT Emirhan Gürpinar
2022	J	`jnl`	Symmetries in Linear Programming for Information Inequalities. CoRR Emirhan Gürpinar
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	J	`jnl`	Tight approximation bounds for maximum multi-coverage. Math. Program. Siddharth Barman, Omar Fawzi, Suprovat Ghoshal, Emirhan Gürpinar
2020	B	`conf`	Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory. MFCS Emirhan Gürpinar, Andrei Romashchenko
2020	J	`jnl`	Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory. CoRR Emirhan Gürpinar, Andrei Romashchenko
2020	B	`conf`	Tight Approximation Bounds for Maximum Multi-coverage. IPCO Siddharth Barman, Omar Fawzi, Suprovat Ghoshal, Emirhan Gürpinar
2019	B	`conf`	How to Use Undiscovered Information Inequalities: Direct Applications of the Copy Lemma. ISIT Emirhan Gürpinar, Andrei Romashchenko
2019	J	`jnl`	How to Use Undiscovered Information Inequalities: Direct Applications of the Copy Lemma. CoRR Emirhan Gürpinar, Andrei Romashchenko
2019	J	`jnl`	Tight Approximation Bounds for Maximum Multi-Coverage. CoRR Siddharth Barman, Omar Fawzi, Suprovat Ghoshal, Emirhan Gürpinar