Manoj Gupta

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 18

Top Topics

Top Venues

SIAM J. Comput.

Publications

Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Akash Pareek, Sorrachai Yingchareonthawornchai
The Group Access Bounds for Binary Search Trees. ICALP (2024)
Dipan Dey, Manoj Gupta
Near Optimal Dual Fault Tolerant Distance Oracle. CoRR (2024)
Dipan Dey, Manoj Gupta
Nearly Optimal Fault Tolerant Distance Oracle. CoRR (2024)
Dipan Dey, Manoj Gupta
Nearly Optimal Fault Tolerant Distance Oracle. STOC (2024)
Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Akash Pareek, Sorrachai Yingchareonthawornchai
The Group Access Bounds for Binary Search Trees. CoRR (2023)
Manoj Gupta, Shahbaz Khan
Simple dynamic algorithms for Maximal Independent Set, Maximum Flow and Maximum Matching. SOSA (2021)
Navin Goyal, Manoj Gupta
Better analysis of greedy binary search tree on decomposable sequences. Theor. Comput. Sci. 776 (2019)
Manoj Gupta, Hitesh Kumar, Neeldhara Misra
On the Complexity of Optimal Matching Reconfiguration. SOFSEM (2019)
Surender Baswana, Manoj Gupta, Sandeep Sen
Fully Dynamic Maximal Matching in O(log n) Update Time (Corrected Version). SIAM J. Comput. 47 (3) (2018)
Manoj Gupta, Shahbaz Khan
Simple dynamic algorithms for Maximal Independent Set and other problems. CoRR (2018)
Manoj Gupta, Aditi Singh
Generic Single Edge Fault Tolerant Exact Distance Oracle. ICALP (2018)
Manoj Gupta, Aditi Singh
Generic Single Edge Fault Tolerant Exact Distance Oracle. CoRR (2018)
Manoj Gupta, Shahbaz Khan
Multiple Source Dual Fault Tolerant BFS Trees. ICALP (2017)
Manoj Gupta, Shahbaz Khan
Multiple Source Dual Fault Tolerant BFS Trees. CoRR (2017)
Manoj Gupta, Yogish Sabharwal, Sandeep Sen
The Update Complexity of Selection and Related Problems. Theory Comput. Syst. 59 (1) (2016)
Navin Goyal, Manoj Gupta
Better Analysis of GREEDY Binary Search Tree on Decomposable Sequences. CoRR (2016)
Surender Baswana, Manoj Gupta, Sandeep Sen
Fully Dynamic Maximal Matching in O(log n) Update Time. SIAM J. Comput. 44 (1) (2015)
Marc Goerigk, Manoj Gupta, Jonas Ide, Anita Schöbel, Sandeep Sen
The robust knapsack problem with queries. Comput. Oper. Res. 55 (2015)
Manoj Gupta
Maintaining Approximate Maximum Matching in an Incremental Bipartite Graph in Polylogarithmic Update Time. FSTTCS (2014)
Manoj Gupta, Richard Peng
Fully Dynamic $(1+ε)$-Approximate Matchings CoRR (2013)
Manoj Gupta, Richard Peng
Fully Dynamic (1+ e)-Approximate Matchings. FOCS (2013)
Abhash Anand, Surender Baswana, Manoj Gupta, Sandeep Sen
Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs. FSTTCS (2012)
Abhash Anand, Surender Baswana, Manoj Gupta, Sandeep Sen
Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs CoRR (2012)
Navin Goyal, Manoj Gupta
On Dynamic Optimality for Binary Search Trees CoRR (2011)
Surender Baswana, Manoj Gupta, Sandeep Sen
Fully Dynamic Maximal Matching in O (log n) Update Time. FOCS (2011)
Manoj Gupta, Yogish Sabharwal, Sandeep Sen
The update complexity of selection and related problems. FSTTCS (2011)
Surender Baswana, Manoj Gupta, Sandeep Sen
Fully dynamic maximal matching in O(log n) update time CoRR (2011)
Manoj Gupta, Yogish Sabharwal, Sandeep Sen
The update complexity of selection and related problems CoRR (2011)
Manoj Gupta, Ankit Sharma
An O(log(n)) Fully Dynamic Algorithm for Maximum matching in a tree CoRR (2009)
M. Y. Pan, Manoj Gupta, A. A. O. Tay, K. Vaidyanathan
Development of bulk nanostructured copper with superior hardness for use as an interconnect material in electronic packaging. Microelectron. Reliab. 46 (5-6) (2006)