Manoj Gupta

Orcid: 0000-0002-2248-8700

Affiliations:
  • Indian Institute of Technology Gandhinagar, India
  • Microsoft Research, India
  • Indian Institute of Technology Delhi, India
  • Indian Institute of Technology Kanpur, India


According to our database1, Manoj Gupta authored at least 28 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Nearly Optimal Fault Tolerant Distance Oracle.
CoRR, 2024

2023
The Group Access Bounds for Binary Search Trees.
CoRR, 2023

Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition.
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.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Output Sensitive Fault Tolerant Maximum Matching.
Proceedings of the Computer Science - Theory and Applications, 2022

2021
Simple dynamic algorithms for Maximal Independent Set, Maximum Flow and Maximum Matching.
Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

2020
Multiple Source Replacement Path Problem.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

2019
Better analysis of greedy binary search tree on decomposable sequences.
Theor. Comput. Sci., 2019

On the Complexity of Optimal Matching Reconfiguration.
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).
SIAM J. Comput., 2018

Nearly Optimal Space Efficient Algorithm for Depth First Search.
CoRR, 2018

Simple dynamic algorithms for Maximal Independent Set and other problems.
CoRR, 2018

Generic Single Edge Fault Tolerant Exact Distance Oracle.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Multiple Source Dual Fault Tolerant BFS Trees.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Improved Algorithm for Dynamic b-Matching.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016
Matching in Dynamic Graphs.
Encyclopedia of Algorithms, 2016

The Update Complexity of Selection and Related Problems.
Theory Comput. Syst., 2016

Cell Design and Routing of Jobs in a Multisite Make-to-Order Enterprise.
Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, 2016

CAPReS: Context Aware Persona Based Recommendation for Shoppers.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Fully Dynamic Maximal Matching in O(log n) Update Time.
SIAM J. Comput., 2015

The robust knapsack problem with queries.
Comput. Oper. Res., 2015

2014
Maintaining Approximate Maximum Matching in an Incremental Bipartite Graph in Polylogarithmic Update Time.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2013
Fully Dynamic $(1+ε)$-Approximate Matchings
CoRR, 2013

Fully Dynamic (1+ e)-Approximate Matchings.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012
Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2011
On Dynamic Optimality for Binary Search Trees
CoRR, 2011

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

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


  Loading...