Ameya Velingker

545 total citations
12 papers, 84 citations indexed

About

Ameya Velingker is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computational Mechanics. According to data from OpenAlex, Ameya Velingker has authored 12 papers receiving a total of 84 indexed citations (citations by other indexed papers that have themselves been cited), including 8 papers in Computational Theory and Mathematics, 7 papers in Artificial Intelligence and 3 papers in Computational Mechanics. Recurrent topics in Ameya Velingker's work include Complexity and Algorithms in Graphs (6 papers), Sparse and Compressive Sensing Techniques (3 papers) and Cryptography and Data Security (3 papers). Ameya Velingker is often cited by papers focused on Complexity and Algorithms in Graphs (6 papers), Sparse and Compressive Sensing Techniques (3 papers) and Cryptography and Data Security (3 papers). Ameya Velingker collaborates with scholars based in United States, Switzerland and Denmark. Ameya Velingker's co-authors include Venkatesan Guruswami, Mahdi Cheraghchi, Michael Kapralov, Cameron Musco, Haim Avron, Madhu Sudan, Christopher Musco, Pritish Kamath, Bernhard Haeupler and Sanjeev Khanna and has published in prestigious journals such as Linear Algebra and its Applications, Symposium on Discrete Algorithms and International Conference on Machine Learning.

In The Last Decade

Ameya Velingker

11 papers receiving 81 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Ameya Velingker United States	7	31	31	29	29	16	12	84
Khanh Do Ba United States	4	50 1.6×	43 1.4×	29 1.0×	26 0.9×	12 0.8×	6	120
Elena Ceci Italy	8	9 0.3×	63 2.0×	53 1.8×	12 0.4×	45 2.8×	9	127
Victor Malyshkin Russia	6	11 0.4×	16 0.5×	45 1.6×	12 0.4×	7 0.4×	34	97
Yongjin Yeom South Korea	6	8 0.3×	44 1.4×	19 0.7×	13 0.4×	10 0.6×	30	97
Tillmann Miltzow Germany	7	21 0.7×	26 0.8×	10 0.3×	45 1.6×	8 0.5×	27	103
Jakob Wenzel Germany	4	9 0.3×	18 0.6×	12 0.4×	20 0.7×	9 0.6×	12	87
Xinyang Yi United States	4	68 2.2×	33 1.1×	13 0.4×	5 0.2×	13 0.8×	7	112
Konstantin Mishchenko Saudi Arabia	5	42 1.4×	46 1.5×	17 0.6×	15 0.5×	13 0.8×	15	86
Terry Cojean Germany	7	25 0.8×	20 0.6×	68 2.3×	61 2.1×	18 1.1×	15	153
Botong Wang United States	9	16 0.5×	10 0.3×	3 0.1×	49 1.7×	8 0.5×	39	195

Countries citing papers authored by Ameya Velingker

Since Specialization

Citations

This map shows the geographic impact of Ameya Velingker's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Ameya Velingker with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ameya Velingker more than expected).

Fields of papers citing papers by Ameya Velingker

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Ameya Velingker. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Ameya Velingker. The network helps show where Ameya Velingker may publish in the future.

Co-authorship network of co-authors of Ameya Velingker

This figure shows the co-authorship network connecting the top 25 collaborators of Ameya Velingker. A scholar is included among the top collaborators of Ameya Velingker based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Ameya Velingker. Ameya Velingker is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

12 of 12 papers shown

Golovnev, Alexander, et al.. (2022). Linear space streaming lower bounds for approximating CSPs. 275–288. 7 indexed citations

Golowich, Noah, et al.. (2020). Pure Differentially Private Summation from Anonymous Messages. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

Kapralov, Michael, et al.. (2020). Oblivious Sketching of High-Degree Polynomial Kernels. IT University Of Copenhagen (IT University of Copenhagen). 2 indexed citations

Avron, Haim, et al.. (2017). Random Fourier Features for Kernel Ridge Regression: Approximation Bounds and Statistical Guarantees. International Conference on Machine Learning. 253–262. 15 indexed citations

Kapralov, Michael, Sanjeev Khanna, Madhu Sudan, & Ameya Velingker. (2017). (1 + Ω(1))-Αpproximation to MAX-CUT Requires Linear Space. 6 indexed citations

Velingker, Ameya, et al.. (2017). Shift lifts preserving Ramanujan property. Linear Algebra and its Applications. 529. 199–214. 1 indexed citations

Guruswami, Venkatesan, et al.. (2017). Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 81. 19. 7 indexed citations

Velingker, Ameya, et al.. (2015). Constructing Ramanujan Graphs Using Shift Lifts.. 1 indexed citations

Haeupler, Bernhard, Pritish Kamath, & Ameya Velingker. (2015). Communication with Partial Noiseless Feedback. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 40. 897. 6 indexed citations

10.

Guruswami, Venkatesan, et al.. (2014). Limitations on Testable Affine-Invariant Codes in the High-Rate Regime. 1312–1325.

11.

Cheraghchi, Mahdi, Venkatesan Guruswami, & Ameya Velingker. (2013). Restricted isometry of fourier matrices and list decodability of random linear codes. Symposium on Discrete Algorithms. 432–442. 12 indexed citations

12.

Cheraghchi, Mahdi, Venkatesan Guruswami, & Ameya Velingker. (2012). Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes. DSpace@MIT (Massachusetts Institute of Technology). 26 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact