English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Traversing the FFT Computation Tree for Dimension-Independent Sparse Fourier Transforms

Bringmann, K., Kapralov, M., Makarov, M., Nakos, V., Yagudin, A., & Zandieh, A. (2023). Traversing the FFT Computation Tree for Dimension-Independent Sparse Fourier Transforms. In N. Bansal, & V. Nagarajan (Eds.), Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 4768-4845). Philadelphia, PA: SIAM. doi:10.1137/1.9781611977554.ch177.

Item is

Basic

show hide
Genre: Conference Paper
Other : Sparse {F}ourier Transform by traversing {C}ooley-{T}ukey {FFT} computation graphs
Latex : Traversing the {FFT} Computation Tree for Dimension-Independent Sparse {F}ourier Transforms

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Bringmann, Karl1, Author                 
Kapralov, Michael2, Author
Makarov, Mikhail2, Author
Nakos, Vasileios1, Author           
Yagudin, Amir2, Author
Zandieh, Amir1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2External Organizations, ou_persistent22              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2021-06-2320222023
 Publication Status: Published online
 Pages: 139 p.
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: BringmannSODA23
DOI: 10.1137/1.9781611977554.ch177
 Degree: -

Event

show
hide
Title: Annual ACM-SIAM Symposium on Discrete Algorithms
Place of Event: Florence, Italy
Start-/End Date: 2023-01-22 - 2023-01-25

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms
  Abbreviation : SODA 2023
Source Genre: Proceedings
 Creator(s):
Bansal, Nikhil1, Editor
Nagarajan, Viswanath, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Philadelphia, PA : SIAM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 4768 - 4845 Identifier: ISBN: 978-1-61197-755-4