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

Khurram Sajid

dblp:59/5280 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2003
—ORCID · none

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

Theory of computation · 2Systems, architecture and hardware · 1Software engineering, systems software and programming languages · 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
Automated reasoning and model checking · 67% Coding theory · 33%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › decoding › minimum distance decoding
bounded-distance decoding		 0.011998
BDD Based Procedures for a Theory of Equality with Uninterpreted Functions · CAV 1998
Automated reasoning and model checking
decision procedures		 0.011998
BDD Based Procedures for a Theory of Equality with Uninterpreted Functions · CAV 1998
Automated reasoning and model checking › satisfiability modulo theories
equality logic with uninterpreted functions		 0.011998
BDD Based Procedures for a Theory of Equality with Uninterpreted Functions · CAV 1998
Electronic design automation › hardware verification and test › formal verification
equivalence checking		 0.011997
Optimizing Designs Containing Black Boxes · DAC 1997
Electronic design automation › logic synthesis
logic optimization		 0.011997
Optimizing Designs Containing Black Boxes · DAC 1997

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

congruence closure · 0.0BDD · 0.0
YearPublicationVenuePosition
2003 BDD Based Procedures for a Theory of Equality with Uninterpreted Functions
Anuj Goel, Khurram Sajid, Hai Zhou 0001, Adnan Aziz, Vigyan Singhal
 Formal Methods Syst. Des.2
1998 BDD Based Procedures for a Theory of Equality with Uninterpreted Functions
Anuj Goel, Khurram Sajid, Hai Zhou 0001, Adnan Aziz, Vigyan Singhal
 CAV2
1997 Optimizing Designs Containing Black Boxes
abstract
We define a notion of equivalence for designs containingblack boxes i.e., components whose functionality is notknown; these arise naturally in the course of hierarchicaldesign. Using this notion, we describe a sound andcomplete methodology for optimizing such designs.
Tai-Hung Liu, Khurram Sajid, Adnan Aziz, Vigyan Singhal
 DAC2