@article{Lin/03,
AUTHOR = {Lin, Huimin},
TITLE = {Complete inference systems for weak bisimulation equivalences in the $\pi$-calculus},
JOURNAL = {Inf.~Comput.},
VOLUME = {180},
NUMBER = {1},
PAGES = {1-29},
YEAR = {2003},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {mobile processes, $\pi$-calculus, bisimulation, symbolic bisimulation, proof systems, process algebra},
URL = {http://dx.doi.org/10.1016/S0890-5401(02)00014-7},
PUBLISHER = {Academic Press},
ADDRESS = {Orlando},
}
@article{Lopez-Narbel/03,
AUTHOR = {Lopez, Luis-Miguel and Narbel, Philippe},
TITLE = {Languages, DOL-systems, sets of curves, and surface automorphisms},
JOURNAL = {Inf.~Comput.},
VOLUME = {180},
NUMBER = {1},
PAGES = {30-52},
YEAR = {2003},
EDITOR = {Meyer, Albert R.},
URL = {http://dx.doi.org/10.1016/S0890-5401(02)00031-7},
PUBLISHER = {Academic Press},
ADDRESS = {Orlando},
}
@article{Boros-Ibaraki-Makino/03,
AUTHOR = {Boros, Endre and Ibaraki, Toshihide and Makino, Kazuhisa},
TITLE = {Variations on extending partially defined Boolean functions with missing bits},
JOURNAL = {Inf.~Comput.},
VOLUME = {180},
NUMBER = {1},
PAGES = {53-70},
YEAR = {2003},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {logical analysis of data, boolean functions, extensions, partially defined boolean functions, missing bits},
URL = {http://dx.doi.org/10.1016/S0890-5401(02)00012-3},
PUBLISHER = {Academic Press},
ADDRESS = {Orlando},
}
@article{Jansen/03,
AUTHOR = {Jansen, Klaus},
TITLE = {The mutual exclusion scheduling problem for permutation and comparability graphs},
JOURNAL = {Inf.~Comput.},
VOLUME = {180},
NUMBER = {2},
PAGES = {71-81},
YEAR = {2003},
EDITOR = {Meyer, Albert R.},
URL = {http://dx.doi.org/10.1016/S0890-5401(02)00028-7},
PUBLISHER = {Academic Press},
ADDRESS = {Orlando},
}
@article{Goldman-Kwek-Scott/03,
AUTHOR = {Goldman, Sally A. and Kwek, Stephen S. and Scott, Stephen D.},
TITLE = {Learning from examples with unspecified attribute values},
JOURNAL = {Inf.~Comput.},
VOLUME = {180},
NUMBER = {2},
PAGES = {82-100},
YEAR = {2003},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {unspecified or missing attributes, exact learning, membership queries, equivalence queries, dnf formulas, decision trees},
URL = {http://dx.doi.org/10.1016/S0890-5401(02)00030-5},
PUBLISHER = {Academic Press},
ADDRESS = {Orlando},
}
@article{de_Agostino-Silvestri/03,
AUTHOR = {de Agostino, Sergio and Silvestri, Riccardo},
TITLE = {Bounded size dictionary compression: $SC^k$-completeness and $NC$ algorithms},
JOURNAL = {Inf.~Comput.},
VOLUME = {180},
NUMBER = {2},
PAGES = {101-112},
YEAR = {2003},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {parallel complexity, NC algorithms, SC$^k$-completeness, data compression, dictionary algorithms},
URL = {http://dx.doi.org/10.1016/S0890-5401(02)00013-5},
PUBLISHER = {Academic Press},
ADDRESS = {Orlando},
}
@article{Halldorsson-Kortsarz-Proskurowski-Salman-Shachnai-Telle/03,
AUTHOR = {Halld{\'{o}}rsson, Magn{\'{u}}s M. and Kortsarz, Guy and Proskurowski, Andrzej and Salman, Ravit and Shachnai, Hadas and Telle, Jan Arne},
TITLE = {Multicoloring trees},
JOURNAL = {Inf.~Comput.},
VOLUME = {180},
NUMBER = {2},
PAGES = {113-129},
YEAR = {2003},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {multicoloring, approximation algorithms, resource allocation, scheduling},
URL = {http://dx.doi.org/10.1016/S0890-5401(02)00032-9},
PUBLISHER = {Academic Press},
ADDRESS = {Orlando},
}