Madhur Tulsiani

805 total citations
28 papers, 174 citations indexed

About

Madhur Tulsiani is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Madhur Tulsiani has authored 28 papers receiving a total of 174 indexed citations (citations by other indexed papers that have themselves been cited), including 23 papers in Computational Theory and Mathematics, 12 papers in Computer Networks and Communications and 9 papers in Artificial Intelligence. Recurrent topics in Madhur Tulsiani's work include Complexity and Algorithms in Graphs (21 papers), Advanced Graph Theory Research (16 papers) and Optimization and Search Problems (4 papers). Madhur Tulsiani is often cited by papers focused on Complexity and Algorithms in Graphs (21 papers), Advanced Graph Theory Research (16 papers) and Optimization and Search Problems (4 papers). Madhur Tulsiani collaborates with scholars based in United States, Israel and Switzerland. Madhur Tulsiani's co-authors include David Steurer, Prasad Raghavendra, Nisheeth K. Vishnoi, Subhash Khot, Siavosh Benabbas, Avner Magen, Sanjeev Arora, Konstantinos Georgiou, Alexandra Kolla and Luca Trevisan and has published in prestigious journals such as SIAM Journal on Computing, Theory of Computing and arXiv (Cornell University).

In The Last Decade

Madhur Tulsiani

25 papers receiving 160 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Madhur Tulsiani United States	7	130	67	58	16	16	28	174
Arnab Bhattacharyya United States	9	160 1.2×	130 1.9×	56 1.0×	4 0.3×	16 1.0×	34	220
Jakub Onufry Wojtaszczyk Poland	8	187 1.4×	29 0.4×	82 1.4×	8 0.5×	8 0.5×	16	218
Euiwoong Lee United States	6	70 0.5×	19 0.3×	50 0.9×	6 0.4×	12 0.8×	42	122
Omri Weinstein United States	8	136 1.0×	111 1.7×	40 0.7×	5 0.3×	5 0.3×	32	196
Pavel Hrubeš United States	8	124 1.0×	86 1.3×	12 0.2×	7 0.4×	7 0.4×	40	180
Ramprasad Saptharishi India	8	213 1.6×	150 2.2×	31 0.5×	3 0.2×	14 0.9×	29	248
Kevin Matulef United States	6	146 1.1×	122 1.8×	48 0.8×	3 0.2×	9 0.6×	11	196
Satyanarayana V. Lokam United States	7	193 1.5×	138 2.1×	50 0.9×	7 0.4×	9 0.6×	22	249
Li-Yang Tan United States	7	119 0.9×	102 1.5×	24 0.4×	12 0.8×	11 0.7×	37	174
Ishay Haviv Israel	7	99 0.8×	76 1.1×	60 1.0×	3 0.2×	5 0.3×	33	167

Countries citing papers authored by Madhur Tulsiani

Since Specialization

Citations

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

Fields of papers citing papers by Madhur Tulsiani

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Madhur Tulsiani

This figure shows the co-authorship network connecting the top 25 collaborators of Madhur Tulsiani. A scholar is included among the top collaborators of Madhur Tulsiani 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 Madhur Tulsiani. Madhur Tulsiani 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:

20 of 20 papers shown

1.

Kothari, Pravesh K., et al.. (2024). Efficient Certificates of Anti-Concentration Beyond Gaussians. 970–987. 1 indexed citations

2.

Ghosh, Mrinal K., et al.. (2023). Inapproximability of Matrix $\boldsymbol{p \rightarrow q}$ Norms. SIAM Journal on Computing. 52(1). 132–155. 4 indexed citations

3.

Tulsiani, Madhur, et al.. (2021). Near-linear time decoding of Ta-Shma’s codes via splittable regularity. 1527–1536. 8 indexed citations

4.

Tulsiani, Madhur, et al.. (2020). Unique Decoding of Explicit $\varepsilon$-balanced Codes Near the Gilbert-Varshamov Bound. 434–445. 2 indexed citations

5.

Guruswami, Venkatesan, et al.. (2018). Inapproximability of Matrix p→q Norms.. arXiv (Cornell University). 25. 37. 2 indexed citations

6.

Tulsiani, Madhur, et al.. (2018). . Theory of Computing. 14(1). 1–33. 2 indexed citations

7.

Guruswami, Venkatesan, et al.. (2017). Weak Decoupling, Polynomial Folds and Approximate Optimization over the Sphere. 1008–1019. 1 indexed citations

8.

Ghosh, Mrinal K., et al.. (2016). Multiplicative Approximations for Polynomial Optimization Over the Unit Sphere. arXiv (Cornell University). 23. 185. 4 indexed citations

9.

Khot, Subhash, et al.. (2014). A characterization of strong approximation resistance. 634–643. 5 indexed citations

10.

Tulsiani, Madhur, et al.. (2013). LS+ Lower Bounds from Pairwise Independence. 121–132. 8 indexed citations

11.

Tulsiani, Madhur, et al.. (2012). $LS_+$ Lower Bounds from Pairwise Independence.. Electronic colloquium on computational complexity. 19. 105. 2 indexed citations

12.

Khot, Subhash, et al.. (2012). The Complexity of Somewhat Approximation Resistant Predicates.. Electronic colloquium on computational complexity. 19. 151.

13.

Benabbas, Siavosh, Konstantinos Georgiou, Avner Magen, & Madhur Tulsiani. (2012). . Theory of Computing. 8(1). 269–289. 27 indexed citations

14.

Khot, Subhash, Muli Safra, & Madhur Tulsiani. (2012). Towards An Optimal Query Efficient PCP. Electronic colloquium on computational complexity. 19. 109.

15.

Raghavendra, Prasad, David Steurer, & Madhur Tulsiani. (2012). Reductions between Expansion Problems. 37. 64–73. 36 indexed citations

16.

Kumar, Amit, et al.. (2011). On LP-based Approximability for Strict CSPs. 1560–1573. 7 indexed citations

17.

De, Anindya, Omid Etesami, Luca Trevisan, & Madhur Tulsiani. (2009). Improved Pseudorandom Generators for Depth 2 Circuits.. Electronic colloquium on computational complexity. 16. 141. 2 indexed citations

18.

Kumar, Amit, et al.. (2009). On the Optimality of a Class of LP-based Algorithms. Electronic colloquium on computational complexity. 16. 124. 1 indexed citations

19.

De, Anindya, Luca Trevisan, & Madhur Tulsiani. (2009). Non-uniform attacks against one-way functions and PRGs.. Electronic colloquium on computational complexity. 16. 113. 2 indexed citations

20.

Schoenebeck, Grant, Luca Trevisan, & Madhur Tulsiani. (2007). A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover. Electronic colloquium on computational complexity. 13. 205–216. 3 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