| Updates of relational views SS Cosmadakis, CH Papadimitriou Journal of the ACM (JACM) 31 (4), 742-760, 1984 | 233 | 1984 |
| The complexity of the travelling repairman problem F Afrati, S Cosmadakis, CH Papadimitriou, G Papageorgiou, ... RAIRO-Theoretical Informatics and Applications-Informatique Théorique et …, 1986 | 230 | 1986 |
| Decidable optimization problems for database logic programs S Cosmadakis, H Gaifman, P Kanellakis, M Vardi Proceedings of the twentieth annual ACM symposium on Theory of computing …, 1988 | 216 | 1988 |
| The complexity of minimizing wire lengths in VLSI layouts SN Bhatt, SS Cosmadakis Information Processing Letters 25 (4), 263-267, 1987 | 158 | 1987 |
| Polynomial-time implication problems for unary inclusion dependencies SS Cosmadakis, PC Kanellakis, MY Vardi Journal of the ACM (JACM) 37 (1), 15-46, 1990 | 123 | 1990 |
| On Datalog vs polynomial time F Afrati, SS Cosmadakis, M Yannakakis Journal of computer and system sciences 51 (2), 177-196, 1995 | 104* | 1995 |
| Parallel evaluation of recursive rule queries S Cosmadakis, P Kanellakis Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of …, 1985 | 103 | 1985 |
| Partition semantics for relations SS Cosmadakis, PC Kanellakis, N Spyratos Journal of Computer and System Sciences 33 (2), 203-233, 1986 | 101 | 1986 |
| Semantical paradigms: Notes for an invited lecture AR Meyer, SS Cosmadakis MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE, 1988 | 90 | 1988 |
| Expressiveness of restricted recursive queries F Afrati, SS Cosmadakis Proceedings of the twenty-first annual ACM symposium on Theory of computing …, 1989 | 75 | 1989 |
| Functional and inclusion dependencies a graph theoretic approach SS Cosmadakis, PC Kanellakis Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database …, 1984 | 74 | 1984 |
| Linear vs. polynomial constraints in database query languages F Afrati, SS Cosmadakis, S Grumbach, GM Kuper International Workshop on Principles and Practice of Constraint Programming …, 1994 | 68 | 1994 |
| Unary inclusion dependencies have polynomial time inference problems PC Kanellakis, SS Cosmadakis, MY Vardi Proceedings of the fifteenth annual ACM symposium on Theory of computing …, 1983 | 60 | 1983 |
| The traveling salesman problem with many visits to few cities SS Cosmadakis, CH Papadimitriou SIAM Journal on Computing 13 (1), 99-108, 1984 | 57 | 1984 |
| Cutting and partitioning a graph after a fixed pattern M Yannakakis, PC Kanellakis, SS Cosmadakis, CH Papadimitriou International Colloquium on Automata, Languages, and Programming, 712-722, 1983 | 56 | 1983 |
| Equational theories and database constraints SS Cosmadakis, PC Kanellakis Proceedings of the seventeenth annual ACM symposium on Theory of computing …, 1985 | 41 | 1985 |
| Logical reducibility and monadic NP SS Cosmadakis Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, 52-61, 1993 | 28 | 1993 |
| Database theory and cylindric lattices SS Cosmadakis 28th Annual Symposium on Foundations of Computer Science (sfcs 1987), 411-420, 1987 | 20 | 1987 |
| Computing with recursive types SS Cosmadakis Proceedings. Fourth Annual Symposium on Logic in Computer Science, 24, 25 …, 1989 | 17 | 1989 |
| The word and generator problems for lattices SS Cosmadakis Information and Computation 77 (3), 192-217, 1988 | 16 | 1988 |
