Zamir, D.
5381  results:
Search for persons X
?
 
?
 
?
3

Algorithmic Applications of Hypergraph and Partition Contai..:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Zamir, Or - p. 985-998 , 2023
 
?
4

Hardness of approximation in p via short cycle removal: cyc..:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
Abboud, Amir ; Bringmann, Karl ; Khoury, Seri. - p. 1487-1500 , 2022
 
?
5

Tight Space Complexity of the Coin Problem:

, In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS),
Braverman, Mark ; Garg, Sumegha ; Zamir, Or - p. 1068-1079 , 2022
 
?
6

Planting Undetectable Backdoors in Machine Learning Models ..:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),
 
?
 
?
9

A sort of an adversary:

, In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms,
Kaplan, Haim ; Zamir, Or ; Zwick, Uri - p. 1291-1310 , 2019
 
?
10

Random k-out Subgraph Leaves only O(n/k) Inter-Component Ed..:

, In: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS),
Holm, Jacob ; King, Valerie ; Thorup, Mikkel.. - p. 896-909 , 2019
 
?
11

Faster k-SAT algorithms using biased-PPSZ:

, In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing,
Hansen, Thomas Dueholm ; Kaplan, Haim ; Zamir, Or. - p. 578-589 , 2019
 
?
12

Beam tracking phase tomography with laboratory sources:

Vittoria, F.A. ; Endrizzi, M. ; Kallon, G.K.N....
Journal of Instrumentation.  13 (2018)  4 - p. C04008-C04008 , 2018
 
?
13

Subtree Isomorphism Revisited:

Abboud, Amir ; Backurs, Arturs ; Hansen, Thomas Dueholm..
ACM Transactions on Algorithms (TALG).  14 (2018)  3 - p. 1-23 , 2018
 
?
14

Subtree Isomorphism Revisited:

Abboud, Amir ; Backurs, Arturs ; Hansen, Thomas Dueholm..
ACM Transactions on Algorithms.  14 (2018)  3 - p. 1-23 , 2018
 
1-15