| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Martin Grohe Martin Grohe, György Turán : Learnability and Definability in Trees and Similar Structures. Theory Comput. Syst. 37 (1): 193-220 (2004) Martin Grohe, Nicole Schweikardt : Comparing the Succinctness of Monadic Query Languages over Finite Trees. CSL 2003 : 226-240 Martin Grohe: The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side. FOCS 2003 : 552-561 Markus Frick , Martin Grohe, Christoph Koch : Query Evaluation on Compressed Trees (Extended Abstract). LICS 2003 : 188- Peter Buneman , Martin Grohe, Christoph Koch : Path Queries on Compressed XML. VLDB 2003 : 141-152 Jörg Flum , Martin Grohe: Describing parameterized complexity classes. Inf. Comput. 187 (2): 291-319 (2003) Michael Benedikt , Martin Grohe, Leonid Libkin , Luc Segoufin : Reachability and connectivity queries in constraint databases. J. Comput. Syst. Sci. 66 (1): 169-206 (2003) Jörg Flum , Martin Grohe: The Parameterized Complexity of Counting Problems. FOCS 2002 : 538- Markus Frick , Martin Grohe: The Complexity of First-Order and Monadic Second-Order Logic Revisited. LICS 2002 : 215-224 Jörg Flum , Martin Grohe: Describing Parameterized Complexity Classes. STACS 2002 : 359-371 Martin Grohe, György Turán : Learnability and Definability in Trees and Similar Structures. STACS 2002 : 645-658 Martin Grohe, Luc Segoufin : On first-order topological queries. ACM Trans. Comput. Log. 3 (3): 336-358 (2002) Martin Grohe: Large Finite Structures with Few Lk-Types. Inf. Comput. 179 (2): 250-278 (2002) Jörg Flum , Markus Frick , Martin Grohe: Query evaluation via tree-decompositions. J. ACM 49 (6): 716-752 (2002) Martin Grohe: Parameterized Complexity for the Database Theorist. SIGMOD Record 31 (4): 86-96 (2002) Martin Grohe, Stefan Wöhrle : An Existential Locality Theorem. CSL 2001 : 99-114 Jörg Flum , Markus Frick , Martin Grohe: Query Evaluation via Tree-Decompositions. ICDT 2001 : 22-38 Martin Grohe: The Parameterized Complexity of Database Queries. PODS 2001 Martin Grohe: Generalized Model-Checking Problems for First-Order Logic. STACS 2001 : 12-26 Martin Grohe: Computing crossing numbers in quadratic time. STOC 2001 : 231-236 Martin Grohe, Thomas Schwentick , Luc Segoufin : When is the evaluation of conjunctive queries tractable? STOC 2001 : 657-666 Markus Frick , Martin Grohe: Deciding first-order properties of locally tree-decomposable structures. J. ACM 48 (6): 1184-1206 (2001) Jörg Flum , Martin Grohe: Fixed-Parameter Tractability, Definability, and Model-Checking. SIAM J. Comput. 31 (1): 113-145 (2001) Martin Grohe, Luc Segoufin : On First-Order Topological Queries. LICS 2000 : 349-360 Michael Benedikt , Martin Grohe, Leonid Libkin , Luc Segoufin : Reachability and Connectivity Queries in Constraint Databases. PODS 2000 : 104-115 Martin Grohe: Isomorphism testing for embeddable graphs through definability. STOC 2000 : 63-72 Martin Grohe, Thomas Schwentick : Locality of order-invariant first-order formulas. ACM Trans. Comput. Log. 1 (1): 112-130 (2000) Jörg Flum , Martin Grohe: On Fixed-Point Logic With Counting. J. Symb. Log. 65 (2): 777-787 (2000) Martin Grohe: Descriptive and Parameterized Complexity. CSL 1999 : 14-31 Markus Frick , Martin Grohe: Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs. ICALP 1999 : 331-340 Martin Grohe, Julian Mariño : Definability and Descriptive Complexity on Databases of Bounded Tree-Width. ICDT 1999 : 70-82 Martin Grohe: Equivalence in Finite-Variable Logics is Complete for Polynomial Time. Combinatorica 19 (4): 507-532 (1999) Martin Grohe: Fixed-Point Logics on Planar Graphs. LICS 1998 : 6-15 Martin Grohe, Thomas Schwentick : Locality of Order-Invariant First-Order Formulas. MFCS 1998 : 437-445 Martin Grohe: Canonization for L k -equivalence is Hard. CSL 1997 : 220-238 Martin Grohe: Large Finite Structures with Few L k -Types. LICS 1997 : 216-227 Martin Grohe: Existential Least Fixed-Point Logic and its Relatives. J. Log. Comput. 7 (2): 205-228 (1997) Martin Grohe: Equivalence in Finite-Variable Logics is Complete for Polynomial Time. FOCS 1996 : 264-273 Martin Grohe: Arity Hierarchies. Ann. Pure Appl. Logic 82 (2): 103-163 (1996) Martin Grohe: Some Remarks on Finite Löwenheim-Skolem Theorems. Math. Log. Q. 42 : 569-571 (1996) Martin Grohe: Complete Problems for Fixed-Point Logics. J. Symb. Log. 60 (2): 517-527 (1995) Martin Grohe: Bounded-Arity Hierarchies in Fixed-Point Logics. CSL 1993 : 150-164 1 [ 18 ] [ 36 ] 2 [ 38 ] 3 [ 15 ] [ 20 ] [ 26 ] [ 29 ] [ 33 ] [ 35 ] [ 37 ] 4 [ 13 ] [ 21 ] [ 26 ] [ 29 ] [ 34 ] [ 39 ] 5 [ 38 ] [ 39 ] 6 [ 18 ] [ 36 ] 7 [ 12 ] 8 [ 41 ] 9 [ 9 ] [ 16 ] [ 22 ] 10 [ 18 ] [ 19 ] [ 22 ] [ 31 ] [ 36 ] 11 [ 32 ] [ 42 ] 12 [ 27 ]  ©2004 Association for Computing Machinery |
