| 2005 |
|---|
| 27 | EE | 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 |
| 2003 |
|---|
| 26 | EE | 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 |
|---|
| 25 | EE | 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) |
| 24 | | 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) |
| 23 | EE | 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) |
| 2000 |
|---|
| 22 | EE | 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) |
| 21 | EE | Sanjiv Kapoor,
S. N. Maheshwari:
Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles.
SIAM J. Comput. 30(3): 847-871 (2000) |
| 1999 |
|---|
| 20 | EE | 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 |
|---|
| 19 | | 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 |
|---|
| 18 | | 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 |
| 17 | EE | 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) |
| 1990 |
|---|
| 16 | | Pratul Dublish,
S. N. Maheshwari:
Query Languages which Express all PTIME Queries for Trees and Unicyclic Graphs.
MFCS 1990: 246-253 |
| 1989 |
|---|
| 15 | EE | Pratul Dublish,
S. N. Maheshwari:
Expressibility of Bounded-Arity Fixed-Point Query Hierarchies.
PODS 1989: 324-335 |
| 14 | | 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) |
| 13 | EE | Joseph Cheriyan,
S. N. Maheshwari:
The parallel complexity of finding a blocking flow in a 3-layer network.
Inf. Process. Lett. 32(3): 157-161 (1989) |
| 12 | | Joseph Cheriyan,
S. N. Maheshwari:
Analysis of Preflow Push Algorithms for Maximum Network Flow.
SIAM J. Comput. 18(6): 1057-1086 (1989) |
| 1988 |
|---|
| 11 | | Joseph Cheriyan,
S. N. Maheshwari:
Analysis of Preflow Push Algorithms for Maximum Network Flow.
FSTTCS 1988: 30-48 |
| 10 | EE | Pratul Dublish,
S. N. Maheshwari:
On O(N²) Equivalence Algorithm for Fan-Out Free Queries.
ICDT 1988: 176-190 |
| 9 | EE | Sanjiv Kapoor,
S. N. Maheshwari:
Efficient Algorithms for Euclidean Shortest Path and Visibility Problems with Polygonal Obstacles.
Symposium on Computational Geometry 1988: 172-182 |
| 8 | | Joseph Cheriyan,
S. N. Maheshwari:
Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected Graphs.
J. Algorithms 9(4): 507-537 (1988) |
| 1987 |
|---|
| 7 | | Pratul Dublish,
S. N. Maheshwari:
An O(n²) Algorithm for Fan-Out Free Query Optimization.
FSTTCS 1987: 242-264 |
| 1985 |
|---|
| 6 | | S. N. Maheshwari:
Foundations of Software Technology and Theoretical Computer Science, Fifth Conference, New Delhi, India, December 16-18, 1985, Proceedings
Springer 1985 |
| 1983 |
|---|
| 5 | | 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 |
|---|
| 4 | | 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 |
|---|
| 3 | | Dhruva Nath,
S. N. Maheshwari,
P. C. P. Bhatt:
Parallel algorithms for the convex hull problem in two dimensions.
CONPAR 1981: 358-372 |
| 1978 |
|---|
| 2 | | 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) |
| 1 | | 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) |
