E-LIB Suche - Ergebnisse für: Oshman, Rotem

1

Multi-Party Set Disjointness and Intersection with Bounded ..:

, In: Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing,

Braverman, Mark ; Oshman, Rotem ; Roth, Tal - p. 332-342 , 2024

Link: https://dl.acm.org/doi/1..

2

History-Independent Concurrent Objects:

, In: Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing,

Attiya, Hagit ; Bender, Michael A. ; Farach-Colton, Martín.. - p. 14-24 , 2024

Link: https://dl.acm.org/doi/1..

3

Locally Verifiable Distributed SNARGs:

, In: Theory of Cryptography; Lecture Notes in Computer Science,

Aldema Tshuva, Eden ; Boyle, Elette ; Cohen, Ran.. - p. 65-90 , 2023

Link: https://doi.org/10.1007/..

4

Proceedings of the 2023 ACM Symposium on Principles of Dist..:

Oshman, Rotem ; Nolin, Alexandre ; Halldorsson, Magnus Mar. , 2023

Link: https://dl.acm.org/doi/1..

5

Brief Announcement: On Polynomial-Time Local Decision:

, In: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing,

Tshuva, Eden Aldema ; Oshman, Rotem - p. 48-50 , 2022

Link: https://dl.acm.org/doi/1..

6

Massively Parallel Computation in a Heterogeneous Regime:

, In: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing,

Fischer, Orr ; Horowitz, Adi ; Oshman, Rotem - p. 345-355 , 2022

Link: https://dl.acm.org/doi/1..

7

Proof Labeling Schemes for Reachability-Related Problems in..:

, In: Structural Information and Communication Complexity; Lecture Notes in Computer Science,

Ben Shimon, Yoav ; Fischer, Orr ; Oshman, Rotem - p. 21-41 , 2022

Link: https://doi.org/10.1007/..

8

A distributed algorithm for directed minimum-weight spannin..:

Fischer, Orr ; Oshman, Rotem
Distributed Computing. 36 (2021) 1 - p. 57-87 , 2021

Link: https://doi.org/10.1007/..

9

The communication complexity of multiparty set disjointness..:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,

Dershowitz, Nachum ; Oshman, Rotem ; Roth, Tal - p. 1194-1207 , 2021

Link: https://dl.acm.org/doi/1..

10

Sublinear-time distributed algorithms for detecting small c..:

Eden, Talya ; Fiat, Nimrod ; Fischer, Orr..
Distributed Computing. 35 (2021) 3 - p. 207-234 , 2021

Link: https://doi.org/10.1007/..

11

Public vs. private randomness in simultaneous multi-party c..:

Fischer, Orr ; Oshman, Rotem ; Zwick, Uri
Theoretical Computer Science. 810 (2020) - p. 72-81 , 2020

Link: https://doi.org/10.1016/..

12

Lower Bounds for Distributed Sketching of Maximal Matchings..:

, In: Proceedings of the 39th Symposium on Principles of Distributed Computing,

Assadi, Sepehr ; Kol, Gillat ; Oshman, Rotem - p. 79-88 , 2020

Link: https://dl.acm.org/doi/1..

13

On the Interactive Capacity of Finite-State Protocols:

Ben-Yishai, Assaf ; Kim, Young-Han ; Oshman, Rotem.
Entropy. 23 (2020) 1 - p. 17 , 2020

Link: https://doi.org/10.3390/..

14

Can Distributed Uniformity Testing Be Local?:

, In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing,

Meir, Uri ; Minzer, Dor ; Oshman, Rotem - p. 228-237 , 2019

Link: https://dl.acm.org/doi/1..

15

On Distributed Merlin-Arthur Decision Protocols:

, In: Structural Information and Communication Complexity; Lecture Notes in Computer Science,

Fraigniaud, Pierre ; Montealegre, Pedro ; Oshman, Rotem.. - p. 230-245 , 2019

Link: https://doi.org/10.1007/..