Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
42 | Bilel Derbel, Mohamed Mosbah 0001, Akka Zemmari |
Fast distributed graph partition and application. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), Proceedings, 25-29 April 2006, Rhodes Island, Greece, 2006, IEEE. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Ameya R. Agnihotri, Patrick H. Madden |
Congestion reduction in traditional and new routing architectures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Great Lakes Symposium on VLSI ![In: Proceedings of the 13th ACM Great Lakes Symposium on VLSI 2003, Washington, DC, USA, April 28-29, 2003, pp. 211-214, 2003, ACM, 1-58113-677-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
non-Manhattan design, congest, steiner trees, global routing |
23 | Pierre Fraigniaud, Maël Luce, Frédéric Magniez, Ioan Todinca |
Even-Cycle Detection in the Randomized and Quantum CONGEST Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.12018, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
23 | Magnús M. Halldórsson, Alexandre Nolin |
Superfast coloring in CONGEST via efficient color sampling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 948, pp. 113711, February 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Vignesh Manoharan, Vijaya Ramachandran |
Improved Approximation Bounds for Minimum Weight Cycle in the CONGEST Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2308.08670, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Pierre Fraigniaud, Maël Luce, Ioan Todinca |
On the Power of Threshold-Based Algorithms for Detecting Cycles in the CONGEST Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2304.02360, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Tijn de Vos |
Minimum Cost Flow in the CONGEST Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2304.01600, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Leonid Barenboim, Uri Goldenberg |
Speedup of Distributed Algorithms for Power Graphs in the CONGEST Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.04358, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Udit Agarwal |
Distributed Deterministic Exact Minimum Weight Cycle and Multi Source Shortest Paths in Near Linear Rounds in CONGEST model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2310.00782, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Orr Fischer, Merav Parter |
Distributed CONGEST Algorithms against Mobile Adversaries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.14300, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Noy Biton, Reut Levi, Moti Medina |
Distributed CONGEST Algorithm for Finding Hamiltonian Paths in Dirac Graphs and Generalizations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2302.00742, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Vahan Mkrtchyan |
Reducing Maximum Weighted Matching to the Largest Cardinality Matching in CONGEST. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2301.01084, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Noy Biton, Reut Levi, Moti Medina |
Distributed CONGEST Algorithm for Finding Hamiltonian Paths in Dirac Graphs and Generalizations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: 48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, August 28 to September 1, 2023, Bordeaux, France, pp. 19:1-19:14, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-292-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Jhonatan Tavori, Hanoch Levy |
How to Attack and Congest a Network? Worst-Case Link-Targeted DDoS Attacks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoNEXT (Companion) ![In: Companion of the 19th International Conference on emerging Networking EXperiments and Technologies, CoNEXT 2023, Paris, France, December 5-8, 2023, pp. 69-70, 2023, ACM. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Jhonatan Tavori, Hanoch Levy |
How to Attack and Congest Delay-Sensitive Applications on the Cloud. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFOCOM ![In: IEEE INFOCOM 2023 - IEEE Conference on Computer Communications, New York City, NY, USA, May 17-20, 2023, pp. 1-10, 2023, IEEE, 979-8-3503-3414-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Orr Fischer, Merav Parter |
Distributed CONGEST Algorithms against Mobile Adversaries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, PODC 2023, Orlando, FL, USA, June 19-23, 2023, pp. 262-273, 2023, ACM. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Tijn de Vos |
Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, PODC 2023, Orlando, FL, USA, June 19-23, 2023, pp. 71-74, 2023, ACM. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Pierre Fraigniaud, Maël Luce, Ioan Todinca |
On the Power of Threshold-Based Algorithms for Detecting Cycles in the CONGEST Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIROCCO ![In: Structural Information and Communication Complexity - 30th International Colloquium, SIROCCO 2023, Alcalá de Henares, Spain, June 6-9, 2023, Proceedings, pp. 459-481, 2023, Springer, 978-3-031-32732-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Tijn de Vos |
Minimum Cost Flow in the CONGEST Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIROCCO ![In: Structural Information and Communication Complexity - 30th International Colloquium, SIROCCO 2023, Alcalá de Henares, Spain, June 6-9, 2023, Proceedings, pp. 406-426, 2023, Springer, 978-3-031-32732-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Shiri Chechik, Doron Mukhtar |
Single-source shortest paths in the CONGEST model with improved bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 35(4), pp. 357-374, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | ChengSheng Wang, Xudong Wu, Penghui Yao |
Complexity of Eccentricities and All-Pairs Shortest Paths in the Quantum CONGEST Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2206.02766, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Yi-Jun Chang, Hsin-Hao Su |
Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2205.08093, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Joran van Apeldoorn, Tijn de Vos |
A Framework for Distributed Quantum Queries in the CONGEST Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2202.10969, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
23 | Xudong Wu, Penghui Yao |
Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2206.02767, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Vignesh Manoharan, Vijaya Ramachandran |
Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2205.14797, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Yael Hitron, Merav Parter, Eylon Yogev |
Broadcast CONGEST Algorithms Against Eavesdroppers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA., pp. 27:1-27:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-255-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Vignesh Manoharan, Vijaya Ramachandran |
Brief Announcement: Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, pp. 369-371, 2022, ACM, 978-1-4503-9262-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Yi-Jun Chang, Hsin-Hao Su |
Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, pp. 301-312, 2022, ACM, 978-1-4503-9262-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Xudong Wu, Penghui Yao |
Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, pp. 120-130, 2022, ACM, 978-1-4503-9262-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Joran van Apeldoorn, Tijn de Vos |
A Framework for Distributed Quantum Queries in the CONGEST Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, pp. 109-119, 2022, ACM, 978-1-4503-9262-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Reut Levi, Moti Medina, Dana Ron |
Property testing of planarity in the CONGEST model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 34(1), pp. 15-32, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Ali Mashreghi, Valerie King |
Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 34(4), pp. 283-299, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Parikshit Saikia, Sushanta Karmakar |
Improved distributed approximation for Steiner tree in the CONGEST model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Parallel Distributed Comput. ![In: J. Parallel Distributed Comput. 158, pp. 196-212, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Salwa Faour, Marc Fuchs, Fabian Kuhn |
Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2111.10577, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
23 | Yannic Maus, Jara Uitto |
Efficient CONGEST Algorithms for the Lovasz Local Lemma. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2108.02638, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
23 | Saeed Akhoondian Amiri |
Deterministic CONGEST Algorithm for MDS on Bounded Arboricity Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2102.08076, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
23 | Magnús M. Halldórsson, Alexandre Nolin |
Superfast Coloring in CONGEST via Efficient Color Sampling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2102.04546, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
23 | Yannic Maus, Jara Uitto |
Efficient CONGEST Algorithms for the Lovász Local Lemma. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: 35th International Symposium on Distributed Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany (Virtual Conference)., pp. 31:1-31:19, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-210-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Yael Hitron, Merav Parter |
Broadcast CONGEST Algorithms against Adversarial Edges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: 35th International Symposium on Distributed Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany (Virtual Conference)., pp. 23:1-23:19, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-210-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Yael Hitron, Merav Parter |
General CONGEST Compilers against Adversarial Edges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: 35th International Symposium on Distributed Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany (Virtual Conference)., pp. 24:1-24:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-210-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Salwa Faour, Marc Fuchs, Fabian Kuhn |
Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OPODIS ![In: 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France., pp. 17:1-17:20, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-219-8. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Magnús M. Halldórsson, Alexandre Nolin |
Superfast Coloring in CONGEST via Efficient Color Sampling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIROCCO ![In: Structural Information and Communication Complexity - 28th International Colloquium, SIROCCO 2021, Wrocław, Poland, June 28 - July 1, 2021, Proceedings, pp. 68-83, 2021, Springer, 978-3-030-79526-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, Tigran Tonoyan |
Efficient randomized distributed coloring in CONGEST. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021., pp. 1180-1193, 2021, ACM, 978-1-4503-8053-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Artur Czumaj, Christian Konrad 0001 |
Detecting cliques in CONGEST networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 33(6), pp. 533-543, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Yuval Efron, Ofer Grossman, Seri Khoury |
Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2003.07427, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
23 | Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, Tigran Tonoyan |
Efficient Randomized Distributed Coloring in CONGEST. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2012.14169, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
23 | Udit Agarwal, Vijaya Ramachandran |
Faster Deterministic All Pairs Shortest Paths in Congest Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2005.09588, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
23 | Mohamad Ahmadi, Fabian Kuhn |
Distributed Maximum Matching Verification in CONGEST. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2002.07649, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
23 | Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus |
Distance-2 Coloring in the CONGEST Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2005.06528, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
23 | Reut Levi, Moti Medina |
Distributed Testing of Graph Isomorphism in the CONGEST model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2003.00468, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
23 | Salwa Faour, Fabian Kuhn |
Approximate Bipartite Vertex Cover in the CONGEST Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2011.10014, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
23 | Parikshit Saikia, Sushanta Karmakar |
Round-Message Trade-Off in Distributed Steiner Tree Construction in the CONGEST Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCIT ![In: Distributed Computing and Internet Technology - 16th International Conference, ICDCIT 2020, Bhubaneswar, India, January 9-12, 2020, Proceedings, pp. 111-126, 2020, Springer, 978-3-030-36986-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Ofer Grossman, Seri Khoury, Ami Paz |
Improved Hardness of Approximation of Diameter in the CONGEST Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: 34th International Symposium on Distributed Computing, DISC 2020, October 12-16, 2020, Virtual Conference., pp. 19:1-19:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-168-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Mohamad Ahmadi, Fabian Kuhn |
Distributed Maximum Matching Verification in CONGEST. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: 34th International Symposium on Distributed Computing, DISC 2020, October 12-16, 2020, Virtual Conference., pp. 37:1-37:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-168-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Shiri Chechik, Doron Mukhtar |
Single-Source Shortest Paths in the CONGEST Model with Improved Bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: PODC '20: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3-7, 2020, pp. 464-473, 2020, ACM, 978-1-4503-7582-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus |
Distance-2 Coloring in the CONGEST Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: PODC '20: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3-7, 2020, pp. 233-242, 2020, ACM, 978-1-4503-7582-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Yuval Efron, Ofer Grossman, Seri Khoury |
Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: PODC '20: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3-7, 2020, pp. 511-520, 2020, ACM, 978-1-4503-7582-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Taisuke Izumi, François Le Gall, Frédéric Magniez |
Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France., pp. 23:1-23:13, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-140-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Salwa Faour, Fabian Kuhn |
Approximating Bipartite Minimum Vertex Cover in the CONGEST Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OPODIS ![In: 24th International Conference on Principles of Distributed Systems, OPODIS 2020, December 14-16, 2020, Strasbourg, France (Virtual Conference)., pp. 29:1-29:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-176-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Reut Levi, Moti Medina |
Distributed Testing of Graph Isomorphism in the CONGEST Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 19:1-19:24, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Leonid Barenboim, Tzalik Maimon |
Simple Distributed Spanners in Dense Congest Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2020: Theory and Practice of Computer Science - 46th International Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2020, Limassol, Cyprus, January 20-24, 2020, Proceedings, pp. 260-272, 2020, Springer, 978-3-030-38918-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Udit Agarwal, Vijaya Ramachandran |
Faster Deterministic All Pairs Shortest Paths in Congest Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020, pp. 11-21, 2020, ACM, 978-1-4503-6935-0. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Shiri Chechik, Doron Mukhtar |
Reachability and Shortest Paths in the Broadcast CONGEST Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1910.05645, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
23 | Taisuke Izumi, François Le Gall, Frédéric Magniez |
Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1908.11488, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
23 | Michael Elkin, Shaked Matar |
Near-Additive Spanners In Low Polynomial Deterministic CONGEST Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1903.00872, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
23 | Taisuke Izumi, François Le Gall |
Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1906.02456, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
23 | Janosch Deurer, Fabian Kuhn, Yannic Maus |
Deterministic Distributed Dominating Set Approximation in the CONGEST Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1905.10775, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
23 | Parikshit Saikia, Sushanta Karmakar |
A simple 2(1-1/l) factor distributed approximation algorithm for steiner tree in the CONGEST model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCN ![In: Proceedings of the 20th International Conference on Distributed Computing and Networking, ICDCN 2019, Bangalore, India, January 04-07, 2019, pp. 41-50, 2019, ACM, 978-1-4503-6094-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Shiri Chechik, Doron Mukhtar |
Reachability and Shortest Paths in the Broadcast CONGEST Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: 33rd International Symposium on Distributed Computing, DISC 2019, October 14-18, 2019, Budapest, Hungary., pp. 11:1-11:13, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-126-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Michael Elkin, Shaked Matar |
Near-Additive Spanners In Low Polynomial Deterministic CONGEST Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 - August 2, 2019., pp. 531-540, 2019, ACM, 978-1-4503-6217-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Taisuke Izumi, François Le Gall |
Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 - August 2, 2019., pp. 84-93, 2019, ACM, 978-1-4503-6217-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Janosch Deurer, Fabian Kuhn, Yannic Maus |
Deterministic Distributed Dominating Set Approximation in the CONGEST Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 - August 2, 2019., pp. 94-103, 2019, ACM, 978-1-4503-6217-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Keren Censor-Hillel, Tariq Toukan |
On fast and robust information spreading in the Vertex-Congest model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 751, pp. 74-90, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Ali Mashreghi, Valerie King |
Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1806.04328, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
23 | Reut Levi, Moti Medina, Dana Ron |
Property Testing of Planarity in the CONGEST model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1805.10657, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
23 | François Le Gall, Frédéric Magniez |
Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1804.02917, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
23 | Artur Czumaj, Christian Konrad 0001 |
Detecting cliques in CONGEST networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1807.01070, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
23 | Ali Mashreghi, Valerie King |
Broadcast and Minimum Spanning Tree with o(m) Messages in the Asynchronous CONGEST Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: 32nd International Symposium on Distributed Computing, DISC 2018, New Orleans, LA, USA, October 15-19, 2018, pp. 37:1-37:17, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-092-7. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Mohamad Ahmadi, Fabian Kuhn, Rotem Oshman |
Distributed Approximate Maximum Matching in the CONGEST Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: 32nd International Symposium on Distributed Computing, DISC 2018, New Orleans, LA, USA, October 15-19, 2018, pp. 6:1-6:17, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-092-7. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Artur Czumaj, Christian Konrad 0001 |
Detecting Cliques in CONGEST Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: 32nd International Symposium on Distributed Computing, DISC 2018, New Orleans, LA, USA, October 15-19, 2018, pp. 16:1-16:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-092-7. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
23 | François Le Gall, Frédéric Magniez |
Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC 2018, Egham, United Kingdom, July 23-27, 2018, pp. 337-346, 2018, ACM. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
23 | Idit Keidar |
Session details: Session 3A: Congest. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC 2018, Egham, United Kingdom, July 23-27, 2018, 2018, ACM. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
23 | Reut Levi, Moti Medina, Dana Ron |
Property Testing of Planarity in the CONGEST model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC 2018, Egham, United Kingdom, July 23-27, 2018, pp. 347-356, 2018, ACM. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
23 | Taisuke Izumi, François Le Gall |
Triangle Finding and Listing in CONGEST Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1705.09061, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
23 | Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson 0002 |
Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1705.07861, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
23 | Dennis Olivetti |
How Bandwidth Affects the CONGEST Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1704.06092, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
23 | Janne H. Korhonen, Joel Rybicki |
Deterministic subgraph detection in broadcast CONGEST. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1705.10195, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
23 | Keren Censor-Hillel, Seri Khoury, Ami Paz |
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1705.05646, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
23 | Guy Even, Reut Levi, Moti Medina |
Faster and Simpler Distributed Algorithms for Testing and Correcting Graph Properties in the CONGEST-Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1705.04898, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
23 | Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson 0002 |
Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: 31st International Symposium on Distributed Computing, DISC 2017, October 16-20, 2017, Vienna, Austria, pp. 38:1-38:16, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-053-8. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
23 | Keren Censor-Hillel, Seri Khoury, Ami Paz |
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: 31st International Symposium on Distributed Computing, DISC 2017, October 16-20, 2017, Vienna, Austria, pp. 10:1-10:16, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-053-8. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
23 | Taisuke Izumi, François Le Gall |
Triangle Finding and Listing in CONGEST Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2017, Washington, DC, USA, July 25-27, 2017, pp. 381-389, 2017, ACM, 978-1-4503-4992-5. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
23 | Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson 0002 |
Brief Announcement: Symmetry Breaking in the CONGEST Model: Time- and Message-Efficient Algorithms for Ruling Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2017, Washington, DC, USA, July 25-27, 2017, pp. 207-209, 2017, ACM, 978-1-4503-4992-5. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
23 | Tzlil Gonen, Rotem Oshman |
Lower Bounds for Subgraph Detection in the CONGEST Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OPODIS ![In: 21st International Conference on Principles of Distributed Systems, OPODIS 2017, Lisbon, Portugal, December 18-20, 2017, pp. 6:1-6:16, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-061-3. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
23 | Janne H. Korhonen, Joel Rybicki |
Deterministic Subgraph Detection in Broadcast CONGEST. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OPODIS ![In: 21st International Conference on Principles of Distributed Systems, OPODIS 2017, Lisbon, Portugal, December 18-20, 2017, pp. 4:1-4:16, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-061-3. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
23 | Keren Censor-Hillel, Tariq Toukan |
On Fast and Robust Information Spreading in the Vertex-Congest Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1507.01181, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
23 | Stephan Holzer, Nathan Pinsker |
Approximation of Distances and Shortest Paths in the Broadcast Congest Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OPODIS ![In: 19th International Conference on Principles of Distributed Systems, OPODIS 2015, December 14-17, 2015, Rennes, France, pp. 6:1-6:16, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-98-9. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Keren Censor-Hillel, Tariq Toukan |
On Fast and Robust Information Spreading in the Vertex-Congest Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIROCCO ![In: Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings, pp. 270-284, 2015, Springer, 978-3-319-25257-5. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Stephan Holzer, Nathan Pinsker |
Approximation of Distances and Shortest Paths in the Broadcast Congest Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1412.3445, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
23 | Fabian Fuchs, Dorothea Wagner |
On Local Broadcasting Schedules and CONGEST Algorithms in the SINR Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALGOSENSORS ![In: Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers, pp. 170-184, 2013, Springer, 978-3-642-45345-8. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|