Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOr Zamir
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c18]Or Zamir:
The Wrong Direction of Jensen's Inequality Is Algorithmically Right. ICALP 2023: 107:1-107:10- [c17]Or Zamir:
Algorithmic Applications of Hypergraph and Partition Containers. STOC 2023: 985-998 - [i15]Miranda Christ, Sam Gunn, Or Zamir:
Undetectable Watermarks for Language Models. CoRR abs/2306.09194 (2023) - [i14]Kasper Green Larsen, Rasmus Pagh, Toniann Pitassi, Or Zamir:
Optimal Non-Adaptive Cell Probe Dictionaries and Hashing. CoRR abs/2308.16042 (2023) - [i13]Miranda Christ, Sam Gunn, Or Zamir:
Undetectable Watermarks for Language Models. IACR Cryptol. ePrint Arch. 2023: 763 (2023) - 2022
- [c16]Or Zamir:
Faster Algorithm for Unique (k, 2)-CSP. ESA 2022: 92:1-92:13 - [c15]Shafi Goldwasser, Michael P. Kim, Vinod Vaikuntanathan, Or Zamir:
Planting Undetectable Backdoors in Machine Learning Models : [Extended Abstract]. FOCS 2022: 931-942 - [c14]Haim Kaplan, Robert E. Tarjan, Or Zamir, Uri Zwick:
Simulating a stack using queues. SODA 2022: 1901-1924 - [c13]Amir Abboud, Karl Bringmann, Seri Khoury, Or Zamir:
Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond. STOC 2022: 1487-1500 - [i12]Shafi Goldwasser, Michael P. Kim, Vinod Vaikuntanathan, Or Zamir:
Planting Undetectable Backdoors in Machine Learning Models. CoRR abs/2204.06974 (2022) - [i11]Amir Abboud, Karl Bringmann, Seri Khoury, Or Zamir:
Hardness of Approximation in P via Short Cycle Removal: Cycle Detection, Distance Oracles, and Beyond. CoRR abs/2204.10465 (2022) - [i10]Or Zamir:
The wrong direction of Jensen's inequality is algorithmically right. CoRR abs/2211.08563 (2022) - [i9]Or Zamir:
Algorithmic Applications of Hypergraph and Partition Containers. CoRR abs/2211.11737 (2022) - 2021
- [c12]Mark Braverman, Sumegha Garg, Or Zamir:
Tight Space Complexity of the Coin Problem. FOCS 2021: 1068-1079 - [c11]Or Zamir:
Breaking the 2ⁿ Barrier for 5-Coloring and 6-Coloring. ICALP 2021: 113:1-113:20 - [c10]Shyam Narayanan, Sandeep Silwal, Piotr Indyk, Or Zamir:
Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering. ICML 2021: 7948-7957 - [i8]Shyam Narayanan, Sandeep Silwal, Piotr Indyk, Or Zamir:
Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering. CoRR abs/2107.01804 (2021) - [i7]Or Zamir:
Faster algorithm for Unique (k, 2)-CSP. CoRR abs/2110.03122 (2021) - [i6]Mark Braverman, Sumegha Garg, Or Zamir:
Tight Space Complexity of the Coin Problem. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [i5]Or Zamir:
Breaking the 2n barrier for 5-coloring and 6-coloring. CoRR abs/2007.10790 (2020)
2010 – 2019
- 2019
- [c9]Jacob Holm, Valerie King, Mikkel Thorup
, Or Zamir, Uri Zwick:
Random k-out Subgraph Leaves only O(n/k) Inter-Component Edges. FOCS 2019: 896-909 - [c8]Mikkel Thorup, Or Zamir, Uri Zwick:
Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft Heaps. ICALP 2019: 95:1-95:13 - [c7]Haim Kaplan, László Kozma, Or Zamir, Uri Zwick:
Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps. SOSA 2019: 5:1-5:21 - [c6]Haim Kaplan, Or Zamir, Uri Zwick:
A sort of an adversary. SODA 2019: 1291-1310 - [c5]Thomas Dueholm Hansen, Haim Kaplan, Or Zamir, Uri Zwick:
Faster k-SAT algorithms using biased-PPSZ. STOC 2019: 578-589 - [i4]Jacob Holm, Valerie King, Mikkel Thorup, Or Zamir, Uri Zwick:
Random k-out subgraph leaves only O(n/k) inter-component edges. CoRR abs/1909.11147 (2019) - 2018
- [j1]Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir:
Subtree Isomorphism Revisited. ACM Trans. Algorithms 14(3): 27:1-27:23 (2018) - [i3]Haim Kaplan, László Kozma, Or Zamir, Uri Zwick:
Selection from heaps, row-sorted matrices and X+Y using soft heaps. CoRR abs/1802.07041 (2018) - 2016
- [c4]Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir:
Subtree Isomorphism Revisited. SODA 2016: 1256-1271 - [c3]Shiri Chechik, Haim Kaplan, Mikkel Thorup, Or Zamir, Uri Zwick:
Bottleneck Paths and Trees and Deterministic Graphical Games. STACS 2016: 27:1-27:13 - 2015
- [c2]Kiril Solovey, Jingjin Yu, Or Zamir, Dan Halperin:
Motion Planning for Unlabeled Discs with Optimality Guarantees. Robotics: Science and Systems 2015 - [c1]Haim Kaplan, Or Zamir, Uri Zwick:
The amortized cost of finding the minimum. SODA 2015: 757-768 - [i2]Kiril Solovey, Jingjin Yu, Or Zamir, Dan Halperin:
Motion Planning for Unlabeled Discs with Optimality Guarantees. CoRR abs/1504.05218 (2015) - [i1]Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir:
Subtree Isomorphism Revisited. CoRR abs/1510.04622 (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 2023-09-08 12:57 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:
