default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOfer Grossman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[b1]Ofer Grossman:
Pseudo-determinism. MIT, USA, 2023- [c14]Ofer Grossman, Meghal Gupta, Mark Sellke:
Tight Space Lower Bound for Pseudo-Deterministic Approximate Counting. FOCS 2023: 1496-1504 - [i20]Ofer Grossman, Meghal Gupta, Mark Sellke
:
Tight Space Lower Bound for Pseudo-Deterministic Approximate Counting. CoRR abs/2304.01438 (2023) - 2021
- [c13]Ofer Grossman, Justin Holmgren:
Error Correcting Codes for Uncompressed Messages. ITCS 2021: 43:1-43:18 - 2020
- [j1]Ofer Grossman, Dana Moshkovitz:
Amplification and Derandomization without Slowdown. SIAM J. Comput. 49(5): 959-998 (2020) - [c12]Greg Bodwin, Ofer Grossman:
Strategy-Stealing Is Non-Constructive. ITCS 2020: 21:1-21:12 - [c11]Shafi Goldwasser, Ofer Grossman, Sidhanth Mohanty, David P. Woodruff:
Pseudo-Deterministic Streaming. ITCS 2020: 79:1-79:25 - [c10]Yuval Efron, Ofer Grossman, Seri Khoury:
Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST. PODC 2020: 511-520 - [c9]Ofer Grossman, Justin Holmgren, Eylon Yogev:
Transparent Error Correcting in a Computationally Bounded World. TCC (3) 2020: 530-549 - [c8]Ofer Grossman, Seri Khoury, Ami Paz:
Improved Hardness of Approximation of Diameter in the CONGEST Model. DISC 2020: 19:1-19:16 - [i19]Yuval Efron, Ofer Grossman, Seri Khoury:
Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST. CoRR abs/2003.07427 (2020) - [i18]Ofer Grossman, Justin Holmgren:
Error Correcting Codes for Uncompressed Messages. Electron. Colloquium Comput. Complex. TR20 (2020) - [i17]Ofer Grossman, Justin Holmgren, Eylon Yogev:
Transparent Error Correcting in a Computationally Bounded World. IACR Cryptol. ePrint Arch. 2020: 1411 (2020)
2010 – 2019
- 2019
- [c7]Lijie Chen, Ofer Grossman:
Broadcast Congested Clique: Planted Cliques and Pseudorandom Generators. PODC 2019: 248-255 - [c6]Ofer Grossman, Yang P. Liu:
Reproducibility and Pseudo-Determinism in Log-Space. SODA 2019: 606-620 - [i16]Lijie Chen, Ofer Grossman:
Broadcast Congested Clique: Planted Cliques and Pseudorandom Generators. CoRR abs/1905.07780 (2019) - [i15]Greg Bodwin, Ofer Grossman:
Strategy-Stealing is Non-Constructive. CoRR abs/1911.06907 (2019) - [i14]Shafi Goldwasser, Ofer Grossman, Sidhanth Mohanty, David P. Woodruff:
Pseudo-deterministic Streaming. CoRR abs/1911.11368 (2019) - [i13]Greg Bodwin, Ofer Grossman:
Strategy-Stealing is Non-Constructive. Electron. Colloquium Comput. Complex. TR19 (2019) - [i12]Lijie Chen, Ofer Grossman:
Broadcast Congested Clique: Planted Cliques and Pseudorandom Generators. Electron. Colloquium Comput. Complex. TR19 (2019) - [i11]Shafi Goldwasser, Ofer Grossman, Sidhanth Mohanty, David P. Woodruff:
Pseudo-deterministic Streaming. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c5]Ofer Grossman, Bernhard Haeupler, Sidhanth Mohanty:
Algorithms for Noisy Broadcast with Erasures. ICALP 2018: 153:1-153:12 - [c4]Shafi Goldwasser, Ofer Grossman, Dhiraj Holden:
Pseudo-Deterministic Proofs. ITCS 2018: 17:1-17:18 - [i10]Ofer Grossman, Yang P. Liu:
Reproducibility and Pseudo-Determinism in Log-Space. CoRR abs/1803.04025 (2018) - [i9]Ofer Grossman, Bernhard Haeupler, Sidhanth Mohanty:
Algorithms for Noisy Broadcast under Erasures. CoRR abs/1808.00838 (2018) - [i8]Ofer Grossman, Yang P. Liu:
Reproducibility and Pseudo-Determinism in Log-Space. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c3]Shafi Goldwasser, Ofer Grossman:
Bipartite Perfect Matching in Pseudo-Deterministic NC. ICALP 2017: 87:1-87:13 - [c2]Ofer Grossman, Merav Parter:
Improved Deterministic Distributed Construction of Spanners. DISC 2017: 24:1-24:16 - [i7]Shafi Goldwasser, Ofer Grossman, Dhiraj Holden:
Pseudo-deterministic Proofs. CoRR abs/1706.04641 (2017) - [i6]Ofer Grossman, Merav Parter:
Improved Deterministic Distributed Construction of Spanners. CoRR abs/1708.01011 (2017) - [i5]Shafi Goldwasser, Ofer Grossman, Dhiraj Holden:
Pseudo-Deterministic Proofs. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c1]Ofer Grossman, Dana Moshkovitz:
Amplification and Derandomization without Slowdown. FOCS 2016: 770-779 - 2015
- [i4]Ofer Grossman, Dana Moshkovitz:
Amplification and Derandomization Without Slowdown. CoRR abs/1509.08123 (2015) - [i3]Shafi Goldwasser, Ofer Grossman:
Perfect Bipartite Matching in Pseudo-Deterministic RNC. Electron. Colloquium Comput. Complex. TR15 (2015) - [i2]Ofer Grossman:
Finding Primitive Roots Pseudo-Deterministically. Electron. Colloquium Comput. Complex. TR15 (2015) - [i1]Ofer Grossman, Dana Moshkovitz:
Amplification and Derandomization Without Slowdown. Electron. Colloquium Comput. Complex. TR15 (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-10-07 22:10 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:
