@article{Courcelle-Delhomme/08,
AUTHOR = {Courcelle, Bruno and Delhomm{\'e}, Christian},
TITLE = {The modular decomposition of countable graphs. Definition and construction in monadic second-order logic},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {394},
NUMBER = {1-2},
PAGES = {1-38},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {modular decomposition, tree, linear order, monadic second-order logic, monadic second-order transduction},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4R5F1WH-1/1/b0aa0c18475fdad11ef2510ec19d0a85},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang/08b,
AUTHOR = {Zhang, Yu},
TITLE = {Cryptographic logical relations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {394},
NUMBER = {1-2},
PAGES = {39-63},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {logical relation, monad, verification of cryptographic protocols, dynamic key generation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PW5XRY-1/1/75364204f05056a7f632a68ef2e37090},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Laird/08,
AUTHOR = {Laird, J.},
TITLE = {Decidability and syntactic control of interference},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {394},
NUMBER = {1-2},
PAGES = {64-83},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {interference control, idealized algol, game semantics, multitape automata},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4R53WHX-2/1/af8edc9dc61ece81ea284bf1bcfee24a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Calders/08,
AUTHOR = {Calders, Toon},
TITLE = {Itemset frequency satisfiability: Complexity and axiomatization},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {394},
NUMBER = {1-2},
PAGES = {84-111},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {data mining, frequent itemset, complexity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4R5F1WH-2/1/f020177654215f00100fbcaaf7dd553d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Garcia-van_Rossum/08,
AUTHOR = {Garcia, Flavio D. and van Rossum, Peter},
TITLE = {Sound and complete computational interpretation of symbolic hashes in the standard model},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {394},
NUMBER = {1-2},
PAGES = {112-133},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {symbolic cryptography, protocol verification, abadi-rogaway logic, dolev-yao model, oracle hashing},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4R6B2T2-1/1/869c5d623061dcdcc76c43f7abf1dd74},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kretinsky-Rehak-Strejcek/08,
AUTHOR = {K{\v{r}}et{\'{i}}nsk{\'y}, Mojm{\'{i}}r and {\v{R}}eh{\'a}k, Vojt{\v{e}}ch and Strej{\v{c}}ek, Jan},
TITLE = {Petri nets are less expressive than state-extended PA},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {394},
NUMBER = {1-2},
PAGES = {134-140},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {petri nets, process algebras, strong bisimulation, expressiveness},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4RCKJVV-8/1/525d9e042541a0b26e6ab5bef02165d3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Avron/08,
AUTHOR = {Avron, Arnon},
TITLE = {Constructibility and decidability versus domain independence and absoluteness},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {394},
NUMBER = {3},
PAGES = {144-158},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computability, decidability, constructibility, church thesis, absoluteness, domain-independence, predicativity, set theory},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4RDS46X-1/1/b1e09f1c9849c5533767d72f648bcd42},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cockshott-Mackenzie-Michaelson/08,
AUTHOR = {Cockshott, Paul and Mackenzie, Lewis and Michaelson, Greg},
TITLE = {Physical constraints on hypercomputation},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {394},
NUMBER = {3},
PAGES = {159-174},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {hyper-computing, quantum-computing, computability, quantum-measurement},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4RHP9DC-1/1/cd423d3ceceb81078fc1706af01ae929},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fouche/08,
AUTHOR = {Fouch{\'e}, Willem L.},
TITLE = {Dynamics of a generic Brownian motion: Recursive aspects},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {394},
NUMBER = {3},
PAGES = {175-186},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {brownian motion, law of iterated logarithm, kolmogorov complexity, complex points},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4RNK44H-1/1/0aed0c8868229701c597364705066d8a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kendon-Maloyer/08,
AUTHOR = {Kendon, Viv and Maloyer, Olivier},
TITLE = {Optimal computation with non-unitary quantum walks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {394},
NUMBER = {3},
PAGES = {187-196},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {quantum computing, quantum walks, quantum algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4RSRR50-1/1/4ca507c77840f72c5a09e463fba02f4d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Koepke-Siders/08,
AUTHOR = {Koepke, Peter and Siders, Ryan},
TITLE = {Minimality considerations for ordinal computers modeling constructibility},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {394},
NUMBER = {3},
PAGES = {197-207},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {hypercomputation, well-structured programming, set theory, constructibility, ordinal arithmetic, abstract computability},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4RDS46X-4/1/065549853b881cd5a7429711904d0b45},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Nagy-Valyi/08,
AUTHOR = {Nagy, Benedek and V{\'a}lyi, S{\'a}ndor},
TITLE = {Interval-valued computations and their connection with PSPACE},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {394},
NUMBER = {3},
PAGES = {208-222},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {algorithmic complexity, parallel computing, new computing paradigms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4RDS46X-2/1/5ca9ac2dd2a59136a01b7044ea06daed},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Welch/08,
AUTHOR = {Welch, Philip D.},
TITLE = {Bounding lemmata for non-deterministic halting times of transfinite Turing machines},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {394},
NUMBER = {3},
PAGES = {223-228},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4RDS46X-3/1/70d30b4158cc45a2a02460879c6ee38b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}