Manoj Gupta

According to our database, Manoj Gupta authored at least 29 papers between 2006 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Nearly Optimal Fault Tolerant Distance Oracle.

Dipan Dey, Manoj Gupta

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

The Group Access Bounds for Binary Search Trees.

Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Akash Pareek, Sorrachai Yingchareonthawornchai

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Near Optimal Dual Fault Tolerant Distance Oracle.

Dipan Dey, Manoj Gupta

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023

Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition.

Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Nidia Obscura Acosta, Akash Pareek, Sorrachai Yingchareonthawornchai

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Near Optimal Algorithm for Fault Tolerant Distance Oracle and Single Source Replacement Path Problem.

Dipan Dey, Manoj Gupta

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Output Sensitive Fault Tolerant Maximum Matching.

Niranka Banerjee, Manoj Gupta, Venkatesh Raman, Saket Saurabh

Proceedings of the Computer Science - Theory and Applications, 2022

2021

Simple dynamic algorithms for Maximal Independent Set, Maximum Flow and Maximum Matching.

Manoj Gupta, Shahbaz Khan

Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

2020

Multiple Source Replacement Path Problem.

Manoj Gupta, Rahul Jain, Nitiksha Modi

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

2019

Better analysis of greedy binary search tree on decomposable sequences.

Navin Goyal, Manoj Gupta

Theor. Comput. Sci., 2019

On the Complexity of Optimal Matching Reconfiguration.

Manoj Gupta, Hitesh Kumar, Neeldhara Misra

Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

2018

Fully Dynamic Maximal Matching in O(log n) Update Time (Corrected Version).

Surender Baswana, Manoj Gupta, Sandeep Sen

SIAM J. Comput., 2018

Nearly Optimal Space Efficient Algorithm for Depth First Search.

Jayesh Choudhari, Manoj Gupta, Shivdutt Sharma

CoRR, 2018

Simple dynamic algorithms for Maximal Independent Set and other problems.

Manoj Gupta, Shahbaz Khan

CoRR, 2018

Generic Single Edge Fault Tolerant Exact Distance Oracle.

Manoj Gupta, Aditi Singh

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Multiple Source Dual Fault Tolerant BFS Trees.

Manoj Gupta, Shahbaz Khan

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Improved Algorithm for Dynamic b-Matching.

Sayan Bhattacharya, Manoj Gupta, Divyarthi Mohan

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016

Matching in Dynamic Graphs.

Surender Baswana, Manoj Gupta, Sandeep Sen

Encyclopedia of Algorithms, 2016

Cell Design and Routing of Jobs in a Multisite Make-to-Order Enterprise.

Manoj Gupta, R. P. Jagadeesh Chandra Bose, Partha Dutta

Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, 2016

CAPReS: Context Aware Persona Based Recommendation for Shoppers.

Joydeep Banerjee, Gurulingesh Raravi, Manoj Gupta, Sindhu Kiranmai Ernala, Shruti Kunde, Koustuv Dasgupta

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015

The robust knapsack problem with queries.

Marc Goerigk, Manoj Gupta, Jonas Ide, Anita Schöbel, Sandeep Sen

Comput. Oper. Res., 2015

2014

Maintaining Approximate Maximum Matching in an Incremental Bipartite Graph in Polylogarithmic Update Time.

Manoj Gupta

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2013

Fully Dynamic $(1+ε)$-Approximate Matchings

Manoj Gupta, Richard Peng

CoRR, 2013

Fully Dynamic (1+ e)-Approximate Matchings.

Manoj Gupta, Richard Peng

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012

Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs.

Abhash Anand, Surender Baswana, Manoj Gupta, Sandeep Sen

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2011

On Dynamic Optimality for Binary Search Trees

Navin Goyal, Manoj Gupta

CoRR, 2011

The update complexity of selection and related problems.

Manoj Gupta, Yogish Sabharwal, Sandeep Sen

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Fully Dynamic Maximal Matching in O (log n) Update Time.

Surender Baswana, Manoj Gupta, Sandeep Sen

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2009

An O(log(n)) Fully Dynamic Algorithm for Maximum matching in a tree

Manoj Gupta, Ankit Sharma

CoRR, 2009

2006

Development of bulk nanostructured copper with superior hardness for use as an interconnect material in electronic packaging.

M. Y. Pan, Manoj Gupta, Andrew A. O. Tay, Kripesh Vaidyanathan

Microelectron. Reliab., 2006