Parameterized model checking of rendezvous systems B Aminof, T Kotek, S Rubin, F Spegni, H Veith Distributed computing 31 (3), 187-222, 2018 | 56 | 2018 |

Recurrence relations and splitting formulas for the domination polynomial T Kotek, J Preen, F Simon, P Tittmann, M Trinks arXiv preprint arXiv:1206.5926, 2012 | 54 | 2012 |

Evaluations of graph polynomials B Godlin, T Kotek, JA Makowsky International Workshop on Graph-Theoretic Concepts in Computer Science, 183-194, 2008 | 35 | 2008 |

On counting generalized colorings T Kotek, JA Makowsky, B Zilber Model theoretic methods in finite combinatorics 558, 207-242, 2011 | 26 | 2011 |

Connection matrices and the definability of graph parameters T Kotek, JA Makowsky arXiv preprint arXiv:1308.3654, 2013 | 25 | 2013 |

On counting generalized colorings T Kotek, JA Makowsky, B Zilber International Workshop on Computer Science Logic, 339-353, 2008 | 22 | 2008 |

On the automated verification of web applications with embedded SQL S Itzhaky, T Kotek, N Rinetzky, M Sagiv, O Tamir, H Veith, F Zuleger arXiv preprint arXiv:1610.02101, 2016 | 17 | 2016 |

Parameterized systems in BIP: design and model checking I Konnov, T Kotek, Q Wang, H Veith, S Bliudze, J Sifakis 27th International conference on concurrency theory (CONCUR 2016), 2016 | 16 | 2016 |

Subset-sum representations of domination polynomials T Kotek, J Preen, P Tittmann Graphs and Combinatorics 30 (3), 647-660, 2014 | 16 | 2014 |

Shape and content: Incorporating domain knowledge into shape analysis D Calvanese, T Kotek, M Šimkus, H Veith, F Zuleger arXiv preprint arXiv:1312.6624, 2013 | 15* | 2013 |

Definability of combinatorial functions T Kotek, JA Makowsky Computer Science Department, Technion, 2012 | 15 | 2012 |

Shape and content D Calvanese, T Kotek, M Šimkus, H Veith, F Zuleger International Conference on Integrated Formal Methods, 3-17, 2014 | 11 | 2014 |

Bipartition Polynomials, the Ising Model, and Domination in Graphs. M Dod, T Kotek, J Preen, P Tittmann Discussiones Mathematicae: Graph Theory 35 (2), 2015 | 10 | 2015 |

Domination polynomials of graph products T Kotek, J Preen, P Tittmann arXiv preprint arXiv:1305.1475, 2013 | 10 | 2013 |

Application of logic to combinatorial sequences and their recurrence relations E Fischer, T Kotek, JA Makowsky Model Theoretic Methods in Finite Combinatorics 558, 1-42, 2011 | 10 | 2011 |

Definability of combinatorial functions and their linear recurrence relations T Kotek, JA Makowsky Fields of Logic and Computation, 444-462, 2010 | 10 | 2010 |

A computational framework for the study of partition functions and graph polynomials T Kotek, JA Makowsky, EV Ravve Proceedings of the 12th Asian Logic Conference, 210-230, 2013 | 9 | 2013 |

Complexity of Ising polynomials T Kotek Combinatorics, Probability and Computing 21 (5), 743-772, 2012 | 8 | 2012 |

Extending ALCQIO with trees T Kotek, H Veith, F Zuleger 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 511-522, 2015 | 7* | 2015 |

Towards a Description Logic for Program Analysis: Extending ALCQIO with Reachability. T Kotek, M Simkus, H Veith, F Zuleger Description Logics, 591-594, 2014 | 6 | 2014 |