Tigran Tonoyan

Distributed Comput., 2022

Guessing fractions of online sequences.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Near-optimal distributed degree+1 coloring.

[BibT_eX]

[DOI]

Fabian Kuhn

Alexandre Nolin

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Overcoming Congestion in Distributed Coloring.

[BibT_eX]

[DOI]

Alexandre Nolin

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Distributed Vertex Cover Reconfiguration.

[BibT_eX]

[DOI]

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021

Query minimization under stochastic uncertainty.

[BibT_eX]

[DOI]

Steven Chaplick

Murilo S. de Lima

Theor. Comput. Sci., 2021

Sparse Backbone and Optimal Distributed SINR Algorithms.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2021

Effective Wireless Scheduling via Hypergraph Sketches.

[BibT_eX]

[DOI]

SIAM J. Comput., 2021

Unimodal eccentricity in trees.

[BibT_eX]

[DOI]

Jökull Snær Gylfason

Bernhard L. Hilmarsson

Networks, 2021

Computing inductive vertex orderings.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2021

Ultrafast Distributed Coloring of High Degree Graphs.

[BibT_eX]

[DOI]

Alexandre Nolin

CoRR, 2021

Network Design under General Wireless Interference.

[BibT_eX]

[DOI]

Guy Kortsarz

Pradipta Mitra

Algorithmica, 2021

Generalized Disk Graphs.

[BibT_eX]

[DOI]

Ívar Marrow Arnþórsson

Steven Chaplick

Jökull Snær Gylfason

Jökull Máni Reynisson

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Efficient randomized distributed coloring in CONGEST.

[BibT_eX]

[DOI]

Fabian Kuhn

Yannic Maus

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Fault Tolerant Max-Cut.

[BibT_eX]

[DOI]

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Limitations of current wireless link scheduling algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Local Conflict Coloring Revisited: Linial for Lists.

[BibT_eX]

[DOI]

Yannic Maus

Proceedings of the 34th International Symposium on Distributed Computing, 2020

2019

Link Scheduling under Correlated Shadowing.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Modeling and Optimization in Mobile, 2019

Plain SINR is Enough!

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

2018

Leveraging Indirect Signaling for Topology Inference and Fast Broadcast.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Preemptively Guessing the Center.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

Wireless Aggregation at Nearly Constant Rate.

[BibT_eX]

[DOI]

Proceedings of the 38th IEEE International Conference on Distributed Computing Systems, 2018

Spanning Trees With Edge Conflicts and Wireless Connectivity.

[BibT_eX]

[DOI]

Guy Kortsarz

Pradipta Mitra

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Preemptive Online Partitioning of Sequences.

[BibT_eX]

[DOI]

CoRR, 2017

Universal Framework for Wireless Scheduling Problems.

[BibT_eX]

[DOI]

CoRR, 2017

Aggregation Rate for Compressible Functions.

[BibT_eX]

[DOI]

Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2017

Wireless Link Capacity under Shadowing and Fading.

[BibT_eX]

[DOI]

Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2017

Dynamic Adaptation in Wireless Networks Under Comprehensive Interference via Carrier Sense.

[BibT_eX]

[DOI]

Dongxiao Yu

Yuexuan Wang

Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium, 2017

Universal Framework for Wireless Scheduling Problems.

[BibT_eX]

[DOI]

Eyjólfur Ingi Ásgeirsson

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Data Dissemination in Unified Dynamic Wireless Networks.

[BibT_eX]

[DOI]

Yuexuan Wang

Dongxiao Yu

CoRR, 2016

Brief Announcement: Data Dissemination in Unified Dynamic Wireless Networks.

[BibT_eX]

[DOI]

Yuexuan Wang

Dongxiao Yu

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

2015

Conflict graphs and the SINR-capacity of the mean power scheme.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

How Well Can Graphs Represent Wireless Interference?

[BibT_eX]

[DOI]

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

The Price of Local Power Control in Wireless Scheduling.

[BibT_eX]

[DOI]

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

Limitations of Current Wireless Scheduling Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2015

2013

Bounds and Algorithms for Scheduling Transmissions in Wireless Networks.

[BibT_eX]

[DOI]

PhD thesis, 2013

Low radiation paths in wireless networks pass along Voronoi diagram.

[BibT_eX]

[DOI]

Hakob Aslanyan

José D. P. Rolim

Proceedings of the 21st International Conference on Software, 2013

Conflict Graphs and the Capacity of the Mean Power Scheme.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2013

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

[BibT_eX]

[DOI]

Proceedings of the Ad-hoc, Mobile, and Wireless Network - 12th International Conference, 2013

2012

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

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2012

2011

On the Problem of Wireless Scheduling with Linear Power Levels

[BibT_eX]

[DOI]

CoRR, 2011

Algorithms for Scheduling with Power Control in Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

On the Capacity of Oblivious Powers.

[BibT_eX]

[DOI]