Ashok Subramanian - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 19 from 19

2011

Visualization-Based Decision Support Systems: An Example of Regional Relationship DataVicki L. Sauter, Srikanth Mudigonda, Ashok Subramanian, Ray Creely. ijdsst, 3(1):1-20, 2011. [doi]

2008

Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete tiesNitin Chanderwal, Ashok Subramanian. jda, 6(3):353-380, 2008. [doi]

2006

On Reliability Analysis of Cost-Effective Hybrid Zeta Network: A Fault-Tolerant Multi-Stage Interconnection NetworkAshok Subramanian, Nitin Chanderwal. pdpta 2006: 260-265

2001

Developing Outsourcing Strategies for MIS: A Mathematical Programming ApproachL. Douglas Smith, Ashok Subramanian, Robert M. Nauss, Ronald Beck. hicss 2001: [doi]

1997

A strategic client/server implementation: new technology, lessons from historyMary Lacity, Leslie P. Willcocks, Ashok Subramanian. jsis, 6(2):95-128, 1997. [doi]

Managing client/server implementations: today's technology, yesterday's lessonsAshok Subramanian, Mary C. Lacity. jitech, 12(3):169-186, 1997. [doi]

Strategic planning for data warehousingAshok Subramanian, L. Douglas Smith, Anthony C. Nelson, James F. Campbell, David A. Bird. iam, 33(2):99-113, 1997. [doi]

1996

An Explanation of SplayingAshok Subramanian. jal, 20(3):512-525, 1996.

Strategic Planning for Data Warehousing in the Public SectorAshok Subramanian, L. Douglas Smith, Anthony C. Nelson, James F. Campbell, David A. Bird. hicss 1996: 54-61 [doi]

1995

The Parallel Complexity of Propagation in Boolean CircuitsAshok Subramanian. iandc, 117(2):266-275, March 1995.

A Polynomial Bound on the Number of Light Cycles in an Undirected GraphAshok Subramanian. ipl, 53(4):173-176, 1995. [doi]

Erratum: A Polynomial Bound on the Number of Light Cycles in an Undirected GraphAshok Subramanian. ipl, 54(4):247, 1995. [doi]

Two recent algorithms for the global minimum cut problemAshok Subramanian. sigact, 26(2):78-87, 1995. [doi]

1994

An Explanation of SplayingAshok Subramanian. fsttcs 1994: 354-365

Measurement: A blueprint for theory-building in MISAshok Subramanian, Sree Nilakanta. iam, 26(1):13-20, 1994. [doi]

A New Approach to Stable Matching ProblemsAshok Subramanian. SICOMP, 23(4):671-700, 1994.

1992

The Complexity of Circuit Value and Network StabilityErnst W. Mayr, Ashok Subramanian. jcss, 44(2):302-323, 1992.

1990

The computational complexity of the circuit value and network stability problemsAshok Subramanian. PhD thesis, Stanford University, USA, 1990. [doi]

1989

The Complexity of Circuit Value and Network StabilityErnst W. Mayr, Ashok Subramanian. cocoon 1989: 114-123

Sign in or sign up to see more results.

runs on WebDSL