default search action
Ameya Velingker
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c26]Federico Barbero, Ameya Velingker, Amin Saberi, Michael M. Bronstein, Francesco Di Giovanni:
Locality-Aware Graph Rewiring in GNNs. ICLR 2024 - [c25]Billy Joe Franks, Christopher Morris, Ameya Velingker, Floris Geerts:
Weisfeiler-Leman at the margin: When more expressivity matters. ICML 2024 - [c24]Sara Ahmadian
, Sreenivas Gollapudi
Efficient Location Sampling Algorithms for Road Networks. WWW (Companion Volume) 2024: 899-902 - [i29]Billy Joe Franks, Christopher Morris, Ameya Velingker, Floris Geerts:
Weisfeiler-Leman at the margin: When more expressivity matters. CoRR abs/2402.07568 (2024) - 2023
- [c23]Hamed Shirzad, Ameya Velingker, Balaji Venkatachalam, Danica J. Sutherland, Ali Kemal Sinop:
Exphormer: Sparse Transformers for Graphs. ICML 2023: 31613-31632 - [c22]Ameya Velingker, Maximilian Vötsch, David P. Woodruff, Samson Zhou:
Fast (1+ε)-Approximation Algorithms for Binary Matrix Factorization. ICML 2023: 34952-34977 - [c21]Ameya Velingker, Ali Kemal Sinop, Ira Ktena, Petar Velickovic, Sreenivas Gollapudi:
Affinity-Aware Graph Networks. NeurIPS 2023 - [i28]Hamed Shirzad, Ameya Velingker, Balaji Venkatachalam, Danica J. Sutherland, Ali Kemal Sinop:
Exphormer: Sparse Transformers for Graphs. CoRR abs/2303.06147 (2023) - [i27]Ameya Velingker, Maximilian Vötsch, David P. Woodruff, Samson Zhou:
Fast (1+ε)-Approximation Algorithms for Binary Matrix Factorization. CoRR abs/2306.01869 (2023) - [i26]Federico Barbero, Ameya Velingker, Amin Saberi, Michael M. Bronstein, Francesco Di Giovanni:
Locality-Aware Graph-Rewiring in GNNs. CoRR abs/2310.01668 (2023) - 2022
- [c20]Pravesh Kothari, Pasin Manurangsi, Ameya Velingker:
Private Robust Estimation by Stabilizing Convex Relaxations. COLT 2022: 723-777 - [c19]Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Ameya Velingker, Santhoshini Velusamy
Linear space streaming lower bounds for approximating CSPs. STOC 2022: 275-288 - [i25]Ameya Velingker, Ali Kemal Sinop, Ira Ktena, Petar Velickovic, Sreenivas Gollapudi:
Affinity-Aware Graph Networks. CoRR abs/2206.11941 (2022) - 2021
- [c18]Badih Ghazi, Noah Golowich, Ravi Kumar, Rasmus Pagh
On the Power of Multiple Anonymous Messages: Frequency Estimation and Selection in the Shuffle Model of Differential Privacy. EUROCRYPT (3) 2021: 463-488 - [i24]Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Ameya Velingker, Santhoshini Velusamy:
Linear Space Streaming Lower Bounds for Approximating CSPs. CoRR abs/2106.13078 (2021) - [i23]Pravesh K. Kothari, Pasin Manurangsi, Ameya Velingker:
Private Robust Estimation by Stabilizing Convex Relaxations. CoRR abs/2112.03548 (2021) - [i22]Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Ameya Velingker, Santhoshini Velusamy:
Linear Space Streaming Lower Bounds for Approximating CSPs. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c17]Amir Zandieh, Navid Nouri, Ameya Velingker, Michael Kapralov
Scaling up Kernel Ridge Regression via Locality Sensitive Hashing. AISTATS 2020: 4088-4097 - [c16]Badih Ghazi, Pasin Manurangsi, Rasmus Pagh, Ameya Velingker:
Private Aggregation from Fewer Anonymous Messages. EUROCRYPT (2) 2020: 798-827 - [c15]Badih Ghazi, Noah Golowich, Ravi Kumar, Pasin Manurangsi, Rasmus Pagh, Ameya Velingker:
Pure Differentially Private Summation from Anonymous Messages. ITC 2020: 15:1-15:23 - [c14]Thomas D. Ahle, Michael Kapralov
Oblivious Sketching of High-Degree Polynomial Kernels. SODA 2020: 141-160 - [i21]Badih Ghazi, Noah Golowich, Ravi Kumar, Pasin Manurangsi, Rasmus Pagh, Ameya Velingker:
Pure Differentially Private Summation from Anonymous Messages. CoRR abs/2002.01919 (2020) - [i20]Michael Kapralov, Navid Nouri, Ilya P. Razenshteyn, Ameya Velingker, Amir Zandieh
Scaling up Kernel Ridge Regression via Locality Sensitive Hashing. CoRR abs/2003.09756 (2020)
2010 – 2019
- 2019
- [c13]Michael Kapralov
Dimension-independent Sparse Fourier Transform. SODA 2019: 2709-2728 - [c12]Haim Avron
A universal sampling method for reconstructing signals with simple Fourier transforms. STOC 2019: 1051-1063 - [i19]Michael Kapralov, Ameya Velingker, Amir Zandieh
Dimension-independent Sparse Fourier Transform. CoRR abs/1902.10633 (2019) - [i18]Badih Ghazi, Rasmus Pagh, Ameya Velingker:
Scalable and Differentially Private Distributed Aggregation in the Shuffled Model. CoRR abs/1906.08320 (2019) - [i17]Badih Ghazi, Noah Golowich, Ravi Kumar, Rasmus Pagh, Ameya Velingker:
Private Heavy Hitters and Range Queries in the Shuffled Model. CoRR abs/1908.11358 (2019) - [i16]Michael Kapralov, Rasmus Pagh, Ameya Velingker, David P. Woodruff, Amir Zandieh
Oblivious Sketching of High-Degree Polynomial Kernels. CoRR abs/1909.01410 (2019) - [i15]Badih Ghazi, Pasin Manurangsi, Rasmus Pagh, Ameya Velingker:
Private Aggregation from Fewer Anonymous Messages. CoRR abs/1909.11073 (2019) - [i14]Badih Ghazi, Noah Golowich, Ravi Kumar, Rasmus Pagh, Ameya Velingker:
On the Power of Multiple Anonymous Messages. IACR Cryptol. ePrint Arch. 2019: 1382 (2019) - 2018
- [i13]Haim Avron, Michael Kapralov, Cameron Musco, Christopher Musco, Ameya Velingker, Amir Zandieh
Random Fourier Features for Kernel Ridge Regression: Approximation Bounds and Statistical Guarantees. CoRR abs/1804.09893 (2018) - [i12]Haim Avron, Michael Kapralov, Cameron Musco, Christopher Musco, Ameya Velingker, Amir Zandieh
A Universal Sampling Method for Reconstructing Signals with Simple Fourier Transforms. CoRR abs/1812.08723 (2018) - 2017
- [c11]Venkatesan Guruswami, Ameya Velingker, Santhoshini Velusamy
Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph. APPROX-RANDOM 2017: 8:1-8:19 - [c10]Haim Avron, Michael Kapralov
Random Fourier Features for Kernel Ridge Regression: Approximation Bounds and Statistical Guarantees. ICML 2017: 253-262 - [c9]Michael Kapralov
(1 + Ω(1))-Αpproximation to MAX-CUT Requires Linear Space. SODA 2017: 1703-1722 - [c8]Bernhard Haeupler, Ameya Velingker:
Bridging the Capacity Gap Between Interactive and One-Way Communication. SODA 2017: 2123-2142 - 2016
- [c7]Mitali Bafna, Satyanarayana V. Lokam, Sébastien Tavenas, Ameya Velingker:
On the Sensitivity Conjecture for Read-k Formulas. MFCS 2016: 16:1-16:14 - [i11]Bernhard Haeupler, Ameya Velingker:
Bridging the Capacity Gap Between Interactive and One-Way Communication. CoRR abs/1605.08792 (2016) - [i10]Mitali Bafna, Satyanarayana V. Lokam, Sébastien Tavenas, Ameya Velingker:
On the Sensitivity Conjecture for Read-k Formulas. Electron. Colloquium Comput. Complex. TR16 (2016) - [i9]Bernhard Haeupler, Ameya Velingker:
Bridging the Capacity Gap Between Interactive and One-Way Communication. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c6]Bernhard Haeupler
Communication with Partial Noiseless Feedback. APPROX-RANDOM 2015: 881-897 - [c5]Venkatesan Guruswami, Ameya Velingker:
An Entropy Sumset Inequality and Polynomially Fast Convergence to Shannon Capacity Over All Alphabets. CCC 2015: 42-57 - [c4]Venkatesan Guruswami, Madhu Sudan, Ameya Velingker, Carol Wang:
Limitations on Testable Affine-Invariant Codes in the High-Rate Regime. SODA 2015: 1312-1325 - [c3]Michael B. Cohen
Approximating Nearest Neighbor Distances. WADS 2015: 200-211 - [i8]Karthekeyan Chandrasekaran, Ameya Velingker:
Constructing Ramanujan Graphs Using Shift Lifts. CoRR abs/1502.07410 (2015) - [i7]Michael B. Cohen
Approximating Nearest Neighbor Distances. CoRR abs/1502.08048 (2015) - 2014
- [i6]Venkatesan Guruswami, Ameya Velingker:
An Entropy Sumset Inequality and Polynomially Fast Convergence to Shannon Capacity Over All Alphabets. CoRR abs/1411.6993 (2014) - [i5]Venkatesan Guruswami, Madhu Sudan, Ameya Velingker, Carol Wang:
Limitations on Testable Affine-Invariant Codes in the High-Rate Regime. Electron. Colloquium Comput. Complex. TR14 (2014) - [i4]Venkatesan Guruswami, Ameya Velingker:
An Entropy Sumset Inequality and Polynomially Fast Convergence to Shannon Capacity Over All Alphabets. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j1]Mahdi Cheraghchi
Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes. SIAM J. Comput. 42(5): 1888-1914 (2013) - [c2]Gary L. Miller, Donald R. Sheehy
A fast algorithm for well-spaced points and approximate delaunay graphs. SoCG 2013: 289-298 - [c1]Mahdi Cheraghchi
Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes. SODA 2013: 432-442 - [i3]Gary L. Miller, Donald R. Sheehy, Ameya Velingker:
A Fast Algorithm for Well-Spaced Points and Approximate Delaunay Graphs. CoRR abs/1304.0524 (2013) - 2012
- [i2]Mahdi Cheraghchi, Venkatesan Guruswami, Ameya Velingker:
Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes. CoRR abs/1207.1140 (2012) - [i1]Mahdi Cheraghchi, Venkatesan Guruswami, Ameya Velingker:
Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes. Electron. Colloquium Comput. Complex. TR12 (2012)
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-10-07 22:05 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: