Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Martin
    Last name: Grohe
    DBLP: g/MGrohe
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 100 of 194  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Christoph Berkholz, Martin Grohe.
    Linear Diophantine Equations, Group CSPs, and Graph Isomorphism.
    Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19 2017 (0) 2017
    Conference paper
    Martin Grohe, Martin Ritzert.
    Learning first-order definable concepts over structures of small degree.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Christoph Berkholz, Paul S. Bonsma, Martin Grohe.
    Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement.
    Theory Comput. Syst. 2017, Volume 60 (0) 2017
    Conference paper
    Yijia Chen, Martin Grohe, Bingkai Lin.
    The Hardness of Embedding Grids and Walls.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Martin Grohe, Stephan Kreutzer, Sebastian Siebertz.
    Deciding First-Order Properties of Nowhere Dense Graphs.
    J. ACM 2017, Volume 64 (0) 2017
    Conference paper
    Martin Grohe, Nicole Schweikardt.
    First-Order Query Evaluation with Cardinality Conditions.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Martin Grohe, Martin Ritzert.
    Learning first-order definable concepts over structures of small degree.
    32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017 2017 (0) 2017
    Conference paper
    Martin Grohe, Wied Pakusa.
    Descriptive complexity of linear equation systems and applications to propositional proof complexity.
    32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017 2017 (0) 2017
    Conference paper
    Martin Grohe, Christof Löding, Martin Ritzert.
    Learning MSO-definable hypotheses on string.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Martin Grohe.
    Tangles and Connectivity in Graphs.
    Language and Automata Theory and Applications - 10th International Conference, LATA 2016, Prague, Czech Republic, March 14-18, 2016, Proceedings 2016 (0) 2016
    Conference paper
    Martin Grohe.
    Tangles and Connectivity in Graphs.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Martin Grohe.
    Quasi-4-Connected Components.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Martin Grohe.
    Tangled up in Blue (A Survey on Connectivity, Decompositions, and Tangles).
    CoRR 2016, Volume 0 (0) 2016
    Journal article
    Michael Elberfeld, Marlin Frickenschmidt, Martin Grohe.
    Order Invariance on Decomposable Structures.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Martin Grohe, Pascal Schweitzer.
    Computing with Tangles.
    SIAM J. Discrete Math. 2016, Volume 30 (0) 2016
    Conference paper
    Christoph Berkholz, Martin Grohe.
    Linear Diophantine Equations, Group CSPs, and Graph Isomorphism.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Martin Grohe.
    Quasi-4-Connected Components.
    43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy 2016 (0) 2016
    Conference paper
    Michael Elberfeld, Marlin Frickenschmidt, Martin Grohe.
    Order Invariance on Decomposable Structures.
    Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, New York, NY, USA, July 5-8, 2016 2016 (0) 2016
    Conference paper
    Michael Elberfeld, Martin Grohe, Till Tantau.
    Where First-Order and Monadic Second-Order Logic Coincide.
    ACM Trans. Comput. Log. 2015, Volume 17 (0) 2016
    Journal article
    Christoph Berkholz, Martin Grohe.
    Limitations of Algebraic Approaches to Graph Isomorphism Testing.
    CoRR 2015, Volume 0 (0) 2015
    Journal article
    Martin Grohe, Dániel Marx.
    Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs.
    SIAM J. Comput. 2015, Volume 44 (0) 2015
    Journal article
    Martin Grohe, Pascal Schweitzer.
    Computing with Tangles.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Martin Grohe, Pascal Schweitzer.
    Isomorphism Testing for Graphs of Bounded Rank Width.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Martin Grohe, Pascal Schweitzer.
    Computing with Tangles.
    Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015 2015 (0) 2015
    Conference paper
    Christoph Berkholz, Martin Grohe.
    Limitations of Algebraic Approaches to Graph Isomorphism Testing.
    Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I 2015 (0) 2015
    Conference paper
    Martin Grohe, Martin Otto 0001.
    Pebble Games and linear equations.
    J. Symb. Log. 2015, Volume 80 (0) 2015
    Conference paper
    Erich Grädel, Martin Grohe.
    Is Polynomial Time Choiceless?
    Fields of Logic and Computation II - Essays Dedicated to Yuri Gurevich on the Occasion of His 75th Birthday 2015 (0) 2015
    Journal article
    Christoph Berkholz, Paul S. Bonsma, Martin Grohe.
    Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Armin Biere, Vijay Ganesh, Martin Grohe, Jakob Nordström, R. Ryan Williams.
    Theory and Practice of SAT Solving (Dagstuhl Seminar 15171).
    Dagstuhl Reports 2015, Volume 5 (0) 2015
    Conference paper
    Martin Grohe, Pascal Schweitzer.
    Isomorphism Testing for Graphs of Bounded Rank Width.
    IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015 2015 (0) 2015
    Conference paper
    Martin Grohe, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, Konstantinos Stavropoulos.
    Colouring and Covering Nowhere Dense Graphs.
    Graph-Theoretic Concepts in Computer Science - 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers 2016 (0) 2015
    Conference paper
    André Frochaux, Martin Grohe, Nicole Schweikardt.
    Monadic Datalog Containment on Trees.
    CoRR 2014, Volume 0 (0) 2014
    Conference paper
    Martin Grohe.
    Algorithmic Meta Theorems for Sparse Graph Classes.
    Computer Science - Theory and Applications - 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings 2014 (0) 2014
    Conference paper
    Martin Grohe, Stephan Kreutzer, Sebastian Siebertz.
    Deciding first-order properties of nowhere dense graphs.
    Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014 2014 (0) 2014
    Conference paper
    André Frochaux, Martin Grohe, Nicole Schweikardt.
    Monadic Datalog Containment on Trees.
    Proceedings of the 8th Alberto Mendelzon Workshop on Foundations of Data Management, Cartagena de Indias, Colombia, June 4-6, 2014. 2014 (0) 2014
    Conference paper
    Kristian Kersting, Martin Mladenov, Roman Garnett, Martin Grohe.
    Power Iterated Color Refinement.
    Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, July 27 -31, 2014, Québec City, Québec, Canada. 2014 (0) 2014
    Conference paper
    Martin Grohe, Kristian Kersting, Martin Mladenov, Erkal Selman.
    Dimension Reduction via Colour Refinement.
    Algorithms - ESA 2014 - 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings 2014 (0) 2014
    Conference paper
    Faried Abu Zaid, Erich Grädel, Martin Grohe, Wied Pakusa.
    Choiceless Polynomial Time on Structures with Small Abelian Colour Classes.
    Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part I 2014 (0) 2014
    Journal article
    Martin Grohe, Dániel Marx.
    Constraint Solving via Fractional Edge Covers.
    ACM Transactions on Algorithms 2014, Volume 11 (0) 2014
    Conference paper
    Martin Grohe.
    Colour Refinement: A Simple Partitioning Algorithm with Applications From Graph Isomorphism Testing to Machine Learning (Invited Talk).
    34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, December 15-17, 2014, New Delhi, India 2014 (0) 2014
    Conference paper
    Martin Grohe.
    Database Theory Column Report on PODS 2014.
    SIGACT News 2014, Volume 45 (0) 2014
    Conference paper
    Martin Grohe, Ken-ichi Kawarabayashi, Bruce A. Reed.
    A Simple Algorithm for the Graph Minor Decomposition - Logic meets Structural Graph Theory.
    Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013 2013 (0) 2013
    Journal article
    Martin Grohe, Kristian Kersting, Martin Mladenov, Erkal Selman.
    Dimension Reduction via Colour Refinement.
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Martin Grohe.
    Logical and Structural Approaches to the Graph Isomorphism Problem.
    Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings 2013 (0) 2013
    Conference paper
    Christoph Berkholz, Paul S. Bonsma, Martin Grohe.
    Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement.
    Algorithms - ESA 2013 - 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings 2013 (0) 2013
    Conference paper
    Albert Atserias, Martin Grohe, Dániel Marx.
    Size Bounds and Query Plans for Relational Joins.
    SIAM J. Comput. 2013, Volume 42 (0) 2013
    Journal article
    Martin Grohe, Stephan Kreutzer, Sebastian Siebertz.
    Deciding first-order properties of nowhere dense graphs.
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Martin Grohe.
    Bounds and Algorithms for Joins via Fractional Edge Covers.
    In Search of Elegance in the Theory and Practice of Computation - Essays Dedicated to Peter Buneman 2013 (0) 2013
    Conference paper
    Martin Grohe, Stephan Kreutzer, Sebastian Siebertz.
    Characterisations of Nowhere Dense Graphs (Invited Talk).
    IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2013, December 12-14, 2013, Guwahati, India 2013 (0) 2013
    Conference paper
    Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx.
    Enumerating homomorphisms.
    J. Comput. Syst. Sci. 2012, Volume 78 (0) 2012
    Conference paper
    Martin Grohe, Dániel Marx.
    Structure theorem and isomorphism test for graphs with excluded topological subgraphs.
    Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19 - 22, 2012 2012 (0) 2012
    Conference paper
    Michael Elberfeld, Martin Grohe, Till Tantau.
    Where First-Order and Monadic Second-Order Logic Coincide.
    Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, LICS 2012, Dubrovnik, Croatia, June 25-28, 2012 2012 (0) 2012
    Conference paper
    Martin Grohe, Martin Otto 0001.
    Pebble Games and Linear Equations.
    Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL, CSL 2012, September 3-6, 2012, Fontainebleau, France 2012 (0) 2012
    Conference paper
    Michael Elberfeld, Martin Grohe, Till Tantau.
    Where First-Order and Monadic Second-Order Logic Coincide
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Martin Grohe, Martin Otto 0001.
    Pebble Games and Linear Equations
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Martin Grohe.
    Fixed-point definability and polynomial time on graphs with excluded minors.
    J. ACM 2012, Volume 59 (0) 2012
    Conference paper
    Martin Grohe.
    Structural and logical approaches to the graph isomorphism problem.
    Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012 2012 (0) 2012
    Conference paper
    Martin Grohe, Berit Grußien, André Hernich, Bastian Laubner.
    L-Recursion and a new Logic for Logarithmic Space
    Logical Methods in Computer Science 2009, Volume 9 (0) 2012
    Journal article
    Martin Grohe, Marc Thurley.
    Counting Homomorphisms and Partition Functions
    CoRR 2011, Volume 0 (0) 2011
    Conference paper
    Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan.
    Finding topological subgraphs is fixed-parameter tractable.
    Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011 2011 (0) 2011
    Conference paper
    Martin Grohe.
    From polynomial time queries to graph structure theory.
    Commun. ACM 2011, Volume 54 (0) 2011
    Journal article
    Kord Eickmeyer, Martin Grohe.
    Randomisation and Derandomisation in Descriptive Complexity Theory
    CoRR 2011, Volume 0 (0) 2011
    Conference paper
    Martin Grohe, Michal Koucký, Rüdiger Reischuk, Dieter van Melkebeek.
    Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121).
    Dagstuhl Reports 2011, Volume 1 (0) 2011
    Conference paper
    Martin Grohe, Berit Grußien, André Hernich, Bastian Laubner.
    L-Recursion and a new Logic for Logarithmic Space.
    Computer Science Logic, 25th International Workshop / 20th Annual Conference of the EACSL, CSL 2011, September 12-15, 2011, Bergen, Norway, Proceedings 2011 (0) 2011
    Conference paper
    Martin Grohe, Dániel Marx.
    Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs
    CoRR 2011, Volume 0 (0) 2011
    Conference paper
    Martin Grohe.
    From polynomial time queries to graph structure theory.
    Database Theory - ICDT 2010, 13th International Conference, Lausanne, Switzerland, March 23-25, 2010, Proceedings 2010 (0) 2010
    Conference paper
    Kord Eickmeyer, Martin Grohe.
    Randomisation and Derandomisation in Descriptive Complexity Theory.
    Computer Science Logic, 24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010. Proceedings 2010 (0) 2010
    Conference paper
    Martin Grohe.
    Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs.
    Fields of Logic and Computation, Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday 2010 (0) 2010
    Conference paper
    Hubie Chen, Martin Grohe.
    Constraint satisfaction with succinctly specified relations.
    J. Comput. Syst. Sci. 2010, Volume 76 (0) 2010
    Conference paper
    Martin Grohe.
    Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors.
    Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010, 11-14 July 2010, Edinburgh, United Kingdom 2010 (0) 2010
    Journal article
    Kord Eickmeyer, Martin Grohe.
    Randomisation and Derandomisation in Descriptive Complexity Theory.
    Electronic Colloquium on Computational Complexity (ECCC) 2010, Volume 17 (0) 2010
    Journal article
    Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan.
    Finding topological subgraphs is fixed-parameter tractable
    CoRR 2010, Volume 0 (0) 2010
    Conference paper
    Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley.
    A Complexity Dichotomy for Partition Functions with Mixed Signs.
    SIAM J. Comput. 2009, Volume 39 (0) 2010
    Journal article
    Martin Grohe.
    Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
    CoRR 2010, Volume 0 (0) 2010
    Conference paper
    Andrei A. Bulatov, Martin Grohe, Phokion G. Kolaitis, Andrei A. Krokhin.
    09441 Abstracts Collection - The Constraint Satisfaction Problem: Complexity and Approximability.
    The Constraint Satisfaction Problem: Complexity and Approximability, 25.10. - 30.10.2009 2009 (0) 2009
    Conference paper
    Andrei A. Bulatov, Martin Grohe, Phokion G. Kolaitis, Andrei A. Krokhin.
    09441 Executive Summary - The Constraint Satisfaction Problem: Complexity and Approximability.
    The Constraint Satisfaction Problem: Complexity and Approximability, 25.10. - 30.10.2009 2009 (0) 2009
    Conference paper
    Martin Grohe.
    Fixed-Point Definability and Polynomial Time.
    Computer Science Logic, 23rd international Workshop, CSL 2009, 18th Annual Conference of the EACSL, Coimbra, Portugal, September 7-11, 2009. Proceedings 2009 (0) 2009
    Conference paper
    Anuj Dawar, Martin Grohe, Bjarki Holm, Bastian Laubner.
    Logics with Rank Operators.
    Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, LICS 2009, 11-14 August 2009, Los Angeles, CA, USA 2009 (0) 2009
    Conference paper
    Martin Grohe, Götz Schwandtner.
    The Complexity of Datalog on Linear Orders
    Logical Methods in Computer Science 2007, Volume 5 (0) 2009
    Conference paper
    Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx.
    Enumerating Homomorphisms
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Martin Grohe, André Hernich, Nicole Schweikardt.
    Lower bounds for processing data with few random accesses to external memory.
    J. ACM 2009, Volume 56 (0) 2009
    Conference paper
    Martin Grohe, Dániel Marx.
    On tree width, bramble size, and expansion.
    J. Comb. Theory, Ser. B 2009, Volume 99 (0) 2009
    Conference paper
    Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, Jan Van den Bussche.
    Database Query Processing Using Finite Cursor Machines.
    Theory Comput. Syst. 2009, Volume 44 (0) 2009
    Conference paper
    Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx.
    Enumerating Homomorphisms.
    26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings 2009 (0) 2009
    Conference paper
    Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley.
    A Complexity Dichotomy for Partition Functions with Mixed Signs.
    26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings 2009 (0) 2009
    Conference paper
    Martin Grohe.
    Logic, graphs, and algorithms.
    Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]. 2008 (0) 2008
    Conference paper
    Kord Eickmeyer, Martin Grohe, Magdalena Grüber.
    Approximation of Natural W[P]-Complete Minimisation Problems Is Hard.
    Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA 2008 (0) 2008
    Conference paper
    Albert Atserias, Martin Grohe, Dániel Marx.
    Size Bounds and Query Plans for Relational Joins.
    49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA 2008 (0) 2008
    Conference paper
    Manuel Bodirsky, Martin Grohe.
    Non-dichotomies in Constraint Satisfaction Complexity.
    Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming Track C: Security and Cryptography Foundations 2008 (0) 2008
    Conference paper
    Martin Grohe.
    The Quest for a Logic Capturing PTIME.
    Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA 2008 (0) 2008
    Conference paper
    Martin Grohe.
    Definable Tree Decompositions.
    Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA 2008 (0) 2008
    Conference paper
    Isolde Adler, Martin Grohe, Stephan Kreutzer.
    Computing excluded minors.
    Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008 2008 (0) 2008
    Conference paper
    Martin Grohe.
    Algorithmic Meta Theorems.
    Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers 2008 (0) 2008
    Conference paper
    Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley.
    A complexity dichotomy for partition functions with mixed signs
    CoRR 2008, Volume 0 (0) 2008
    Conference paper
    Albert Atserias, Anuj Dawar, Martin Grohe.
    Preservation under Extensions on Well-Behaved Finite Structures.
    SIAM J. Comput. 2008, Volume 38 (0) 2008
    Conference paper
    Martin Grohe, Martin Hyland, Johann A. Makowsky, Damian Niwinski.
    The Ackermann Award 2007.
    Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Martin Grohe, Magdalena Grüber.
    Parameterized Approximability of the Disjoint Cycle Problem.
    Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt.
    Model Theory Makes Formulas Large.
    Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, Jan Van den Bussche.
    Database Query Processing Using Finite Cursor Machines.
    Database Theory - ICDT 2007, 11th International Conference, Barcelona, Spain, January 10-12, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Anuj Dawar, Martin Grohe, Stephan Kreutzer.
    Locally Excluding a Minor.
    22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 10-12 July 2007, Wroclaw, Poland, Proceedings 2007 (0) 2007
    Show item 1 to 100 of 194  

    Your query returned 194 matches in the database.