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 (3), 187-222, 2018
482018
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
422012
Evaluations of graph polynomials
B Godlin, T Kotek, JA Makowsky
International Workshop on Graph-Theoretic Concepts in Computer Science, 183-194, 2008
352008
Connection matrices and the definability of graph parameters
T Kotek, JA Makowsky
arXiv preprint arXiv:1308.3654, 2013
252013
On counting generalized colorings
T Kotek, JA Makowsky, B Zilber
Model theoretic methods in finite combinatorics 558, 207-242, 2011
252011
On counting generalized colorings
T Kotek, JA Makowsky, B Zilber
International Workshop on Computer Science Logic, 339-353, 2008
222008
Subset-sum representations of domination polynomials
T Kotek, J Preen, P Tittmann
Graphs and Combinatorics 30 (3), 647-660, 2014
152014
Definability of combinatorial functions
T Kotek, JA Makowsky
Computer Science Department, Technion, 2012
152012
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
132016
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
13*2013
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
112016
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
112015
Definability of combinatorial functions and their linear recurrence relations
T Kotek, JA Makowsky
Fields of logic and computation, 444-462, 2010
102010
Shape and content
D Calvanese, T Kotek, M Šimkus, H Veith, F Zuleger
International Conference on Integrated Formal Methods, 3-17, 2014
92014
Domination polynomials of graph products
T Kotek, J Preen, P Tittmann
arXiv preprint arXiv:1305.1475, 2013
92013
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
92013
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
92011
Complexity of Ising polynomials
T Kotek
arXiv preprint arXiv:1110.3639, 2011
82011
Type checking liveness for collaborative processes with bounded and unbounded recursion
S Debois, T Hildebrandt, T Slaats, N Yoshida
International Conference on Formal Techniques for Distributed Objects …, 2014
62014
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
62011
The system can't perform the operation now. Try again later.
Articles 1–20