• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 106 matches

• 2024
• 
  Hamed Zamanian, Ahmad Shalbaf, M. R. Zali, A. R. Khalaj, P. Dehghan, M. Tabesh, B. Hatami, Roohallah Alizadehsani, Ru San Tan, U. Rajendra Acharya:
  Application of artificial intelligence techniques for non-alcoholic fatty liver disease diagnosis: A systematic review (2005-2023). Comput. Methods Programs Biomed. 244: 107932 (2024)
• 
  Stefan Grosser, Hamed Hatami, Peter Nelson, Sergey Norin:
  Typical structure of hereditary properties of binary matroids. J. Comb. Theory B 167: 283-302 (2024)
• 
  Hamed Hatami, Pooya Hatami:
  Guest Column: Structure in Communication Complexity and Constant-Cost Complexity Classes. SIGACT News 55(1): 67-93 (2024)
• 
  Manasseh Ahmed, Tsun-Ming Cheung, Hamed Hatami, Kusha Sareen:
  Communication Complexity and Discrepancy of Halfplanes. SoCG 2024: 5:1-5:17
• 
  Yuval Filmus, Hamed Hatami, Kaave Hosseini, Esty Kelman:
  Sparse Graph Counting and Kelley-Meka Bounds for Binary Systems. FOCS 2024: 1559-1578
• 
  Hamed Hatami, Kaave Hosseini, Shachar Lovett, Anthony Ostuni:
  Refuting Approaches to the Log-Rank Conjecture for XOR Functions. ICALP 2024: 82:1-82:11
• 
  Hamed Hatami, Pooya Hatami:
  Structure in Communication Complexity and Constant-Cost Complexity Classes. CoRR abs/2401.14623 (2024)
• 
  Tsun-Ming Cheung, Hamed Hatami, Rosie Zhao, Itai Zilberstein:
  Boolean Functions with Small Approximate Spectral Norm. CoRR abs/2409.10634 (2024)
• 
  Hamed Hatami, Pooya Hatami:
  Structure in Communication Complexity and Constant-Cost Complexity Classes. Electron. Colloquium Comput. Complex. TR24 (2024)
• 2023
• 
  Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini, Morgan Shirley:
  Separation of the Factorization Norm and Randomized Communication Complexity. CCC 2023: 1:1-1:16
• 
  TsunMing Cheung, Hamed Hatami, Pooya Hatami, Kaave Hosseini:
  Online Learning and Disambiguations of Partial Concept Classes. ICALP 2023: 42:1-42:13
• 
  Hamed Hatami, Kaave Hosseini, Xiang Meng:
  A Borsuk-Ulam Lower Bound for Sign-Rank and Its Applications. STOC 2023: 463-471
• 
  TsunMing Cheung, Hamed Hatami, Pooya Hatami, Kaave Hosseini:
  Online Learning and Disambiguations of Partial Concept Classes. CoRR abs/2303.17578 (2023)
• 
  Tsun-Ming Cheung, Hamed Hatami, Anthony Ostuni:
  A tight lower bound on non-adaptive group testing estimation. CoRR abs/2309.10286 (2023)
• 
  Hamed Hatami, Kaave Hosseini, Shachar Lovett, Anthony Ostuni:
  Refuting approaches to the log-rank conjecture for XOR functions. CoRR abs/2312.09400 (2023)
• 
  Manasseh Ahmed, TsunMing Cheung, Hamed Hatami, Kusha Sareen:
  Communication complexity of half-plane membership. Electron. Colloquium Comput. Complex. TR23 (2023)
• 
  Hamed Hatami, Kaave Hosseini, Shachar Lovett, Anthony Ostuni:
  Refuting approaches to the log-rank conjecture for XOR functions. Electron. Colloquium Comput. Complex. TR23 (2023)
• 2022
• 
  Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami:
  A counter-example to the probabilistic universal graph conjecture via randomized communication complexity. Discret. Appl. Math. 322: 117-122 (2022)
• 
  Ben Davis, Hamed Hatami, William Pires, Ran Tao, Hamza Usmani:
  On public-coin zero-error randomized communication complexity. Inf. Process. Lett. 178: 106293 (2022)
• 
  Kaave Hosseini, Hamed Hatami, Shachar Lovett:
  Sign-Rank vs. Discrepancy. Adv. Math. Commun. 18: 1-22 (2022)
• 
  Hamed Hatami, Pooya Hatami, William Pires, Ran Tao, Rosie Zhao:
  Lower Bound Methods for Sign-Rank and Their Limitations. APPROX/RANDOM 2022: 22:1-22:24
• 
  Hamed Hatami, Pooya Hatami:
  The Implicit Graph Conjecture is False. FOCS 2022: 1134-1137
• 
  Lianna Hambardzumyan, Hamed Hatami, Ndiamé Ndiaye:
  On depth-3 circuits and covering number: an explicit counter-example. CoRR abs/2210.08300 (2022)
• 
  TsunMing Cheung, Hamed Hatami, Kaave Hosseini, Morgan Shirley:
  Separation of the factorization norm and randomized communication complexity. Electron. Colloquium Comput. Complex. TR22 (2022)
• 
  TsunMing Cheung, Hamed Hatami, Rosie Zhao, Itai Zilberstein:
  Boolean functions with small approximate spectral norm. Electron. Colloquium Comput. Complex. TR22 (2022)
• 
  Hamed Hatami, Kaave Hosseini, Xiang Meng:
  A Borsuk-Ulam lower bound for sign-rank and its application. Electron. Colloquium Comput. Complex. TR22 (2022)
• 
  Hamed Hatami, Pooya Hatami, William Pires, Ran Tao, Rosie Zhao:
  Lower Bound Methods for Sign-rank and their Limitations. Electron. Colloquium Comput. Complex. TR22 (2022)
• 2021
• 
  Noah Brüstle, Tal Elbaz, Hamed Hatami, Onur Kocer, Bingchan Ma:
  Approximation Algorithms for Hitting Subgraphs. IWOCA 2021: 370-384
• 
  Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami:
  A counter-example to the probabilistic universal graph conjecture via randomized communication complexity. CoRR abs/2111.10436 (2021)
• 
  Hamed Hatami, Pooya Hatami:
  The Implicit Graph Conjecture is False. CoRR abs/2111.13198 (2021)

skipping 76 more matches