Manoj Gupta

According to our database1, Manoj Gupta authored at least 12 papers between 2009 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

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

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

2016
Matching in Dynamic Graphs.
Encyclopedia of Algorithms, 2016

The Update Complexity of Selection and Related Problems.
Theory Comput. Syst., 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


  Loading...