Search the dblp DataBase
S. N. Maheshwari: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Pratul Dublish, S. N. Maheshwari
An O(n²) Algorithm for Fan-Out Free Query Optimization. [Citation Graph (2, 0)][DBLP]
FSTTCS, 1987, pp:242-264 [Conf] - Pratul Dublish, S. N. Maheshwari
Expressibility of Bounded-Arity Fixed-Point Query Hierarchies. [Citation Graph (2, 5)][DBLP]
PODS, 1989, pp:324-335 [Conf] - Vishv M. Malhotra, M. Pramodh Kumar, S. N. Maheshwari
An O(|V|³) Algorithm for Finding Maximum Flows in Networks. [Citation Graph (2, 0)][DBLP]
Inf. Process. Lett., 1978, v:7, n:6, pp:277-278 [Journal] - Sanjay Kumar Madria, S. N. Maheshwari, B. Chandra, Bharat K. Bhargava
Crash Recovery in an Open and Safe Nested Transaction Model. [Citation Graph (1, 0)][DBLP]
DEXA, 1997, pp:440-451 [Conf] - Sanjay Kumar Madria, S. N. Maheshwari, B. Chandra
On the Correctnes of Virtual Partition Algorithm in a Nested Transaction Environment. [Citation Graph (0, 10)][DBLP]
ADBIS, 1999, pp:98-112 [Conf] - Sanjiv Kapoor, S. N. Maheshwari
Efficient Algorithms for Euclidean Shortest Path and Visibility Problems with Polygonal Obstacles. [Citation Graph (0, 0)][DBLP]
Symposium on Computational Geometry, 1988, pp:172-182 [Conf] - Dhruva Nath, S. N. Maheshwari, P. C. P. Bhatt
Parallel algorithms for the convex hull problem in two dimensions. [Citation Graph (0, 0)][DBLP]
CONPAR, 1981, pp:358-372 [Conf] - Joseph Cheriyan, S. N. Maheshwari
Analysis of Preflow Push Algorithms for Maximum Network Flow. [Citation Graph (0, 0)][DBLP]
FSTTCS, 1988, pp:30-48 [Conf] - Sanjay Kumar Madria, S. N. Maheshwari, B. Chandra
Formalization of Linear Hash Structures Using Nested Transactions and I/O Automation Model. [Citation Graph (0, 0)][DBLP]
IADT, 1998, pp:521-530 [Conf] - Rahul Agarwal, Mahender Bisht, S. N. Maheshwari, Sanjiva Prasad
Divide and Concur: Employing Chandra and Toueg's Consensus Algorithm in a Multi-level Setting. [Citation Graph (0, 0)][DBLP]
ICDCIT, 2005, pp:172-183 [Conf] - Pratul Dublish, S. N. Maheshwari
On O(N²) Equivalence Algorithm for Fan-Out Free Queries. [Citation Graph (0, 7)][DBLP]
ICDT, 1988, pp:176-190 [Conf] - Pratul Dublish, S. N. Maheshwari
Query Languages which Express all PTIME Queries for Trees and Unicyclic Graphs. [Citation Graph (0, 0)][DBLP]
MFCS, 1990, pp:246-253 [Conf] - Sanjiv Kapoor, S. N. Maheshwari, Joseph S. B. Mitchell
An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane. [Citation Graph (0, 0)][DBLP]
Discrete & Computational Geometry, 1997, v:18, n:4, pp:377-383 [Journal] - 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. [Citation Graph (0, 0)][DBLP]
Data Knowl. Eng., 2001, v:37, n:2, pp:139-176 [Journal] - 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. [Citation Graph (0, 0)][DBLP]
Int. J. Cooperative Inf. Syst., 2001, v:10, n:1-2, pp:1-50 [Journal] - Joseph Cheriyan, S. N. Maheshwari
The Parallel Complexity of Finding a Blocking Flow in a 3-Layer Network. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1989, v:31, n:3, pp:157-161 [Journal] - Joseph Cheriyan, S. N. Maheshwari
The parallel complexity of finding a blocking flow in a 3-layer network. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1989, v:32, n:3, pp:157-161 [Journal] - Dhruva Nath, S. N. Maheshwari
Parallel Algorithms for the Connected Components and Minimal Spanning Tree Problems. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1982, v:14, n:1, pp:7-11 [Journal] - Sanjay Kumar Madria, S. N. Maheshwari, B. Chandra
Virtual partition algorithm in a nested transaction environment and its correctness. [Citation Graph (0, 0)][DBLP]
Inf. Sci., 2001, v:137, n:1-4, pp:211-244 [Journal] - Joseph Cheriyan, S. N. Maheshwari
Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected Graphs. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1988, v:9, n:4, pp:507-537 [Journal] - Sanjay Kumar Madria, S. N. Maheshwari, B. Chandra
A Concurrency Control Algorithm for an Open and Safe Nested. [Citation Graph (0, 0)][DBLP]
J. Inf. Sci. Eng., 2003, v:19, n:2, pp:283-328 [Journal] - Sanjay Kumar Madria, S. N. Maheshwari, B. Chandra, Bharat K. Bhargava
An open and safe nested transaction model: concurrency and recovery. [Citation Graph (0, 0)][DBLP]
Journal of Systems and Software, 2000, v:55, n:2, pp:151-165 [Journal] - Joseph Cheriyan, S. N. Maheshwari
Analysis of Preflow Push Algorithms for Maximum Network Flow. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1989, v:18, n:6, pp:1057-1086 [Journal] - Sanjiv Kapoor, S. N. Maheshwari
Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 2000, v:30, n:3, pp:847-871 [Journal] - S. N. Maheshwari, S. Louis Hakimi
Corrections and Comments on ``On Models for Diagnosable Systems and Probabilistic Fault Diagnosis''. [Citation Graph (0, 0)][DBLP]
IEEE Trans. Computers, 1978, v:27, n:3, pp:287- [Journal] - Dhruva Nath, S. N. Maheshwari, P. C. P. Bhatt
Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees. [Citation Graph (0, 0)][DBLP]
IEEE Trans. Computers, 1983, v:32, n:6, pp:569-581 [Journal]
An Efficient Graph Cut Algorithm for Computer Vision Problems. [Citation Graph (, )][DBLP]
Search in 0.006secs, Finished in 0.008secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002