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

M. S. Krishnamoorthy

dblp:10/9 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2008
—ORCID · none

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

Security and privacy · 1Databases, data management, data science and information retrieval · 1

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
1 paper
Mathematical optimization · 50% Approximation and online algorithms · 50%
Databases, data mining, and information retrieval
1 paper
Distributed and cloud data management · 100%

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

TopicWeightPapersLastEvidence papers
Distributed and cloud data management › data placement
file allocation		 0.011983
An Approximation Algorithm to the File Allocation Problem in Computer Networks · PODS 1983
Approximation and online algorithms
approximation algorithms		 0.011983
An Approximation Algorithm to the File Allocation Problem in Computer Networks · PODS 1983
Mathematical optimization
combinatorial optimization		 0.011983
An Approximation Algorithm to the File Allocation Problem in Computer Networks · PODS 1983

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

approximation algorithm · 0.0
YearPublicationVenuePosition
2008 Models and methods for prediction problem of evolving graphs
abstract
This paper concentrates on the prediction problem of evolving graphs. We provide five new models and methods for prediction problem of evolving graphs. We experiment each method on real-world evolving graph data which are football competition data, file sharing data, Enron e-mail data, and Eurovision data. Experimental results show that our prediction methods can predict the result with higher accuracy than the random prediction.
A. Chapanond, M. S. Krishnamoorthy
 ISI2
1983 An Approximation Algorithm to the File Allocation Problem in Computer Networks
abstract
Article An approximation algorithm to the file allocation problem in computer networks Share on Authors: Kowtha Murthy Paramus, New Jersey Paramus, New JerseyView Profile , John Kam Wang Research Laboratories, Waltham, Massachusetts Wang Research Laboratories, Waltham, MassachusettsView Profile , M. S. Krishnamoorthy Rensselaer Polytechnic Institute, Troy, New York Rensselaer Polytechnic Institute, Troy, New YorkView Profile Authors Info & Claims PODS '83: Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systemsMarch 1983 Pages 258–266https://doi.org/10.1145/588058.588087Online:21 March 1983Publication History 10citation274DownloadsMetricsTotal Citations10Total Downloads274Last 12 Months1Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Kowtha Murthy, John B. Kam, M. S. Krishnamoorthy
 PODS3