Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/fuin/fuin53.bht:"
@article{DBLP:journals/fuin/Aho02, author = {Isto Aho}, title = {New polynomial-time instances to various knapsack-type problems}, journal = {Fundam. Informaticae}, volume = {53}, number = {3-4}, pages = {199--228}, year = {2002}, url = {http://content.iospress.com/articles/fundamenta-informaticae/fi53-3-4-01}, timestamp = {Fri, 18 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/fuin/Aho02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fuin/AmadioBL02, author = {Roberto M. Amadio and G{\'{e}}rard Boudol and C{\'{e}}dric Lhoussaine}, title = {On message deliverability and non-uniform receptivity}, journal = {Fundam. Informaticae}, volume = {53}, number = {2}, pages = {105--129}, year = {2002}, url = {http://content.iospress.com/articles/fundamenta-informaticae/fi53-2-01}, timestamp = {Fri, 18 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/fuin/AmadioBL02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fuin/BaiV02, author = {Yun Bai and Vijay Varadharajan}, title = {Object Oriented Database with Authorization Policies}, journal = {Fundam. Informaticae}, volume = {53}, number = {3-4}, pages = {229--250}, year = {2002}, url = {http://content.iospress.com/articles/fundamenta-informaticae/fi53-3-4-02}, timestamp = {Fri, 18 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/fuin/BaiV02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fuin/BenferhatDLP02, author = {Salem Benferhat and Didier Dubois and Sylvain Lagrue and Odile Papini}, title = {Making revision reversible: an approach based on polynomials}, journal = {Fundam. Informaticae}, volume = {53}, number = {3-4}, pages = {251--280}, year = {2002}, url = {http://content.iospress.com/articles/fundamenta-informaticae/fi53-3-4-03}, timestamp = {Fri, 18 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/fuin/BenferhatDLP02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fuin/DemriS02, author = {St{\'{e}}phane Demri and Ulrike Sattler}, title = {Automata-Theoretic Decision Procedures for Information Logics}, journal = {Fundam. Informaticae}, volume = {53}, number = {1}, pages = {1--22}, year = {2002}, url = {http://content.iospress.com/articles/fundamenta-informaticae/fi53-1-01}, timestamp = {Fri, 18 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/fuin/DemriS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fuin/GeorgescuP02, author = {George Georgescu and Andrei Popescu}, title = {Concept lattices and similarity in non-commutative fuzzy logic}, journal = {Fundam. Informaticae}, volume = {53}, number = {1}, pages = {23--54}, year = {2002}, url = {http://content.iospress.com/articles/fundamenta-informaticae/fi53-1-02}, timestamp = {Fri, 18 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/fuin/GeorgescuP02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fuin/Haar02, author = {Stefan Haar}, title = {Probabilistic Cluster Unfoldings}, journal = {Fundam. Informaticae}, volume = {53}, number = {3-4}, pages = {281--314}, year = {2002}, url = {http://content.iospress.com/articles/fundamenta-informaticae/fi53-3-4-04}, timestamp = {Fri, 18 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/fuin/Haar02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fuin/Honkala02, author = {Juha Honkala}, title = {A new class of algebraic series having a decidable equivalence problem}, journal = {Fundam. Informaticae}, volume = {53}, number = {3-4}, pages = {315--320}, year = {2002}, url = {http://content.iospress.com/articles/fundamenta-informaticae/fi53-3-4-05}, timestamp = {Fri, 18 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/fuin/Honkala02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fuin/HwangLH02, author = {Min{-}Shiang Hwang and Cheng{-}Chi Lee and Shin{-}Jia Hwang}, title = {Cryptanalysis of the Hwang-Shi Proxy Signature Scheme}, journal = {Fundam. Informaticae}, volume = {53}, number = {2}, pages = {131--134}, year = {2002}, url = {http://content.iospress.com/articles/fundamenta-informaticae/fi53-2-02}, timestamp = {Fri, 18 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/fuin/HwangLH02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fuin/Jarvinen02, author = {Jouni J{\"{a}}rvinen}, title = {On the Structure of Rough Approximations}, journal = {Fundam. Informaticae}, volume = {53}, number = {2}, pages = {135--153}, year = {2002}, url = {http://content.iospress.com/articles/fundamenta-informaticae/fi53-2-03}, timestamp = {Fri, 18 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/fuin/Jarvinen02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fuin/Mani02, author = {A. Mani}, title = {Rough Equalities From Posets and Rough Difference Orders}, journal = {Fundam. Informaticae}, volume = {53}, number = {3-4}, pages = {321--333}, year = {2002}, url = {http://content.iospress.com/articles/fundamenta-informaticae/fi53-3-4-06}, timestamp = {Fri, 18 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/fuin/Mani02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fuin/Middelburg02, author = {Kees Middelburg}, title = {Process Algebra with Nonstandard Timing}, journal = {Fundam. Informaticae}, volume = {53}, number = {1}, pages = {55--77}, year = {2002}, url = {http://content.iospress.com/articles/fundamenta-informaticae/fi53-1-03}, timestamp = {Fri, 18 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/fuin/Middelburg02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fuin/MidelfartKNYSL02, author = {Herman Midelfart and Henryk Jan Komorowski and Kristin N{\o}rsett and Fekadu Yadetie and Arne K. Sandvik and Astrid L{\ae}greid}, title = {Learning Rough Set Classifiers from Gene Expressions and Clinical Data}, journal = {Fundam. Informaticae}, volume = {53}, number = {2}, pages = {155--183}, year = {2002}, url = {http://content.iospress.com/articles/fundamenta-informaticae/fi53-2-04}, timestamp = {Fri, 18 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/fuin/MidelfartKNYSL02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fuin/PolkowskiA02, author = {Lech Polkowski and Boleslaw Araszkiewicz}, title = {A Rough Set Approach to Estimating the Game Value and the Shapley Value from Data}, journal = {Fundam. Informaticae}, volume = {53}, number = {3-4}, pages = {335--343}, year = {2002}, url = {http://content.iospress.com/articles/fundamenta-informaticae/fi53-3-4-07}, timestamp = {Fri, 18 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/fuin/PolkowskiA02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fuin/SlowinskiSS02, author = {Krzysztof Slowinski and Jerzy Stefanowski and Dariusz Siwinski}, title = {Application of Rule Induction and Rough Sets to Verification of Magnetic Resonance Diagnosis}, journal = {Fundam. Informaticae}, volume = {53}, number = {3-4}, pages = {345--363}, year = {2002}, url = {http://content.iospress.com/articles/fundamenta-informaticae/fi53-3-4-08}, timestamp = {Fri, 18 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/fuin/SlowinskiSS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fuin/Terlikowski02a, author = {Tomasz Terlikowski}, title = {A logical approach to control. The concept of Inner Implication}, journal = {Fundam. Informaticae}, volume = {53}, number = {3-4}, pages = {391--397}, year = {2002}, url = {http://content.iospress.com/articles/fundamenta-informaticae/fi53-3-4-10}, timestamp = {Fri, 18 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/fuin/Terlikowski02a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fuin/TipleaMTE02, author = {Ferucio Laurentiu Tiplea and Erkki M{\"{a}}kinen and Dragos Trinca and Costel Enea}, title = {Characterization Results for Time-Varying Codes}, journal = {Fundam. Informaticae}, volume = {53}, number = {2}, pages = {185--198}, year = {2002}, url = {http://content.iospress.com/articles/fundamenta-informaticae/fi53-2-05}, timestamp = {Fri, 18 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/fuin/TipleaMTE02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fuin/Vlezak02, author = {Dominik Slezak}, title = {Approximate Entropy Reducts}, journal = {Fundam. Informaticae}, volume = {53}, number = {3-4}, pages = {365--390}, year = {2002}, url = {http://content.iospress.com/articles/fundamenta-informaticae/fi53-3-4-09}, timestamp = {Fri, 18 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/fuin/Vlezak02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fuin/ZhaoL02, author = {Xishun Zhao and Paolo Liberatore}, title = {Complexity of the Unique Extension Problem in Default Logic}, journal = {Fundam. Informaticae}, volume = {53}, number = {1}, pages = {79--104}, year = {2002}, url = {http://content.iospress.com/articles/fundamenta-informaticae/fi53-1-04}, timestamp = {Fri, 18 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/fuin/ZhaoL02.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.