Back to authors
Martin Grohe
- Author ID
- o0000-0002-0292-9142
- ORCID
-
0000-0002-0292-9142
- Links
-
(found by gpt-5.6-luna on jul 26 2026)
- Most Frequent Institution
- RWTH Aachen University
- Pagerank
- 0.092089068
- Overall Rank
- 765 | 96.48%
- Paper Count
- 12
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 12 publications. Total citations include self and non-self citations.
| Rank |
Title |
Year |
Venue |
Total Citations |
Pagerank |
| 1,365 |
word2vec, node2vec, graph2vec, X2vec: Towards a Theory of Vector Embeddings of Structured Data |
2020 |
PODS |
14 |
0.00010879832 |
| 2,533 |
Path Queries on Compressed XML |
2003 |
VLDB |
11 |
8.3132165e-05 |
| 6,144 |
Generative Datalog with Continuous Distributions |
2020 |
PODS |
2 |
5.8561863e-05 |
| 6,317 |
Probabilistic Databases with an Infinite Open-World Assumption |
2019 |
PODS |
5 |
5.7965026e-05 |
| 7,206 |
The Parameterized Complexity of Database Queries |
2001 |
PODS |
1 |
5.5701964e-05 |
| 8,332 |
First-Order Query Evaluation with Cardinality Conditions |
2018 |
PODS |
2 |
5.3370034e-05 |
| 8,450 |
Tuple-Independent Representations of Infinite Probabilistic Databases |
2021 |
PODS |
1 |
5.3148581e-05 |
| 10,461 |
Recursive Querying of Neural Networks via Weighted Structures |
2026 |
PODS |
0 |
4.9605343e-05 |
| 11,881 |
On the Parameterized Complexity of Learning First-Order Logic |
2022 |
PODS |
0 |
4.9605343e-05 |
| 13,020 |
Randomized Computations on Large Data Sets: Tight Lower Bounds |
2006 |
PODS |
1 |
4.9605343e-05 |
| 13,061 |
Lower Bounds for Sorting with Few Random Accesses to External Memory |
2005 |
PODS |
2 |
4.9605343e-05 |
| 13,211 |
Reachability and Connectivity Queries in Constraint Databases |
2000 |
PODS |
0 |
4.9605343e-05 |