Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/ijfcs/ijfcs11.bht:"
download as .bib file
@article{DBLP:journals/ijfcs/AccorneroAV00,
author = {Anna Accornero and
Massimo Ancona and
Sonia Varini},
title = {All Separating Triangles in a Plane Graph Can Be Optimally "Broken"
in Polynomial Time},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {3},
pages = {405--421},
year = {2000},
url = {https://doi.org/10.1142/S012905410000020X},
doi = {10.1142/S012905410000020X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/AccorneroAV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BerryBC00,
author = {Anne Berry and
Jean Paul Bordat and
Olivier Cogis},
title = {Generating All the Minimal Separators of a Graph},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {3},
pages = {397--403},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000211},
doi = {10.1142/S0129054100000211},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/BerryBC00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BonizzoniVM00,
author = {Paola Bonizzoni and
Gianluca Della Vedova and
Giancarlo Mauri},
title = {Approximating the Maximum Isomorphic Agreement Subtree is Hard},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {4},
pages = {579--590},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000363},
doi = {10.1142/S0129054100000363},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/BonizzoniVM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BourgeoisT00,
author = {Anu G. Bourgeois and
Jerry L. Trahan},
title = {Relating Two-Dimensional Reconfigurable Meshes with Optically Pipelined
Buses},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {4},
pages = {553--571},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000314},
doi = {10.1142/S0129054100000314},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/BourgeoisT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/ChoS00,
author = {Seonghun Cho and
Sartaj Sahni},
title = {A New Weight Balanced Binary Search Tree},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {3},
pages = {485--513},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000296},
doi = {10.1142/S0129054100000296},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/ChoS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Csuhaj-VarjuMMV00,
author = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Carlos Mart{\'{\i}}n{-}Vide and
Victor Mitrana and
Gy{\"{o}}rgy Vaszil},
title = {Parallel Communicating Pushdown Automata Systems},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {4},
pages = {633--650},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000338},
doi = {10.1142/S0129054100000338},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Csuhaj-VarjuMMV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/DongZ00,
author = {Guozhu Dong and
Louxin Zhang},
title = {Separating Auxiliary Arity Hierarchy of First-Order Incremental Evaluation
Systems Using (3k+1)-ary Input Relations},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {4},
pages = {573--578},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000302},
doi = {10.1142/S0129054100000302},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/DongZ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/GanzingerJV00,
author = {Harald Ganzinger and
Florent Jacquemard and
Margus Veanes},
title = {Rigid Reachability, The Non-Symmetric Form of Rigid E-Unification},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {1},
pages = {3--27},
year = {2000},
url = {https://doi.org/10.1142/S012905410000003X},
doi = {10.1142/S012905410000003X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/GanzingerJV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/GolumbicR00,
author = {Martin Charles Golumbic and
Udi Rotics},
title = {On the Clique-Width of Some Perfect Graph Classes},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {3},
pages = {423--443},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000260},
doi = {10.1142/S0129054100000260},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/GolumbicR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/HalldorssonKT00,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Jan Kratochv{\'{\i}}l and
Jan Arne Telle},
title = {Mod-2 Independence and Domination in Graphs},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {3},
pages = {355--363},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000272},
doi = {10.1142/S0129054100000272},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/HalldorssonKT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Hashimoto00,
author = {Masatomo Hashimoto},
title = {First-Class Contexts in {ML}},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {1},
pages = {65--87},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000053},
doi = {10.1142/S0129054100000053},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Hashimoto00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/HempelW00,
author = {Harald Hempel and
Gerd Wechsung},
title = {The Operators min and max on the Polynomial Hierarchy},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {2},
pages = {315--342},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000181},
doi = {10.1142/S0129054100000181},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/HempelW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Johansson00,
author = {{\"{O}}jvind Johansson},
title = {NLC\({}_{\mbox{2}}\)-Decomposition in Polynomial Time},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {3},
pages = {373--395},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000223},
doi = {10.1142/S0129054100000223},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Johansson00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/KoblerL00,
author = {Johannes K{\"{o}}bler and
Wolfgang Lindner},
title = {Oracles in S\({}^{\mbox{p}}\)\({}_{\mbox{2}}\) are Sufficient for
Exact Learning},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {4},
pages = {615--632},
year = {2000},
url = {https://doi.org/10.1142/S012905410000034X},
doi = {10.1142/S012905410000034X},
timestamp = {Sun, 05 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/KoblerL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/KosubSV00,
author = {Sven Kosub and
Heinz Schmitz and
Heribert Vollmer},
title = {Uniform Characterizations of Complexity Classes of Functions},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {4},
pages = {525--551},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000326},
doi = {10.1142/S0129054100000326},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/KosubSV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Li00,
author = {Keqin Li},
title = {A Method for Evaluating the Expected Load of Dynamic Tree Embeddings
in Hypercubes},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {2},
pages = {207--230},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000132},
doi = {10.1142/S0129054100000132},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Li00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/LiebersWW00,
author = {Annegret Liebers and
Dorothea Wagner and
Karsten Weihe},
title = {On the Hardness of Recognizing Bundles in Time Table Graphs},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {3},
pages = {467--484},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000235},
doi = {10.1142/S0129054100000235},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/LiebersWW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/MahapatraD00,
author = {Nihar R. Mahapatra and
Shantanu Dutt},
title = {Random Seeking: {A} General, Efficient, and Informed Randomized Scheme
for Dynamic Load Balancing},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {2},
pages = {231--246},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000144},
doi = {10.1142/S0129054100000144},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/MahapatraD00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Meyden00,
author = {Ron van der Meyden},
title = {Predicate Boundedness of Linear Monadic Datalog is in {PSPACE}},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {4},
pages = {591--612},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000351},
doi = {10.1142/S0129054100000351},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Meyden00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/MullerN00,
author = {Martin M{\"{u}}ller and
Susumu Nishimura},
title = {Type Inference for First-Class Messages with Feature Constraints},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {1},
pages = {29--63},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000041},
doi = {10.1142/S0129054100000041},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/MullerN00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/NikoletseasPSY00,
author = {Sotiris E. Nikoletseas and
Krishna V. Palem and
Paul G. Spirakis and
Moti Yung},
title = {Connectivity Properties in Random Regular Graphs with Edge Faults},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {2},
pages = {247--262},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000156},
doi = {10.1142/S0129054100000156},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/NikoletseasPSY00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/NishimuraRT00,
author = {Naomi Nishimura and
Prabhakar Ragde and
Dimitrios M. Thilikos},
title = {Finding Smallest Supertrees Under Minor Containment},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {3},
pages = {445--465},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000259},
doi = {10.1142/S0129054100000259},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/NishimuraRT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Ogata00,
author = {Ichiro Ogata},
title = {Constructive Classical Logic as CPS-Calculus},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {1},
pages = {89--112},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000065},
doi = {10.1142/S0129054100000065},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Ogata00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Okadome00,
author = {Takeshi Okadome},
title = {Some Sufficient Conditions of Learnability in the Limit From Positive
Data},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {3},
pages = {515--524},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000284},
doi = {10.1142/S0129054100000284},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Okadome00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Paun00,
author = {Gheorghe Paun},
title = {Computing with Membranes {(P} Systems): {A} Variant},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {1},
pages = {167--181},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000090},
doi = {10.1142/S0129054100000090},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Paun00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/PerkovicR00,
author = {Ljubomir Perkovic and
Bruce A. Reed},
title = {An Improved Algorithm for Finding Tree Decompositions of Small Width},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {3},
pages = {365--371},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000247},
doi = {10.1142/S0129054100000247},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/PerkovicR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/RajasekaranS00,
author = {Sanguthevar Rajasekaran and
Sartaj Sahni},
title = {Special Issue on Randomized Computing},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {2},
pages = {205},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000120},
doi = {10.1142/S0129054100000120},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/RajasekaranS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Rosenberg00,
author = {Arnold L. Rosenberg},
title = {Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations
{II:} On Maximizing Guaranteed Output},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {1},
pages = {183--204},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000107},
doi = {10.1142/S0129054100000107},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Rosenberg00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Roversi00,
author = {Luca Roversi},
title = {Light Affine Logic as a Programming Language: {A} First Contribution},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {1},
pages = {113--152},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000077},
doi = {10.1142/S0129054100000077},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Roversi00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/ShyamasundarR00,
author = {R. K. Shyamasundar and
S. Ramesh},
title = {Languages for Reactive Specifications: Synchrony Vs Asynchrony},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {2},
pages = {283--314},
year = {2000},
url = {https://doi.org/10.1142/S012905410000017X},
doi = {10.1142/S012905410000017X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/ShyamasundarR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Sun00,
author = {Hung{-}Min Sun},
title = {On the Dealer's Randomness Required in Perfect Secret Sharing Schemes
with Access Structures of Constant Rank},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {2},
pages = {263--281},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000168},
doi = {10.1142/S0129054100000168},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Sun00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/YangSMSY00,
author = {Zhonghua Yang and
Chengzheng Sun and
Yuan Miao and
Abdul Sattar and
Yanyan Yang},
title = {Guaranteed Mutually Consistent Checkpointing in Distributed Computations},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {1},
pages = {153--166},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000089},
doi = {10.1142/S0129054100000089},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/YangSMSY00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/ZantemaB00,
author = {Hans Zantema and
Hans L. Bodlaender},
title = {Finding Small Equivalent Decision Trees is Hard},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {2},
pages = {343--354},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000193},
doi = {10.1142/S0129054100000193},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/ZantemaB00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-05-01 01:36 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
