Orr Fischer

MaRDI QIDQ2097331zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
scientific article; zbMATH DE number 7832762 (Why is no real title available?)	2024-04-15	Paper
scientific article; zbMATH DE number 7829267 (Why is no real title available?)	2024-04-09	Paper
Constant-Round Spanners and Shortest Paths in Congested Clique and MPC Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing	2024-03-26	Paper
Massively Parallel Computation in a Heterogeneous Regime Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing	2024-03-26	Paper
Distributed CONGEST Algorithms against Mobile Adversaries Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing	2024-03-26	Paper
Fast distributed algorithms for girth, cycles and small subgraphs	2023-11-02	Paper
A distributed algorithm for directed minimum-weight spanning tree Distributed Computing	2023-03-14	Paper
Sublinear-time distributed algorithms for detecting small cliques and even cycles	2023-02-03	Paper
A distributed algorithm for directed minimum-weight spanning tree	2023-02-03	Paper
Three notes on distributed property testing	2023-02-03	Paper
Proof labeling schemes for reachability-related problems in directed graphs	2022-11-11	Paper
Sublinear-time distributed algorithms for detecting small cliques and even cycles Distributed Computing	2022-06-21	Paper
Public vs. private randomness in simultaneous multi-party communication complexity Theoretical Computer Science	2020-02-06	Paper
Distributed uniformity testing Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing	2019-09-19	Paper
On the multiparty communication complexity of testing triangle-freeness Proceedings of the ACM Symposium on Principles of Distributed Computing	2017-10-11	Paper
A lower bound for the distributed Lovász local lemma Proceedings of the forty-eighth annual ACM symposium on Theory of Computing	2017-09-29	Paper
Public vs. private randomness in simultaneous multi-party communication complexity Structural Information and Communication Complexity	2016-12-01	Paper

Research outcomes over time

This page was built for person: Orr Fischer