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
422015
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
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
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
92017
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
82017
On the problem of wireless scheduling with linear power levels
T Tonoyan
arXiv preprint arXiv:1107.4981, 2011
72011
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
Wireless link capacity under shadowing and fading
MM Halldórsson, T Tonoyan
Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc …, 2017
42017
Plain SINR is Enough!
MM Halldorsson, T Tonoyan
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019
32019
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
32018
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
Local conflict coloring revisited: Linial for lists
Y Maus, T Tonoyan
arXiv preprint arXiv:2007.15251, 2020
22020
Preemptive online partitioning of sequences
C Konrad, T Tonoyan
arXiv preprint arXiv:1702.06099, 2017
22017
Effective Wireless Scheduling via Hypergraph Sketches
MM Halldórsson, T Tonoyan
SIAM Journal on Computing 50 (2), 718-759, 2021
12021
Efficient Randomized Distributed Coloring in CONGEST
MM Halldórsson, F Kuhn, Y Maus, T Tonoyan
arXiv preprint arXiv:2012.14169, 2020
12020
Limitations of current wireless link scheduling algorithms
MM Halldórsson, C Konrad, T Tonoyan
Theoretical Computer Science 840, 154-165, 2020
12020
The system can't perform the operation now. Try again later.
Articles 1–20