@article{Ganzinger-Jacquemard-Veanes/00,
AUTHOR = {Ganzinger, Harald and Jacquemard, Florent and Veanes, Margus},
TITLE = {Rigid reachability the non-symmetric form of rigid $E$-unification},
JOURNAL = {International Journal of Foundations of Computer Science},
VOLUME = {11},
NUMBER = {1},
PAGES = {3-27},
YEAR = {2000},
PUBLISHER = {World Scientific Publishing Co.},
ADDRESS = {Singapore-New Jersey-London-Hong Kong-Bangalore},
}
@article{Muller-Nishimura/00,
AUTHOR = {M{\"u}ller, Martin and Nishimura, Susumu},
TITLE = {Type inference for first-class messages with feature constraints},
JOURNAL = {International Journal of Foundations of Computer Science},
VOLUME = {11},
NUMBER = {1},
PAGES = {29-63},
YEAR = {2000},
PUBLISHER = {World Scientific Publishing Co.},
ADDRESS = {Singapore-New Jersey-London-Hong Kong-Bangalore},
}
@article{Hashimoto/00,
AUTHOR = {Hashimoto, Masatomo},
TITLE = {First-class contexts in ML},
JOURNAL = {International Journal of Foundations of Computer Science},
VOLUME = {11},
NUMBER = {1},
PAGES = {65-87},
YEAR = {2000},
PUBLISHER = {World Scientific Publishing Co.},
ADDRESS = {Singapore-New Jersey-London-Hong Kong-Bangalore},
}
@article{Ogata/00,
AUTHOR = {Ogata, Ichiro},
TITLE = {Constructive classical logic as CPS-calculus},
JOURNAL = {International Journal of Foundations of Computer Science},
VOLUME = {11},
NUMBER = {1},
PAGES = {89-112},
YEAR = {2000},
PUBLISHER = {World Scientific Publishing Co.},
ADDRESS = {Singapore-New Jersey-London-Hong Kong-Bangalore},
}
@article{Roversi/00,
AUTHOR = {Roversi, Luca},
TITLE = {Light affine logic as a programming language: A first contribution},
JOURNAL = {International Journal of Foundations of Computer Science},
VOLUME = {11},
NUMBER = {1},
PAGES = {113-152},
YEAR = {2000},
PUBLISHER = {World Scientific Publishing Co.},
ADDRESS = {Singapore-New Jersey-London-Hong Kong-Bangalore},
}
@article{Yang-Sun-Miao-Sattar-Yang/00,
AUTHOR = {Yang, Zhonghua and Sun, Chengzheng and Miao, Yuan and Sattar, Abdul and Yang, Yanyan},
TITLE = {Guaranteed mutually consistent checkpointing in distributed computations},
JOURNAL = {International Journal of Foundations of Computer Science},
VOLUME = {11},
NUMBER = {1},
PAGES = {153-166},
YEAR = {2000},
PUBLISHER = {World Scientific Publishing Co.},
ADDRESS = {Singapore-New Jersey-London-Hong Kong-Bangalore},
}
@article{Paun/00a,
AUTHOR = {P{\u{a}}un, Gheorghe},
TITLE = {Computing with membranes ($P$ systems): A variant},
JOURNAL = {International Journal of Foundations of Computer Science},
VOLUME = {11},
NUMBER = {1},
PAGES = {167-181},
YEAR = {2000},
PUBLISHER = {World Scientific Publishing Co.},
ADDRESS = {Singapore-New Jersey-London-Hong Kong-Bangalore},
}
@article{Rosenberg/00,
AUTHOR = {Rosenberg, Arnold L.},
TITLE = {Guidelines for data-parallel cycle-stealing in networks of workstations  --- II: On maximizing guaranteed output},
JOURNAL = {International Journal of Foundations of Computer Science},
VOLUME = {11},
NUMBER = {1},
PAGES = {183-204},
YEAR = {2000},
PUBLISHER = {World Scientific Publishing Co.},
ADDRESS = {Singapore-New Jersey-London-Hong Kong-Bangalore},
}
@article{Rajasekaran-Sahni/00,
AUTHOR = {Rajasekaran, Sanguthevar and Sahni, Sartaj K.},
TITLE = {Special issue on randomized computing},
JOURNAL = {International Journal of Foundations of Computer Science},
VOLUME = {11},
NUMBER = {2},
PAGES = {205-205},
YEAR = {2000},
PUBLISHER = {World Scientific Publishing Co.},
ADDRESS = {Singapore-New Jersey-London-Hong Kong-Bangalore},
}
@article{Li/00c,
AUTHOR = {Li, Keqin},
TITLE = {A method for evaluating the expected load of dynamic tree embeddings in hypercubes},
JOURNAL = {International Journal of Foundations of Computer Science},
VOLUME = {11},
NUMBER = {2},
PAGES = {207-230},
YEAR = {2000},
PUBLISHER = {World Scientific Publishing Co.},
ADDRESS = {Singapore-New Jersey-London-Hong Kong-Bangalore},
}
@article{Mahapatra-Dutt/00,
AUTHOR = {Mahapatra, Nihar R. and Dutt, Shantanu},
TITLE = {Random seeking: A general, efficient, and informed randomized scheme for dynamic load balancing},
JOURNAL = {International Journal of Foundations of Computer Science},
VOLUME = {11},
NUMBER = {2},
PAGES = {231-246},
YEAR = {2000},
PUBLISHER = {World Scientific Publishing Co.},
ADDRESS = {Singapore-New Jersey-London-Hong Kong-Bangalore},
}
@article{Nikoletseas-Palem-Spirakis-Yung/00,
AUTHOR = {Nikoletseas, S. and Palem, K. and Spirakis, P. and Yung, M.},
TITLE = {Connectivity properties in random regular graphs with edge faults},
JOURNAL = {International Journal of Foundations of Computer Science},
VOLUME = {11},
NUMBER = {2},
PAGES = {247-262},
YEAR = {2000},
PUBLISHER = {World Scientific Publishing Co.},
ADDRESS = {Singapore-New Jersey-London-Hong Kong-Bangalore},
}
@article{Sun/00a,
AUTHOR = {Sun, Hung-Min},
TITLE = {On the dealer's randomness required in perfect secret sharing schemes with access structures of constant rank},
JOURNAL = {International Journal of Foundations of Computer Science},
VOLUME = {11},
NUMBER = {2},
PAGES = {263-281},
YEAR = {2000},
PUBLISHER = {World Scientific Publishing Co.},
ADDRESS = {Singapore-New Jersey-London-Hong Kong-Bangalore},
}
@article{Shyamasundar-Ramesh/00,
AUTHOR = {Shyamasundar, R.K. and Ramesh, S.},
TITLE = {Languages for reactive specifications: Synchrony vs asynchrony},
JOURNAL = {International Journal of Foundations of Computer Science},
VOLUME = {11},
NUMBER = {2},
PAGES = {283-314},
YEAR = {2000},
PUBLISHER = {World Scientific Publishing Co.},
ADDRESS = {Singapore-New Jersey-London-Hong Kong-Bangalore},
}
@article{Hempel-Wechsung/00,
AUTHOR = {Hempel, Harald and Wechsung, Gerd},
TITLE = {The operators min and max on the polynomial hierarchy},
JOURNAL = {International Journal of Foundations of Computer Science},
VOLUME = {11},
NUMBER = {2},
PAGES = {315-342},
YEAR = {2000},
PUBLISHER = {World Scientific Publishing Co.},
ADDRESS = {Singapore-New Jersey-London-Hong Kong-Bangalore},
}
@article{Zantema-Bodlaender/00,
AUTHOR = {Zantema, Hans and Bodlaender, Hans L.},
TITLE = {Finding small equivalent decision trees is hard},
JOURNAL = {International Journal of Foundations of Computer Science},
VOLUME = {11},
NUMBER = {2},
PAGES = {343-354},
YEAR = {2000},
PUBLISHER = {World Scientific Publishing Co.},
ADDRESS = {Singapore-New Jersey-London-Hong Kong-Bangalore},
}
@article{Halldorsson-Kratochvil-Telle/00a,
AUTHOR = {Halld{\'{o}}rsson, Magn{\'{u}}s M. and Kratochv{\'{i}}l, Jan and Telle, Jan Arne},
TITLE = {Mod-2 independence and domination in graphs},
JOURNAL = {International Journal of Foundations of Computer Science},
VOLUME = {11},
NUMBER = {3},
PAGES = {355-363},
YEAR = {2000},
PUBLISHER = {World Scientific Publishing Co.},
ADDRESS = {Singapore-New Jersey-London-Hong Kong-Bangalore},
}
@article{Perkovic-Reed/00,
AUTHOR = {Perkovi{\'c}, Ljubomir and Reed, Bruce},
TITLE = {An improved algorithm for finding tree decompositions of small width},
JOURNAL = {International Journal of Foundations of Computer Science},
VOLUME = {11},
NUMBER = {3},
PAGES = {365-371},
YEAR = {2000},
PUBLISHER = {World Scientific Publishing Co.},
ADDRESS = {Singapore-New Jersey-London-Hong Kong-Bangalore},
}
@article{Johansson/00,
AUTHOR = {Johansson, {\"O}jvind},
TITLE = {NLC$_2$-decomposition in polynomial time},
JOURNAL = {International Journal of Foundations of Computer Science},
VOLUME = {11},
NUMBER = {3},
PAGES = {373-395},
YEAR = {2000},
PUBLISHER = {World Scientific Publishing Co.},
ADDRESS = {Singapore-New Jersey-London-Hong Kong-Bangalore},
}
@article{Berry-Bordat-Cogis-LIRMM/00,
AUTHOR = {Berry, Anne and Bordat, Jean-Paul and Cogis, Olivier and L.I.R.M.M.},
TITLE = {Generating all the minimal separators of a graph},
JOURNAL = {International Journal of Foundations of Computer Science},
VOLUME = {11},
NUMBER = {3},
PAGES = {397-403},
YEAR = {2000},
PUBLISHER = {World Scientific Publishing Co.},
ADDRESS = {Singapore-New Jersey-London-Hong Kong-Bangalore},
}
@article{Accornero-Ancona-Varini/00,
AUTHOR = {Accornero, Anna and Ancona, Massimo and Varini, Sonia},
TITLE = {All separating triangles in a plane graph can be optimally ``broken'' in polynomial time},
JOURNAL = {International Journal of Foundations of Computer Science},
VOLUME = {11},
NUMBER = {3},
PAGES = {405-421},
YEAR = {2000},
PUBLISHER = {World Scientific Publishing Co.},
ADDRESS = {Singapore-New Jersey-London-Hong Kong-Bangalore},
}
@article{Golumbic-Rotics/00,
AUTHOR = {Golumbic, Martin Charles and Rotics, Udi},
TITLE = {On the clique-width of some perfect graph classes},
JOURNAL = {International Journal of Foundations of Computer Science},
VOLUME = {11},
NUMBER = {3},
PAGES = {423-443},
YEAR = {2000},
PUBLISHER = {World Scientific Publishing Co.},
ADDRESS = {Singapore-New Jersey-London-Hong Kong-Bangalore},
}
@article{Nishimura-Ragde-Thilikos/00,
AUTHOR = {Nishimura, Naomi and Ragde, Prabhakar and Thilikos, Dimitrios M.},
TITLE = {Finding smallest supertrees under minor containment},
JOURNAL = {International Journal of Foundations of Computer Science},
VOLUME = {11},
NUMBER = {3},
PAGES = {445-465},
YEAR = {2000},
PUBLISHER = {World Scientific Publishing Co.},
ADDRESS = {Singapore-New Jersey-London-Hong Kong-Bangalore},
}
@article{Liebers-Wagner-Weihe/00,
AUTHOR = {Liebers, Annegret and Wagner, Dorothea and Weihe, Karsten},
TITLE = {On the hardness of recognizing bundles in time table graphs},
JOURNAL = {International Journal of Foundations of Computer Science},
VOLUME = {11},
NUMBER = {3},
PAGES = {467-484},
YEAR = {2000},
PUBLISHER = {World Scientific Publishing Co.},
ADDRESS = {Singapore-New Jersey-London-Hong Kong-Bangalore},
}
@article{Cho-Sahni/00,
AUTHOR = {Cho, Seonghun and Sahni, Sartaj},
TITLE = {A new weight balanced binary search tree},
JOURNAL = {International Journal of Foundations of Computer Science},
VOLUME = {11},
NUMBER = {3},
PAGES = {485-513},
YEAR = {2000},
PUBLISHER = {World Scientific Publishing Co.},
ADDRESS = {Singapore-New Jersey-London-Hong Kong-Bangalore},
}
@article{Okadome/00,
AUTHOR = {Okadome, Takesi},
TITLE = {Some sufficient conditions of learnability in the limit from positive data},
JOURNAL = {International Journal of Foundations of Computer Science},
VOLUME = {11},
NUMBER = {3},
PAGES = {515-524},
YEAR = {2000},
PUBLISHER = {World Scientific Publishing Co.},
ADDRESS = {Singapore-New Jersey-London-Hong Kong-Bangalore},
}
@article{Kosub-Schmitz-Vollmer/00,
AUTHOR = {Kosub, Sven and Schmitz, Heinz and Vollmer, Heribert},
TITLE = {Uniform characterizations of complexity classes of functions},
JOURNAL = {International Journal of Foundations of Computer Science},
VOLUME = {11},
NUMBER = {4},
PAGES = {525-551},
YEAR = {2000},
PUBLISHER = {World Scientific Publishing Co.},
ADDRESS = {Singapore-New Jersey-London-Hong Kong-Bangalore},
}
@article{Bourgeois-Trahan/00,
AUTHOR = {Bourgeois, Anu G. and Trahan, Jerry L.},
TITLE = {Relating two-dimensional reconfigurable meshes with optically pipelined buses},
JOURNAL = {International Journal of Foundations of Computer Science},
VOLUME = {11},
NUMBER = {4},
PAGES = {553-571},
YEAR = {2000},
PUBLISHER = {World Scientific Publishing Co.},
ADDRESS = {Singapore-New Jersey-London-Hong Kong-Bangalore},
}
@article{Dong-Zhang/00,
AUTHOR = {Dong, Guozhu and Zhang, Louxin},
TITLE = {Separating auxiliary arity hierarchy of first-order incremental evaluation systems using $(3k+1)$-ary input relations},
JOURNAL = {International Journal of Foundations of Computer Science},
VOLUME = {11},
NUMBER = {4},
PAGES = {573-578},
YEAR = {2000},
PUBLISHER = {World Scientific Publishing Co.},
ADDRESS = {Singapore-New Jersey-London-Hong Kong-Bangalore},
}
@article{Bonizzoni-Vedova-Mauri/00,
AUTHOR = {Bonizzoni, Paola and Vedova, Gianluca Della and Mauri, Giancarlo},
TITLE = {Approximating the maximum isomorphic agreement subtree is hard},
JOURNAL = {International Journal of Foundations of Computer Science},
VOLUME = {11},
NUMBER = {4},
PAGES = {579-590},
YEAR = {2000},
PUBLISHER = {World Scientific Publishing Co.},
ADDRESS = {Singapore-New Jersey-London-Hong Kong-Bangalore},
}
@article{van_der_Meyden/00,
AUTHOR = {van der Meyden, Ron},
TITLE = {Predicate boundedness of linear monadic Datalog is in PSPACE},
JOURNAL = {International Journal of Foundations of Computer Science},
VOLUME = {11},
NUMBER = {4},
PAGES = {591-613},
YEAR = {2000},
PUBLISHER = {World Scientific Publishing Co.},
ADDRESS = {Singapore-New Jersey-London-Hong Kong-Bangalore},
}
@article{Kobler-Lindner/00,
AUTHOR = {K{\"o}bler, Johannes and Lindner, Wolfgang},
TITLE = {Oracles in $\Sigma^p_2$ are sufficient for exact learning},
JOURNAL = {International Journal of Foundations of Computer Science},
VOLUME = {11},
NUMBER = {4},
PAGES = {615-632},
YEAR = {2000},
PUBLISHER = {World Scientific Publishing Co.},
ADDRESS = {Singapore-New Jersey-London-Hong Kong-Bangalore},
}
@article{Csuhaj-Varju-Martin-Vide-Mitrana-Vaszil/00,
AUTHOR = {Csuhaj-Varj{\'{u}}, Erzs{\'{e}}bet and Mart{\'{i}}n-Vide, Carlos and Mitrana, Victor and Vaszil, Gy{\"o}rgy},
TITLE = {Parallel communicating pushdown automata systems},
JOURNAL = {International Journal of Foundations of Computer Science},
VOLUME = {11},
NUMBER = {4},
PAGES = {633-650},
YEAR = {2000},
PUBLISHER = {World Scientific Publishing Co.},
ADDRESS = {Singapore-New Jersey-London-Hong Kong-Bangalore},
}