Published in: LIPIcs, Volume 246, 36th International Symposium on Distributed Computing (DISC 2022)
Varsha Dani and Thomas P. Hayes. How to Wake up Your Neighbors: Safe and Nearly Optimal Generic Energy Conservation in Radio Networks. In 36th International Symposium on Distributed Computing (DISC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 246, pp. 16:1-16:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{dani_et_al:LIPIcs.DISC.2022.16, author = {Dani, Varsha and Hayes, Thomas P.}, title = {{How to Wake up Your Neighbors: Safe and Nearly Optimal Generic Energy Conservation in Radio Networks}}, booktitle = {36th International Symposium on Distributed Computing (DISC 2022)}, pages = {16:1--16:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-255-6}, ISSN = {1868-8969}, year = {2022}, volume = {246}, editor = {Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.16}, URN = {urn:nbn:de:0030-drops-172071}, doi = {10.4230/LIPIcs.DISC.2022.16}, annote = {Keywords: Radio Networks, Low Energy Computation, Clustering} }
Published in: LIPIcs, Volume 229, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)
Varsha Dani, Josep Díaz, Thomas P. Hayes, and Cristopher Moore. Improved Reconstruction of Random Geometric Graphs. In 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 229, pp. 48:1-48:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{dani_et_al:LIPIcs.ICALP.2022.48, author = {Dani, Varsha and D{\'\i}az, Josep and Hayes, Thomas P. and Moore, Cristopher}, title = {{Improved Reconstruction of Random Geometric Graphs}}, booktitle = {49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)}, pages = {48:1--48:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-235-8}, ISSN = {1868-8969}, year = {2022}, volume = {229}, editor = {Boja\'{n}czyk, Miko{\l}aj and Merelli, Emanuela and Woodruff, David P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.48}, URN = {urn:nbn:de:0030-drops-163897}, doi = {10.4230/LIPIcs.ICALP.2022.48}, annote = {Keywords: Reconstruction algorithm, distances in RGG, d-dimensional hypercube, 3 dimensional sphere} }
Published in: LIPIcs, Volume 209, 35th International Symposium on Distributed Computing (DISC 2021)
Varsha Dani, Aayush Gupta, Thomas P. Hayes, and Seth Pettie. Wake up and Join Me! an Energy-Efficient Algorithm for Maximal Matching in Radio Networks. In 35th International Symposium on Distributed Computing (DISC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 209, pp. 19:1-19:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{dani_et_al:LIPIcs.DISC.2021.19, author = {Dani, Varsha and Gupta, Aayush and Hayes, Thomas P. and Pettie, Seth}, title = {{Wake up and Join Me! an Energy-Efficient Algorithm for Maximal Matching in Radio Networks}}, booktitle = {35th International Symposium on Distributed Computing (DISC 2021)}, pages = {19:1--19:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-210-5}, ISSN = {1868-8969}, year = {2021}, volume = {209}, editor = {Gilbert, Seth}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.19}, URN = {urn:nbn:de:0030-drops-148219}, doi = {10.4230/LIPIcs.DISC.2021.19}, annote = {Keywords: Distributed Algorithms, Energy-Aware Computation, Radio Networks, Maximal Matching, Sensor Networks} }
Published in: LIPIcs, Volume 207, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)
Varsha Dani, Diksha Gupta, and Thomas P. Hayes. On the Power of Choice for k-Colorability of Random Graphs. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 207, pp. 59:1-59:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{dani_et_al:LIPIcs.APPROX/RANDOM.2021.59, author = {Dani, Varsha and Gupta, Diksha and Hayes, Thomas P.}, title = {{On the Power of Choice for k-Colorability of Random Graphs}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)}, pages = {59:1--59:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-207-5}, ISSN = {1868-8969}, year = {2021}, volume = {207}, editor = {Wootters, Mary and Sanit\`{a}, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2021.59}, URN = {urn:nbn:de:0030-drops-147527}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2021.59}, annote = {Keywords: Random graphs, Achlioptas Processes, Phase Transition, Graph Colorability} }
Feedback for Dagstuhl Publishing