The following pages link to Orr Fischer (Q2097331):
Displaying 14 items.
- Proof labeling schemes for reachability-related problems in directed graphs (Q2097332) (← links)
- Sublinear-time distributed algorithms for detecting small cliques and even cycles (Q2146871) (← links)
- Public vs. private randomness in simultaneous multi-party communication complexity (Q2292918) (← links)
- A distributed algorithm for directed minimum-weight spanning tree (Q2689838) (← links)
- Public vs. Private Randomness in Simultaneous Multi-party Communication Complexity (Q2835017) (← links)
- Distributed Uniformity Testing (Q5197711) (← links)
- A lower bound for the distributed Lovász local lemma (Q5361853) (← links)
- On the Multiparty Communication Complexity of Testing Triangle-Freeness (Q5368951) (← links)
- (Q6126262) (← links)
- (Q6128585) (← links)
- Three notes on distributed property testing (Q6487486) (← links)
- Sublinear-time distributed algorithms for detecting small cliques and even cycles (Q6487531) (← links)
- A distributed algorithm for directed minimum-weight spanning tree (Q6487532) (← links)
- Fast distributed algorithms for girth, cycles and small subgraphs (Q6535032) (← links)
