Tomer Kotek

Publication Activity (10 Years)

Years Active: 2008-2022
Publications (10 Years): 13

Top Topics

Web Applications

Automated Verification

Graph Theoretic

Top Venues

Description Logics

Publications

Tomer Kotek, Johann A. Makowsky
On the Tutte and Matching Polynomials for Complete Graphs. Fundam. Informaticae 186 (1-4) (2022)
Nadia Labai, Tomer Kotek, Magdalena Ortiz, Helmut Veith
with Two Orders. LATA (2020)
Nadia Labai, Tomer Kotek, Magdalena Ortiz, Helmut Veith
Pebble-Intervals Automata and FO2 with Two Orders (Extended Version). CoRR (2019)
Tomer Kotek, Johann A. Makowsky
The exact complexity of the Tutte polynomial. CoRR (2019)
Johann A. Makowsky, Elena V. Ravve, Tomer Kotek
A logician's view of graph polynomials. Ann. Pure Appl. Log. 170 (9) (2019)
Benjamin Aminof, Tomer Kotek, Sasha Rubin, Francesco Spegni, Helmut Veith
Parameterized model checking of rendezvous systems. Distributed Comput. 31 (3) (2018)
Tomer Kotek, Johann A. Makowsky, Elena V. Ravve
On sequences of polynomials arising from graph invariants. Eur. J. Comb. 67 (2018)
Andrew J. Goodall, Miki Hermann, Tomer Kotek, Johann A. Makowsky, Steven D. Noble
On the complexity of generalized chromatic polynomials. Adv. Appl. Math. 94 (2018)
Andrew J. Goodall, Miki Hermann, Tomer Kotek, Johann A. Makowsky, Steven D. Noble
On the complexity of generalized chromatic polynomials. CoRR (2017)
Shachar Itzhaky, Tomer Kotek, Noam Rinetzky, Mooly Sagiv, Orr Tamir, Helmut Veith, Florian Zuleger
On the Automated Verification of Web Applications with Embedded SQL. ICDT (2017)
Igor V. Konnov, Tomer Kotek, Qiang Wang, Helmut Veith, Simon Bliudze, Joseph Sifakis
Parameterized Systems in BIP: Design and Model Checking. CONCUR (2016)
Shachar Itzhaky, Tomer Kotek, Noam Rinetzky, Mooly Sagiv, Orr Tamir, Helmut Veith, Florian Zuleger
On the automated verification of web applications with embedded SQL. CoRR (2016)
Tomer Kotek, Helmut Veith, Florian Zuleger
Monadic Second Order Finite Satisfiability and Unbounded Tree-Width. CSL (2016)
Tomer Kotek, Mantas Simkus, Helmut Veith, Florian Zuleger
Extending ALCQIO with Trees. LICS (2015)
Tomer Kotek, Helmut Veith, Florian Zuleger
Monadic second order finite satisfiability and unbounded tree-width. CoRR (2015)
Tomer Kotek, Johann A. Makowsky
Efficient Computation of Generalized Ising Polynomials on Graphs with Fixed Clique-Width. TTCS (2015)
Markus Dod, Tomer Kotek, James Preen, Peter Tittmann
Bipartition polynomials, the Ising model and domination in graphs. Discuss. Math. Graph Theory 35 (2) (2015)
Tomer Kotek, Johann A. Makowsky
Efficient computation of generalized Ising polynomials on graphs with fixed clique-width. CoRR (2015)
Benjamin Aminof, Tomer Kotek, Sasha Rubin, Francesco Spegni, Helmut Veith
Parameterized Model Checking of Rendezvous Systems. CONCUR (2014)
Tomer Kotek, Johann A. Makowsky
Recurrence relations for graph polynomials on bi-iterative families of graphs. Eur. J. Comb. 41 (2014)
Tomer Kotek, Mantas Simkus, Helmut Veith, Florian Zuleger
Towards a Description Logic for Program Analysis: Extending ALCQIO with Reachability. Description Logics (2014)
Tomer Kotek, James Preen, Peter Tittmann
Subset-Sum Representations of Domination Polynomials. Graphs Comb. 30 (3) (2014)
Tomer Kotek, Johann A. Makowsky
Connection Matrices and the Definability of Graph Parameters. Log. Methods Comput. Sci. 10 (4) (2014)
Diego Calvanese, Tomer Kotek, Mantas Simkus, Helmut Veith, Florian Zuleger
Shape and Content - A Database-Theoretic Perspective on the Analysis of Data Structures. IFM (2014)
Tomer Kotek, Johann A. Makowsky
A representation theorem for (q-)holonomic sequences. J. Comput. Syst. Sci. 80 (2) (2014)
Tomer Kotek, Mantas Simkus, Helmut Veith, Florian Zuleger
Extending ALCQIO with reachability. CoRR (2014)
Diego Calvanese, Tomer Kotek, Mantas Simkus, Helmut Veith, Florian Zuleger
Shape and Content: Incorporating Domain Knowledge into Shape Analysis. Description Logics (2014)
Diego Calvanese, Tomer Kotek, Mantas Simkus, Helmut Veith, Florian Zuleger
Shape and Content: Incorporating Domain Knowledge into Shape Analysis. CoRR (2013)
Tomer Kotek, Johann A. Makowsky, Elena V. Ravve
A Computational Framework for the Study of Partition Functions and Graph Polynomials. SYNASC (2012)
Tomer Kotek, Johann A. Makowsky
A Representation Theorem for Holonomic Sequences Based on Counting Lattice Paths. Fundam. Informaticae 117 (1-4) (2012)
Tomer Kotek, James Preen, Frank Simon, Peter Tittmann, Martin Trinks
Recurrence Relations and Splitting Formulas for the Domination Polynomial. Electron. J. Comb. 19 (3) (2012)
Tomer Kotek, Johann A. Makowsky
Connection Matrices and the Definability of Graph Parameters. CSL (2012)
Tomer Kotek
Complexity of Ising Polynomials. Comb. Probab. Comput. 21 (5) (2012)
Ilya Averbouch, Tomer Kotek, Johann A. Makowsky, Elena V. Ravve
The Universal Edge Elimination Polynomial and the Dichromatic Polynomial. Electron. Notes Discret. Math. 38 (2011)
Tomer Kotek
Complexity of Ising Polynomials CoRR (2011)
Tomer Kotek, Johann A. Makowsky
Definability of Combinatorial Functions and Their Linear Recurrence Relations. Fields of Logic and Computation (2010)
Tomer Kotek, Johann A. Makowsky, Boris Zilber
On Counting Generalized Colorings. AMS-ASL Joint Special Session (2009)
Eldar Fischer, Tomer Kotek, Johann A. Makowsky
Application of logic to combinatorial sequences and their recurrence relations. AMS-ASL Joint Special Session (2009)
Tomer Kotek
On the reconstruction of graph invariants. Electron. Notes Discret. Math. 34 (2009)
Tomer Kotek, Johann A. Makowsky, Boris Zilber
On Counting Generalized Colorings. CSL (2008)
Benny Godlin, Tomer Kotek, Johann A. Makowsky
Evaluations of Graph Polynomials. WG (2008)