| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 42 | Bilel Derbel, Mohamed Mosbah 0001, Akka Zemmari |
Fast distributed graph partition and application.  |
IPDPS  |
2006 |
DBLP DOI BibTeX RDF |
|
| 36 | Ameya R. Agnihotri, Patrick H. Madden |
Congestion reduction in traditional and new routing architectures. |
ACM Great Lakes Symposium on VLSI |
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. |
CoRR |
2024 |
DBLP DOI BibTeX RDF |
|
| 23 | Magnús M. Halldórsson, Alexandre Nolin |
Superfast coloring in CONGEST via efficient color sampling. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
| 23 | Vignesh Manoharan, Vijaya Ramachandran |
Improved Approximation Bounds for Minimum Weight Cycle in the CONGEST Model. |
CoRR |
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. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 23 | Tijn de Vos |
Minimum Cost Flow in the CONGEST Model. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 23 | Leonid Barenboim, Uri Goldenberg |
Speedup of Distributed Algorithms for Power Graphs in the CONGEST Model. |
CoRR |
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. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 23 | Orr Fischer, Merav Parter |
Distributed CONGEST Algorithms against Mobile Adversaries. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 23 | Noy Biton, Reut Levi, Moti Medina |
Distributed CONGEST Algorithm for Finding Hamiltonian Paths in Dirac Graphs and Generalizations. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 23 | Vahan Mkrtchyan |
Reducing Maximum Weighted Matching to the Largest Cardinality Matching in CONGEST. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 23 | Noy Biton, Reut Levi, Moti Medina |
Distributed CONGEST Algorithm for Finding Hamiltonian Paths in Dirac Graphs and Generalizations. |
MFCS |
2023 |
DBLP DOI BibTeX RDF |
|
| 23 | Jhonatan Tavori, Hanoch Levy |
How to Attack and Congest a Network? Worst-Case Link-Targeted DDoS Attacks. |
CoNEXT (Companion) |
2023 |
DBLP DOI BibTeX RDF |
|
| 23 | Jhonatan Tavori, Hanoch Levy |
How to Attack and Congest Delay-Sensitive Applications on the Cloud. |
INFOCOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 23 | Orr Fischer, Merav Parter |
Distributed CONGEST Algorithms against Mobile Adversaries. |
PODC |
2023 |
DBLP DOI BibTeX RDF |
|
| 23 | Tijn de Vos |
Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model. |
PODC |
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. |
SIROCCO |
2023 |
DBLP DOI BibTeX RDF |
|
| 23 | Tijn de Vos |
Minimum Cost Flow in the CONGEST Model. |
SIROCCO |
2023 |
DBLP DOI BibTeX RDF |
|
| 23 | Shiri Chechik, Doron Mukhtar |
Single-source shortest paths in the CONGEST model with improved bounds. |
Distributed Comput. |
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. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
| 23 | Yi-Jun Chang, Hsin-Hao Su |
Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
| 23 | Joran van Apeldoorn, Tijn de Vos |
A Framework for Distributed Quantum Queries in the CONGEST Model. |
CoRR |
2022 |
DBLP BibTeX RDF |
|
| 23 | Xudong Wu, Penghui Yao |
Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
| 23 | Vignesh Manoharan, Vijaya Ramachandran |
Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
| 23 | Yael Hitron, Merav Parter, Eylon Yogev |
Broadcast CONGEST Algorithms Against Eavesdroppers. |
DISC |
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. |
PODC |
2022 |
DBLP DOI BibTeX RDF |
|
| 23 | Yi-Jun Chang, Hsin-Hao Su |
Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions. |
PODC |
2022 |
DBLP DOI BibTeX RDF |
|
| 23 | Xudong Wu, Penghui Yao |
Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks. |
PODC |
2022 |
DBLP DOI BibTeX RDF |
|
| 23 | Joran van Apeldoorn, Tijn de Vos |
A Framework for Distributed Quantum Queries in the CONGEST Model. |
PODC |
2022 |
DBLP DOI BibTeX RDF |
|
| 23 | Reut Levi, Moti Medina, Dana Ron |
Property testing of planarity in the CONGEST model. |
Distributed Comput. |
2021 |
DBLP DOI BibTeX RDF |
|
| 23 | Ali Mashreghi, Valerie King |
Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model. |
Distributed Comput. |
2021 |
DBLP DOI BibTeX RDF |
|
| 23 | Parikshit Saikia, Sushanta Karmakar |
Improved distributed approximation for Steiner tree in the CONGEST model. |
J. Parallel Distributed Comput. |
2021 |
DBLP DOI BibTeX RDF |
|
| 23 | Salwa Faour, Marc Fuchs, Fabian Kuhn |
Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
| 23 | Yannic Maus, Jara Uitto |
Efficient CONGEST Algorithms for the Lovasz Local Lemma. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
| 23 | Saeed Akhoondian Amiri |
Deterministic CONGEST Algorithm for MDS on Bounded Arboricity Graphs. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
| 23 | Magnús M. Halldórsson, Alexandre Nolin |
Superfast Coloring in CONGEST via Efficient Color Sampling. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
| 23 | Yannic Maus, Jara Uitto |
Efficient CONGEST Algorithms for the Lovász Local Lemma. |
DISC |
2021 |
DBLP DOI BibTeX RDF |
|
| 23 | Yael Hitron, Merav Parter |
Broadcast CONGEST Algorithms against Adversarial Edges. |
DISC |
2021 |
DBLP DOI BibTeX RDF |
|
| 23 | Yael Hitron, Merav Parter |
General CONGEST Compilers against Adversarial Edges. |
DISC |
2021 |
DBLP DOI BibTeX RDF |
|
| 23 | Salwa Faour, Marc Fuchs, Fabian Kuhn |
Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings. |
OPODIS |
2021 |
DBLP DOI BibTeX RDF |
|
| 23 | Magnús M. Halldórsson, Alexandre Nolin |
Superfast Coloring in CONGEST via Efficient Color Sampling. |
SIROCCO |
2021 |
DBLP DOI BibTeX RDF |
|
| 23 | Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, Tigran Tonoyan |
Efficient randomized distributed coloring in CONGEST. |
STOC |
2021 |
DBLP DOI BibTeX RDF |
|
| 23 | Artur Czumaj, Christian Konrad 0001 |
Detecting cliques in CONGEST networks. |
Distributed Comput. |
2020 |
DBLP DOI BibTeX RDF |
|
| 23 | Yuval Efron, Ofer Grossman, Seri Khoury |
Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 23 | Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, Tigran Tonoyan |
Efficient Randomized Distributed Coloring in CONGEST. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 23 | Udit Agarwal, Vijaya Ramachandran |
Faster Deterministic All Pairs Shortest Paths in Congest Model. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 23 | Mohamad Ahmadi, Fabian Kuhn |
Distributed Maximum Matching Verification in CONGEST. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 23 | Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus |
Distance-2 Coloring in the CONGEST Model. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 23 | Reut Levi, Moti Medina |
Distributed Testing of Graph Isomorphism in the CONGEST model. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 23 | Salwa Faour, Fabian Kuhn |
Approximate Bipartite Vertex Cover in the CONGEST Model. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 23 | Parikshit Saikia, Sushanta Karmakar |
Round-Message Trade-Off in Distributed Steiner Tree Construction in the CONGEST Model. |
ICDCIT |
2020 |
DBLP DOI BibTeX RDF |
|
| 23 | Ofer Grossman, Seri Khoury, Ami Paz |
Improved Hardness of Approximation of Diameter in the CONGEST Model. |
DISC |
2020 |
DBLP DOI BibTeX RDF |
|
| 23 | Mohamad Ahmadi, Fabian Kuhn |
Distributed Maximum Matching Verification in CONGEST. |
DISC |
2020 |
DBLP DOI BibTeX RDF |
|
| 23 | Shiri Chechik, Doron Mukhtar |
Single-Source Shortest Paths in the CONGEST Model with Improved Bound. |
PODC |
2020 |
DBLP DOI BibTeX RDF |
|
| 23 | Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus |
Distance-2 Coloring in the CONGEST Model. |
PODC |
2020 |
DBLP DOI BibTeX RDF |
|
| 23 | Yuval Efron, Ofer Grossman, Seri Khoury |
Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST. |
PODC |
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. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 23 | Salwa Faour, Fabian Kuhn |
Approximating Bipartite Minimum Vertex Cover in the CONGEST Model. |
OPODIS |
2020 |
DBLP DOI BibTeX RDF |
|
| 23 | Reut Levi, Moti Medina |
Distributed Testing of Graph Isomorphism in the CONGEST Model. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 23 | Leonid Barenboim, Tzalik Maimon |
Simple Distributed Spanners in Dense Congest Networks. |
SOFSEM |
2020 |
DBLP DOI BibTeX RDF |
|
| 23 | Udit Agarwal, Vijaya Ramachandran |
Faster Deterministic All Pairs Shortest Paths in Congest Model. |
SPAA |
2020 |
DBLP DOI BibTeX RDF |
|
| 23 | Shiri Chechik, Doron Mukhtar |
Reachability and Shortest Paths in the Broadcast CONGEST Model. |
CoRR |
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. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
| 23 | Michael Elkin, Shaked Matar |
Near-Additive Spanners In Low Polynomial Deterministic CONGEST Time. |
CoRR |
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. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
| 23 | Janosch Deurer, Fabian Kuhn, Yannic Maus |
Deterministic Distributed Dominating Set Approximation in the CONGEST Model. |
CoRR |
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. |
ICDCN |
2019 |
DBLP DOI BibTeX RDF |
|
| 23 | Shiri Chechik, Doron Mukhtar |
Reachability and Shortest Paths in the Broadcast CONGEST Model. |
DISC |
2019 |
DBLP DOI BibTeX RDF |
|
| 23 | Michael Elkin, Shaked Matar |
Near-Additive Spanners In Low Polynomial Deterministic CONGEST Time. |
PODC |
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. |
PODC |
2019 |
DBLP DOI BibTeX RDF |
|
| 23 | Janosch Deurer, Fabian Kuhn, Yannic Maus |
Deterministic Distributed Dominating Set Approximation in the CONGEST Model. |
PODC |
2019 |
DBLP DOI BibTeX RDF |
|
| 23 | Keren Censor-Hillel, Tariq Toukan |
On fast and robust information spreading in the Vertex-Congest model. |
Theor. Comput. Sci. |
2018 |
DBLP DOI BibTeX RDF |
|
| 23 | Ali Mashreghi, Valerie King |
Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
| 23 | Reut Levi, Moti Medina, Dana Ron |
Property Testing of Planarity in the CONGEST model. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
| 23 | François Le Gall, Frédéric Magniez |
Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
| 23 | Artur Czumaj, Christian Konrad 0001 |
Detecting cliques in CONGEST networks. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
| 23 | Ali Mashreghi, Valerie King |
Broadcast and Minimum Spanning Tree with o(m) Messages in the Asynchronous CONGEST Model. |
DISC |
2018 |
DBLP DOI BibTeX RDF |
|
| 23 | Mohamad Ahmadi, Fabian Kuhn, Rotem Oshman |
Distributed Approximate Maximum Matching in the CONGEST Model. |
DISC |
2018 |
DBLP DOI BibTeX RDF |
|
| 23 | Artur Czumaj, Christian Konrad 0001 |
Detecting Cliques in CONGEST Networks. |
DISC |
2018 |
DBLP DOI BibTeX RDF |
|
| 23 | François Le Gall, Frédéric Magniez |
Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks. |
PODC |
2018 |
DBLP BibTeX RDF |
|
| 23 | Idit Keidar |
Session details: Session 3A: Congest. |
PODC |
2018 |
DBLP BibTeX RDF |
|
| 23 | Reut Levi, Moti Medina, Dana Ron |
Property Testing of Planarity in the CONGEST model. |
PODC |
2018 |
DBLP BibTeX RDF |
|
| 23 | Taisuke Izumi, François Le Gall |
Triangle Finding and Listing in CONGEST Networks. |
CoRR |
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. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
| 23 | Dennis Olivetti |
How Bandwidth Affects the CONGEST Model. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
| 23 | Janne H. Korhonen, Joel Rybicki |
Deterministic subgraph detection in broadcast CONGEST. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
| 23 | Keren Censor-Hillel, Seri Khoury, Ami Paz |
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model. |
CoRR |
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. |
CoRR |
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. |
DISC |
2017 |
DBLP DOI BibTeX RDF |
|
| 23 | Keren Censor-Hillel, Seri Khoury, Ami Paz |
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model. |
DISC |
2017 |
DBLP DOI BibTeX RDF |
|
| 23 | Taisuke Izumi, François Le Gall |
Triangle Finding and Listing in CONGEST Networks. |
PODC |
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. |
PODC |
2017 |
DBLP DOI BibTeX RDF |
|
| 23 | Tzlil Gonen, Rotem Oshman |
Lower Bounds for Subgraph Detection in the CONGEST Model. |
OPODIS |
2017 |
DBLP DOI BibTeX RDF |
|
| 23 | Janne H. Korhonen, Joel Rybicki |
Deterministic Subgraph Detection in Broadcast CONGEST. |
OPODIS |
2017 |
DBLP DOI BibTeX RDF |
|
| 23 | Keren Censor-Hillel, Tariq Toukan |
On Fast and Robust Information Spreading in the Vertex-Congest Model. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
| 23 | Stephan Holzer, Nathan Pinsker |
Approximation of Distances and Shortest Paths in the Broadcast Congest Clique. |
OPODIS |
2015 |
DBLP DOI BibTeX RDF |
|
| 23 | Keren Censor-Hillel, Tariq Toukan |
On Fast and Robust Information Spreading in the Vertex-Congest Model. |
SIROCCO |
2015 |
DBLP DOI BibTeX RDF |
|
| 23 | Stephan Holzer, Nathan Pinsker |
Approximation of Distances and Shortest Paths in the Broadcast Congest Clique. |
CoRR |
2014 |
DBLP BibTeX RDF |
|
| 23 | Fabian Fuchs, Dorothea Wagner |
On Local Broadcasting Schedules and CONGEST Algorithms in the SINR Model. |
ALGOSENSORS |
2013 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license