Tigran Tonoyan
Tigran Tonoyan
Verified email at technion.ac.il - Homepage
Title
Cited by
Cited by
Year
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
432015
The price of local power control in wireless scheduling
MM Halldórsson, T Tonoyan
arXiv preprint arXiv:1502.05279, 2015
172015
On the capacity of oblivious powers
T Tonoyan
International Symposium on Algorithms and Experiments for Sensor Systems …, 2011
162011
On some bounds on the optimum schedule length in the SINR model
T Tonoyan
International Symposium on Algorithms and Experiments for Sensor Systems …, 2012
152012
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
112017
Universal framework for wireless scheduling problems
EI Ásgeirsson, MM Halldórsson, T Tonoyan
44th International Colloquium on Automata, Languages, and Programming (ICALP …, 2017
112017
Algorithms for scheduling with power control in wireless networks
T Tonoyan
International Conference on Theory and Practice of Algorithms in (Computer …, 2011
112011
On the problem of wireless scheduling with linear power levels
T Tonoyan
arXiv preprint arXiv:1107.4981, 2011
72011
Wireless link capacity under shadowing and fading
MM Halldórsson, T Tonoyan
Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc …, 2017
62017
Local conflict coloring revisited: Linial for lists
Y Maus, T Tonoyan
arXiv preprint arXiv:2007.15251, 2020
52020
Plain SINR is Enough!
MM Halldorsson, T Tonoyan
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019
52019
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
Leveraging indirect signaling for topology inference and fast broadcast
MM Halldórsson, T Tonoyan
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing …, 2018
42018
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
32021
Spanning trees with edge conflicts and wireless connectivity
MM Halldórsson, G Kortsarz, P Mitra, T Tonoyan
arXiv preprint arXiv:1803.04578, 2018
32018
Conflict graphs and the capacity of the mean power scheme
T Tonoyan
International Symposium on Algorithms and Experiments for Sensor Systems …, 2013
32013
A constant factor algorithm for scheduling with linear powers
T Tonoyan
Proc. of 2010 International Conference on Intelligent Network and Computing …, 2010
32010
Query Minimization under Stochastic Uncertainty
S Chaplick, MM Halldórsson, MS de Lima, T Tonoyan
Latin American Symposium on Theoretical Informatics, 181-193, 2021
22021
Wireless aggregation at nearly constant rate
MM Halldórsson, T Tonoyan
2018 IEEE 38th International Conference on Distributed Computing Systems …, 2018
22018
Preemptive online partitioning of sequences
C Konrad, T Tonoyan
arXiv preprint arXiv:1702.06099, 2017
22017
The system can't perform the operation now. Try again later.
Articles 1–20