( en | de | ru )

 

Disambiguation of "Makowsky, Johann A."

Author of the publication

copydeleteadd this publication to your clipboard
On spectra of sentences of monadic second order logic with counting.

, and . J. Symb. Log., 69 (3): 617-640 (2004)

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. You can also use the button next to the name to display some publications already assigned to the person.

Johannes Makowsky

Katja Makowsky

Herbert Makowsky

Ludwig Makowsky

Lutz Makowsky

 

Other publications of authors with the same name

Incremental Reorganization of Relational Databases., and . VLDB, page 127-135. Morgan Kaufmann, (1987)Graph Polynomials: Towards a Comparative Theory (Dagstuhl Seminar 16241)., , , and . Dagstuhl Reports, 6 (6): 26-48 (2016)On the Equivalence of Weak Second Order and Nonstandard Time Semantics For Various Program Verification Systems, and . LICS, page 293-300. IEEE Computer Society, (1986)Computable Directory Queries., and . CAAP, volume 214 of Lecture Notes in Computer Science, page 254-265. Springer, (1986)Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width., , and . WG, volume 1517 of Lecture Notes in Computer Science, page 1-16. Springer, (1998)Computing Graph Polynomials on Graphs of Bounded Clique-Width., , , and . WG, volume 4271 of Lecture Notes in Computer Science, page 191-204. Springer, (2006)Translation Schemes and the Fundamental Problem of Database Design., and . ER, volume 1157 of Lecture Notes in Computer Science, page 5-26. Springer, (1996)On the Exact Learnability of Graph Parameters: The Case of Partition Functions., and . MFCS, volume 58 of LIPIcs, page 63:1-63:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Formal Interactive Menu Design., and . Interact. Comput., 4 (1): 83-101 (1992)On Weakly Distinguishing Graph Polynomials., and . Discret. Math. Theor. Comput. Sci., (2019)