Pages that link to "Item:Q5915702"
From MaRDI portal
The following pages link to Fast distributed algorithms for testing graph properties (Q5915702):
Displaying 16 items.
- On mobile agent verifiable problems (Q1753994) (← links)
- Sublinear-time distributed algorithms for detecting small cliques and even cycles (Q2146871) (← links)
- Detecting cliques in CONGEST networks (Q2220401) (← links)
- Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402) (← links)
- Property testing of planarity in the \textsf{CONGEST} model (Q2657275) (← links)
- Quantum and classical query complexities for generalized Deutsch-Jozsa problems (Q2677211) (← links)
- Deterministic Subgraph Detection in Broadcast CONGEST. (Q3300802) (← links)
- Lower Bounds for Subgraph Detection in the CONGEST Model (Q3300805) (← links)
- (Q5005119) (← links)
- (Q5090906) (← links)
- (Q5092335) (← links)
- Distributed Testing of Distance-k Colorings (Q5100965) (← links)
- On a Verification Framework for Certifying Distributed Algorithms: Distributed Checking and Consistency (Q5881540) (← links)
- (Q5915973) (redirect page) (← links)
- Distributed Testing of Graph Isomorphism in the CONGEST Model. (Q6084362) (← links)
- Time-optimal construction of overlay networks (Q6096036) (← links)
