| 2008 |
|---|
| 12 | EE | Nitin Chanderwal,
Ashok Subramanian:
Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties.
J. Discrete Algorithms 6(3): 353-380 (2008) |
| 2006 |
|---|
| 11 | | Ashok Subramanian,
Nitin Chanderwal:
On Reliability Analysis of Cost-Effective Hybrid Zeta Network: A Fault-Tolerant Multi-Stage Interconnection Network.
PDPTA 2006: 260-265 |
| 2001 |
|---|
| 10 | EE | L. Douglas Smith,
Ashok Subramanian,
Robert M. Nauss,
Ronald Beck:
Developing Outsourcing Strategies for MIS: A Mathematical Programming Approach.
HICSS 2001 |
| 1996 |
|---|
| 9 | EE | Ashok Subramanian,
L. Douglas Smith,
Anthony C. Nelson,
James F. Campbell,
David A. Bird:
Strategic Planning for Data Warehousing in the Public Sector.
HICSS (4) 1996: 54-61 |
| 8 | | Ashok Subramanian:
An Explanation of Splaying.
J. Algorithms 20(3): 512-525 (1996) |
| 1995 |
|---|
| 7 | | Ashok Subramanian:
The Parallel Complexity of Propagation in Boolean Circuits
Inf. Comput. 117(2): 266-275 (1995) |
| 6 | EE | Ashok Subramanian:
A Polynomial Bound on the Number of Light Cycles in an Undirected Graph.
Inf. Process. Lett. 53(4): 173-176 (1995) |
| 5 | EE | Ashok Subramanian:
Erratum: A Polynomial Bound on the Number of Light Cycles in an Undirected Graph.
Inf. Process. Lett. 54(4): 247 (1995) |
| 1994 |
|---|
| 4 | | Ashok Subramanian:
An Explanation of Splaying.
FSTTCS 1994: 354-365 |
| 3 | | Ashok Subramanian:
A New Approach to Stable Matching Problems.
SIAM J. Comput. 23(4): 671-700 (1994) |
| 1992 |
|---|
| 2 | | Ernst W. Mayr,
Ashok Subramanian:
The Complexity of Circuit Value and Network Stability.
J. Comput. Syst. Sci. 44(2): 302-323 (1992) |
| 1989 |
|---|
| 1 | | Ernst W. Mayr,
Ashok Subramanian:
The Complexity of Circuit Value and Network Stability.
Structure in Complexity Theory Conference 1989: 114-123 |
