Sushant Sachdeva

1.2k citations

32 papers · 307 indexed · h-index 10

Impact in

Computational Mathematics top 10%
Computational Theory and Mathematics top 5%
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research

Papers in ⓘ

Computational Theory and Mathematics 19
- Complexity and Algorithms in Graphs 14
- Advanced Graph Theory Research 6
Computer Graphics and Computer-Aided Design 4
- Computational Geometry and Mesh Generation 4

Co-authors: Nisheeth K. Vishnoi (3 shared papers)Rasmus Kyng (9 shared papers)Richard Peng (7 shared papers)Yang P. Liu (4 shared papers)Lorenzo Orecchia (1 shared paper)Maximilian Probst Gutenberg (4 shared papers)Sanjeev Arora (3 shared papers)Li Chen (1 shared paper)
Journals: Communications of the ACM (1 paper)Operations Research Letters (1 paper)Algorithmica (1 paper)IEEE/ACM Transactions on Computational Biology and Bioinformatics (1 paper)SIAM Journal on Computing (1 paper)
Partner nations: United States Canada Switzerland

In The Last Decade

Sushant Sachdeva

29 papers receiving 284 citations

Peers

Countries citing papers authored by Sushant Sachdeva

Since Specialization

Citations

This map shows the geographic impact of Sushant Sachdeva'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 Sushant Sachdeva with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Sushant Sachdeva more than expected).

Fields of papers citing papers by Sushant Sachdeva

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Sushant Sachdeva. 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 Sushant Sachdeva. The network helps show where Sushant Sachdeva may publish in the future.

Co-authors

The 25 scholars most cited alongside Sushant Sachdeva, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Sushant Sachdeva Line = papers co-authored together Sushant Sachdeva links everyone, so they are left out of the graph.

All Works

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

20 of 20 papers shown

Showing the 20 most-cited of 32 papers — load more, or switch the sort, to bring in the rest.

#	Work
1	Maximum Flow and Minimum-Cost Flow in Almost-Linear Time Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva	2022	59
2	Approximating the exponential, the lanczos method and an Õ(m)-time spectral algorithm for balanced separator Lorenzo Orecchia, Sushant Sachdeva, Nisheeth K. Vishnoi	2012	37
3	Sparsified Cholesky and multigrid solvers for connection laplacians Rasmus Kyng, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Daniel A. Spielman	2016	34
4	Faster Algorithms via Approximation Theory Sushant Sachdeva, Nisheeth K. Vishnoi	2014	27
5	Finding overlapping communities in social networks Sanjeev Arora, Rong Ge, Sushant Sachdeva, Grant Schoenebeck	2012	24
6	Sampling random spanning trees faster than matrix multiplication David Durfee, Rasmus Kyng, John Peebles, Anup Rao, Sushant Sachdeva	2017	17
7	Provable ICA with Unknown Gaussian Noise, and Implications for Gaussian Mixtures and Autoencoders Algorithmica ·Sanjeev Arora, Rong Ge, Ankur Moitra, Sushant Sachdeva	2015	15
8	A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford	2023	11
9	Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions Timothy Chu, Yu Gao, Richard Peng, Sushant Sachdeva, Saurabh Sawlani, Junxing Wang	2018	11
10	Optimal Inapproximability for Scheduling Problems via Structural Hardness for Hypergraph Vertex Cover Sushant Sachdeva, Rishi Saket	2013	10
11	Fast, provable algorithms for Isotonic regression in all ℓ- p -norms Rasmus Kyng, Anup Rao, Sushant Sachdeva	2015	9
12	Algorithms for Lipschitz Learning on Graphs Conference on Learning Theory ·Rasmus Kyng, Anup Rao, Sushant Sachdeva, Daniel A. Spielman	2015	7
13	Faster Algorithms via Approximation Theory now publishers, Inc. eBooks ·Sushant Sachdeva	2013	5
14	On the Characterization and Selection of Diverse Conformational Ensembles with Applications to Flexible Docking IEEE/ACM Transactions on Computational Biology and Bioinformatics ·Sébastien Loriot, Sushant Sachdeva, Karine Bastard, Chantal Prévost, Frédéric Cazals	2009	4
15	Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions SIAM Journal on Computing ·Timothy Chu, Yu Gao, Richard Peng, Sushant Sachdeva, Saurabh Sawlani, Junxing Wang	2020	4
16	Inapproximability of Minimum Vertex Cover on $k$-Uniform $k$-Partite Hypergraphs SIAM Journal on Discrete Mathematics ·Venkatesan Guruswami, Sushant Sachdeva, Rishi Saket	2015	4
17	Real Analysis in Computer Science: A collection of Open Problems Yuval Filmus, Hamed Hatami, Steven Heilman, Elchanan Mossel, Sushant Sachdeva, Andrew Wan, Karl Wimmer	2014	3
18	Greedy Geometric Algorithms for Collection of Balls, with Applications to Geometric Approximation and Molecular Coarse‐Graining Computer Graphics Forum ·Frédéric Cazals, Tommy Dreyfus, Sushant Sachdeva, Nisarg Shah	2014	3
19	On the Characterization and Selection of Diverse Conformational Ensembles Sébastien Loriot, Sushant Sachdeva, Karine Bastard, Chantal Prévost, Frédéric Cazals	2008	3
20	The mixing time of the Dikin walk in a polytope—A simple proof Operations Research Letters ·Sushant Sachdeva, Nisheeth K. Vishnoi	2016	3

About Sushant Sachdeva

Sushant Sachdeva is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, Statistics and Probability, Discrete Mathematics and Combinatorics and Artificial Intelligence, having authored 32 papers that have together received 307 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (14 papers), Advanced Graph Theory Research (6 papers), Markov Chains and Monte Carlo Methods (6 papers), Machine Learning and Algorithms (5 papers), Neural Networks and Applications (4 papers), Stochastic Gradient Optimization Techniques (4 papers), Computational Geometry and Mesh Generation (4 papers) and Optimization and Search Problems (3 papers). The work is most often cited by research in Computational Mathematics (9 citations), Computational Theory and Mathematics (154 citations), Computer Graphics and Computer-Aided Design (19 citations), Artificial Intelligence (132 citations) and Statistics and Probability (33 citations). Sushant Sachdeva has collaborated with scholars based in United States, Canada and Switzerland. Frequent co-authors include Nisheeth K. Vishnoi, Rasmus Kyng, Richard Peng, Yang P. Liu, Lorenzo Orecchia, Maximilian Probst Gutenberg, Sanjeev Arora, Li Chen, Daniel A. Spielman and Anup Rao. Their work appears in journals such as Communications of the ACM, Operations Research Letters, Algorithmica, IEEE/ACM Transactions on Computational Biology and Bioinformatics and SIAM Journal on Computing.

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