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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@inproceedings{DBLP:conf/icalp/Ailon15,
  author       = {Nir Ailon},
  title        = {Tighter Fourier Transform Lower Bounds},
  booktitle    = {{ICALP} {(1)}},
  series       = {Lecture Notes in Computer Science},
  volume       = {9134},
  pages        = {14--25},
  publisher    = {Springer},
  year         = {2015}
}
@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}
}
@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}
}
@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}
}
@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}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics