default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOrr Fischer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c17]Noga Alon, Dmitrii Avdiukhin, Dor Elboim, Orr Fischer, Grigory Yaroslavtsev:
Optimal Sample Complexity of Contrastive Learning. ICLR 2024- 2023
- [j3]Orr Fischer, Rotem Oshman:
A distributed algorithm for directed minimum-weight spanning tree. Distributed Comput. 36(1): 57-87 (2023) - [c16]Dmitrii Avdiukhin, Grigory Yaroslavtsev, Danny Vainstein, Orr Fischer, Sauman Das, Faraz Mirza:
Tree Learning: Optimal Sample Complexity and Algorithms. AAAI 2023: 6701-6708 - [c15]Orr Fischer
, Merav Parter:
Distributed CONGEST Algorithms against Mobile Adversaries. PODC 2023: 262-273 - [i10]Dmitrii Avdiukhin, Grigory Yaroslavtsev, Danny Vainstein, Orr Fischer, Sauman Das, Faraz Mirza:
Tree Learning: Optimal Algorithms and Sample Complexity. CoRR abs/2302.04492 (2023) - [i9]Orr Fischer, Adi Horowitz, Rotem Oshman:
Massively Parallel Computation in a Heterogeneous Regime. CoRR abs/2302.14692 (2023) - [i8]Orr Fischer, Merav Parter:
Distributed CONGEST Algorithms against Mobile Adversaries. CoRR abs/2305.14300 (2023) - [i7]Noga Alon, Dmitrii Avdiukhin, Dor Elboim, Orr Fischer, Grigory Yaroslavtsev:
Optimal Sample Complexity of Contrastive Learning. CoRR abs/2312.00379 (2023) - 2022
- [j2]Talya Eden, Nimrod Fiat, Orr Fischer, Fabian Kuhn, Rotem Oshman:
Sublinear-time distributed algorithms for detecting small cliques and even cycles. Distributed Comput. 35(3): 207-234 (2022) - [c14]Keren Censor-Hillel, Orr Fischer, François Le Gall, Dean Leitersdorf, Rotem Oshman:
Quantum Distributed Algorithms for Detection of Cliques. ITCS 2022: 35:1-35:25 - [c13]Orr Fischer, Adi Horowitz, Rotem Oshman:
Massively Parallel Computation in a Heterogeneous Regime. PODC 2022: 345-355 - [c12]Yoav Ben Shimon, Orr Fischer, Rotem Oshman:
Proof Labeling Schemes for Reachability-Related Problems in Directed Graphs. SIROCCO 2022: 21-41 - [i6]Keren Censor-Hillel, Orr Fischer, François Le Gall, Dean Leitersdorf, Rotem Oshman:
Quantum Distributed Algorithms for Detection of Cliques. CoRR abs/2201.03000 (2022) - 2021
- [c11]Orr Fischer, Rotem Oshman, Dana Shamir:
Explicit Space-Time Tradeoffs for Proof Labeling Schemes in Graphs with Small Separators. OPODIS 2021: 21:1-21:22 - [c10]Michal Dory, Orr Fischer, Seri Khoury, Dean Leitersdorf:
Constant-Round Spanners and Shortest Paths in Congested Clique and MPC. PODC 2021: 223-233 - [i5]Keren Censor-Hillel, Orr Fischer, Tzlil Gonen, François Le Gall, Dean Leitersdorf, Rotem Oshman:
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs. CoRR abs/2101.07590 (2021) - 2020
- [j1]Orr Fischer, Rotem Oshman, Uri Zwick:
Public vs. private randomness in simultaneous multi-party communication complexity. Theor. Comput. Sci. 810: 72-81 (2020) - [c9]Keren Censor-Hillel, Orr Fischer, Tzlil Gonen, François Le Gall, Dean Leitersdorf, Rotem Oshman:
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs. DISC 2020: 33:1-33:17
2010 – 2019
- 2019
- [c8]Talya Eden, Nimrod Fiat, Orr Fischer, Fabian Kuhn, Rotem Oshman:
Sublinear-Time Distributed Algorithms for Detecting Small Cliques and Even Cycles. DISC 2019: 15:1-15:16 - [c7]Orr Fischer, Rotem Oshman:
A Distributed Algorithm for Directed Minimum-Weight Spanning Tree. DISC 2019: 16:1-16:16 - 2018
- [c6]Orr Fischer, Uri Meir, Rotem Oshman:
Distributed Uniformity Testing. PODC 2018: 455-464 - [c5]Orr Fischer, Tzlil Gonen, Fabian Kuhn, Rotem Oshman:
Possibilities and Impossibilities for Distributed Subgraph Detection. SPAA 2018: 153-162 - 2017
- [c4]Orr Fischer, Shay Gershtein, Rotem Oshman:
On the Multiparty Communication Complexity of Testing Triangle-Freeness. PODC 2017: 111-120 - [c3]Guy Even, Orr Fischer, Pierre Fraigniaud, Tzlil Gonen, Reut Levi, Moti Medina, Pedro Montealegre, Dennis Olivetti, Rotem Oshman, Ivan Rapaport, Ioan Todinca:
Three Notes on Distributed Property Testing. DISC 2017: 15:1-15:30 - [i4]Orr Fischer, Tzlil Gonen, Rotem Oshman:
Distributed Property Testing for Subgraph-Freeness Revisited. CoRR abs/1705.04033 (2017) - [i3]Orr Fischer, Shay Gershtein, Rotem Oshman:
On The Multiparty Communication Complexity of Testing Triangle-Freeness. CoRR abs/1705.08438 (2017) - [i2]Orr Fischer, Tzlil Gonen, Rotem Oshman:
Superlinear Lower Bounds for Distributed Subgraph Detection. CoRR abs/1711.06920 (2017) - 2016
- [c2]Orr Fischer, Rotem Oshman, Uri Zwick:
Public vs. Private Randomness in Simultaneous Multi-party Communication Complexity. SIROCCO 2016: 60-74 - [c1]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. STOC 2016: 479-488 - 2015
- [i1]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. CoRR abs/1511.00900 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-30 21:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
