DBScholar

Back to authors

Mihalis Yannakakis

Author ID
u2856
ORCID
-
Links
(found by gpt-5.6-luna on jul 24 2026)
Most Frequent Institution
AT&T
Pagerank
0.090568549
Overall Rank
779 | 96.42%
Paper Count
11

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 11 publications. Total citations include self and non-self citations.

Rank Title Year Venue Total Citations Pagerank
424 On the Complexity of Database Queries (Extended Abstract) 1997 PODS 27 0.00018448553
778 Independent Database Schemas (Extended Abstract) 1982 PODS 21 0.00014050921
1,816 Multiobjective Query Optimization 2001 PODS 9 9.5618884e-05
1,917 The Input/Output Complexity Of Transitive Closure 1990 SIGMOD 9 9.3649154e-05
3,030 Graph-Theoretic Methods In Database Theory 1990 PODS 7 7.7156987e-05
5,875 Tie-Breaking Semantics and Structural Totality (Extended Abstract) 1992 PODS 2 5.9456544e-05
6,384 On Datalog vs. Polynomial Time 1991 PODS 3 5.78729e-05
7,964 Deleting Completed Transactions (Extended Abstract) 1986 PODS 2 5.4008046e-05
9,470 Querying Weak Instances 1984 PODS 1 5.1586111e-05
13,547 DEADLOCK-FREEDOM (AND SAFETY) OF TRANSACTIONS IN A DISTRIBUTED DATABASE (Extended Abstract) 1985 PODS 0 4.9605343e-05
14,824 The Complexity of Reliable Concurrency Control 1985 PODS 0 -