( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Incremental Model Checking for Decomposable Structures (Extended Abstract).

, и . MFCS, том 969 из Lecture Notes in Computer Science, стр. 540-551. Springer, (1995)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Johannes Makowsky

Katja Makowsky

Herbert Makowsky

Ludwig Makowsky

Lutz Makowsky

 

Другие публикации лиц с тем же именем

On the Exact Learnability of Graph Parameters: The Case of Partition Functions., и . MFCS, том 58 из LIPIcs, стр. 63:1-63:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Formal Interactive Menu Design., и . Interact. Comput., 4 (1): 83-101 (1992)To Yuri at 80 and More than 40 Years of Friendship.. Fields of Logic and Computation III, том 12180 из Lecture Notes in Computer Science, стр. 3-6. Springer, (2020)Arity vs. Alternation in Second Order Logic., и . LFCS, том 813 из Lecture Notes in Computer Science, стр. 240-252. Springer, (1994)Foreword., , и . Fundam. Informaticae, (2012)Incremental Reorganization of Relational Databases., и . VLDB, стр. 127-135. Morgan Kaufmann, (1987)Graph Polynomials: Towards a Comparative Theory (Dagstuhl Seminar 16241)., , , и . Dagstuhl Reports, 6 (6): 26-48 (2016)Translation Schemes and the Fundamental Problem of Database Design., и . ER, том 1157 из Lecture Notes in Computer Science, стр. 5-26. Springer, (1996)Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width., , и . WG, том 1517 из Lecture Notes in Computer Science, стр. 1-16. Springer, (1998)Computing Graph Polynomials on Graphs of Bounded Clique-Width., , , и . WG, том 4271 из Lecture Notes in Computer Science, стр. 191-204. Springer, (2006)