Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Ashok Subramanian

dblp:24/4590 · DBLP profile ↗
← Back
9ranked-venue papers
7as first author
0since 2021 · last 1997
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 6 · 5 first-authorDatabases, data management, data science and information retrieval · 5 · 4 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Computational complexity · 61% Algorithmic game theory and mechanism design · 24% Graph algorithms and graph theory · 7%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational complexity
parallel complexity		 0.011995
The Parallel Complexity of Propagation in Boolean Circuits · Inf. Comput. 1995
Algorithmic game theory and mechanism design › matching
stable matching		 0.011994
A New Approach to Stable Matching Problems · SIAM J. Comput. 1994
Computational complexity
circuit complexity		 0.011995
The Parallel Complexity of Propagation in Boolean Circuits · Inf. Comput. 1995
Mathematical optimization › combinatorial optimization
assignment problem		 0.011994
A New Approach to Stable Matching Problems · SIAM J. Comput. 1994
Graph algorithms and graph theory › graph algorithms
network flow		 0.011994
A New Approach to Stable Matching Problems · SIAM J. Comput. 1994

Methods — techniques the papers use, named apart from their topics

x-networks · 0.0parallel reduction · 0.0
YearPublicationVenuePosition
1997 Strategic planning for data warehousing
Ashok Subramanian, L. Douglas Smith, Anthony C. Nelson, James F. Campbell, David A. Bird
 Inf. Manag.1
1997 A strategic client/server implementation: new technology, lessons from history
Mary C. Lacity, Leslie P. Willcocks, Ashok Subramanian
 J. Strateg. Inf. Syst.3
1995 The Parallel Complexity of Propagation in Boolean Circuits
Ashok Subramanian
 Inf. Comput.1
1995 A Polynomial Bound on the Number of Light Cycles in an Undirected Graph
Ashok Subramanian
 Inf. Process. Lett.1
1995 Erratum: A Polynomial Bound on the Number of Light Cycles in an Undirected Graph
Ashok Subramanian
 Inf. Process. Lett.1
1994 An Explanation of Splaying
Ashok Subramanian
 FSTTCS1
1994 Measurement: A blueprint for theory-building in MIS
Ashok Subramanian, Sree Nilakanta
 Inf. Manag.1
1994 A New Approach to Stable Matching Problems
abstract
It is shown that Stable Matching problems are the same as problems about stable configurations of X-networks. Consequences include easy proofs of old theorems, a new simple algorithm for finding a stable matching, an understanding of the difference between Stable Marriage and Stable Roommates, NP-completeness of Three-party Stable Marriage, CC-completeness of several Stable Matching problems, and a fast parallel reduction from the Stable Marriage problem to the Assignment problem.
Ashok Subramanian
 SIAM J. Comput.1
1992 The Complexity of Circuit Value and Network Stability
Ernst W. Mayr, Ashok Subramanian
 J. Comput. Syst. Sci.2