default search action
Search dblp for Publications
export results for "toc:db/journals/iandc/iandc178.bht:"
@article{DBLP:journals/iandc/AriasK02, author = {Marta Arias and Roni Khardon}, title = {Learning Closed Horn Expressions}, journal = {Inf. Comput.}, volume = {178}, number = {1}, pages = {214--240}, year = {2002}, url = {https://doi.org/10.1006/inco.2002.3162}, doi = {10.1006/INCO.2002.3162}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/AriasK02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/BaaderT02, author = {Franz Baader and Cesare Tinelli}, title = {Deciding the Word Problem in the Union of Equational Theories}, journal = {Inf. Comput.}, volume = {178}, number = {2}, pages = {346--390}, year = {2002}, url = {https://doi.org/10.1006/inco.2001.3118}, doi = {10.1006/INCO.2001.3118}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/BaaderT02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/BestDK02, author = {Eike Best and Raymond R. Devillers and Maciej Koutny}, title = {The Box Algebra = Petri Nets + Process Expressions}, journal = {Inf. Comput.}, volume = {178}, number = {1}, pages = {44--100}, year = {2002}, url = {https://doi.org/10.1006/inco.2002.3117}, doi = {10.1006/INCO.2002.3117}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/BestDK02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/BolligSW02, author = {Beate Bollig and Martin Sauerhoff and Ingo Wegener}, title = {On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs}, journal = {Inf. Comput.}, volume = {178}, number = {1}, pages = {263--278}, year = {2002}, url = {https://doi.org/10.1006/inco.2002.3174}, doi = {10.1006/INCO.2002.3174}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/BolligSW02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/Courcelle02, author = {Bruno Courcelle}, title = {A Monadic Second-Order Definition of the Structure of Convex Hypergraphs}, journal = {Inf. Comput.}, volume = {178}, number = {2}, pages = {391--411}, year = {2002}, url = {https://doi.org/10.1006/inco.2002.3130}, doi = {10.1006/INCO.2002.3130}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/Courcelle02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/Durand02, author = {Arnaud Durand}, title = {Linear Time and the Power of One First-Order Universal Quantifier}, journal = {Inf. Comput.}, volume = {178}, number = {1}, pages = {12--22}, year = {2002}, url = {https://doi.org/10.1006/inco.2002.3027}, doi = {10.1006/INCO.2002.3027}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/Durand02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/GeserMOZ02, author = {Alfons Geser and Aart Middeldorp and Enno Ohlebusch and Hans Zantema}, title = {Relative Undecidability in Term Rewriting: I. The Termination Hierarchy}, journal = {Inf. Comput.}, volume = {178}, number = {1}, pages = {101--131}, year = {2002}, url = {https://doi.org/10.1006/inco.2002.3120}, doi = {10.1006/INCO.2002.3120}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/GeserMOZ02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/GeserMOZ02a, author = {Alfons Geser and Aart Middeldorp and Enno Ohlebusch and Hans Zantema}, title = {Relative Undecidability in Term Rewriting: {II.} The Confluence Hierarchy}, journal = {Inf. Comput.}, volume = {178}, number = {1}, pages = {132--148}, year = {2002}, url = {https://doi.org/10.1006/inco.2002.3150}, doi = {10.1006/INCO.2002.3150}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/GeserMOZ02a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/GoldmannR02, author = {Mikael Goldmann and Alexander Russell}, title = {The Complexity of Solving Equations over Finite Groups}, journal = {Inf. Comput.}, volume = {178}, number = {1}, pages = {253--262}, year = {2002}, url = {https://doi.org/10.1006/inco.2002.3173}, doi = {10.1006/INCO.2002.3173}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/GoldmannR02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/Groote02, author = {Philippe de Groote}, title = {On the Strong Normalisation of Intuitionistic Natural Deduction with Permutation-Conversions}, journal = {Inf. Comput.}, volume = {178}, number = {2}, pages = {441--464}, year = {2002}, url = {https://doi.org/10.1006/inco.2002.3147}, doi = {10.1006/INCO.2002.3147}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/Groote02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/HofbauerH02, author = {Dieter Hofbauer and Maria Huber}, title = {Test Sets for the Universal and Existential Closure of Regular Tree Languages}, journal = {Inf. Comput.}, volume = {178}, number = {2}, pages = {465--498}, year = {2002}, url = {https://doi.org/10.1006/inco.2002.3156}, doi = {10.1006/INCO.2002.3156}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/HofbauerH02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/HonsellS02, author = {Furio Honsell and Donald Sannella}, title = {Prelogical Relations}, journal = {Inf. Comput.}, volume = {178}, number = {1}, pages = {23--43}, year = {2002}, url = {https://doi.org/10.1006/inco.2002.3115}, doi = {10.1006/INCO.2002.3115}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/HonsellS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/Kurata02, author = {Toshihiko Kurata}, title = {Intersection and Singleton Type Assignment Characterizing Finite B{\"{o}}hm-Trees}, journal = {Inf. Comput.}, volume = {178}, number = {1}, pages = {1--11}, year = {2002}, url = {https://doi.org/10.1006/inco.2002.2907}, doi = {10.1006/INCO.2002.2907}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/Kurata02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/Lucas02, author = {Salvador Lucas}, title = {Context-Sensitive Rewriting Strategies}, journal = {Inf. Comput.}, volume = {178}, number = {1}, pages = {294--343}, year = {2002}, url = {https://doi.org/10.1006/inco.2002.3176}, doi = {10.1006/INCO.2002.3176}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/Lucas02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/Marcinkowski02, author = {Jerzy Marcinkowski}, title = {The [exist]*[forall]* Part of the Theory of Ground Term Algebra Modulo an {AC} Symbol is Undecidable}, journal = {Inf. Comput.}, volume = {178}, number = {2}, pages = {412--421}, year = {2002}, url = {https://doi.org/10.1006/inco.2002.3145}, doi = {10.1006/INCO.2002.3145}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/Marcinkowski02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/NagayaT02, author = {Takashi Nagaya and Yoshihito Toyama}, title = {Decidability for Left-Linear Growing Term Rewriting Systems}, journal = {Inf. Comput.}, volume = {178}, number = {2}, pages = {499--514}, year = {2002}, url = {https://doi.org/10.1006/inco.2002.3157}, doi = {10.1006/INCO.2002.3157}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/NagayaT02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/NarendranR02, author = {Paliath Narendran and Micha{\"{e}}l Rusinowitch}, title = {Guest Editorial}, journal = {Inf. Comput.}, volume = {178}, number = {2}, pages = {345}, year = {2002}, url = {https://doi.org/10.1006/inco.2002.3159}, doi = {10.1006/INCO.2002.3159}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/NarendranR02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/NeergaardS02, author = {Peter M{\o}ller Neergaard and Morten Heine S{\o}rensen}, title = {Conservation and Uniform Normalization in Lambda Calculi with Erasing Reductions}, journal = {Inf. Comput.}, volume = {178}, number = {1}, pages = {149--179}, year = {2002}, url = {https://doi.org/10.1006/inco.2002.3153}, doi = {10.1006/INCO.2002.3153}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/NeergaardS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/NieuwenhuisR02, author = {Robert Nieuwenhuis and Jos{\'{e}} Miguel Rivero}, title = {Practical Algorithms for Deciding Path Ordering Constraint Satisfaction}, journal = {Inf. Comput.}, volume = {178}, number = {2}, pages = {422--440}, year = {2002}, url = {https://doi.org/10.1006/inco.2002.3146}, doi = {10.1006/INCO.2002.3146}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iandc/NieuwenhuisR02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/PnueliRSS02, author = {Amir Pnueli and Yoav Rodeh and Ofer Strichman and Michael Siegel}, title = {The Small Model Property: How Small Can It Be?}, journal = {Inf. Comput.}, volume = {178}, number = {1}, pages = {279--293}, year = {2002}, url = {https://doi.org/10.1006/inco.2002.3175}, doi = {10.1006/INCO.2002.3175}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/PnueliRSS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/Rubio02, author = {Albert Rubio}, title = {A Fully Syntactic {AC-RPO}}, journal = {Inf. Comput.}, volume = {178}, number = {2}, pages = {515--533}, year = {2002}, url = {https://doi.org/10.1006/inco.2002.3158}, doi = {10.1006/INCO.2002.3158}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/Rubio02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/Touzet02, author = {H{\'{e}}l{\`{e}}ne Touzet}, title = {A Characterisation of Multiply Recursive Functions with Higman's Lemma}, journal = {Inf. Comput.}, volume = {178}, number = {2}, pages = {534--544}, year = {2002}, url = {https://doi.org/10.1006/inco.2002.3160}, doi = {10.1006/INCO.2002.3160}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/Touzet02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/UlidowskiP02, author = {Irek Ulidowski and Iain C. C. Phillips}, title = {Ordered {SOS} Process Languages for Branching and Eager Bisimulations}, journal = {Inf. Comput.}, volume = {178}, number = {1}, pages = {180--213}, year = {2002}, url = {https://doi.org/10.1006/inco.2002.3161}, doi = {10.1006/INCO.2002.3161}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/UlidowskiP02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/VyuginV02, author = {Michael V. Vyugin and Vladimir V. V'yugin}, title = {On Complexity of Easy Predictable Sequences}, journal = {Inf. Comput.}, volume = {178}, number = {1}, pages = {241--252}, year = {2002}, url = {https://doi.org/10.1006/inco.2002.3164}, doi = {10.1006/INCO.2002.3164}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/VyuginV02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.