Tigran Tonoyan

I am currently a software engineer in the Research team at Krisp Technologies.

From 2018 to 2021, I was a visiting researcher at the CS department of the Technion, hosted by Keren Censor-Hillel.

From 2014 to 2018, I was a postdoc at ICE-TCS, Reykjavik University, under the supervision of Magnús M. Halldórsson.

I received my PhD in 2013 from the TCS-Sensor Lab, University of Geneva, under the supervision of José D. P. Rolim.

Before that, I worked as a software engineer at Synopsys Armenia.


    email:             ttonoyan at gmail dot com

    address:        Acharyan 30, apt. 25, 

                           0040, Yerevan, Armenia  


Guessing Fractions of Sequences 

(with C. Konrad) In Discret. Appl. Math., 2022.

Linial for Lists

(with Y. Maus) In Distributed Comput., 2022.

Near-Optimal Distributed degree+1 Coloring 

(with M.M. Halldorsson, F. Kuhn, A. Nolin) In STOC, 2022.

Overcoming Congestion in Distributed Coloring 

(with M.M. Halldorsson, F. Kuhn, A. Nolin) In PODC, 2022.

Distributed Vertex Cover Reconfiguration

(with K. Censor-Hillel, Y. Maus, and S. Romem-Peled) In ITCS, 2022.

Computing Inductive Vertex Orderings

(with M.M. Halldorsson) In Inf. Process. Lett., 2021.

Efficient Randomized Distributed Coloring in CONGEST

(with M.M. Halldorsson, F. Kuhn, and Y. Maus) In STOC, 2021.

Fault Tolerant Max-Cut

(with K. Censor-Hillel, N. Marelly, and R. Schwartz) In ICALP, 2021.

Sparse Backbone and Optimal Distributed SINR Algorithms

(with M.M. Halldorsson) In ACM TALG, 2021.

Effective Wireless Scheduling via Hypergraph Sketches

(with M.M. Halldorsson) In SIAM J. Comput., 2021. Prelim. version.

Network Design Under General Wireless Interference

(with M.M. Halldorsson, G. Kortsarz, and P. Mitra) In Algorithmica, 2021. Prelim. version.

Query Minimization under Stochastic Uncertainty

(with S. Chaplick, M.M. Halldorsson, and M. Santos de Lima) In Theor. Comput. Sci., 2021.

Unimodal Eccentricity in Trees

(with J.S. Gylfason and B.L. Hilmarsson) In Networks, 2020. Link.

Local Conflict Coloring Revisited: Linial for Lists

(with Y. Maus) In DISC, 2020. arXiv.

Limitations of Current Wireless Scheduling Algorithms 

(with M.M. Halldorsson and C. Konrad) In Theor. Comput. Sci. 2020.

Plain SINR is Enough!

(with M.M. Halldorsson) In PODC 2019.

Link Scheduling under Correlated Shadowing

(with M.M. Halldorsson) In WiOpt 2019.

Leveraging Indirect Signaling for Topology Inference and Fast Broadcast

(with M.M. Halldorsson) In PODC 2018.

Spanning Trees with Edge Conflicts and Wireless Connectivity

(with M.M. Halldorsson, G. Kortsarz and P. Mitra) In ICALP 2018. arXiv

Effective Wireless Scheduling via Hypergraph Sketches

(with M.M. Halldorsson) Preprint 2018 (Combienes the STOC'15, FSTTCS'15 and ICALP'17 papers). arXiv

Wireless Aggregation at Nearly Constant Rate

(with M.M. Halldorsson) In ICDCS 2018. arXiv

Preemptively Guessing the Center

(with C. Konrad) In ISCO 2018.

Universal Framework for Wireless Scheduling Problems

(with E.I. Asgeirsson and M.M. Halldorsson) In ICALP 2017 (Best Paper of Track C).

Dynamic Adaptation in Wireless Networks under Comprehensive Interference via Carrier Sense

(with M.M. Halldorsson, Y. Wand and D. Yu) In IPDPS 2017.

Wireless Link Capacity under Shadowing and Fading

(with M.M. Halldorsson) In MobiHoc 2017. arXiv

Aggregation Rate for Compressible Functions (Poster)

(with M.M. Halldorsson) In MobiHoc 2017.

Brief Announcement: Data Dissemination in Unified Dynamic Wireless Networks

(with M.M. Halldorsson, Y. Wand and D. Yu) In PODC 2016.

The Price of Local Power Control in Wireless Scheduling 

(with M.M. Halldorsson) In FSTTCS 2015. arXiv

Limitations of Current Wireless Scheduling Algorithms 

(with M.M. Halldorsson and C. Konrad) In ALGOSENSORS 2015.

How Well Can Graphs Represent Wireless Interference? 

(with M.M. Halldorsson) In STOC 2015. arXiv

Conflict Graphs and the Capacity of the Mean Power Scheme 

Theor. Comput. Sci. 608, 2015 (Conference version in ALGOSENSORS 2013).

Bounds and Algorithms for Scheduling Transmissions in Wireless Networks 

PhD thesis (link), University of Geneva, 2013.

Low Radiation Paths in Wireless Networks Pass along Voronoi Diagram 

(with H. Aslanyan and J.D.P. Rolim) In SoftCom 2013.

    A better exposition of the following results can be found in my PhD thesis.

Comparing Schedules in the SINR and Conflict-Graph Models with Different Power Schemes 

In ADHOC-NOW 2013.

On Some Bounds on the Optimum Schedule Length in the SINR Model. 


The Capacity of Oblivious Powers 


Algorithms for Scheduling with Power Control in Wireless Networks 

In TAPAS 2011.


SC-T-445-GRTH Graph Theory (Co-taught with Murilo de Lima, Reykjavik, Spring 2019)

T-755-PRCO Probability and Computing (Reykjavik, Fall 2017)

T-445-GRTH Graph Theory (Reykjavik, Spring 2017) 

Community Service

I was on the PC of PIMRC 2018 and Algosensors 2019.

I am one of the organizers of SWAT'16.