Folgen
Tigran Tonoyan
Tigran Tonoyan
Krisp Inc.
Bestätigte E-Mail-Adresse bei krisp.ai - Startseite
Titel
Zitiert von
Zitiert von
Jahr
How well can graphs represent wireless interference?
MM Halldórsson, T Tonoyan
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
452015
Local conflict coloring revisited: Linial for lists
Y Maus, T Tonoyan
arXiv preprint arXiv:2007.15251, 2020
362020
Efficient randomized distributed coloring in CONGEST
MM Halldórsson, F Kuhn, Y Maus, T Tonoyan
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
282021
Near-optimal distributed degree+ 1 coloring
MM Halldórsson, F Kuhn, A Nolin, T Tonoyan
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
242022
The price of local power control in wireless scheduling
MM Halldórsson, T Tonoyan
arXiv preprint arXiv:1502.05279, 2015
162015
On the capacity of oblivious powers
T Tonoyan
International Symposium on Algorithms and Experiments for Sensor Systems …, 2011
162011
Overcoming congestion in distributed coloring
MM Halldórsson, A Nolin, T Tonoyan
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing …, 2022
142022
Dynamic adaptation in wireless networks under comprehensive interference via carrier sense
D Yu, Y Wang, T Tonoyan, MM Halldórsson
2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS …, 2017
142017
On some bounds on the optimum schedule length in the SINR model
T Tonoyan
International Symposium on Algorithms and Experiments for Sensor Systems …, 2012
142012
Query minimization under stochastic uncertainty
S Chaplick, MM Halldórsson, MS de Lima, T Tonoyan
Theoretical Computer Science 895, 75-95, 2021
112021
Algorithms for scheduling with power control in wireless networks
T Tonoyan
International Conference on Theory and Practice of Algorithms in (Computer …, 2011
112011
Universal framework for wireless scheduling problems
EI Ásgeirsson, MM Halldórsson, T Tonoyan
44th International Colloquium on Automata, Languages, and Programming (ICALP …, 2017
102017
Plain SINR is enough!
MM Halldorsson, T Tonoyan
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019
82019
Wireless link capacity under shadowing and fading
MM Halldórsson, T Tonoyan
Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc …, 2017
82017
Ultrafast distributed coloring of high degree graphs
MM Halldórsson, A Nolin, T Tonoyan
arXiv preprint arXiv:2105.04700, 2021
62021
Spanning trees with edge conflicts and wireless connectivity
MM Halldórsson, G Kortsarz, P Mitra, T Tonoyan
arXiv preprint arXiv:1803.04578, 2018
62018
On the problem of wireless scheduling with linear power levels
T Tonoyan
arXiv preprint arXiv:1107.4981, 2011
62011
Linial for lists
Y Maus, T Tonoyan
Distributed Computing 35 (6), 533-546, 2022
52022
Comparing schedules in the SINR and conflict-graph models with different power schemes
T Tonoyan
International Conference on Ad-Hoc Networks and Wireless, 317-328, 2013
52013
Effective wireless scheduling via hypergraph sketches
MM Halldórsson, T Tonoyan
SIAM Journal on Computing 50 (2), 718-759, 2021
42021
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20