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 VLDB 2026 / reviewers in the wild / expert

Anil K. Sarje

dblp:65/5388 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 1989
—ORCID · none

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

Systems, architecture and hardware · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 1Theory of computation · 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.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Electronic design automation · 70% Integrated circuit design · 30%

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

TopicWeightPapersLastEvidence papers
Electronic design automation
logic synthesis		 0.021979
A New Approach to 2-Asummability Testing · IEEE Trans. Computers 1979
An Algorithm for Testing 2-Asummability of Boolean Functions · IEEE Trans. Computers 1977
Integrated circuit design › digital circuit design
threshold logic		 0.011977
An Algorithm for Testing 2-Asummability of Boolean Functions · IEEE Trans. Computers 1977

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

minterm generation · 0.02-monotonicity analysis · 0.0
YearPublicationVenuePosition
1989 On module assignment in two-processor distributed systems: a modified algorithm
G. Sagar, Anil K. Sarje, Kamal U. Ahmed
 Inf. Process. Lett.2
1979 A New Approach to 2-Asummability Testing
abstract
A relationship between 2-monotonicity and 2-asummability has been established and thereby a fast method for testing 2-asummability of switching functions derived. The approach is based on the fact that only a particular type of 2-sums need be examined for 2-asummability testing of 2-monotonic switching functions. These 2-sums are those which contain more than five 1's. 2-asummability testing for these 2-sums can be easily done by using the authors' technique.
Anil K. Sarje, Nripendra N. Biswas
 IEEE Trans. Computers1
1977 An Algorithm for Testing 2-Asummability of Boolean Functions
abstract
Simple algorithms have been developed to generate pairs of minterms forming a given 2-sum and thereby to test 2-asummability of switching functions. The 2-asummability testing procedure can be easily implemented on the computer. Since 2-asummability is a necessary and sufficient condition for a switching function of upto eight variables to be linearly separable (LS), it can be used for testing LS switching functions of upto eight variables.
Anil K. Sarje, Nripendra N. Biswas
 IEEE Trans. Computers1