Tomer Kotek
Tomer Kotek
TU Wien
Verified email at - Homepage
Cited by
Cited by
Parameterized model checking of rendezvous systems
B Aminof, T Kotek, S Rubin, F Spegni, H Veith
Distributed Computing 31 (3), 187-222, 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
Evaluations of graph polynomials
B Godlin, T Kotek, JA Makowsky
International Workshop on Graph-Theoretic Concepts in Computer Science, 183-194, 2008
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
Connection matrices and the definability of graph parameters
JA Makowsky, T Kotek
Logical Methods in Computer Science 10, 2014
On counting generalized colorings
T Kotek, JA Makowsky, B Zilber
Model theoretic methods in finite combinatorics 558, 207-242, 2011
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
On counting generalized colorings
T Kotek, JA Makowsky, B Zilber
International Workshop on Computer Science Logic, 339-353, 2008
Subset-sum representations of domination polynomials
T Kotek, J Preen, P Tittmann
Graphs and Combinatorics 30 (3), 647-660, 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
Definability of combinatorial functions
T Kotek, JA Makowsky
Computer Science Department, Technion, 2012
Bipartition Polynomials, the Ising Model, and Domination in Graphs.
M Dod, T Kotek, J Preen, P Tittmann
Discussiones Mathematicae: Graph Theory 35 (2), 2015
Shape and content
D Calvanese, T Kotek, M Šimkus, H Veith, F Zuleger
International Conference on Integrated Formal Methods, 3-17, 2014
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
Domination polynomials of graph products
T Kotek, J Preen, P Tittmann
arXiv preprint arXiv:1305.1475, 2013
Recurrence relations for graph polynomials on bi-iterative families of graphs
T Kotek, JA Makowsky
European Journal of Combinatorics 41, 47-67, 2014
Definability of combinatorial functions and their linear recurrence relations
T Kotek, JA Makowsky
Fields of Logic and Computation, 444-462, 2010
A computational framework for the study of partition functions and graph polynomials
T Kotek, JA Makowsky, EV Ravve
2012 14th International Symposium on Symbolic and Numeric Algorithms for …, 2012
A logician's view of graph polynomials
JA Makowsky, EV Ravve, T Kotek
Annals of pure and applied logic 170 (9), 1030-1069, 2019
Extending ALCQIO with trees
T Kotek, H Veith, F Zuleger
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 511-522, 2015
The system can't perform the operation now. Try again later.
Articles 1–20