@article{Jancar/00,
AUTHOR = {Jan{\v{c}}ar, Petr},
TITLE = {Decidability of bisimilarity for one-counter processes},
JOURNAL = {Inf.~Comput.},
VOLUME = {158},
NUMBER = {1},
PAGES = {1-17},
YEAR = {2000},
EDITOR = {Meyer, Albert R.},
URL = {http://dx.doi.org/10.1006/inco.1999.2813},
PUBLISHER = {Academic Press},
ADDRESS = {Orlando},
}
@article{Hagerup/00a,
AUTHOR = {Hagerup, Torben},
TITLE = {Parallel preprocessing for path queries without concurrent reading},
JOURNAL = {Inf.~Comput.},
VOLUME = {158},
NUMBER = {1},
PAGES = {18-28},
YEAR = {2000},
EDITOR = {Meyer, Albert R.},
URL = {http://dx.doi.org/10.1006/inco.1999.2814},
PUBLISHER = {Academic Press},
ADDRESS = {Orlando},
}
@article{Goldsmith-Ogihara-Rothe/00,
AUTHOR = {Goldsmith, Judy and Ogihara, Mitsunori and Rothe, J{\"o}rg},
TITLE = {Tally $NP$ sets and easy census functions},
JOURNAL = {Inf.~Comput.},
VOLUME = {158},
NUMBER = {1},
PAGES = {29-52},
YEAR = {2000},
EDITOR = {Meyer, Albert R.},
URL = {http://dx.doi.org/10.1006/inco.1999.2810},
PUBLISHER = {Academic Press},
ADDRESS = {Orlando},
}
@article{Bartal-Chrobak-Larmore/00,
AUTHOR = {Bartal, Yair and Chrobak, Marek and Larmore, Lawrence L.},
TITLE = {A randomized algorithm for two servers on the line},
JOURNAL = {Inf.~Comput.},
VOLUME = {158},
NUMBER = {1},
PAGES = {53-69},
YEAR = {2000},
EDITOR = {Meyer, Albert R.},
URL = {http://dx.doi.org/10.1006/inco.1999.2809},
PUBLISHER = {Academic Press},
ADDRESS = {Orlando},
}
@article{Modiano-Ephremides/00,
AUTHOR = {Modiano, Eytan and Ephremides, Anthony},
TITLE = {Communication protocols for secure distributed computation of binary functions},
JOURNAL = {Inf.~Comput.},
VOLUME = {158},
NUMBER = {2},
PAGES = {71-97},
YEAR = {2000},
EDITOR = {Meyer, Albert R.},
URL = {http://dx.doi.org/10.1006/inco.2000.2865},
PUBLISHER = {Academic Press},
ADDRESS = {Orlando},
}
@article{Koppenhagen-Mayr/00,
AUTHOR = {Koppenhagen, Ulla and Mayr, Ernst W.},
TITLE = {Optimal algorithms for the coverability, the subword, the containment, and the equivalence problems for commutative semigroups},
JOURNAL = {Inf.~Comput.},
VOLUME = {158},
NUMBER = {2},
PAGES = {98-124},
YEAR = {2000},
EDITOR = {Meyer, Albert R.},
URL = {http://dx.doi.org/10.1006/inco.1999.2812},
PUBLISHER = {Academic Press},
ADDRESS = {Orlando},
}
@article{van_Maaren/00,
AUTHOR = {van Maaren, Hans},
TITLE = {A short note on some tractable cases of the satisfiability problem},
JOURNAL = {Inf.~Comput.},
VOLUME = {158},
NUMBER = {2},
PAGES = {125-130},
YEAR = {2000},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {satisfiability, autarkies, horn, complexity},
URL = {http://dx.doi.org/10.1006/inco.2000.2867},
PUBLISHER = {Academic Press},
ADDRESS = {Orlando},
}