| |
 |      |
                                         |
Note: Links lead to the DBLP on the Web. Reinhard Pichler 16 Georg Gottlob , Christoph Koch , Reinhard Pichler: The complexity of XPath query evaluation. PODS 2003 : 179-190 15 Georg Gottlob , Christoph Koch , Reinhard Pichler: XPath Processing in a Nutshell. SIGMOD Record 32 (1): 12-19 (2003) 14 Georg Gottlob , Christoph Koch , Reinhard Pichler: XPath processing in a nutshell. SIGMOD Record 32 (2): 21-27 (2003) 13 Reinhard Pichler: Explicit versus implicit representations of subsets of the Herbrand universe. TCS 290 (1): 1021-1056 (2003) 12 Bernhard Gramlich , Reinhard Pichler: Algorithmic Aspects of Herbrand Models Represented by Ground Atoms with Ground Equations. CADE 2002 : 241-259 11 Georg Gottlob , Christoph Koch , Reinhard Pichler: Efficient Algorithms for Processing XPath Queries. VLDB 2002 : 95-106 10 Georg Gottlob , Reinhard Pichler: Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width. ICALP 2001 : 708-719 9 Reinhard Pichler: Negation Elimination from Simple Equational Formulae. ICALP 2000 : 612-623 8 Reinhard Pichler: The Explicit Representability of Implicit Generalizations. RTA 2000 : 187-202 7 Reinhard Pichler: Speeding up Algorithms on Atomic Representations of Herbrand Models via New Redundancy Criteria. JSC 29 (2): 213-257 (2000) 6 Reinhard Pichler: Solving Equational Problems Efficiently. CADE 1999 : 97-111 5 Georg Gottlob , Reinhard Pichler: Working with Arms: Complexity Results on Atomic Representations of Herbrand Models. LICS 1999 : 306-315 4 Reinhard Pichler: On the Complexity of H-Subsumption. CSL 1998 : 355-371 3 Reinhard Pichler: Extending Decidable Clause Classes via Constraints. FTP (LNCS Selection) 1998 : 206-220 2 Reinhard Pichler: Completeness and Redundancy in Constrained Clause Logic. FTP (LNCS Selection) 1998 : 221-235 1 Reinhard Pichler: Algorithms on Atomic Representations of Herbrand Models. JELIA 1998 : 199-215  DiSC'03 © 2003 Association for Computing Machinery |
