@article{di_Pierro-Hankin-Wiklicky/05,
AUTHOR = {di Pierro, Alessandra and Hankin, Chris and Wiklicky, Herbert},
TITLE = {Measuring the confinement of probabilistic systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {340},
NUMBER = {1},
PAGES = {3-56},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {security analysis, probabilistic bisimulation, probabilistic weak bisimulation, static program analysis, statistical testing},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.03.002},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Herzog/05,
AUTHOR = {Herzog, Jonathan},
TITLE = {A computational interpretation of Dolev-Yao adversaries},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {340},
NUMBER = {1},
PAGES = {57-81},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computational soundness, formal encryption, Dolev-Yao model, non-malleability},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.03.003},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Rohrmair-Lowe/05,
AUTHOR = {Rohrmair, Gordon Thomas and Lowe, Gavin},
TITLE = {Using data-independence in the analysis of intrusion detection systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {340},
NUMBER = {1},
PAGES = {82-101},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {intrusion detection, desynchronisation attacks, communicating sequential processes, model checking, data independence},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.03.004},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Bhargavan-Fournet-Gordon/05,
AUTHOR = {Bhargavan, Karthikeyan and Fournet, C{\'e}dric and Gordon, Andrew D.},
TITLE = {A semantics for web services authentication},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {340},
NUMBER = {1},
PAGES = {102-153},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {XML security, applied pi calculus, web services},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.03.005},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Zunino-Degano/05,
AUTHOR = {Zunino, Roberto and Degano, Pierpaolo},
TITLE = {Weakening the perfect encryption assumption in Dolev-Yao adversaries},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {340},
NUMBER = {1},
PAGES = {154-178},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {security, formal methods, computational approach, probabilistic model, secrecy, authentication},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.03.006},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{de_Luca-Mignosi-Perrin-Rozenberg/05,
AUTHOR = {de Luca, A. and Mignosi, F. and Perrin, D. and Rozenberg, G.},
TITLE = {Preface},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {340},
NUMBER = {2},
PAGES = {179-185},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.03.019},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Salomaa/05,
AUTHOR = {Salomaa, Arto},
TITLE = {Connections between subwords and certain matrix mappings},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {340},
NUMBER = {2},
PAGES = {188-203},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {parikh matrix, subword, scattered subword, number of subwords, inference from subsequences, forbidden subword},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.03.024},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Araujo-Bruyere/05a,
AUTHOR = {Ara{\'u}jo, Isabel M. and Bruy{\`e}re, V{\'e}ronique},
TITLE = {Words derivated from Sturmian words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {340},
NUMBER = {2},
PAGES = {204-219},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {combinatorics on words, sturmian words, return words},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.03.020},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Carpi-de_Luca/05a,
AUTHOR = {Carpi, Arturo and de Luca, Aldo},
TITLE = {Codes of central Sturmian words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {340},
NUMBER = {2},
PAGES = {220-239},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {sturmian word, code, central word},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.03.021},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{de_Felice/05,
AUTHOR = {de Felice, Clelia},
TITLE = {An enhanced property of factorizing codes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {340},
NUMBER = {2},
PAGES = {240-256},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {variable length codes, formal languages, factorizations of cyclic groups},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.03.022},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Crespi_Reghizzi-Pradella/05,
AUTHOR = {Crespi Reghizzi, Stefano and Pradella, Matteo},
TITLE = {Tile rewriting grammars and picture languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {340},
NUMBER = {2},
PAGES = {257-272},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {picture languages, 2D languages, tiling systems, context-free grammars, locally testable languages},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.03.041},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Harju-Nowotka/05a,
AUTHOR = {Harju, Tero and Nowotka, Dirk},
TITLE = {Counting bordered and primitive words with a fixed weight},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {340},
NUMBER = {2},
PAGES = {273-279},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {combinatorics on words, borders, primitive words, M{\"o}bius function},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.03.040},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Berstel/05,
AUTHOR = {Berstel, Jean},
TITLE = {Growth of repetition-free words --- A review},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {340},
NUMBER = {2},
PAGES = {280-290},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.03.039},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Esik-Weil/05,
AUTHOR = {{\'E}sik, Zolt{\'a}n and Weil, Pascal},
TITLE = {Algebraic recognizability of regular tree languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {340},
NUMBER = {2},
PAGES = {291-321},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {recognizability, regular tree languages, variety theorem, pseudovariety, preclones},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.03.038},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Karhumaki-Latteux-Petre/05,
AUTHOR = {Karhum{\"a}ki, Juhani and Latteux, Michel and Petre, Ion},
TITLE = {Commutation with codes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {340},
NUMBER = {2},
PAGES = {322-333},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {codes, commutation, centralizer, conway's problem, prefix codes},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.03.037},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Borel-Reutenauer/05,
AUTHOR = {Borel, J.-P. and Reutenauer, C.},
TITLE = {Palindromic factors of billiard words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {340},
NUMBER = {2},
PAGES = {334-348},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {words, languages, sturmian, billiard, palindromes},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.03.036},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bonizzoni-Mauri/05,
AUTHOR = {Bonizzoni, Paola and Mauri, Giancarlo},
TITLE = {Regular splicing languages and subclasses},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {340},
NUMBER = {2},
PAGES = {349-363},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {automata, regular languages, molecular computing, splicing systems},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.03.035},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Choffrut-Durak/05,
AUTHOR = {Choffrut, Christian and Durak, Berke},
TITLE = {Collage of two-dimensional words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {340},
NUMBER = {2},
PAGES = {364-380},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {regular languages, picture languages},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.03.034},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Beal-Perrin/05,
AUTHOR = {B{\'e}al, Marie-Pierre and Perrin, Dominique},
TITLE = {Codes and sofic constraints},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {340},
NUMBER = {2},
PAGES = {381-393},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {kraft-mcmillan inequality, sofic shifts, symbolic dynamics, variable-length codes},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.03.033},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bertoni-Mereghetti-Palano/05,
AUTHOR = {Bertoni, Alberto and Mereghetti, Carlo and Palano, Beatrice},
TITLE = {Small size quantum automata recognizing some regular languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {340},
NUMBER = {2},
PAGES = {394-407},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {stochastic events, quantum automata},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.03.032},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Anselmo-Giammarresi-Madonia/05,
AUTHOR = {Anselmo, Marcella and Giammarresi, Dora and Madonia, Maria},
TITLE = {New operations and regular expressions for two-dimensional languages over one-letter alphabet},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {340},
NUMBER = {2},
PAGES = {408-431},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {two-dimensional language, regular expression},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.03.031},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Clement-Duval-Guaiana-Perrin-Rindone/05,
AUTHOR = {Cl{\'e}ment, Julien and Duval, Jean-Pierre and Guaiana, Giovanna and Perrin, Dominique and Rindone, Giuseppina},
TITLE = {Parsing with a finite dictionary},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {340},
NUMBER = {2},
PAGES = {432-442},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {finite automata, string matching},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.03.030},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Pin-Silva/05,
AUTHOR = {Pin, Jean-{\'E}ric and Silva, Pedro V.},
TITLE = {A topological approach to transductions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {340},
NUMBER = {2},
PAGES = {443-456},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.03.029},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dezani-Ciancaglini-Honsell-Motohama/05,
AUTHOR = {Dezani-Ciancaglini, M. and Honsell, F. and Motohama, Y.},
TITLE = {Compositional characterisations of $\lambda$-terms using intersection types},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {340},
NUMBER = {3},
PAGES = {459-495},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {$\lambda$-calculus, intersection types, normalisation properties, set-theoretical semantics of types},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.03.011},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Durand-Hermann-Kolaitis/05,
AUTHOR = {Durand, Arnaud and Hermann, Miki and Kolaitis, Phokion G.},
TITLE = {Subtractive reductions and complete problems for counting complexity classes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {340},
NUMBER = {3},
PAGES = {496-513},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {counting complexity, complete problems, subtractive reductions},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.03.012},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fotakis-Nikoletseas-Papadopoulou-Spirakis/05,
AUTHOR = {Fotakis, D.A. and Nikoletseas, S.E. and Papadopoulou, V.G. and Spirakis, P.G.},
TITLE = {Radiocoloring in planar graphs: Complexity and approximations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {340},
NUMBER = {3},
PAGES = {514-538},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {mobile computing, radio communication, coloring, computational complexity, approximations, planar graphs, rapid mixing, coupling},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.03.013},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Montanari-Pistore/05,
AUTHOR = {Montanari, Ugo and Pistore, Marco},
TITLE = {Structured coalgebras and minimal HD-automata for the $\pi$-calculus},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {340},
NUMBER = {3},
PAGES = {539-576},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {concurrency and distributed computation, $\pi$-calculus, categorical models and logics, coinductive techniques, automata theory},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.03.014},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Peleg/05,
AUTHOR = {Peleg, David},
TITLE = {Informative labeling schemes for graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {340},
NUMBER = {3},
PAGES = {577-593},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.03.015},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Savicky-Sieling/05,
AUTHOR = {Savick{\'y}, Petr and Sieling, Detlef},
TITLE = {A hierarchy result for read-once branching programs with restricted parity nondeterminism},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {340},
NUMBER = {3},
PAGES = {594-605},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {read-once branching programes, restricted parity nondeterminision, lower bounds on complexity, hierarchy},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.03.016},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wischik-Gardner/05,
AUTHOR = {Wischik, Lucian and Gardner, Philippa},
TITLE = {Explicit fusions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {340},
NUMBER = {3},
PAGES = {606-630},
YEAR = {2005},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://dx.doi.org/10.1016/j.tcs.2005.03.017},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}