default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNoah Amsel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i8]Noah Amsel, Tyler Chen, Feyza Duman Keles, Diana Halikias, Cameron Musco, Christopher Musco:
Fixed-sparsity matrix approximation from matrix-vector products. CoRR abs/2402.09379 (2024)- [i7]Noah Amsel, Gilad Yehudai, Joan Bruna:
On the Benefits of Rank in Attention Layers. CoRR abs/2407.16153 (2024) - 2023
- [i6]Noah Amsel, Tyler Chen, Anne Greenbaum, Cameron Musco, Christopher Musco:
Near-Optimality Guarantees for Approximating Rational Matrix Functions by the Lanczos Method. CoRR abs/2303.03358 (2023) - 2022
- [i5]Jordi Ros-Giralt, Noah Amsel, Sruthi Yellamraju, James R. Ezick, Richard Lethin, Yuang Jiang, Aosong Feng, Leandros Tassiulas:
A Quantitative Theory of Bottleneck Structures for Data Networks. CoRR abs/2210.03534 (2022) - 2021
- [j1]Ariel Jaffe, Noah Amsel, Yariv Aizenbud, Boaz Nadler
, Joseph T. Chang, Yuval Kluger:
Spectral Neighbor Joining for Reconstruction of Latent Tree Models. SIAM J. Math. Data Sci. 3(1): 113-141 (2021) - [c5]Julia Wei, Matthew Harper Langston, Pierre-David Letourneau, Matthew J. Morse, Larry Weintraub, Aimee Nogoy, Noah Amsel, Richard Lethin:
Boundary Integral Solver Approaches for Particle Accelerator Simulation Problems and Deployment on NERSC Hardware. HPEC 2021: 1-6 - [c4]Jordi Ros-Giralt, Noah Amsel, Sruthi Yellamraju, James R. Ezick, Richard Lethin, Yuang Jiang, Aosong Feng, Leandros Tassiulas, Zhenguo Wu, Min Yee Teh, Keren Bergman:
Designing data center networks using bottleneck structures. SIGCOMM 2021: 319-348 - [i4]Yariv Aizenbud, Ariel Jaffe, Meng Wang, Amber Hu, Noah Amsel, Boaz Nadler, Joseph T. Chang, Yuval Kluger:
Spectral Top-Down Recovery of Latent Tree Models. CoRR abs/2102.13276 (2021) - 2020
- [c3]Noah Amsel, Jordi Ros-Giralt, Sruthi Yellamraju, James R. Ezick, Brendan von Hofe, Alison Ryan, Richard Lethin:
Computing Bottleneck Structures at Scale for High-Precision Network Performance Analysis. INDIS@SC 2020: 68-78 - [i3]Ariel Jaffe, Noah Amsel, Boaz Nadler, Joseph T. Chang, Yuval Kluger:
Spectral neighbor joining for reconstruction of latent tree models. CoRR abs/2002.12547 (2020)
2010 – 2019
- 2019
- [c2]William Merrill, Lenny Khazan, Noah Amsel, Yiding Hao, Simon Mendelsohn, Robert Frank:
Finding Hierarchical Structure in Neural Stacks Using Unsupervised Parsing. BlackboxNLP@ACL 2019: 224-232 - [i2]William Merrill, Lenny Khazan, Noah Amsel, Yiding Hao, Simon Mendelsohn, Robert Frank:
Finding Syntactic Representations in Neural Stacks. CoRR abs/1906.01594 (2019) - 2018
- [c1]Yiding Hao, William Merrill, Dana Angluin, Robert Frank, Noah Amsel, Andrew Benz, Simon Mendelsohn:
Context-Free Transductions with Neural Stacks. BlackboxNLP@EMNLP 2018: 306-315 - [i1]Yiding Hao, William Merrill, Dana Angluin, Robert Frank, Noah Amsel, Andrew Benz, Simon Mendelsohn:
Context-Free Transductions with Neural Stacks. CoRR abs/1809.02836 (2018)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-20 22:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
