default search action
S. N. Maheshwari
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [c17]Ishant Shanu, Siddhant Bharti
, Chetan Arora, S. N. Maheshwari:
An Inference Algorithm for Multi-label MRF-MAP Problems with Clique Size 100. ECCV (20) 2020: 257-274
2010 – 2019
- 2018
- [c16]Ishant Shanu, Chetan Arora, S. N. Maheshwari:
Inference in Higher Order MRF-MAP Problems With Small and Large Cliques. CVPR 2018: 7883-7891 - 2015
- [j14]Chetan Arora, Subhashis Banerjee, Prem Kumar Kalra, S. N. Maheshwari:
Generalized Flows for Optimal Inference in Higher Order MRF-MAP. IEEE Trans. Pattern Anal. Mach. Intell. 37(7): 1323-1335 (2015) - 2014
- [c15]Chetan Arora, Subhashis Banerjee, Prem Kumar Kalra, S. N. Maheshwari:
Fast Approximate Inference in Higher Order MRF-MAP Labeling Problems. CVPR 2014: 1338-1345 - [c14]Chetan Arora, S. N. Maheshwari:
Multi-label Generic Cuts: Optimal Inference in Multi-label Multi-clique MRF-MAP Problems. CVPR 2014: 1346-1353 - 2012
- [c13]Chetan Arora, Subhashis Banerjee, Prem Kalra, S. N. Maheshwari:
Generic Cuts: An Efficient Algorithm for Optimal Inference in Higher Order MRF-MAP. ECCV (5) 2012: 17-30 - 2010
- [c12]Chetan Arora, Subhashis Banerjee, Prem Kalra, S. N. Maheshwari:
An Efficient Graph Cut Algorithm for Computer Vision Problems. ECCV (3) 2010: 552-565 - [i1]Rajasekhar Inkulu, Sanjiv Kapoor, S. N. Maheshwari:
A near optimal algorithm for finding Euclidean shortest path in polygonal domain. CoRR abs/1011.6481 (2010)
2000 – 2009
- 2005
- [c11]Rahul Agarwal, Mahender Bisht, S. N. Maheshwari, Sanjiva Prasad:
Divide and Concur: Employing Chandra and Toueg's Consensus Algorithm in a Multi-level Setting. ICDCIT 2005: 172-183 - 2004
- [r1]S. N. Maheshwari:
The Web as a Dynamic Graph. Handbook of Data Structures and Applications 2004 - 2003
- [j13]Sanjay Kumar Madria, S. N. Maheshwari, B. Chandra:
A Concurrency Control Algorithm for an Open and Safe Nested. J. Inf. Sci. Eng. 19(2): 283-328 (2003) - 2001
- [j12]Sanjay Kumar Madria, S. N. Maheshwari, B. Chandra:
Formalization and correctness of a concurrent linear hash structure algorithm using nested transactions and I/O automata. Data Knowl. Eng. 37(2): 139-176 (2001) - [j11]Sanjay Kumar Madria, S. N. Maheshwari, B. Chandra, Bharat K. Bhargava:
Formalization and Proof of Correctness of the Crash Recovery Algorithm for an Open and Safe Nested Transaction Model. Int. J. Cooperative Inf. Syst. 10(1-2): 1-50 (2001) - [j10]Sanjay Kumar Madria, S. N. Maheshwari, B. Chandra:
Virtual partition algorithm in a nested transaction environment and its correctness. Inf. Sci. 137(1-4): 211-244 (2001) - 2000
- [j9]Sanjay Kumar Madria, S. N. Maheshwari, B. Chandra, Bharat K. Bhargava:
An open and safe nested transaction model: concurrency and recovery. J. Syst. Softw. 55(2): 151-165 (2000) - [j8]Sanjiv Kapoor, S. N. Maheshwari:
Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles. SIAM J. Comput. 30(3): 847-871 (2000)
1990 – 1999
- 1999
- [c10]Sanjay Kumar Madria, S. N. Maheshwari, B. Chandra:
On the Correctnes of Virtual Partition Algorithm in a Nested Transaction Environment. ADBIS 1999: 98-112 - 1998
- [c9]Sanjay Kumar Madria, S. N. Maheshwari, B. Chandra:
Formalization of Linear Hash Structures Using Nested Transactions and I/O Automation Model. IADT 1998: 521-530 - 1997
- [j7]Sanjiv Kapoor, S. N. Maheshwari, Joseph S. B. Mitchell:
An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane. Discret. Comput. Geom. 18(4): 377-383 (1997) - [c8]Sanjay Kumar Madria, S. N. Maheshwari, B. Chandra, Bharat K. Bhargava:
Crash Recovery in an Open and Safe Nested Transaction Model. DEXA 1997: 440-451 - 1990
- [c7]Pratul Dublish, S. N. Maheshwari:
Query Languages which Express all PTIME Queries for Trees and Unicyclic Graphs. MFCS 1990: 246-253
1980 – 1989
- 1989
- [j6]Joseph Cheriyan, S. N. Maheshwari:
The Parallel Complexity of Finding a Blocking Flow in a 3-Layer Network. Inf. Process. Lett. 31(3): 157-161 (1989) - [j5]Joseph Cheriyan, S. N. Maheshwari:
Analysis of Preflow Push Algorithms for Maximum Network Flow. SIAM J. Comput. 18(6): 1057-1086 (1989) - [c6]Pratul Dublish, S. N. Maheshwari:
Expressibility of Bounded-Arity Fixed-Point Query Hierarchies. PODS 1989: 324-335 - 1988
- [j4]Joseph Cheriyan, S. N. Maheshwari:
Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected Graphs. J. Algorithms 9(4): 507-537 (1988) - [c5]Sanjiv Kapoor, S. N. Maheshwari:
Efficient Algorithms for Euclidean Shortest Path and Visibility Problems with Polygonal Obstacles. SCG 1988: 172-182 - [c4]Joseph Cheriyan, S. N. Maheshwari:
Analysis of Preflow Push Algorithms for Maximum Network Flow. FSTTCS 1988: 30-48 - [c3]Pratul Dublish, S. N. Maheshwari:
On O(N²) Equivalence Algorithm for Fan-Out Free Queries. ICDT 1988: 176-190 - 1987
- [c2]Pratul Dublish, S. N. Maheshwari:
An O(n²) Algorithm for Fan-Out Free Query Optimization. FSTTCS 1987: 242-264 - 1985
- [e1]S. N. Maheshwari:
Foundations of Software Technology and Theoretical Computer Science, Fifth Conference, New Delhi, India, December 16-18, 1985, Proceedings. Lecture Notes in Computer Science 206, Springer 1985, ISBN 3-540-16042-6 [contents] - 1983
- [j3]Dhruva Nath, S. N. Maheshwari, P. C. P. Bhatt:
Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees. IEEE Trans. Computers 32(6): 569-581 (1983) - 1982
- [j2]Dhruva Nath, S. N. Maheshwari:
Parallel Algorithms for the Connected Components and Minimal Spanning Tree Problems. Inf. Process. Lett. 14(1): 7-11 (1982) - 1981
- [c1]Dhruva Nath, S. N. Maheshwari, P. C. P. Bhatt:
Parallel algorithms for the convex hull problem in two dimensions. CONPAR 1981: 358-372
1970 – 1979
- 1978
- [j1]Vishv M. Malhotra
An O(|V|³) Algorithm for Finding Maximum Flows in Networks. Inf. Process. Lett. 7(6): 277-278 (1978)
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-04-25 05:55 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: