Demo Data from VLDB 2026 / reviewers in the wild / expert
Sathiamoorthy Subbarayan
dblp:01/197
· DBLP profile ↗
5ranked-venue papers
5as first author
0since 2021 · last 2008
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 4 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorTheory of computation · 1 · 1 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 |
Automated reasoning and model checking · 17% Logic in computer science · 17% Coding theory · 17% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes › decoding › minimum distance decoding
bounded-distance decoding |
0.1 | 1 | 2007 | Knowledge Compilation Properties of Tree-of-BDDs · AAAI 2007 |
Computational complexity
constraint satisfaction |
0.1 | 1 | 2007 | Backtracking Procedures for Hypertree, HyperSpread and Connected Hypertree Decomposition of CSPs · IJCAI 2007 |
Combinatorics and discrete mathematics › hypergraph › hypertree width
hypertree decomposition |
0.1 | 1 | 2007 | Backtracking Procedures for Hypertree, HyperSpread and Connected Hypertree Decomposition of CSPs · IJCAI 2007 |
Automated reasoning and model checking
knowledge compilation |
0.1 | 1 | 2007 | Knowledge Compilation Properties of Tree-of-BDDs · AAAI 2007 |
Logic in computer science › knowledge representation and reasoning
knowledge representation |
0.1 | 1 | 2007 | Knowledge Compilation Properties of Tree-of-BDDs · AAAI 2007 |
Graph algorithms and graph theory › graph decomposition
tree decomposition |
0.1 | 1 | 2007 | Backtracking Procedures for Hypertree, HyperSpread and Connected Hypertree Decomposition of CSPs · IJCAI 2007 |
Methods — techniques the papers use, named apart from their topics
hypertree decomposition · 0.1hyperspread decomposition · 0.1backtracking · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2008 | Efficient Reasoning for Nogoods in Constraint Solvers with BDDs
Sathiamoorthy Subbarayan |
PADL | 1 |
| 2007 | Knowledge Compilation Properties of Tree-of-BDDs
Sathiamoorthy Subbarayan, Lucas Bordeaux, Youssef Hamadi |
AAAI | 1 |
| 2007 | Backtracking Procedures for Hypertree, HyperSpread and Connected Hypertree Decomposition of CSPs
Sathiamoorthy Subbarayan, Henrik Reif Andersen |
IJCAI | 1 |
| 2005 | Integrating CSP Decomposition Techniques and BDDs for Compiling Configuration Problems
Sathiamoorthy Subbarayan |
CPAIOR | 1 |
| 2004 | NiVER: Non Increasing Variable Elimination Resolution for Preprocessing SAT instances
Sathiamoorthy Subbarayan, Dhiraj K. Pradhan |
SAT | 1 |