Orr Fischer

Generating author description...

All published works

Action	Title	Year	Authors
+	Distributed CONGEST Algorithms against Mobile Adversaries	2023	Orr Fischer Merav Parter
+	Tree Learning: Optimal Algorithms and Sample Complexity	2023	Dmitrii Avdiukhin Grigory Yaroslavtsev Danny Vainstein Orr Fischer Sauman Das Faraz Mirza
+	Massively Parallel Computation in a Heterogeneous Regime	2023	Orr Fischer Adi Horowitz Rotem Oshman
+	Distributed CONGEST Algorithms against Mobile Adversaries	2023	Orr Fischer Merav Parter
+	Optimal Sample Complexity of Contrastive Learning	2023	Noga Alon Dmitrii Avdiukhin Dor Elboim Orr Fischer Grigory Yaroslavtsev
+ PDF Chat	Massively Parallel Computation in a Heterogeneous Regime	2022	Orr Fischer Adi Horowitz Rotem Oshman
+	Quantum Distributed Algorithms for Detection of Cliques	2022	Keren Censor-Hillel Orr Fischer François Le Gall Dean Leitersdorf Rotem Oshman
+	Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs	2021	Keren Censor-Hillel Orr Fischer Tzlil Gonen François Le Gall Dean Leitersdorf Rotem Oshman
+ PDF Chat	On the Multiparty Communication Complexity of Testing Triangle-Freeness	2017	Orr Fischer Shay Gershtein Rotem Oshman
+	On The Multiparty Communication Complexity of Testing Triangle-Freeness	2017	Orr Fischer Shay Gershtein Rotem Oshman
+	Distributed Property Testing for Subgraph-Freeness Revisited	2017	Orr Fischer Tzlil Gonen Rotem Oshman
+	Superlinear Lower Bounds for Distributed Subgraph Detection	2017	Orr Fischer Tzlil Gonen Rotem Oshman
+	On The Multiparty Communication Complexity of Testing Triangle-Freeness	2017	Orr Fischer Shay Gershtein Rotem Oshman
+ PDF Chat	A lower bound for the distributed Lovász local lemma	2016	Sebastian Brandt Orr Fischer Juho Hirvonen Barbara Keller Tuomo Lempiäinen Joel Rybicki Jukka Suomela Jara Uitto
+	A Lower Bound for the Distributed Lov\'asz Local Lemma	2015	Sebastian Brandt Orr Fischer Juho Hirvonen Barbara Keller Tuomo Lempiäinen Joel Rybicki Jukka Suomela Jara Uitto
+	A Lower Bound for the Distributed Lovász Local Lemma	2015	Sebastian Brandt Orr Fischer Juho Hirvonen Barbara Keller Tuomo Lempiäinen Joel Rybicki Jukka Suomela Jara Uitto

Common Coauthors

Coauthor	Papers Together
Rotem Oshman	9
Tuomo Lempiäinen	3
Tzlil Gonen	3
Jara Uitto	3
Shay Gershtein	3
Jukka Suomela	3
Joel Rybicki	3
Juho Hirvonen	3
Sebastian Brandt	3
Keren Censor-Hillel	2
Dean Leitersdorf	2
François Le Gall	2
Merav Parter	2
Adi Horowitz	2
Grigory Yaroslavtsev	2
Dmitrii Avdiukhin	2
Barbara Keller	2
Noga Alon	1
Danny Vainstein	1
Dor Elboim	1
Barbara Keller	1
Sauman Das	1
Faraz Mirza	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Algebraic methods in the congested clique	2016	Keren Censor-Hillel Petteri Kaski Janne H. Korhonen Christoph Lenzen Ami Paz Jukka Suomela	5
+ PDF Chat	“Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting	2012	Danny Dolev Christoph Lenzen Shir Peled	4
+ PDF Chat	Fast Distributed Algorithms for Testing Graph Properties	2016	Keren Censor-Hillel Eldar Fischer Gregory Schwartzman Yadu Vasudev	2
+ PDF Chat	Communication lower bounds for statistical estimation problems via a distributed data processing inequality	2016	Mark Braverman Ankit Garg Tengyu Ma Huy L. Nguyễn David P. Woodruff	2
+	Improved bounds and parallel algorithms for the Lovasz Local Lemma.	2015	Bernhard Haeupler David G. Harris	2
+ PDF Chat	Dynamic Graph Stream Algorithms in $o(n)$ Space	2016	Zengfeng Huang Peng Pan	2
+ PDF Chat	Optimal principal component analysis in distributed and streaming models	2016	Christos Boutsidis David P. Woodruff Peilin Zhong	2
+	Testing subgraphs in directed graphs	2003	Noga Alon A. Shapira	2
+	Property testing in bounded degree graphs	1997	Oded Goldreich Dana Ron	2
+ PDF Chat	A new proof of the graph removal lemma	2011	Jacob Fox	2
+ PDF Chat	Approximately Counting Triangles in Sublinear Time	2015	Talya Eden Amit Levi Dana Ron C. Seshadhri	2
+	Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems	2016	François Le Gall	2
+	The one-way communication complexity of the Boolean Hidden Matching Problem	2006	Iordanis Kerenidis Ran Raz	2
+	Testing triangle-freeness in general graphs	2006	Noga Alon Tali Kaufman Michael Krivelevich Dana Ron	2
+	Deterministic subgraph detection in broadcast CONGEST	2017	Janne H. Korhonen Joel Rybicki	2
+ PDF Chat	Performance of modularity maximization in practical contexts	2010	Benjamin H. Good Yves-Alexandre de Montjoye Aaron Clauset	1
+ PDF Chat	Lower bounds for local approximation	2013	Mika Göös Juho Hirvonen Jukka Suomela	1
+ PDF Chat	New Constructive Aspects of the Lovász Local Lemma	2011	Bernhard Haeupler Barna Saha Aravind Srinivasan	1
+ PDF Chat	Algebraic Methods in the Congested Clique	2015	Keren Censor-Hillel Petteri Kaski Janne H. Korhonen Christoph Lenzen Ami Paz Jukka Suomela	1
+ PDF Chat	A constructive proof of the general lovász local lemma	2010	Robin A. Moser Gábor Tardos	1
+ PDF Chat	Towards real-time community detection in large networks	2009	Ian X. Y. Leung Pan Hui Píetro Lió Jon Crowcroft	1
+ PDF Chat	An Extension of the Lovász Local Lemma, and its Applications to Integer Programming	2006	Aravind Srinivasan	1
+ PDF Chat	A parallel algorithmic version of the local lemma	1991	Noga Alon	1
+ PDF Chat	Distributed $(\Delta+1)$-Coloring in Linear (in $\Delta$) Time	2014	Leonid Barenboim Michael Elkin Fabian Kühn	1
+ PDF Chat	Optimal deterministic routing and sorting on the congested clique	2013	Christoph Lenzen	1
+ PDF Chat	On the Communication Complexity of Linear Algebraic Problems in the Message Passing Model	2014	Yi Li Xiaoming Sun Chengu Wang David P. Woodruff	1
+ PDF Chat	Deterministic Algorithms for the Lovász Local Lemma	2013	Karthekeyan Chandrasekaran Navin Goyal Bernhard Haeupler	1
+ PDF Chat	A tail bound for read‐<i>k</i> families of functions	2014	Dmitry Gavinsky Shachar Lovett Michael Saks Srikanth Srinivasan	1
+ PDF Chat	The Locality of Distributed Symmetry Breaking	2012	Leonid Barenboim Michael Elkin Seth Pettie Johannes Schneider	1
+ PDF Chat	Tight bounds for distributed functional monitoring	2012	David P. Woodruff Qin Zhang	1
+ PDF Chat	Distributed community detection in dynamic graphs	2014	Andrea Clementi Miriam Di Ianni Giorgio Gambosi Emanuele Natale Riccardo Silvestri	1
+ PDF Chat	Limits of local algorithms over sparse random graphs	2014	David Gamarnik Madhu Sudan	1
+	An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model	2016	Yi‐Jun Chang Tsvi Kopelowitz Seth Pettie	1
+ PDF Chat	Equivalence between modularity optimization and maximum likelihood methods for community detection	2016	M. E. J. Newman	1
+	Community detection and stochastic block models: recent developments	2017	Emmanuel Abbé	1
+	Faster and Simpler Distributed Algorithms for Testing and Correcting Graph Properties in the CONGEST-Model	2017	Guy Even Reut Levi Moti Medina	1
+	Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model	2017	Keren Censor-Hillel Seri Khoury Ami Paz	1
+ PDF Chat	Triangle Finding and Listing in CONGEST Networks	2017	Taisuke Izumi François Le Gall	1
+	Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion	2017	Amir Abboud Keren Censor-Hillel Seri Khoury Christoph Lenzen	1
+	Distributed triangle detection via expander decomposition	2019	Yi‐Jun Chang Seth Pettie Hengjie Zhang	1
+ PDF Chat	Distributed Algorithms Made Secure: A Graph Theoretic Approach	2019	Merav Parter Eylon Yogev	1
+	When Distributed Computation is Communication Expensive	2013	David P. Woodruff Qin Zhang	1
+	A constructive proof of the general Lovasz Local Lemma	2009	Robin A. Moser Gábor Tardos	1
+ PDF Chat	Low Congestion Cycle Covers and Their Applications	2019	Merav Parter Eylon Yogev	1
+	A Hybrid Sampling Scheme for Triangle Counting	2017	John Kallaugher Eric Price	1
+	Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy	2012	Jeff M. Phillips Elad Verbin Qin Zhang	1
+	An Improved Distributed Algorithm for Maximal Independent Set	2015	Mohsen Ghaffari	1
+ PDF Chat	Fast Approximate Shortest Paths in the Congested Clique	2019	Keren Censor-Hillel Michal Dory Janne H. Korhonen Dean Leitersdorf	1
+ PDF Chat	Exact Recovery in the Stochastic Block Model	2015	Emmanuel Abbé Afonso S. Bandeira Georgina Hall	1
+	Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration	2019	Yi‐Jun Chang Thatchaphol Saranurak	1