Search dblp for Publications

export results for "nir ailon fourier"

 download as .bib file

@article{DBLP:journals/ipl/AilonY21,
  author       = {Nir Ailon and
                  Gal Yehuda},
  title        = {The complexity of computing (almost) orthogonal matrices with \emph{{\(\epsilon\)}}-copies
                  of the Fourier transform},
  journal      = {Inf. Process. Lett.},
  volume       = {165},
  pages        = {106024},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.ipl.2020.106024},
  doi          = {10.1016/J.IPL.2020.106024},
  timestamp    = {Fri, 14 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/AilonY21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Ailon20,
  author       = {Nir Ailon},
  title        = {Paraunitary matrices, entropy, algebraic condition number and Fourier
                  computation},
  journal      = {Theor. Comput. Sci.},
  volume       = {814},
  pages        = {234--248},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.tcs.2020.02.002},
  doi          = {10.1016/J.TCS.2020.02.002},
  timestamp    = {Fri, 14 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/Ailon20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1907-07471,
  author       = {Nir Ailon},
  title        = {Interesting Open Problem Related to Complexity of Computing the Fourier
                  Transform and Group Theory},
  journal      = {CoRR},
  volume       = {abs/1907.07471},
  year         = {2019},
  url          = {http://arxiv.org/abs/1907.07471},
  eprinttype    = {arXiv},
  eprint       = {1907.07471},
  timestamp    = {Tue, 23 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1907-07471.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/toct/Ailon16,
  author       = {Nir Ailon},
  title        = {An Omega((n log n)/R) Lower Bound for Fourier Transform Computation
                  in the R-Well Conditioned Model},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {8},
  number       = {1},
  pages        = {4:1--4:14},
  year         = {2016},
  url          = {https://doi.org/10.1145/2858785},
  doi          = {10.1145/2858785},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/Ailon16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/Ailon16,
  author       = {Nir Ailon},
  title        = {Paraunitary Matrices, Entropy, Algebraic Condition Number and Fourier
                  Computation},
  journal      = {CoRR},
  volume       = {abs/1609.03278},
  year         = {2016},
  url          = {http://arxiv.org/abs/1609.03278},
  eprinttype    = {arXiv},
  eprint       = {1609.03278},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Ailon16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/AilonY16,
  author       = {Nir Ailon and
                  Gal Yehuda},
  title        = {The Complexity of Computing a Fourier Perturbation},
  journal      = {CoRR},
  volume       = {abs/1604.02557},
  year         = {2016},
  url          = {http://arxiv.org/abs/1604.02557},
  eprinttype    = {arXiv},
  eprint       = {1604.02557},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/AilonY16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icalp/Ailon15,
  author       = {Nir Ailon},
  editor       = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
                  Kazuo Iwama and
                  Naoki Kobayashi and
                  Bettina Speckmann},
  title        = {Tighter Fourier Transform Lower Bounds},
  booktitle    = {Automata, Languages, and Programming - 42nd International Colloquium,
                  {ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {9134},
  pages        = {14--25},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-662-47672-7\_2},
  doi          = {10.1007/978-3-662-47672-7\_2},
  timestamp    = {Fri, 27 Mar 2020 09:02:59 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/Ailon15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/Ailon14,
  author       = {Nir Ailon},
  title        = {An n{\textbackslash}log n Lower Bound for Fourier Transform Computation
                  in the Well Conditioned Model},
  journal      = {CoRR},
  volume       = {abs/1403.1307},
  year         = {2014},
  url          = {http://arxiv.org/abs/1403.1307},
  eprinttype    = {arXiv},
  eprint       = {1403.1307},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Ailon14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/Ailon14a,
  author       = {Nir Ailon},
  title        = {A Tighter Lower Bound For Fourier Transform in the Well Conditioned
                  Model},
  journal      = {CoRR},
  volume       = {abs/1404.1741},
  year         = {2014},
  url          = {http://arxiv.org/abs/1404.1741},
  eprinttype    = {arXiv},
  eprint       = {1404.1741},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Ailon14a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cjtcs/Ailon13,
  author       = {Nir Ailon},
  title        = {A Lower Bound for Fourier Transform Computation in a Linear Model
                  Over 2x2 Unitary Gates Using Matrix Entropy},
  journal      = {Chic. J. Theor. Comput. Sci.},
  volume       = {2013},
  year         = {2013},
  url          = {http://cjtcs.cs.uchicago.edu/articles/2013/12/contents.html},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cjtcs/Ailon13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1305-4745,
  author       = {Nir Ailon},
  title        = {A Lower Bound for Fourier Transform Computation in a Linear Model
                  Over 2x2 Unitary Gates Using Matrix Entropy},
  journal      = {CoRR},
  volume       = {abs/1305.4745},
  year         = {2013},
  url          = {http://arxiv.org/abs/1305.4745},
  eprinttype    = {arXiv},
  eprint       = {1305.4745},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1305-4745.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.