E-LIB Suche - Ergebnisse für: Hatami, Hamed

1

Typical structure of hereditary properties of binary matroi..:

Grosser, Stefan ; Hatami, Hamed ; Nelson, Peter.
Journal of Combinatorial Theory, Series B. 167 (2024) - p. 283-302 , 2024

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

2

A Borsuk-Ulam Lower Bound for Sign-Rank and Its Application:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,

Hatami, Hamed ; Hosseini, Kaave ; Meng, Xiang - p. 463-471 , 2023

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

3

Importance of lactate dehydrogenase (LDH) and monocarboxyla..:

Hatami, Hamed ; Sajedi, Atefe ; Mir, Seyed Mostafa.
Health Science Reports. 6 (2022) 1 - p. , 2022

Link: https://doi.org/10.1002/..

4

On public-coin zero-error randomized communication complexi..:

Davis, Ben ; Hatami, Hamed ; Pires, William..
Information Processing Letters. 178 (2022) - p. 106293 , 2022

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

5

Analyzing free vibration of a beam-type liquid micro-pump w..:

Hatami, Hamed ; Bagheri, Ahmad ; Ansari, Reza
Journal of Vibration and Control. 29 (2022) 11-12 - p. 2868-2877 , 2022

Link: https://doi.org/10.1177/..

6

A counter-example to the probabilistic universal graph conj..:

Hambardzumyan, Lianna ; Hatami, Hamed ; Hatami, Pooya
Discrete Applied Mathematics. 322 (2022) - p. 117-122 , 2022

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

7

Dimension-free bounds and structural results in communicati..:

Hambardzumyan, Lianna ; Hatami, Hamed ; Hatami, Pooya
Israel Journal of Mathematics. 253 (2022) 2 - p. 555-616 , 2022

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

8

The Implicit Graph Conjecture is False:

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

Hatami, Hamed ; Hatami, Pooya - p. 1134-1137 , 2022

Link: https://doi.org/10.1109/..

9

Approximation Algorithms for Hitting Subgraphs:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,

Brüstle, Noah ; Elbaz, Tal ; Hatami, Hamed.. - p. 370-384 , 2021

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

10

Lower bounds for graph bootstrap percolation via properties..:

Hambardzumyan, Lianna ; Hatami, Hamed ; Qian, Yingjie
Journal of Combinatorial Theory, Series A. 174 (2020) - p. 105253 , 2020

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

11

Sign rank vs discrepancy:

, In: Proceedings of the 35th Computational Complexity Conference,

Hatami, Hamed ; Hosseini, Kaave ; Lovett, Shachar - p. 1-14 , 2020

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

12

Structure of Protocols for XOR Functions:

Hatami, Hamed ; Hosseini, Kaave ; Lovett, Shachar
SIAM Journal on Computing. 47 (2018) 1 - p. 208-217 , 2018

Link: https://doi.org/10.1137/..

13

Information Complexity of the AND Function in the Two-Party..:

Filmus, Yuval ; Hatami, Hamed ; Li, Yaqiao.
Algorithmica. 81 (2018) 11-12 - p. 4200-4237 , 2018

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

14

Proceedings of the 49th Annual ACM SIGACT Symposium on Theo..:

Hatami, Hamed ; McKenzie, Pierre ; King, Valerie , 2017

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

15

Graph properties, graph limits, and entropy:

Hatami, Hamed ; Janson, Svante ; Szegedy, Balázs
Journal of Graph Theory. 87 (2017) 2 - p. 208-229 , 2017

Link: https://doi.org/10.1002/..