BibTeX records: Hamed Hatami

download as .bib file

@article{DBLP:journals/corr/abs-2401-14623,
  author       = {Hamed Hatami and
                  Pooya Hatami},
  title        = {Structure in Communication Complexity and Constant-Cost Complexity
                  Classes},
  journal      = {CoRR},
  volume       = {abs/2401.14623},
  year         = {2024}
}
@article{DBLP:journals/eccc/HatamiH24,
  author       = {Hamed Hatami and
                  Pooya Hatami},
  title        = {Structure in Communication Complexity and Constant-Cost Complexity
                  Classes},
  journal      = {Electron. Colloquium Comput. Complex.},
  pages        = {TR24--012},
  year         = {2024}
}
@inproceedings{DBLP:conf/coco/CheungHHS23,
  author       = {Tsun{-}Ming Cheung and
                  Hamed Hatami and
                  Kaave Hosseini and
                  Morgan Shirley},
  title        = {Separation of the Factorization Norm and Randomized Communication
                  Complexity},
  booktitle    = {{CCC}},
  series       = {LIPIcs},
  volume       = {264},
  pages        = {1:1--1:16},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023}
}
@inproceedings{DBLP:conf/icalp/CheungHHH23,
  author       = {TsunMing Cheung and
                  Hamed Hatami and
                  Pooya Hatami and
                  Kaave Hosseini},
  title        = {Online Learning and Disambiguations of Partial Concept Classes},
  booktitle    = {{ICALP}},
  series       = {LIPIcs},
  volume       = {261},
  pages        = {42:1--42:13},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023}
}
@inproceedings{DBLP:conf/stoc/HatamiHM23,
  author       = {Hamed Hatami and
                  Kaave Hosseini and
                  Xiang Meng},
  title        = {A Borsuk-Ulam Lower Bound for Sign-Rank and Its Applications},
  booktitle    = {{STOC}},
  pages        = {463--471},
  publisher    = {{ACM}},
  year         = {2023}
}
@article{DBLP:journals/corr/abs-2303-17578,
  author       = {TsunMing Cheung and
                  Hamed Hatami and
                  Pooya Hatami and
                  Kaave Hosseini},
  title        = {Online Learning and Disambiguations of Partial Concept Classes},
  journal      = {CoRR},
  volume       = {abs/2303.17578},
  year         = {2023}
}
@article{DBLP:journals/corr/abs-2309-10286,
  author       = {Tsun{-}Ming Cheung and
                  Hamed Hatami and
                  Anthony Ostuni},
  title        = {A tight lower bound on non-adaptive group testing estimation},
  journal      = {CoRR},
  volume       = {abs/2309.10286},
  year         = {2023}
}
@article{DBLP:journals/corr/abs-2312-09400,
  author       = {Hamed Hatami and
                  Kaave Hosseini and
                  Shachar Lovett and
                  Anthony Ostuni},
  title        = {Refuting approaches to the log-rank conjecture for {XOR} functions},
  journal      = {CoRR},
  volume       = {abs/2312.09400},
  year         = {2023}
}
@article{DBLP:journals/eccc/AhmedCHS23,
  author       = {Manasseh Ahmed and
                  TsunMing Cheung and
                  Hamed Hatami and
                  Kusha Sareen},
  title        = {Communication complexity of half-plane membership},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR23-050}},
  year         = {2023}
}
@article{DBLP:journals/eccc/HatamiHLO23,
  author       = {Hamed Hatami and
                  Kaave Hosseini and
                  Shachar Lovett and
                  Anthony Ostuni},
  title        = {Refuting approaches to the log-rank conjecture for {XOR} functions},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR23-203}},
  year         = {2023}
}
@article{DBLP:journals/dam/HambardzumyanHH22,
  author       = {Lianna Hambardzumyan and
                  Hamed Hatami and
                  Pooya Hatami},
  title        = {A counter-example to the probabilistic universal graph conjecture
                  via randomized communication complexity},
  journal      = {Discret. Appl. Math.},
  volume       = {322},
  pages        = {117--122},
  year         = {2022}
}
@article{DBLP:journals/ipl/DavisHPTU22,
  author       = {Ben Davis and
                  Hamed Hatami and
                  William Pires and
                  Ran Tao and
                  Hamza Usmani},
  title        = {On public-coin zero-error randomized communication complexity},
  journal      = {Inf. Process. Lett.},
  volume       = {178},
  pages        = {106293},
  year         = {2022}
}
@article{DBLP:journals/toc/HosseiniHL22,
  author       = {Kaave Hosseini and
                  Hamed Hatami and
                  Shachar Lovett},
  title        = {Sign-Rank vs. Discrepancy},
  journal      = {Theory Comput.},
  volume       = {18},
  pages        = {1--22},
  year         = {2022}
}
@inproceedings{DBLP:conf/approx/HatamiHPTZ22,
  author       = {Hamed Hatami and
                  Pooya Hatami and
                  William Pires and
                  Ran Tao and
                  Rosie Zhao},
  title        = {Lower Bound Methods for Sign-Rank and Their Limitations},
  booktitle    = {{APPROX/RANDOM}},
  series       = {LIPIcs},
  volume       = {245},
  pages        = {22:1--22:24},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2022}
}
@inproceedings{DBLP:conf/focs/HatamiH22,
  author       = {Hamed Hatami and
                  Pooya Hatami},
  title        = {The Implicit Graph Conjecture is False},
  booktitle    = {{FOCS}},
  pages        = {1134--1137},
  publisher    = {{IEEE}},
  year         = {2022}
}
@article{DBLP:journals/corr/abs-2210-08300,
  author       = {Lianna Hambardzumyan and
                  Hamed Hatami and
                  Ndiam{\'{e}} Ndiaye},
  title        = {On depth-3 circuits and covering number: an explicit counter-example},
  journal      = {CoRR},
  volume       = {abs/2210.08300},
  year         = {2022}
}
@article{DBLP:journals/eccc/CheungHHS22,
  author       = {TsunMing Cheung and
                  Hamed Hatami and
                  Kaave Hosseini and
                  Morgan Shirley},
  title        = {Separation of the factorization norm and randomized communication
                  complexity},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR22-165}},
  year         = {2022}
}
@article{DBLP:journals/eccc/CheungHZZ22,
  author       = {TsunMing Cheung and
                  Hamed Hatami and
                  Rosie Zhao and
                  Itai Zilberstein},
  title        = {Boolean functions with small approximate spectral norm},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR22-041}},
  year         = {2022}
}
@article{DBLP:journals/eccc/HatamiHM22,
  author       = {Hamed Hatami and
                  Kaave Hosseini and
                  Xiang Meng},
  title        = {A Borsuk-Ulam lower bound for sign-rank and its application},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR22-130}},
  year         = {2022}
}
@article{DBLP:journals/eccc/HatamiHPTZ22,
  author       = {Hamed Hatami and
                  Pooya Hatami and
                  William Pires and
                  Ran Tao and
                  Rosie Zhao},
  title        = {Lower Bound Methods for Sign-rank and their Limitations},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR22-079}},
  year         = {2022}
}
@inproceedings{DBLP:conf/iwoca/BrustleEHKM21,
  author       = {Noah Br{\"{u}}stle and
                  Tal Elbaz and
                  Hamed Hatami and
                  Onur Kocer and
                  Bingchan Ma},
  title        = {Approximation Algorithms for Hitting Subgraphs},
  booktitle    = {{IWOCA}},
  series       = {Lecture Notes in Computer Science},
  volume       = {12757},
  pages        = {370--384},
  publisher    = {Springer},
  year         = {2021}
}
@article{DBLP:journals/corr/abs-2111-10436,
  author       = {Lianna Hambardzumyan and
                  Hamed Hatami and
                  Pooya Hatami},
  title        = {A counter-example to the probabilistic universal graph conjecture
                  via randomized communication complexity},
  journal      = {CoRR},
  volume       = {abs/2111.10436},
  year         = {2021}
}
@article{DBLP:journals/corr/abs-2111-13198,
  author       = {Hamed Hatami and
                  Pooya Hatami},
  title        = {The Implicit Graph Conjecture is False},
  journal      = {CoRR},
  volume       = {abs/2111.13198},
  year         = {2021}
}
@article{DBLP:journals/eccc/DavisHPTU21,
  author       = {Ben Davis and
                  Hamed Hatami and
                  William Pires and
                  Ran Tao and
                  Hamza Usmani},
  title        = {On public-coin zero-error randomized communication complexity},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR21-123}},
  year         = {2021}
}
@article{DBLP:journals/eccc/HambardzumyanHH21,
  author       = {Lianna Hambardzumyan and
                  Hamed Hatami and
                  Pooya Hatami},
  title        = {Dimension-free Bounds and Structural Results in Communication Complexity},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR21-066}},
  year         = {2021}
}
@article{DBLP:journals/jcta/HambardzumyanHQ20,
  author       = {Lianna Hambardzumyan and
                  Hamed Hatami and
                  Yingjie Qian},
  title        = {Lower bounds for graph bootstrap percolation via properties of polynomials},
  journal      = {J. Comb. Theory, Ser. {A}},
  volume       = {174},
  pages        = {105253},
  year         = {2020}
}
@inproceedings{DBLP:conf/coco/HatamiHL20,
  author       = {Hamed Hatami and
                  Kaave Hosseini and
                  Shachar Lovett},
  title        = {Sign Rank vs Discrepancy},
  booktitle    = {{CCC}},
  series       = {LIPIcs},
  volume       = {169},
  pages        = {18:1--18:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2020}
}
@article{DBLP:journals/corr/abs-2011-14450,
  author       = {Noah Br{\"{u}}stle and
                  Tal Elbaz and
                  Hamed Hatami and
                  Onur Kocer and
                  Bingchan Ma},
  title        = {Approximation algorithms for hitting subgraphs},
  journal      = {CoRR},
  volume       = {abs/2011.14450},
  year         = {2020}
}
@article{DBLP:journals/algorithmica/FilmusHLY19,
  author       = {Yuval Filmus and
                  Hamed Hatami and
                  Yaqiao Li and
                  Suzin You},
  title        = {Information Complexity of the {AND} Function in the Two-Party and
                  Multi-party Settings},
  journal      = {Algorithmica},
  volume       = {81},
  number       = {11-12},
  pages        = {4200--4237},
  year         = {2019}
}
@article{DBLP:journals/fttcs/HatamiHL19,
  author       = {Hamed Hatami and
                  Pooya Hatami and
                  Shachar Lovett},
  title        = {Higher-order Fourier Analysis and Applications},
  journal      = {Found. Trends Theor. Comput. Sci.},
  volume       = {13},
  number       = {4},
  pages        = {247--448},
  year         = {2019}
}
@inproceedings{DBLP:conf/icalp/FilmusHHHZ19,
  author       = {Yuval Filmus and
                  Lianna Hambardzumyan and
                  Hamed Hatami and
                  Pooya Hatami and
                  David Zuckerman},
  title        = {Biasing Boolean Functions and Collective Coin-Flipping Protocols over
                  Arbitrary Product Distributions},
  booktitle    = {{ICALP}},
  series       = {LIPIcs},
  volume       = {132},
  pages        = {58:1--58:13},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019}
}
@article{DBLP:journals/corr/abs-1902-07426,
  author       = {Yuval Filmus and
                  Lianna Hambardzumyan and
                  Hamed Hatami and
                  Pooya Hatami and
                  David Zuckerman},
  title        = {Biasing Boolean Functions and Collective Coin-Flipping Protocols over
                  Arbitrary Product Distributions},
  journal      = {CoRR},
  volume       = {abs/1902.07426},
  year         = {2019}
}
@article{DBLP:journals/eccc/FilmusHHHZ19,
  author       = {Yuval Filmus and
                  Lianna Hambardzumyan and
                  Hamed Hatami and
                  Pooya Hatami and
                  David Zuckerman},
  title        = {Biasing Boolean Functions and Collective Coin-Flipping Protocols over
                  Arbitrary Product Distributions},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR19-029}},
  year         = {2019}
}
@article{DBLP:journals/eccc/HatamiHL19,
  author       = {Hamed Hatami and
                  Kaave Hosseini and
                  Shachar Lovett},
  title        = {Sign rank vs Discrepancy},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR19-067}},
  year         = {2019}
}
@article{DBLP:journals/jgt/HatamiJS18,
  author       = {Hamed Hatami and
                  Svante Janson and
                  Bal{\'{a}}zs Szegedy},
  title        = {Graph properties, graph limits, and entropy},
  journal      = {J. Graph Theory},
  volume       = {87},
  number       = {2},
  pages        = {208--229},
  year         = {2018}
}
@article{DBLP:journals/siamcomp/HatamiHL18,
  author       = {Hamed Hatami and
                  Kaave Hosseini and
                  Shachar Lovett},
  title        = {Structure of Protocols for {XOR} Functions},
  journal      = {{SIAM} J. Comput.},
  volume       = {47},
  number       = {1},
  pages        = {208--217},
  year         = {2018}
}
@article{DBLP:journals/toc/DaganFHL18,
  author       = {Yuval Dagan and
                  Yuval Filmus and
                  Hamed Hatami and
                  Yaqiao Li},
  title        = {Trading Information Complexity for Error},
  journal      = {Theory Comput.},
  volume       = {14},
  number       = {1},
  pages        = {1--73},
  year         = {2018}
}
@inproceedings{DBLP:conf/coco/DaganFHL17,
  author       = {Yuval Dagan and
                  Yuval Filmus and
                  Hamed Hatami and
                  Yaqiao Li},
  title        = {Trading Information Complexity for Error},
  booktitle    = {{CCC}},
  series       = {LIPIcs},
  volume       = {79},
  pages        = {16:1--16:59},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017}
}
@inproceedings{DBLP:conf/cocoon/FilmusHLY17,
  author       = {Yuval Filmus and
                  Hamed Hatami and
                  Yaqiao Li and
                  Suzin You},
  title        = {Information Complexity of the {AND} Function in the Two-Party and
                  Multi-party Settings},
  booktitle    = {{COCOON}},
  series       = {Lecture Notes in Computer Science},
  volume       = {10392},
  pages        = {200--211},
  publisher    = {Springer},
  year         = {2017}
}
@proceedings{DBLP:conf/stoc/2017,
  editor       = {Hamed Hatami and
                  Pierre McKenzie and
                  Valerie King},
  title        = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
                  of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
  publisher    = {{ACM}},
  year         = {2017}
}
@article{DBLP:journals/corr/FilmusHLY17,
  author       = {Yuval Filmus and
                  Hamed Hatami and
                  Yaqiao Li and
                  Suzin You},
  title        = {Information complexity of the {AND} function in the two-Party, and
                  multiparty settings},
  journal      = {CoRR},
  volume       = {abs/1703.07833},
  year         = {2017}
}
@article{DBLP:journals/corr/HatamiQ17,
  author       = {Hamed Hatami and
                  Yingjie Qian},
  title        = {The Unbounded-Error Communication Complexity of symmetric {XOR} functions},
  journal      = {CoRR},
  volume       = {abs/1704.00777},
  year         = {2017}
}
@article{DBLP:journals/combinatorics/QuehenH16,
  author       = {Victoria de Quehen and
                  Hamed Hatami},
  title        = {On the Additive Bases Problem in Finite Fields},
  journal      = {Electron. J. Comb.},
  volume       = {23},
  number       = {3},
  pages        = {3},
  year         = {2016}
}
@article{DBLP:journals/ejc/HatamiHL16,
  author       = {Hamed Hatami and
                  Pooya Hatami and
                  Yaqiao Li},
  title        = {A characterization of functions with vanishing averages over products
                  of disjoint sets},
  journal      = {Eur. J. Comb.},
  volume       = {56},
  pages        = {81--93},
  year         = {2016}
}
@inproceedings{DBLP:conf/focs/HatamiHL16,
  author       = {Hamed Hatami and
                  Kaave Hosseini and
                  Shachar Lovett},
  title        = {Structure of Protocols for {XOR} Functions},
  booktitle    = {{FOCS}},
  pages        = {282--288},
  publisher    = {{IEEE} Computer Society},
  year         = {2016}
}
@article{DBLP:journals/corr/DaganFHL16,
  author       = {Yuval Dagan and
                  Yuval Filmus and
                  Hamed Hatami and
                  Yaqiao Li},
  title        = {Trading information complexity for error},
  journal      = {CoRR},
  volume       = {abs/1611.06650},
  year         = {2016}
}
@article{DBLP:journals/eccc/DaganFHL16,
  author       = {Yuval Dagan and
                  Yuval Filmus and
                  Hamed Hatami and
                  Yaqiao Li},
  title        = {Trading information complexity for error},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR16-190}},
  year         = {2016}
}
@article{DBLP:journals/combinatorics/HatamiHH14,
  author       = {Hamed Hatami and
                  Pooya Hatami and
                  James Hirst},
  title        = {Limits of Boolean Functions on {\textdollar}{\textbackslash}mathbb\{F\}{\_}p{\^{}}n{\textdollar}},
  journal      = {Electron. J. Comb.},
  volume       = {21},
  number       = {4},
  pages        = {4},
  year         = {2014}
}
@article{DBLP:journals/jct/HatamiHN14,
  author       = {Hamed Hatami and
                  James Hirst and
                  Serguei Norine},
  title        = {The inducibility of blow-up graphs},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {109},
  pages        = {196--212},
  year         = {2014}
}
@article{DBLP:journals/siamcomp/HatamiL14,
  author       = {Hamed Hatami and
                  Shachar Lovett},
  title        = {Correlation Testing for Affine Invariant Properties on {\unicode{54589}}\({}_{\mbox{p\({}^{\mbox{n}}\)}}\)
                  in the High Error Regime},
  journal      = {{SIAM} J. Comput.},
  volume       = {43},
  number       = {4},
  pages        = {1417--1455},
  year         = {2014}
}
@article{DBLP:journals/corr/FilmusH14,
  author       = {Yuval Filmus and
                  Hamed Hatami},
  title        = {Bounds on the sum of {L1} influences},
  journal      = {CoRR},
  volume       = {abs/1404.3396},
  year         = {2014}
}
@article{DBLP:journals/eccc/HatamiHL14,
  author       = {Hamed Hatami and
                  Pooya Hatami and
                  Shachar Lovett},
  title        = {General systems of linear forms: equidistribution and true complexity},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR14-040}},
  year         = {2014}
}
@article{DBLP:journals/cpc/HatamiN13,
  author       = {Hamed Hatami and
                  Serguei Norine},
  title        = {The Entropy of Random-Free Graphons and Properties},
  journal      = {Comb. Probab. Comput.},
  volume       = {22},
  number       = {4},
  pages        = {517--526},
  year         = {2013}
}
@article{DBLP:journals/jct/HatamiHKNR13,
  author       = {Hamed Hatami and
                  Jan Hladk{\'{y}} and
                  Daniel Kr{\'{a}}l' and
                  Serguei Norine and
                  Alexander A. Razborov},
  title        = {On the number of pentagons in triangle-free graphs},
  journal      = {J. Comb. Theory, Ser. {A}},
  volume       = {120},
  number       = {3},
  pages        = {722--732},
  year         = {2013}
}
@inproceedings{DBLP:conf/focs/HatamiL13,
  author       = {Hamed Hatami and
                  Shachar Lovett},
  title        = {Estimating the Distance from Testable Affine-Invariant Properties},
  booktitle    = {{FOCS}},
  pages        = {237--242},
  publisher    = {{IEEE} Computer Society},
  year         = {2013}
}
@inproceedings{DBLP:conf/stoc/BhattacharyyaFHHL13,
  author       = {Arnab Bhattacharyya and
                  Eldar Fischer and
                  Hamed Hatami and
                  Pooya Hatami and
                  Shachar Lovett},
  title        = {Every locally characterized affine-invariant property is testable},
  booktitle    = {{STOC}},
  pages        = {429--436},
  publisher    = {{ACM}},
  year         = {2013}
}
@article{DBLP:journals/corr/HatamiL13,
  author       = {Hamed Hatami and
                  Shachar Lovett},
  title        = {Estimating the distance from testable affine-invariant properties},
  journal      = {CoRR},
  volume       = {abs/1306.0649},
  year         = {2013}
}
@article{DBLP:journals/eccc/HatamiL13,
  author       = {Hamed Hatami and
                  Shachar Lovett},
  title        = {Estimating the distance from testable affine-invariant properties},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR13-087}},
  year         = {2013}
}
@article{DBLP:journals/cpc/HatamiHKNR12,
  author       = {Hamed Hatami and
                  Jan Hladk{\'{y}} and
                  Daniel Kr{\'{a}}l' and
                  Serguei Norine and
                  Alexander A. Razborov},
  title        = {Non-Three-Colourable Common Graphs Exist},
  journal      = {Comb. Probab. Comput.},
  volume       = {21},
  number       = {5},
  pages        = {734--742},
  year         = {2012}
}
@article{DBLP:journals/rsa/HatamiM12,
  author       = {Hamed Hatami and
                  Michael Molloy},
  title        = {The scaling window for a random graph with a given degree sequence},
  journal      = {Random Struct. Algorithms},
  volume       = {41},
  number       = {1},
  pages        = {99--123},
  year         = {2012}
}
@inproceedings{DBLP:conf/approx/AdaFH12,
  author       = {Anil Ada and
                  Omar Fawzi and
                  Hamed Hatami},
  title        = {Spectral Norm of Symmetric Functions},
  booktitle    = {{APPROX-RANDOM}},
  series       = {Lecture Notes in Computer Science},
  volume       = {7408},
  pages        = {338--349},
  publisher    = {Springer},
  year         = {2012}
}
@article{DBLP:journals/corr/abs-1205-5282,
  author       = {Anil Ada and
                  Omar Fawzi and
                  Hamed Hatami},
  title        = {Spectral Norm of Symmetric Functions},
  journal      = {CoRR},
  volume       = {abs/1205.5282},
  year         = {2012}
}
@article{DBLP:journals/corr/abs-1212-3849,
  author       = {Arnab Bhattacharyya and
                  Eldar Fischer and
                  Hamed Hatami and
                  Pooya Hatami and
                  Shachar Lovett},
  title        = {Every locally characterized affine-invariant property is testable},
  journal      = {CoRR},
  volume       = {abs/1212.3849},
  year         = {2012}
}
@article{DBLP:journals/eccc/BhattacharyyaFHHL12,
  author       = {Arnab Bhattacharyya and
                  Eldar Fischer and
                  Hamed Hatami and
                  Pooya Hatami and
                  Shachar Lovett},
  title        = {Every locally characterized affine-invariant property is testable},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR12-184}},
  year         = {2012}
}
@inproceedings{DBLP:conf/stoc/HatamiL11,
  author       = {Hamed Hatami and
                  Shachar Lovett},
  title        = {Correlation testing for affine invariant properties on F\({}_{\mbox{p}}\)\({}^{\mbox{n}}\)
                  in the high error regime},
  booktitle    = {{STOC}},
  pages        = {187--194},
  publisher    = {{ACM}},
  year         = {2011}
}
@article{DBLP:journals/corr/abs-1104-3335,
  author       = {Hamed Hatami and
                  Shachar Lovett},
  title        = {Correlation Testing for Affine Invariant Properties on {\textdollar}{\textbackslash}mathbb\{F\}{\_}p{\^{}}n{\textdollar}
                  in the High Error Regime},
  journal      = {CoRR},
  volume       = {abs/1104.3335},
  year         = {2011}
}
@article{DBLP:journals/eccc/HatamiL11,
  author       = {Hamed Hatami and
                  Shachar Lovett},
  title        = {Correlation testing for affine invariant properties on F\({}_{\mbox{p}}\)\({}^{\mbox{n}}\)
                  in the high error regime},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR11-029}},
  year         = {2011}
}
@phdthesis{DBLP:phd/ca/Hatami10,
  author       = {Hamed Hatami},
  title        = {On Generalizations of Gowers Norms},
  school       = {University of Toronto, Canada},
  year         = {2010}
}
@inproceedings{DBLP:conf/soda/HatamiM10,
  author       = {Hamed Hatami and
                  Michael Molloy},
  title        = {The Scaling Window for a Random Graph with a Given Degree Sequence},
  booktitle    = {{SODA}},
  pages        = {1403--1411},
  publisher    = {{SIAM}},
  year         = {2010}
}
@article{DBLP:journals/eccc/HatamiL10,
  author       = {Hamed Hatami and
                  Shachar Lovett},
  title        = {Higher-order Fourier analysis of F\({}_{\mbox{p}}\)\({}^{\mbox{n}}\)
                  and the complexity of systems of linear forms},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR10-181}},
  year         = {2010}
}
@article{DBLP:journals/cpc/Hatami09,
  author       = {Hamed Hatami},
  title        = {Decision Trees and Influences of Variables Over Product Probability
                  Spaces},
  journal      = {Comb. Probab. Comput.},
  volume       = {18},
  number       = {3},
  pages        = {357--369},
  year         = {2009}
}
@article{DBLP:journals/siamdm/HatamiZ09,
  author       = {Hamed Hatami and
                  Xuding Zhu},
  title        = {The Fractional Chromatic Number of Graphs of Maximum Degree at Most
                  Three},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {23},
  number       = {4},
  pages        = {1762--1775},
  year         = {2009}
}
@article{DBLP:journals/ipl/AfshaniH08,
  author       = {Peyman Afshani and
                  Hamed Hatami},
  title        = {Approximation and inapproximability results for maximum clique of
                  disc graphs in high dimensions},
  journal      = {Inf. Process. Lett.},
  volume       = {105},
  number       = {3},
  pages        = {83--87},
  year         = {2008}
}
@article{DBLP:journals/jct/GhandehariH08,
  author       = {Mahya Ghandehari and
                  Hamed Hatami},
  title        = {Fourier analysis and large independent sets in powers of complete
                  graphs},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {98},
  number       = {1},
  pages        = {164--172},
  year         = {2008}
}
@article{DBLP:journals/rsa/HatamiM08,
  author       = {Hamed Hatami and
                  Michael Molloy},
  title        = {Sharp thresholds for constraint satisfaction problems and homomorphisms},
  journal      = {Random Struct. Algorithms},
  volume       = {33},
  number       = {3},
  pages        = {310--332},
  year         = {2008}
}
@article{DBLP:journals/siamdm/HatamiMM08,
  author       = {Hamed Hatami and
                  Avner Magen and
                  Evangelos Markakis},
  title        = {Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations
                  to l\({}_{\mbox{1}}\) Embeddability of Negative Type Metrics},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {23},
  number       = {1},
  pages        = {178--194},
  year         = {2008}
}
@article{DBLP:journals/combinatorics/HatamiH07,
  author       = {Hamed Hatami and
                  Pooya Hatami},
  title        = {Perfect Dominating Sets in the Cartesian Products of Prime Cycles},
  journal      = {Electron. J. Comb.},
  volume       = {14},
  number       = {1},
  year         = {2007}
}
@inproceedings{DBLP:conf/approx/HatamiMM07,
  author       = {Hamed Hatami and
                  Avner Magen and
                  Evangelos Markakis},
  title        = {Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations
                  to \emph{l}\({}_{\mbox{1}}\) Embeddability of Negative Type Metrics},
  booktitle    = {{APPROX-RANDOM}},
  series       = {Lecture Notes in Computer Science},
  volume       = {4627},
  pages        = {164--179},
  publisher    = {Springer},
  year         = {2007}
}
@article{DBLP:journals/corr/abs-cs-0701007,
  author       = {Hamed Hatami and
                  Ruzbeh Tusserkani},
  title        = {On the Complexity of the Circular Chromatic Number},
  journal      = {CoRR},
  volume       = {abs/cs/0701007},
  year         = {2007}
}
@article{DBLP:journals/corr/abs-cs-0701008,
  author       = {Hamed Hatami and
                  Hossein Maserrat},
  title        = {On the Computational Complexity of Defining Sets},
  journal      = {CoRR},
  volume       = {abs/cs/0701008},
  year         = {2007}
}
@article{DBLP:journals/corr/abs-cs-0701009,
  author       = {Peyman Afshani and
                  Hamed Hatami},
  title        = {Approximation and Inapproximability Results for Maximum Clique of
                  Disc Graphs in High Dimensions},
  journal      = {CoRR},
  volume       = {abs/cs/0701009},
  year         = {2007}
}
@article{DBLP:journals/corr/abs-cs-0601011,
  author       = {Hamed Hatami and
                  Avner Magen and
                  Vangelis Markakis},
  title        = {Integrality gaps of semidefinite programs for Vertex Cover and relations
                  to {\(\mathscr{l}\)}\({}_{\mbox{1}}\) embeddability of Negative Type
                  metrics},
  journal      = {CoRR},
  volume       = {abs/cs/0601011},
  year         = {2006}
}
@article{DBLP:journals/dam/HatamiM05,
  author       = {Hamed Hatami and
                  Hossein Maserrat},
  title        = {On the computational complexity of defining sets},
  journal      = {Discret. Appl. Math.},
  volume       = {149},
  number       = {1-3},
  pages        = {101--110},
  year         = {2005}
}
@article{DBLP:journals/dm/GhandehariHM05,
  author       = {Mahya Ghandehari and
                  Hamed Hatami and
                  Ebadollah S. Mahmoodian},
  title        = {On the size of the minimum critical set of a Latin square},
  journal      = {Discret. Math.},
  volume       = {293},
  number       = {1-3},
  pages        = {121--127},
  year         = {2005}
}
@article{DBLP:journals/jct/Hatami05,
  author       = {Hamed Hatami},
  title        = {Random cubic graphs are not homomorphic to the cycle of size 7},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {93},
  number       = {2},
  pages        = {319--325},
  year         = {2005}
}
@article{DBLP:journals/jct/Hatami05a,
  author       = {Hamed Hatami},
  title        = {Delta+300 is a bound on the adjacent vertex distinguishing edge chromatic
                  number},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {95},
  number       = {2},
  pages        = {246--256},
  year         = {2005}
}
@article{DBLP:journals/jgt/AfshaniGGHTZ05,
  author       = {Peyman Afshani and
                  Mahsa Ghandehari and
                  Mahya Ghandehari and
                  Hamed Hatami and
                  Ruzbeh Tusserkani and
                  Xuding Zhu},
  title        = {Circular chromatic index of graphs of maximum degree 3},
  journal      = {J. Graph Theory},
  volume       = {49},
  number       = {4},
  pages        = {325--335},
  year         = {2005}
}
@article{DBLP:journals/ajc/AfshaniHM04,
  author       = {Peyman Afshani and
                  Hamed Hatami and
                  Ebadollah S. Mahmoodian},
  title        = {On the spectrum of the forced matching number of graphs},
  journal      = {Australas. {J} Comb.},
  volume       = {30},
  pages        = {147--160},
  year         = {2004}
}
@article{DBLP:journals/jgt/HatamiT04,
  author       = {Hamed Hatami and
                  Ruzbeh Tusserkani},
  title        = {On the complexity of the circular chromatic number},
  journal      = {J. Graph Theory},
  volume       = {47},
  number       = {3},
  pages        = {226--230},
  year         = {2004}
}
@inproceedings{DBLP:conf/robocup/HabibiFMKHF00,
  author       = {Jafar Habibi and
                  Ehsan Foroughi and
                  Mehran Motamed and
                  Pooya Karimian and
                  Hamed Hatami and
                  Hossein Fardad},
  title        = {SharifII Soccer Simulation Team},
  booktitle    = {RoboCup},
  series       = {Lecture Notes in Computer Science},
  volume       = {2019},
  pages        = {437--440},
  publisher    = {Springer},
  year         = {2000}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics