@article{Castagna-Chen/01,
AUTHOR = {Castagna, Giuseppe and Chen, Gang},
TITLE = {Dependent types with subtyping and late-bound overloading},
JOURNAL = {Inf.~Comput.},
VOLUME = {168},
NUMBER = {1},
PAGES = {1-67},
YEAR = {2001},
EDITOR = {Meyer, Albert R.},
URL = {http://dx.doi.org/10.1006/inco.2001.3128},
PUBLISHER = {Academic Press},
ADDRESS = {Orlando},
}
@article{Bodei-Degano-Nielson-Nielson/01,
AUTHOR = {Bodei, Chiara and Degano, Pierpaolo and Nielson, Flemming and Nielson, Hanne Riis},
TITLE = {Static analysis for the $\pi$-calculus with applications to security},
JOURNAL = {Inf.~Comput.},
VOLUME = {168},
NUMBER = {1},
PAGES = {68-92},
YEAR = {2001},
EDITOR = {Meyer, Albert R.},
URL = {http://dx.doi.org/10.1006/inco.2000.3020},
PUBLISHER = {Academic Press},
ADDRESS = {Orlando},
}
@article{Skodinis/01,
AUTHOR = {Skodinis, Konstantin},
TITLE = {The complexity of the $K_{n,n}$-problem for node replacement graph languages},
JOURNAL = {Inf.~Comput.},
VOLUME = {168},
NUMBER = {2},
PAGES = {95-112},
YEAR = {2001},
EDITOR = {Meyer, Albert R.},
URL = {http://dx.doi.org/10.1006/inco.2000.3021},
PUBLISHER = {Academic Press},
ADDRESS = {Orlando},
}
@article{Bernasconi-Damm-Shparlinski/01,
AUTHOR = {Bernasconi, Anna and Damm, Carsten and Shparlinski, Igor},
TITLE = {Circuit and decision tree complexity of some number theoretic problems},
JOURNAL = {Inf.~Comput.},
VOLUME = {168},
NUMBER = {2},
PAGES = {113-124},
YEAR = {2001},
EDITOR = {Meyer, Albert R.},
URL = {http://dx.doi.org/10.1006/inco.2000.3017},
PUBLISHER = {Academic Press},
ADDRESS = {Orlando},
}
@article{Fernau-Staiger/01,
AUTHOR = {Fernau, Henning and Staiger, Ludwig},
TITLE = {Iterated function systems and control languages},
JOURNAL = {Inf.~Comput.},
VOLUME = {168},
NUMBER = {2},
PAGES = {125-143},
YEAR = {2001},
EDITOR = {Meyer, Albert R.},
URL = {http://dx.doi.org/10.1006/inco.2000.2912},
PUBLISHER = {Academic Press},
ADDRESS = {Orlando},
}
@article{de_Felice/01,
AUTHOR = {de Felice, Clelia},
TITLE = {On some Sch{\"u}tzenberger conjectures},
JOURNAL = {Inf.~Comput.},
VOLUME = {168},
NUMBER = {2},
PAGES = {144-155},
YEAR = {2001},
EDITOR = {Meyer, Albert R.},
URL = {http://dx.doi.org/10.1006/inco.2000.2932},
PUBLISHER = {Academic Press},
ADDRESS = {Orlando},
}
@article{Neven-Otto-Tyszkiewicz-van_den_Bussche/01,
AUTHOR = {Neven, Frank and Otto, Martin and Tyszkiewicz, Jurek and van den Bussche, Jan},
TITLE = {Adding for-loops to first-order logic},
JOURNAL = {Inf.~Comput.},
VOLUME = {168},
NUMBER = {2},
PAGES = {156-186},
YEAR = {2001},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {database theory, query languages, for-loops, finite model theory},
URL = {http://dx.doi.org/10.1006/inco.2000.2961},
PUBLISHER = {Academic Press},
ADDRESS = {Orlando},
}
@article{Iwata/01,
AUTHOR = {Iwata, Shigeki},
TITLE = {Lower bounds for merging networks},
JOURNAL = {Inf.~Comput.},
VOLUME = {168},
NUMBER = {2},
PAGES = {187-195},
YEAR = {2001},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {merging network, odd?even merge, comparator, lower bound, open problem by Yao and Yao},
URL = {http://dx.doi.org/10.1006/inco.2001.2934},
PUBLISHER = {Academic Press},
ADDRESS = {Orlando},
}