@article{Khosravi-Ghodsi/07,
AUTHOR = {Khosravi, Ramtin and Ghodsi, Mohammad},
TITLE = {Query-point visibility constrained shortest paths in simple polygons},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {389},
NUMBER = {1-2},
PAGES = {1-11},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computational geometry, shortest path, visibility},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P718T5-1/2/30192ec3da5892f5bbca9035ce48d3d5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bernat-Masakova-Pelantova/07,
AUTHOR = {Bernat, Julien and Mas{\'a}kov{\'a}, Zuzana and Pelantov{\'a}, Edita},
TITLE = {On a class of infinite words with affine factor complexity},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {389},
NUMBER = {1-2},
PAGES = {12-25},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {beta-expansions, factor complexity of infinite words},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P4NPMF-4/2/f7c0a4ab82bef818be1ea1b646958b22},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Aspnes-Feigenbaum-Yampolskiy-Zhong/07,
AUTHOR = {Aspnes, James and Feigenbaum, Joan and Yampolskiy, Aleksandr and Zhong, Sheng},
TITLE = {Towards a theory of data entanglement},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {389},
NUMBER = {1-2},
PAGES = {26-43},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {data entanglement, untrusted storage, all-or-nothing integrity, upgrade attacks},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P940TB-1/2/92e3c72f1657e0de6302b3eace7a6f60},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gronau-Moran/07a,
AUTHOR = {Gronau, Ilan and Moran, Shlomo},
TITLE = {On the hardness of inferring phylogenies from triplet-dissimilarities},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {389},
NUMBER = {1-2},
PAGES = {44-55},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {np hardness, hardness of approximation, phylogenetic trees, distance based reconstruction algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PCXGMD-1/2/a3a2621a247a2606131cd21f7764d78e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jurdzinski/07,
AUTHOR = {Jurdzi{\'n}ski, Tomasz},
TITLE = {On complexity of grammars related to the safety problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {389},
NUMBER = {1-2},
PAGES = {56-72},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {automata and formal languages, leftist grammars, protection system, accessibility problem},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PCGS3X-3/2/73f1f860d515e0953185e634c3605db6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Meduna-Techet/07,
AUTHOR = {Meduna, Alexander and Techet, Ji{\v{r}}{\'{i}}},
TITLE = {Canonical scattered context generators of sentences with their parses},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {389},
NUMBER = {1-2},
PAGES = {73-81},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {scattered context grammars, canonical derivations, parses, descriptional complexity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PCGS3X-4/2/db83fa68f7df0fffd774897f62abfdcf},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Le-Phan/07,
AUTHOR = {Le, Minh Ha and Phan, Thi Ha Duong},
TITLE = {Strict partitions and discrete dynamical systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {389},
NUMBER = {1-2},
PAGES = {82-90},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {strict partition, discrete dynamical system, chip firing game, poset, lattice},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PCGS3X-5/2/b5999a249477206375eda2630dcb042f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{De_Simone-Galluccio/07,
AUTHOR = {De Simone, Caterina and Galluccio, Anna},
TITLE = {Edge-colouring of regular graphs of large degree},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {389},
NUMBER = {1-2},
PAGES = {91-99},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {edge-colouring, regular graph, join},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PCGS3X-1/2/ccab2fca79e0e447c4800f70b0503ef7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Herranz/07,
AUTHOR = {Herranz, Javier},
TITLE = {Identity-based ring signatures from RSA},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {389},
NUMBER = {1-2},
PAGES = {100-117},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {identity-based ring signatures, rsa, exact security},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PJ0527-1/2/9370eb959d2820553f106d11a1471467},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tan/07b,
AUTHOR = {Tan, Bo},
TITLE = {Mirror substitutions and palindromic sequences},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {389},
NUMBER = {1-2},
PAGES = {118-124},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {mirror substitution, palindrome},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PHJTT1-1/2/06193f6ded6fc7571230c9c8576fb7fc},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Michail/07,
AUTHOR = {Michail, Dimitrios},
TITLE = {Reducing rank-maximal to maximum weight matching},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {389},
NUMBER = {1-2},
PAGES = {125-132},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {bipartite graph, matching, preference lists, rank-maximal, weighted matching},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PHJTT1-2/2/f58c259425f7673ab86e3b3ce63313f5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Martinez-de_Pina-Soares/07,
AUTHOR = {Martinez, F{\'a}bio Viduani and de Pina, Jos{\'e} Coelho and Soares, Jos{\'e}},
TITLE = {Algorithms for terminal Steiner trees},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {389},
NUMBER = {1-2},
PAGES = {133-142},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {terminal steiner trees, approximation algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PHJTT1-3/2/ab7d308c6e7ef8c2e8771471d629d7bf},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Xu-Dai-Katoh-Ohsaki/07,
AUTHOR = {Xu, Yinfeng and Dai, Wenqiang and Katoh, Naoki and Ohsaki, Makoto},
TITLE = {Triangulating a convex polygon with fewer number of non-standard bars},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {389},
NUMBER = {1-2},
PAGES = {143-151},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {triangulation, convex polygon, mesh generation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PPF6F8-1/2/9031eb1252a207a324740b7f3c8d24e2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kloster/07,
AUTHOR = {Kloster, Oddvar},
TITLE = {A solution to the Angel Problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {389},
NUMBER = {1-2},
PAGES = {152-161},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {angel problem, combinatorial games},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PJCYJD-2/2/daa2b72aee76156660129031562e801f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Harkins-Hitchcock/07a,
AUTHOR = {Harkins, Ryan C. and Hitchcock, John M.},
TITLE = {Upward separations and weaker hypotheses in resource-bounded measure},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {389},
NUMBER = {1-2},
PAGES = {162-171},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {resource-bounded measure, double-exponential time, np-machine hypothesis},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PP77D0-1/2/1ca644e0f7b8bdec059d51b705829968},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Koiran-Perifel/07b,
AUTHOR = {Koiran, Pascal and Perifel, Sylvain},
TITLE = {The complexity of two problems on arithmetic circuits},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {389},
NUMBER = {1-2},
PAGES = {172-181},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {arithmetic circuits, polynomials, counting classes, algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PKFH7G-1/2/75f7ffec27e8a3466dd703aa2edf7175},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Liu-Chao/07,
AUTHOR = {Liu, Hsiao-Fei and Chao, Kun-Mao},
TITLE = {A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {389},
NUMBER = {1-2},
PAGES = {182-189},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {algorithms, topological order, online algorithms, tight analysis},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PKFH7G-2/2/d696e8de325ffdd93fcdaec0a47a9aa4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jain-Kinber/07b,
AUTHOR = {Jain, Sanjay and Kinber, Efim},
TITLE = {Learning languages from positive data and a limited number of short counterexamples},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {389},
NUMBER = {1-2},
PAGES = {190-218},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {inductive inference, learning in the limit, positive data, counterexamples},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PKPH0G-1/2/ae614625aac555dddfbc4c6cad824787},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Alekseev-Boliac-Korobitsyn-Lozin/07,
AUTHOR = {Alekseev, V.E. and Boliac, R. and Korobitsyn, D.V. and Lozin, V.V.},
TITLE = {$NP$-hard graph problems and boundary classes of graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {389},
NUMBER = {1-2},
PAGES = {219-236},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computational complexity, hereditary class of graphs},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PPMXT9-6/2/d5835d2272f6434c962c5f4fe9c6fca9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Halava-Harju-Karki/07,
AUTHOR = {Halava, Vesa and Harju, Tero and K{\"a}rki, Tomi},
TITLE = {Relational codes of words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {389},
NUMBER = {1-2},
PAGES = {237-249},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {code, relational code, partial word, np-completeness, sardinas-patterson algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PPMXT9-2/2/26798398e184be804adca32302ad9725},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Lau-Liu/07,
AUTHOR = {Wang, Rui and Lau, Francis C.M. and Liu, Yan Yan},
TITLE = {On the hardness of minimizing space for all-shortest-path interval routing schemes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {389},
NUMBER = {1-2},
PAGES = {250-264},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {interval routing schemes, compact routing, np-completeness},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PPMXT9-3/2/9b5e3b98b848791c86ef424df8230967},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Manea-Mercas/07,
AUTHOR = {Manea, Florin and Merca{\c{s}}, Robert},
TITLE = {Freeness of partial words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {389},
NUMBER = {1-2},
PAGES = {265-277},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {infinite words, partial words, thue-morse word, k-freeness, overlap-freeness},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PTW4Y1-1/2/4785bfe6dd21ea2711ca8276673110bc},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Strothmann/07,
AUTHOR = {Strothmann, Dirk},
TITLE = {The affix array data structure and its applications to RNA secondary structure analysis},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {389},
NUMBER = {1-2},
PAGES = {278-294},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {suffix tree, suffix array, affix tree, pattern matching},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PTW4Y1-3/2/9011d1e0b94c633350f671f8912d59af},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Brandstadt-Hoang/07,
AUTHOR = {Brandst{\"a}dt, Andreas and Ho{\`a}ng, Ch{\'{i}}nh T.},
TITLE = {On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {389},
NUMBER = {1-2},
PAGES = {295-306},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {nearly chordal graphs, clique separators, graph algorithms, struction, maximum weight stable set problem},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PV2S4B-4/2/f2503bf30faf6e4d5f26df0442b19302},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Han-Wang-Wood/07,
AUTHOR = {Han, Yo-Sub and Wang, Yajun and Wood, Derick},
TITLE = {Prefix-free regular languages and pattern matching},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {389},
NUMBER = {1-2},
PAGES = {307-317},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {string pattern matching, regular-expression matching, prefix-free regular languages, pruned prefix-free languages},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PWF0WP-3/2/2bb80df6149057829b4c646549c0bca5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Moshe/07,
AUTHOR = {Moshe, Yossi},
TITLE = {On the subword complexity of Thue-Morse polynomial extractions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {389},
NUMBER = {1-2},
PAGES = {318-329},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {subword complexity, automatic sequences, thue-morse sequence, polynomial extractions},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PWF0WP-2/2/c816c0c68d35aeaf86ffcc9b3ea18073},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Le-Randerath-Schiermeyer/07,
AUTHOR = {Le, Van Bang and Randerath, Bert and Schiermeyer, Ingo},
TITLE = {On the complexity of 4-coloring graphs without long induced paths},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {389},
NUMBER = {1-2},
PAGES = {330-335},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph coloring, p5-free graph, computational complexity, induced path},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PPMXT9-4/2/bd22c68db4458aaf6376a8d5174c357a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ahern-Yoshida/07,
AUTHOR = {Ahern, Alexander and Yoshida, Nobuko},
TITLE = {Formalising Java RMI with explicit code mobility},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {389},
NUMBER = {3},
PAGES = {341-410},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {distribution, java, rmi, types, optimisation, runtime, code mobility},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PP2D0V-3/2/2246b14d0b96254cc82de8caead54ba2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Aspinall-Beringer-Hofmann-Loidl-Momigliano/07,
AUTHOR = {Aspinall, David and Beringer, Lennart and Hofmann, Martin and Loidl, Hans-Wolfgang and Momigliano, Alberto},
TITLE = {A program logic for resources},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {389},
NUMBER = {3},
PAGES = {411-445},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {program logic, proof-carrying-code, object-oriented languages, java virtual machine language, cost modelling, quantitative type-systems, lightweight verification},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PP2D0V-4/2/6863cd56dafc96da3c81457192179fb6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Baldan-Bracciali-Bruni/07,
AUTHOR = {Baldan, P. and Bracciali, A. and Bruni, R.},
TITLE = {A semantic framework for open processes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {389},
NUMBER = {3},
PAGES = {446-483},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {open systems, symbolic bisimulation, unification},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PP2D0V-5/2/e96faf4017e63e4ed71f38f1bc1f59ec},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Briais-Nestmann/07a,
AUTHOR = {Briais, S{\'e}bastien and Nestmann, Uwe},
TITLE = {A formal semantics for protocol narrations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {389},
NUMBER = {3},
PAGES = {484-511},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {cryptographic protocols, protocol narrations, spi-calculus},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PP2D0V-1/2/7c438f108264371bfe50857a15861df4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chatzikokolakis-Palamidessi/07,
AUTHOR = {Chatzikokolakis, Konstantinos and Palamidessi, Catuscia},
TITLE = {A framework for analyzing probabilistic protocols and its application to the Partial Secrets Exchange},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {389},
NUMBER = {3},
PAGES = {512-527},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {security, probabilistic protocols, oblivious transfer, contract signing},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PP2D0V-2/2/3486ff49c8b7dbd9ca90c03946fea042},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Krukow-Twigg/07,
AUTHOR = {Krukow, Karl and Twigg, Andrew},
TITLE = {The complexity of fixed point models of trust in distributed networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {389},
NUMBER = {3},
PAGES = {528-549},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {distributed networks, trust models, fixed point computation, proof carrying requests},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PNM4FC-1/2/5dce56e3a50535a7e68d7bc8b20ed0b3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}