Follow
Tomer Kotek
Tomer Kotek
TU Wien
Verified email at forsyte.at - Homepage
Title
Cited by
Cited by
Year
Parameterized model checking of rendezvous systems
B Aminof, T Kotek, S Rubin, F Spegni, H Veith
Distributed Computing 31, 187-222, 2018
772018
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
722012
On counting generalized colorings
T Kotek, JA Makowsky, B Zilber
Computer Science Logic: 22nd International Workshop, CSL 2008, 17th Annual …, 2008
382008
Evaluations of graph polynomials
B Godlin, T Kotek, JA Makowsky
International Workshop on Graph-Theoretic Concepts in Computer Science, 183-194, 2008
352008
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
322016
Connection matrices and the definability of graph parameters
T Kotek, JA Makowsky
Logical Methods in Computer Science 10, 2014
262014
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
222016
Subset-sum representations of domination polynomials
T Kotek, J Preen, P Tittmann
Graphs and Combinatorics 30 (3), 647-660, 2014
182014
Definability of combinatorial functions
T Kotek, JA Makowsky
Computer Science Department, Technion, 2012
182012
Recurrence relations for graph polynomials on bi-iterative families of graphs
T Kotek, JA Makowsky
European Journal of Combinatorics 41, 47-67, 2014
162014
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
162011
Bipartition polynomials, the ising model, and domination in graphs
M Dod, T Kotek, J Preen, P Tittmann
Discussiones Mathematicae Graph Theory 35 (2), 335-353, 2015
132015
Shape and Content: A Database-Theoretic Perspective on the Analysis of Data Structures
D Calvanese, T Kotek, M Šimkus, H Veith, F Zuleger
International Conference on Integrated Formal Methods, 3-17, 2014
132014
Domination polynomials of graph products
T Kotek, J Preen, P Tittmann
arXiv preprint arXiv:1305.1475, 2013
122013
Definability of Combinatorial Functions and Their Linear Recurrence Relations.
T Kotek, JA Makowsky
Fields of Logic and Computation, 444-462, 2010
102010
A logician's view of graph polynomials
JA Makowsky, EV Ravve, T Kotek
Annals of pure and applied logic 170 (9), 1030-1069, 2019
92019
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
82012
Complexity of Ising polynomials
T Kotek
Combinatorics, Probability and Computing 21 (5), 743-772, 2012
82012
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
The universal edge elimination polynomial and the dichromatic polynomial
I Averbouch, T Kotek, JA Makowsky, E Ravve
Electronic Notes in Discrete Mathematics 38, 77-82, 2011
72011
The system can't perform the operation now. Try again later.
Articles 1–20