Back to authors
Pierre Senellart
- Author ID
- o0000-0002-7909-5369
- ORCID
-
0000-0002-7909-5369
- Links
-
(found by gpt-5.6-luna on jul 24 2026)
- Most Frequent Institution
- Télécom Paris
- Pagerank
- 0.11057977
- Overall Rank
- 600 | 97.24%
- Paper Count
- 14
Affiliation Timeline
Incoming Non-self Citations Over Time
Total yearly non-self incoming citations across all papers by this author.
Publications by Paper Pagerank
Showing all 14 publications. Total citations include self and non-self citations.
| Rank |
Title |
Year |
Venue |
Total Citations |
Pagerank |
| 1,822 |
ProvSQL: Provenance and Probability Management in PostgreSQL |
2018 |
VLDB |
19 |
9.5464187e-05 |
| 2,143 |
PARIS: Probabilistic Alignment of Relations, Instances, and Schema |
2012 |
VLDB |
12 |
8.965577e-05 |
| 2,842 |
Crowd Mining |
2013 |
SIGMOD |
16 |
7.9345347e-05 |
| 3,390 |
On the Complexity of Managing Probabilistic XML Data |
2007 |
PODS |
9 |
7.3292374e-05 |
| 3,989 |
On the Complexity of Deriving Schema Mappings from Database Instances |
2008 |
PODS |
3 |
6.8620001e-05 |
| 5,538 |
Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases |
2024 |
PODS |
6 |
6.0747885e-05 |
| 6,651 |
Probabilistic XML via Markov Chains |
2010 |
VLDB |
3 |
5.7046046e-05 |
| 7,816 |
Tractable Lineages on Treelike Instances: Limits and Extensions |
2016 |
PODS |
3 |
5.4309297e-05 |
| 7,878 |
Conjunctive Queries on Probabilistic Graphs: Combined Complexity |
2017 |
PODS |
2 |
5.4187338e-05 |
| 8,973 |
CrowdMiner: Mining association rules from the crowd |
2013 |
VLDB |
2 |
5.2347984e-05 |
| 9,858 |
ProApproX: A Lightweight Approximation Query Processor over Probabilistic Trees |
2011 |
SIGMOD |
1 |
5.1064323e-05 |
| 12,648 |
Optimal Top-k Generation of Attribute Combinations based on Ranked Lists |
2012 |
SIGMOD |
0 |
4.9605343e-05 |
| 12,661 |
Auto-Completion Learning for XML |
2012 |
SIGMOD |
0 |
4.9605343e-05 |
| 12,704 |
Determining Relevance of Accesses at Runtime |
2011 |
PODS |
1 |
4.9605343e-05 |