Tomer Kotek

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