default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDManoj Gupta 0002
Person information
- affiliation: Indian Institute of Technology Gandhinagar, India
- affiliation: Microsoft Research, India
- affiliation: Indian Institute of Technology Delhi, India
- affiliation: Indian Institute of Technology Kanpur, India
Other persons with the same name
- Manoj Gupta — disambiguation page
- Manoj Gupta 0001 — Universitat Politecnica de Catalunya, Barcelona, Spain
- Manoj Gupta 0003 — University of California, San Diego, Department of Electrical and Computer Engineering, La Jolla, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c19]Dipan Dey, Manoj Gupta:
Near Optimal Dual Fault Tolerant Distance Oracle. ESA 2024: 45:1-45:23- [c18]Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Akash Pareek, Sorrachai Yingchareonthawornchai:
The Group Access Bounds for Binary Search Trees. ICALP 2024: 38:1-38:18 - [c17]Dipan Dey
, Manoj Gupta:
Nearly Optimal Fault Tolerant Distance Oracle. STOC 2024: 944-955 - [i17]Dipan Dey, Manoj Gupta:
Nearly Optimal Fault Tolerant Distance Oracle. CoRR abs/2402.12832 (2024) - [i16]Dipan Dey, Manoj Gupta:
Near Optimal Dual Fault Tolerant Distance Oracle. CoRR abs/2406.19709 (2024) - 2023
- [c16]Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Nidia Obscura Acosta, Akash Pareek, Sorrachai Yingchareonthawornchai:
Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition. SODA 2023: 509-534 - [i15]Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Akash Pareek, Sorrachai Yingchareonthawornchai:
The Group Access Bounds for Binary Search Trees. CoRR abs/2312.15426 (2023) - 2022
- [c15]Niranka Banerjee, Manoj Gupta, Venkatesh Raman, Saket Saurabh:
Output Sensitive Fault Tolerant Maximum Matching. CSR 2022: 115-132 - [c14]Dipan Dey, Manoj Gupta:
Near Optimal Algorithm for Fault Tolerant Distance Oracle and Single Source Replacement Path Problem. ESA 2022: 42:1-42:18 - [i14]Dipan Dey, Manoj Gupta:
Near Optimal Algorithm for Fault Tolerant Distance Oracle and Single Source Replacement Path problem. CoRR abs/2206.15016 (2022) - [i13]Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Nidia Obscura Acosta, Akash Pareek, Sorrachai Yingchareonthawornchai:
Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition. CoRR abs/2211.04112 (2022) - 2021
- [c13]Manoj Gupta, Shahbaz Khan:
Simple dynamic algorithms for Maximal Independent Set, Maximum Flow and Maximum Matching. SOSA 2021: 86-91 - 2020
- [c12]Manoj Gupta, Rahul Jain, Nitiksha Modi:
Multiple Source Replacement Path Problem. PODC 2020: 339-348 - [i12]Manoj Gupta, Rahul Jain, Nitiksha Modi:
Multiple Source Replacement Path Problem. CoRR abs/2005.09262 (2020)
2010 – 2019
- 2019
- [j6]Navin Goyal, Manoj Gupta:
Better analysis of greedy binary search tree on decomposable sequences. Theor. Comput. Sci. 776: 19-42 (2019) - [c11]Manoj Gupta, Hitesh Kumar, Neeldhara Misra:
On the Complexity of Optimal Matching Reconfiguration. SOFSEM 2019: 221-233 - 2018
- [j5]Surender Baswana, Manoj Gupta, Sandeep Sen:
Fully Dynamic Maximal Matching in O(log n) Update Time (Corrected Version). SIAM J. Comput. 47(3): 617-650 (2018) - [c10]Manoj Gupta, Aditi Singh:
Generic Single Edge Fault Tolerant Exact Distance Oracle. ICALP 2018: 72:1-72:15 - [i11]Manoj Gupta, Shahbaz Khan:
Simple dynamic algorithms for Maximal Independent Set and other problems. CoRR abs/1804.01823 (2018) - [i10]Manoj Gupta, Aditi Singh:
Generic Single Edge Fault Tolerant Exact Distance Oracle. CoRR abs/1805.00190 (2018) - [i9]Jayesh Choudhari, Manoj Gupta, Shivdutt Sharma:
Nearly Optimal Space Efficient Algorithm for Depth First Search. CoRR abs/1810.07259 (2018) - 2017
- [c9]Sayan Bhattacharya, Manoj Gupta, Divyarthi Mohan:
Improved Algorithm for Dynamic b-Matching. ESA 2017: 15:1-15:13 - [c8]Manoj Gupta, Shahbaz Khan:
Multiple Source Dual Fault Tolerant BFS Trees. ICALP 2017: 127:1-127:15 - [i8]Manoj Gupta, Shahbaz Khan:
Multiple Source Dual Fault Tolerant BFS Trees. CoRR abs/1704.06907 (2017) - 2016
- [j4]Manoj Gupta, Yogish Sabharwal, Sandeep Sen:
The Update Complexity of Selection and Related Problems. Theory Comput. Syst. 59(1): 112-132 (2016) - [c7]Joydeep Banerjee, Gurulingesh Raravi, Manoj Gupta, Sindhu Kiranmai Ernala, Shruti Kunde, Koustuv Dasgupta:
CAPReS: Context Aware Persona Based Recommendation for Shoppers. AAAI 2016: 680-686 - [c6]Manoj Gupta, R. P. Jagadeesh Chandra Bose, Partha Dutta:
Cell Design and Routing of Jobs in a Multisite Make-to-Order Enterprise. ICAPS 2016: 394-402 - [r1]Surender Baswana, Manoj Gupta, Sandeep Sen:
Matching in Dynamic Graphs. Encyclopedia of Algorithms 2016: 1195-1199 - [i7]Navin Goyal, Manoj Gupta:
Better Analysis of GREEDY Binary Search Tree on Decomposable Sequences. CoRR abs/1604.06997 (2016) - 2015
- [j3]Marc Goerigk, Manoj Gupta, Jonas Ide, Anita Schöbel, Sandeep Sen:
The robust knapsack problem with queries. Comput. Oper. Res. 55: 12-22 (2015) - [j2]Surender Baswana, Manoj Gupta, Sandeep Sen:
Fully Dynamic Maximal Matching in O(log n) Update Time. SIAM J. Comput. 44(1): 88-113 (2015) - 2014
- [c5]Manoj Gupta:
Maintaining Approximate Maximum Matching in an Incremental Bipartite Graph in Polylogarithmic Update Time. FSTTCS 2014: 227-239 - 2013
- [c4]Manoj Gupta, Richard Peng:
Fully Dynamic (1+ e)-Approximate Matchings. FOCS 2013: 548-557 - [i6]Manoj Gupta, Richard Peng:
Fully Dynamic $(1+ε)$-Approximate Matchings. CoRR abs/1304.0378 (2013) - 2012
- [c3]Abhash Anand, Surender Baswana, Manoj Gupta, Sandeep Sen:
Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs. FSTTCS 2012: 257-266 - [i5]Abhash Anand, Surender Baswana, Manoj Gupta, Sandeep Sen:
Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs. CoRR abs/1207.3976 (2012) - 2011
- [c2]Surender Baswana, Manoj Gupta, Sandeep Sen:
Fully Dynamic Maximal Matching in O (log n) Update Time. FOCS 2011: 383-392 - [c1]Manoj Gupta, Yogish Sabharwal, Sandeep Sen:
The update complexity of selection and related problems. FSTTCS 2011: 325-338 - [i4]Navin Goyal, Manoj Gupta:
On Dynamic Optimality for Binary Search Trees. CoRR abs/1102.4523 (2011) - [i3]Surender Baswana, Manoj Gupta, Sandeep Sen:
Fully dynamic maximal matching in O(log n) update time. CoRR abs/1103.1109 (2011) - [i2]Manoj Gupta, Yogish Sabharwal, Sandeep Sen:
The update complexity of selection and related problems. CoRR abs/1108.5525 (2011)
2000 – 2009
- 2009
- [i1]Manoj Gupta, Ankit Sharma:
An O(log(n)) Fully Dynamic Algorithm for Maximum matching in a tree. CoRR abs/0901.2900 (2009) - 2006
- [j1]M. Y. Pan, Manoj Gupta, Andrew A. O. Tay, Kripesh Vaidyanathan:
Development of bulk nanostructured copper with superior hardness for use as an interconnect material in electronic packaging. Microelectron. Reliab. 46(5-6): 763-767 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
