S. N. Maheshwari

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

Chetan Arora, Subhashis Banerjee, Prem Kalra, S. N. Maheshwari: An Efficient Graph Cut Algorithm for Computer Vision Problems. ECCV (3) 2010: 552-565

Rajasekhar Inkulu, Sanjiv Kapoor, S. N. Maheshwari: A near optimal algorithm for finding Euclidean shortest path in polygonal domain. CoRR abs/1011.6481 (2010)

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

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)

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)

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)

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)

Sanjay Kumar Madria, S. N. Maheshwari, B. Chandra, Bharat K. Bhargava: An open and safe nested transaction model: concurrency and recovery. Journal of Systems and Software 55(2): 151-165 (2000)

Sanjiv Kapoor, S. N. Maheshwari: Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles. SIAM J. Comput. 30(3): 847-871 (2000)

Sanjay Kumar Madria, S. N. Maheshwari, B. Chandra: On the Correctnes of Virtual Partition Algorithm in a Nested Transaction Environment. ADBIS 1999: 98-112

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

Sanjiv Kapoor, S. N. Maheshwari, Joseph S. B. Mitchell: An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane. Discrete & Computational Geometry 18(4): 377-383 (1997)

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

Pratul Dublish, S. N. Maheshwari: Query Languages which Express all PTIME Queries for Trees and Unicyclic Graphs. MFCS 1990: 246-253

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)

Joseph Cheriyan, S. N. Maheshwari: Analysis of Preflow Push Algorithms for Maximum Network Flow. SIAM J. Comput. 18(6): 1057-1086 (1989)

Pratul Dublish, S. N. Maheshwari: Expressibility of Bounded-Arity Fixed-Point Query Hierarchies. PODS 1989: 324-335

Joseph Cheriyan, S. N. Maheshwari: Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected Graphs. J. Algorithms 9(4): 507-537 (1988)

Sanjiv Kapoor, S. N. Maheshwari: Efficient Algorithms for Euclidean Shortest Path and Visibility Problems with Polygonal Obstacles. Symposium on Computational Geometry 1988: 172-182

Joseph Cheriyan, S. N. Maheshwari: Analysis of Preflow Push Algorithms for Maximum Network Flow. FSTTCS 1988: 30-48

Pratul Dublish, S. N. Maheshwari: On O(N²) Equivalence Algorithm for Fan-Out Free Queries. ICDT 1988: 176-190

Pratul Dublish, S. N. Maheshwari: An O(n²) Algorithm for Fan-Out Free Query Optimization. FSTTCS 1987: 242-264

S. N. Maheshwari (Ed.): 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

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)

Dhruva Nath, S. N. Maheshwari: Parallel Algorithms for the Connected Components and Minimal Spanning Tree Problems. Inf. Process. Lett. 14(1): 7-11 (1982)

Dhruva Nath, S. N. Maheshwari, P. C. P. Bhatt: Parallel algorithms for the convex hull problem in two dimensions. CONPAR 1981: 358-372

Vishv M. Malhotra, M. Pramodh Kumar, S. N. Maheshwari: An O(|V|³) Algorithm for Finding Maximum Flows in Networks. Inf. Process. Lett. 7(6): 277-278 (1978)

S. N. Maheshwari, S. Louis Hakimi: Corrections and Comments on ``On Models for Diagnosable Systems and Probabilistic Fault Diagnosis''. IEEE Trans. Computers 27(3): 287 (1978)