According to our database1, Manoj Gupta authored at least 12 papers between 2009 and 2019.
Legend:Book In proceedings Article PhD thesis Other
Better analysis of greedy binary search tree on decomposable sequences.
Theor. Comput. Sci., 2019
Fully Dynamic Maximal Matching in O(log n) Update Time (Corrected Version).
SIAM J. Comput., 2018
Matching in Dynamic Graphs.
Encyclopedia of Algorithms, 2016
The Update Complexity of Selection and Related Problems.
Theory Comput. Syst., 2016
Fully Dynamic Maximal Matching in O(log n) Update Time.
SIAM J. Comput., 2015
The robust knapsack problem with queries.
Comput. Oper. Res., 2015
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
Fully Dynamic $(1+ε)$-Approximate Matchings
Fully Dynamic (1+ e)-Approximate Matchings.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013
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
On Dynamic Optimality for Binary Search Trees
An O(log(n)) Fully Dynamic Algorithm for Maximum matching in a tree