default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAshok Subramanian
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j13]Vicki L. Sauter, Srikanth Mudigonda, Ashok Subramanian, Ray Creely:
Visualization-Based Decision Support Systems: An Example of Regional Relationship Data. Int. J. Decis. Support Syst. Technol. 3(1): 1-20 (2011)
2000 – 2009
- 2008
- [j12]Nitin
, 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
- [c5]Ashok Subramanian, Nitin:
On Reliability Analysis of Cost-Effective Hybrid Zeta Network: A Fault-Tolerant Multi-Stage Interconnection Network. PDPTA 2006: 260-265 - 2001
- [c4]L. Douglas Smith, Ashok Subramanian, Robert M. Nauss, Ronald Beck:
Developing Outsourcing Strategies for MIS: A Mathematical Programming Approach. HICSS 2001
1990 – 1999
- 1997
- [j11]Ashok Subramanian, L. Douglas Smith, Anthony C. Nelson, James F. Campbell, David A. Bird:
Strategic planning for data warehousing. Inf. Manag. 33(2): 99-113 (1997) - [j10]Ashok Subramanian, Mary C. Lacity:
Managing client/server implementations: today's technology, yesterday's lessons. J. Inf. Technol. 12(3): 169-186 (1997) - [j9]Mary C. Lacity, Leslie P. Willcocks, Ashok Subramanian:
A strategic client/server implementation: new technology, lessons from history. J. Strateg. Inf. Syst. 6(2): 95-128 (1997) - 1996
- [j8]Ashok Subramanian:
An Explanation of Splaying. J. Algorithms 20(3): 512-525 (1996) - [c3]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 - 1995
- [j7]Ashok Subramanian:
The Parallel Complexity of Propagation in Boolean Circuits. Inf. Comput. 117(2): 266-275 (1995) - [j6]Ashok Subramanian:
A Polynomial Bound on the Number of Light Cycles in an Undirected Graph. Inf. Process. Lett. 53(4): 173-176 (1995) - [j5]Ashok Subramanian:
Erratum: A Polynomial Bound on the Number of Light Cycles in an Undirected Graph. Inf. Process. Lett. 54(4): 247 (1995) - [j4]Ashok Subramanian:
Two recent algorithms for the global minimum cut problem. SIGACT News 26(2): 78-87 (1995) - 1994
- [j3]Ashok Subramanian, Sree Nilakanta:
Measurement: A blueprint for theory-building in MIS. Inf. Manag. 26(1): 13-20 (1994) - [j2]Ashok Subramanian:
A New Approach to Stable Matching Problems. SIAM J. Comput. 23(4): 671-700 (1994) - [c2]Ashok Subramanian:
An Explanation of Splaying. FSTTCS 1994: 354-365 - 1992
- [j1]Ernst W. Mayr, Ashok Subramanian:
The Complexity of Circuit Value and Network Stability. J. Comput. Syst. Sci. 44(2): 302-323 (1992) - 1990
- [b1]Ashok Subramanian:
The computational complexity of the circuit value and network stability problems. Stanford University, USA, 1990
1980 – 1989
- 1989
- [c1]Ernst W. Mayr, Ashok Subramanian:
The Complexity of Circuit Value and Network Stability. SCT 1989: 114-123
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
