Author of the publication

Arity vs. Alternation in Second Order Logic.

, and . LFCS, volume 813 of Lecture Notes in Computer Science, page 240-252. Springer, (1994)

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.

 

Other publications of authors with the same name

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)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)Graph Polynomials: From Recursive Definitions To Subset Expansion Formulas, , and . CoRR, (2008)Can one design a geometry engine? - On the (un)decidability of certain affine Euclidean geometries.. Ann. Math. Artif. Intell., 85 (2-4): 259-291 (2019)Translation Schemes and the Fundamental Problem of Database Design., and . ER, volume 1157 of Lecture Notes in Computer Science, page 5-26. Springer, (1996)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)Incremental Model Checking for Decomposable Structures (Extended Abstract)., and . MFCS, volume 969 of Lecture Notes in Computer Science, page 540-551. Springer, (1995)