List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Fault tolerant max-cut | 2026-05-12 | Paper |
| scientific article; zbMATH DE number 7829268 (Why is no real title available?) (available as arXiv preprint) | 2024-04-09 | Paper |
| Overcoming Congestion in Distributed Coloring Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| Unimodal eccentricity in trees Networks | 2023-12-11 | Paper |
| Near-optimal distributed degree+1 coloring Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
| Efficient randomized distributed coloring in CONGEST Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
| Local conflict coloring revisited: Linial for lists | 2023-11-02 | Paper |
| Linial for lists Distributed Computing | 2022-12-09 | Paper |
| Query minimization under stochastic uncertainty LATIN 2020: Theoretical Informatics | 2022-10-13 | Paper |
| Generalized disk graphs | 2022-03-25 | Paper |
| Sparse Backbone and Optimal Distributed SINR Algorithms ACM Transactions on Algorithms | 2022-02-16 | Paper |
| Guessing fractions of online sequences Discrete Applied Mathematics | 2022-01-05 | Paper |
| Network design under general wireless interference Algorithmica | 2021-11-19 | Paper |
| Query minimization under stochastic uncertainty Theoretical Computer Science | 2021-11-18 | Paper |
| Query minimization under stochastic uncertainty Theoretical Computer Science | 2021-11-18 | Paper |
| Computing inductive vertex orderings Information Processing Letters | 2021-10-19 | Paper |
| Spanning trees with edge conflicts and wireless connectivity (available as arXiv preprint) | 2021-07-28 | Paper |
| Effective Wireless Scheduling via Hypergraph Sketches SIAM Journal on Computing | 2021-04-14 | Paper |
| Plain SINR is Enough! Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
| Limitations of current wireless link scheduling algorithms Theoretical Computer Science | 2020-09-17 | Paper |
| Universal framework for wireless scheduling problems (available as arXiv preprint) | 2020-05-27 | Paper |
| Leveraging Indirect Signaling for Topology Inference and Fast Broadcast Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
| Conflict graphs and the capacity of the mean power scheme | 2018-10-17 | Paper |
| Preemptively guessing the center | 2018-08-17 | Paper |
| Brief announcement: Data dissemination in unified dynamic wireless networks Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
| The price of local power control in wireless scheduling (available as arXiv preprint) | 2017-07-13 | Paper |
| On some bounds on the optimum schedule length in the SINR model Algorithms for Sensor Systems | 2016-12-19 | Paper |
| Conflict graphs and the SINR-capacity of the mean power scheme Theoretical Computer Science | 2015-12-11 | Paper |
| How well can graphs represent wireless interference? Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
| Algorithms for scheduling with power control in wireless networks Theory and Practice of Algorithms in (Computer) Systems | 2011-05-12 | Paper |
Research outcomes over time
This page was built for person: Tigran Tonoyan
