BibTeX records: Hamed Hatami

download as .bib file

@inproceedings{DBLP:conf/coco/DaganFHL17,
  author    = {Yuval Dagan and
               Yuval Filmus and
               Hamed Hatami and
               Yaqiao Li},
  title     = {Trading Information Complexity for Error},
  booktitle = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
               Riga, Latvia},
  pages     = {16:1--16:59},
  year      = {2017},
  crossref  = {DBLP:conf/coco/2017},
  url       = {https://doi.org/10.4230/LIPIcs.CCC.2017.16},
  doi       = {10.4230/LIPIcs.CCC.2017.16},
  timestamp = {Mon, 14 Aug 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/DaganFHL17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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 = {Computing and Combinatorics - 23rd International Conference, {COCOON}
               2017, Hong Kong, China, August 3-5, 2017, Proceedings},
  pages     = {200--211},
  year      = {2017},
  crossref  = {DBLP:conf/cocoon/2017},
  url       = {https://doi.org/10.1007/978-3-319-62389-4_17},
  doi       = {10.1007/978-3-319-62389-4_17},
  timestamp = {Tue, 25 Jul 2017 11:37:58 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/cocoon/FilmusHLY17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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},
  url       = {http://doi.acm.org/10.1145/3055399},
  doi       = {10.1145/3055399},
  isbn      = {978-1-4503-4528-6},
  timestamp = {Sat, 17 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/2017},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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},
  url       = {http://arxiv.org/abs/1703.07833},
  archivePrefix = {arXiv},
  eprint    = {1703.07833},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/FilmusHLY17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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},
  url       = {http://arxiv.org/abs/1704.00777},
  archivePrefix = {arXiv},
  eprint    = {1704.00777},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/HatamiQ17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/combinatorics/QuehenH16,
  author    = {Victoria de Quehen and
               Hamed Hatami},
  title     = {On the Additive Bases Problem in Finite Fields},
  journal   = {Electr. J. Comb.},
  volume    = {23},
  number    = {3},
  pages     = {P3.33},
  year      = {2016},
  url       = {http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i3p33},
  timestamp = {Tue, 06 Sep 2016 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/combinatorics/QuehenH16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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},
  url       = {https://doi.org/10.1016/j.ejc.2016.03.002},
  doi       = {10.1016/j.ejc.2016.03.002},
  timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/ejc/HatamiHL16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/HatamiHL16,
  author    = {Hamed Hatami and
               Kaave Hosseini and
               Shachar Lovett},
  title     = {Structure of Protocols for {XOR} Functions},
  booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
               2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
               {USA}},
  pages     = {282--288},
  year      = {2016},
  crossref  = {DBLP:conf/focs/2016},
  url       = {https://doi.org/10.1109/FOCS.2016.38},
  doi       = {10.1109/FOCS.2016.38},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/HatamiHL16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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},
  url       = {http://arxiv.org/abs/1611.06650},
  archivePrefix = {arXiv},
  eprint    = {1611.06650},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/DaganFHL16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/DaganFHL16,
  author    = {Yuval Dagan and
               Yuval Filmus and
               Hamed Hatami and
               Yaqiao Li},
  title     = {Trading information complexity for error},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {23},
  pages     = {190},
  year      = {2016},
  url       = {http://eccc.hpi-web.de/report/2016/190},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/DaganFHL16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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   = {Electr. J. Comb.},
  volume    = {21},
  number    = {4},
  pages     = {P4.2},
  year      = {2014},
  url       = {http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i4p2},
  timestamp = {Wed, 08 Oct 2014 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/combinatorics/HatamiHH14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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},
  url       = {https://doi.org/10.1016/j.jctb.2014.06.005},
  doi       = {10.1016/j.jctb.2014.06.005},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jct/HatamiHN14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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},
  url       = {https://doi.org/10.1137/110831349},
  doi       = {10.1137/110831349},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/HatamiL14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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},
  url       = {http://arxiv.org/abs/1404.3396},
  archivePrefix = {arXiv},
  eprint    = {1404.3396},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/FilmusH14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {21},
  pages     = {40},
  year      = {2014},
  url       = {http://eccc.hpi-web.de/report/2014/040},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/HatamiHL14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/cpc/HatamiN13,
  author    = {Hamed Hatami and
               Serguei Norine},
  title     = {The Entropy of Random-Free Graphons and Properties},
  journal   = {Combinatorics, Probability {\&} Computing},
  volume    = {22},
  number    = {4},
  pages     = {517--526},
  year      = {2013},
  url       = {https://doi.org/10.1017/S0963548313000175},
  doi       = {10.1017/S0963548313000175},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cpc/HatamiN13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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},
  url       = {https://doi.org/10.1016/j.jcta.2012.12.008},
  doi       = {10.1016/j.jcta.2012.12.008},
  timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jct/HatamiHKNR13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/HatamiL13,
  author    = {Hamed Hatami and
               Shachar Lovett},
  title     = {Estimating the Distance from Testable Affine-Invariant Properties},
  booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2013, 26-29 October, 2013, Berkeley, CA, {USA}},
  pages     = {237--242},
  year      = {2013},
  crossref  = {DBLP:conf/focs/2013},
  url       = {https://doi.org/10.1109/FOCS.2013.33},
  doi       = {10.1109/FOCS.2013.33},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/HatamiL13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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 = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
               USA, June 1-4, 2013},
  pages     = {429--436},
  year      = {2013},
  crossref  = {DBLP:conf/stoc/2013},
  url       = {http://doi.acm.org/10.1145/2488608.2488662},
  doi       = {10.1145/2488608.2488662},
  timestamp = {Sun, 26 May 2013 10:30:47 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/BhattacharyyaFHHL13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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},
  url       = {http://arxiv.org/abs/1306.0649},
  archivePrefix = {arXiv},
  eprint    = {1306.0649},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/HatamiL13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/HatamiL13,
  author    = {Hamed Hatami and
               Shachar Lovett},
  title     = {Estimating the distance from testable affine-invariant properties},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {20},
  pages     = {87},
  year      = {2013},
  url       = {http://eccc.hpi-web.de/report/2013/087},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/HatamiL13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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   = {Combinatorics, Probability {\&} Computing},
  volume    = {21},
  number    = {5},
  pages     = {734--742},
  year      = {2012},
  url       = {https://doi.org/10.1017/S0963548312000107},
  doi       = {10.1017/S0963548312000107},
  timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cpc/HatamiHKNR12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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},
  url       = {https://doi.org/10.1002/rsa.20394},
  doi       = {10.1002/rsa.20394},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/rsa/HatamiM12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/approx/AdaFH12,
  author    = {Anil Ada and
               Omar Fawzi and
               Hamed Hatami},
  title     = {Spectral Norm of Symmetric Functions},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques - 15th International Workshop, {APPROX} 2012, and 16th
               International Workshop, {RANDOM} 2012, Cambridge, MA, USA, August
               15-17, 2012. Proceedings},
  pages     = {338--349},
  year      = {2012},
  crossref  = {DBLP:conf/approx/2012},
  url       = {https://doi.org/10.1007/978-3-642-32512-0_29},
  doi       = {10.1007/978-3-642-32512-0_29},
  timestamp = {Tue, 23 May 2017 01:11:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/approx/AdaFH12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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},
  url       = {http://arxiv.org/abs/1205.5282},
  archivePrefix = {arXiv},
  eprint    = {1205.5282},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1205-5282},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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},
  url       = {http://arxiv.org/abs/1212.3849},
  archivePrefix = {arXiv},
  eprint    = {1212.3849},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1212-3849},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {19},
  pages     = {184},
  year      = {2012},
  url       = {http://eccc.hpi-web.de/report/2012/184},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/BhattacharyyaFHHL12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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 = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC}
               2011, San Jose, CA, USA, 6-8 June 2011},
  pages     = {187--194},
  year      = {2011},
  crossref  = {DBLP:conf/stoc/2011},
  url       = {http://doi.acm.org/10.1145/1993636.1993662},
  doi       = {10.1145/1993636.1993662},
  timestamp = {Tue, 22 May 2012 21:36:56 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/HatamiL11},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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},
  url       = {http://arxiv.org/abs/1104.3335},
  archivePrefix = {arXiv},
  eprint    = {1104.3335},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1104-3335},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {18},
  pages     = {29},
  year      = {2011},
  url       = {http://eccc.hpi-web.de/report/2011/029},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/HatamiL11},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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 = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
  pages     = {1403--1411},
  year      = {2010},
  crossref  = {DBLP:conf/soda/2010},
  url       = {https://doi.org/10.1137/1.9781611973075.113},
  doi       = {10.1137/1.9781611973075.113},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/soda/HatamiM10},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {17},
  pages     = {181},
  year      = {2010},
  url       = {http://eccc.hpi-web.de/report/2010/181},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/HatamiL10},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/cpc/Hatami09,
  author    = {Hamed Hatami},
  title     = {Decision Trees and Influences of Variables Over Product Probability
               Spaces},
  journal   = {Combinatorics, Probability {\&} Computing},
  volume    = {18},
  number    = {3},
  pages     = {357--369},
  year      = {2009},
  url       = {https://doi.org/10.1017/S0963548309009833},
  doi       = {10.1017/S0963548309009833},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cpc/Hatami09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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. Discrete Math.},
  volume    = {23},
  number    = {4},
  pages     = {1762--1775},
  year      = {2009},
  url       = {https://doi.org/10.1137/080712635},
  doi       = {10.1137/080712635},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamdm/HatamiZ09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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},
  url       = {https://doi.org/10.1016/j.ipl.2007.08.005},
  doi       = {10.1016/j.ipl.2007.08.005},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/ipl/AfshaniH08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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},
  url       = {https://doi.org/10.1016/j.jctb.2007.06.003},
  doi       = {10.1016/j.jctb.2007.06.003},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jct/GhandehariH08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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},
  url       = {https://doi.org/10.1002/rsa.20225},
  doi       = {10.1002/rsa.20225},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/rsa/HatamiM08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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. Discrete Math.},
  volume    = {23},
  number    = {1},
  pages     = {178--194},
  year      = {2008},
  url       = {https://doi.org/10.1137/070700103},
  doi       = {10.1137/070700103},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamdm/HatamiMM08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/combinatorics/HatamiH07,
  author    = {Hamed Hatami and
               Pooya Hatami},
  title     = {Perfect Dominating Sets in the Cartesian Products of Prime Cycles},
  journal   = {Electr. J. Comb.},
  volume    = {14},
  number    = {1},
  year      = {2007},
  url       = {http://www.combinatorics.org/Volume_14/Abstracts/v14i1n8.html},
  timestamp = {Mon, 26 May 2008 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/combinatorics/HatamiH07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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 = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, 10th International Workshop, {APPROX} 2007, and 11th
               International Workshop, {RANDOM} 2007, Princeton, NJ, USA, August
               20-22, 2007, Proceedings},
  pages     = {164--179},
  year      = {2007},
  crossref  = {DBLP:conf/approx/2007},
  url       = {https://doi.org/10.1007/978-3-540-74208-1_12},
  doi       = {10.1007/978-3-540-74208-1_12},
  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/approx/HatamiMM07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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},
  url       = {http://arxiv.org/abs/cs/0701007},
  archivePrefix = {arXiv},
  eprint    = {cs/0701007},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-cs-0701007},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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},
  url       = {http://arxiv.org/abs/cs/0701008},
  archivePrefix = {arXiv},
  eprint    = {cs/0701008},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-cs-0701008},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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},
  url       = {http://arxiv.org/abs/cs/0701009},
  archivePrefix = {arXiv},
  eprint    = {cs/0701009},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-cs-0701009},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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},
  url       = {http://arxiv.org/abs/cs/0601011},
  archivePrefix = {arXiv},
  eprint    = {cs/0601011},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-cs-0601011},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/dam/HatamiM05,
  author    = {Hamed Hatami and
               Hossein Maserrat},
  title     = {On the computational complexity of defining sets},
  journal   = {Discrete Applied Mathematics},
  volume    = {149},
  number    = {1-3},
  pages     = {101--110},
  year      = {2005},
  url       = {https://doi.org/10.1016/j.dam.2005.03.004},
  doi       = {10.1016/j.dam.2005.03.004},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/dam/HatamiM05},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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   = {Discrete Mathematics},
  volume    = {293},
  number    = {1-3},
  pages     = {121--127},
  year      = {2005},
  url       = {https://doi.org/10.1016/j.disc.2004.08.026},
  doi       = {10.1016/j.disc.2004.08.026},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/dm/GhandehariHM05},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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},
  url       = {https://doi.org/10.1016/j.jctb.2004.11.004},
  doi       = {10.1016/j.jctb.2004.11.004},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jct/Hatami05},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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},
  url       = {https://doi.org/10.1016/j.jctb.2005.04.002},
  doi       = {10.1016/j.jctb.2005.04.002},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jct/Hatami05a},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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   = {Journal of Graph Theory},
  volume    = {49},
  number    = {4},
  pages     = {325--335},
  year      = {2005},
  url       = {https://doi.org/10.1002/jgt.20086},
  doi       = {10.1002/jgt.20086},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jgt/AfshaniGGHTZ05},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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   = {Australasian J. Combinatorics},
  volume    = {30},
  pages     = {147--160},
  year      = {2004},
  url       = {http://ajc.maths.uq.edu.au/pdf/30/ajc_v30_p147.pdf},
  timestamp = {Mon, 14 Aug 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/ajc/AfshaniHM04},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jgt/HatamiT04,
  author    = {Hamed Hatami and
               Ruzbeh Tusserkani},
  title     = {On the complexity of the circular chromatic number},
  journal   = {Journal of Graph Theory},
  volume    = {47},
  number    = {3},
  pages     = {226--230},
  year      = {2004},
  url       = {https://doi.org/10.1002/jgt.20022},
  doi       = {10.1002/jgt.20022},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jgt/HatamiT04},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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 2000: Robot Soccer World Cup {IV}},
  pages     = {437--440},
  year      = {2000},
  crossref  = {DBLP:conf/robocup/2000},
  url       = {https://doi.org/10.1007/3-540-45324-5_55},
  doi       = {10.1007/3-540-45324-5_55},
  timestamp = {Thu, 15 Jun 2017 21:41:22 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/robocup/HabibiFMKHF00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/2017,
  editor    = {Ryan O'Donnell},
  title     = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
               Riga, Latvia},
  series    = {LIPIcs},
  volume    = {79},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2017},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-040-8},
  isbn      = {978-3-95977-040-8},
  timestamp = {Thu, 10 Aug 2017 16:49:48 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/2017},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/cocoon/2017,
  editor    = {Yixin Cao and
               Jianer Chen},
  title     = {Computing and Combinatorics - 23rd International Conference, {COCOON}
               2017, Hong Kong, China, August 3-5, 2017, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {10392},
  publisher = {Springer},
  year      = {2017},
  url       = {https://doi.org/10.1007/978-3-319-62389-4},
  doi       = {10.1007/978-3-319-62389-4},
  isbn      = {978-3-319-62388-7},
  timestamp = {Tue, 25 Jul 2017 11:37:58 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/cocoon/2017},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/2016,
  editor    = {Irit Dinur},
  title     = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
               2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
               {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2016},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7781469},
  isbn      = {978-1-5090-3933-3},
  timestamp = {Tue, 20 Dec 2016 16:13:45 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/2016},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/2013,
  title     = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2013, 26-29 October, 2013, Berkeley, CA, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2013},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6685222},
  isbn      = {978-0-7695-5135-7},
  timestamp = {Mon, 15 Dec 2014 18:48:45 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/2013},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/2013,
  editor    = {Dan Boneh and
               Tim Roughgarden and
               Joan Feigenbaum},
  title     = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
               USA, June 1-4, 2013},
  publisher = {{ACM}},
  year      = {2013},
  url       = {http://dl.acm.org/citation.cfm?id=2488608},
  isbn      = {978-1-4503-2029-0},
  timestamp = {Sun, 26 May 2013 10:30:47 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/2013},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/approx/2012,
  editor    = {Anupam Gupta and
               Klaus Jansen and
               Jos{\'{e}} D. P. Rolim and
               Rocco A. Servedio},
  title     = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques - 15th International Workshop, {APPROX} 2012, and 16th
               International Workshop, {RANDOM} 2012, Cambridge, MA, USA, August
               15-17, 2012. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {7408},
  publisher = {Springer},
  year      = {2012},
  url       = {https://doi.org/10.1007/978-3-642-32512-0},
  doi       = {10.1007/978-3-642-32512-0},
  isbn      = {978-3-642-32511-3},
  timestamp = {Tue, 23 May 2017 01:11:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/approx/2012},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/2011,
  editor    = {Lance Fortnow and
               Salil P. Vadhan},
  title     = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC}
               2011, San Jose, CA, USA, 6-8 June 2011},
  publisher = {{ACM}},
  year      = {2011},
  isbn      = {978-1-4503-0691-1},
  timestamp = {Tue, 22 May 2012 21:36:56 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/2011},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/2010,
  editor    = {Moses Charikar},
  title     = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
  publisher = {{SIAM}},
  year      = {2010},
  url       = {https://doi.org/10.1137/1.9781611973075},
  doi       = {10.1137/1.9781611973075},
  isbn      = {978-0-89871-701-3},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/soda/2010},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/approx/2007,
  editor    = {Moses Charikar and
               Klaus Jansen and
               Omer Reingold and
               Jos{\'{e}} D. P. Rolim},
  title     = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, 10th International Workshop, {APPROX} 2007, and 11th
               International Workshop, {RANDOM} 2007, Princeton, NJ, USA, August
               20-22, 2007, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {4627},
  publisher = {Springer},
  year      = {2007},
  url       = {https://doi.org/10.1007/978-3-540-74208-1},
  doi       = {10.1007/978-3-540-74208-1},
  isbn      = {978-3-540-74207-4},
  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/approx/2007},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/robocup/2000,
  editor    = {Peter Stone and
               Tucker R. Balch and
               Gerhard K. Kraetzschmar},
  title     = {RoboCup 2000: Robot Soccer World Cup {IV}},
  series    = {Lecture Notes in Computer Science},
  volume    = {2019},
  publisher = {Springer},
  year      = {2001},
  url       = {https://doi.org/10.1007/3-540-45324-5},
  doi       = {10.1007/3-540-45324-5},
  isbn      = {3-540-42185-8},
  timestamp = {Thu, 15 Jun 2017 21:41:22 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/robocup/2000},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
maintained by Schloss Dagstuhl LZI at University of Trier