@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{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{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{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{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{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},
}
@article{Lai-Zhang/07,
AUTHOR = {Lai, Hongliang and Zhang, Dexue},
TITLE = {Complete and directed complete $\Omega$-categories},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {388},
NUMBER = {1-3},
PAGES = {1-25},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {commutative quantale, enriched category, completeness, directed completeness, completion, weighted limit, weighted colimit},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PPMXT9-1/2/d7df2306d3e5592ba4d1f9a49f113e31},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Geniet-Largeteau/07,
AUTHOR = {Geniet, Dominique and Largeteau, Ga{\"e}lle},
TITLE = {WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {388},
NUMBER = {1-3},
PAGES = {26-52},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {finite automata, real-time systems, operational validation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NF4F7P-3/2/7c55f24d3a212a87b63fb11852053be2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cirstea-Pattinson/07,
AUTHOR = {C{\^{i}}rstea, Corina and Pattinson, Dirk},
TITLE = {Modular construction of complete coalgebraic logics},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {388},
NUMBER = {1-3},
PAGES = {83-108},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {coalgebra, modal logic, completeness, probabilistic systems},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P06CMT-1/2/b8f501aa063124c02bcf69dc660978f5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Johnson-Rosebrugh/07,
AUTHOR = {Johnson, Michael and Rosebrugh, Robert},
TITLE = {Fibrations and universal view updatability},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {388},
NUMBER = {1-3},
PAGES = {109-129},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {database, semantic data model, view update, sketch, fibration},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P37JP7-5/2/db4763472cf6be1dbc41d73f6908496b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Adamek-Milius-Velebil/07a,
AUTHOR = {Ad{\'a}mek, Ji{\v{r}}{\'{i}} and Milius, Stefan and Velebil, Ji{\v{r}}{\'{i}}},
TITLE = {Algebras with parametrized iterativity},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {388},
NUMBER = {1-3},
PAGES = {130-151},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {parametrized endofunctor, algebra for an endofunctor, rational trees},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P4NPMF-3/2/7c233ebed3d43251e09646df4b2801a6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Birkedal-Mogelberg-Petersen/07,
AUTHOR = {Birkedal, L. and M{\o}gelberg, R.E. and Petersen, R.L.},
TITLE = {Domain-theoretical models of parametric polymorphism},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {388},
NUMBER = {1-3},
PAGES = {152-172},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {parametric polymorphism, domain theory, realizability models},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P5NX83-1/2/112a5b7db1fd123393bb0244718585b9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chatterjee/07b,
AUTHOR = {Chatterjee, Krishnendu},
TITLE = {Concurrent games with tail objectives},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {388},
NUMBER = {1-3},
PAGES = {181-198},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {concurrent games, omega-regular objectives, muller objectives, tail objectives},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PCGS3X-2/2/48e503a518c1110326f48ddcea79d856},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Komenda-van_Schuppen/07,
AUTHOR = {Komenda, Jan and van Schuppen, Jan H.},
TITLE = {Control of discrete-event systems with modular or distributed structure},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {388},
NUMBER = {1-3},
PAGES = {199-226},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {supervisory control, modular discrete-event system, distributed discrete-event system},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PJ6GNP-1/2/071b1f4308ca806ed293cf2503c77f39},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cook-Kroening-Sharygina/07,
AUTHOR = {Cook, Byron and Kroening, Daniel and Sharygina, Natasha},
TITLE = {Verification of Boolean programs with unbounded thread creation},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {388},
NUMBER = {1-3},
PAGES = {227-242},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {program verification, model checking, boolean programs, reachability},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PG11CK-1/2/268427384fd2dd50d8355b53c79819c8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bennet-Bshouty/07,
AUTHOR = {Bennet, Rotem and Bshouty, Nader H.},
TITLE = {Learning attribute-efficiently with corrupt oracles},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {1},
PAGES = {32-50},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {learning, oracles, corrupt, exact, queries, attribute efficient, monotone theory},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P9625T-9/2/4f5d8fc81cecb97f656323b1e61084b0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jain-Lange-Zilles/07a,
AUTHOR = {Jain, Sanjay and Lange, Steffen and Zilles, Sandra},
TITLE = {A general comparison of language learning from examples and from queries},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {1},
PAGES = {51-66},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {inductive inference, query learning, formal languages, recursion theory},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P9625T-4/2/998a74b1533a1cdba916981de5895fe2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jain-Kinber/07a,
AUTHOR = {Jain, Sanjay and Kinber, Efim},
TITLE = {Learning multiple languages in groups},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {1},
PAGES = {67-76},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computational learning theory, learning in the limit, classification, learning multiple languages},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P9625T-G/2/bea2fb880a763ca1060e5a4ffeade769},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Almeida-Moreira-Reis/07,
AUTHOR = {Almeida, Marco and Moreira, Nelma and Reis, Rog{\'e}rio},
TITLE = {Enumeration and generation with a string automata representation},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {2},
PAGES = {93-102},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {finite automata, initially-connected deterministic finite automata, exact enumeration, random generation, minimal automata},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P9625T-5/2/f37666af7cf2c1d12dc26dafc379eb58},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Biegler-Burrell-Daley/07,
AUTHOR = {Biegler, Franziska and Burrell, Michael J. and Daley, Mark},
TITLE = {Regulated RNA rewriting: Modelling RNA editing with guided insertion},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {2},
PAGES = {103-112},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {regulated rewriting, rna editing, formal languages, kinetoplasts},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PB0PW1-1/2/f4ac57c804d015ef69e21e48700301a0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Biegler-McQuillan-Salomaa/07,
AUTHOR = {Biegler, Franziska and McQuillan, Ian and Salomaa, Kai},
TITLE = {An infinite hierarchy induced by depth synchronization},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {2},
PAGES = {113-124},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {synchronization, et0l languages, regulated rewriting, infinite hierarchy},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P9625T-D/2/f1cf0a864dd42a24f972fa6c14db2265},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cordy-Salomaa/07,
AUTHOR = {Cordy, Brendan and Salomaa, Kai},
TITLE = {On the existence of regular approximations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {2},
PAGES = {125-135},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {regular languages, degree of approximation, decidability},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P9625T-J/2/8ed722e5b32e611bd6dea7cb01a653f2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dassow-Truthe/07,
AUTHOR = {Dassow, J{\"u}rgen and Truthe, Bianca},
TITLE = {On the number of components for some parallel communicating grammar systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {2},
PAGES = {136-146},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {parallel communicating grammar systems, number of components, multiple agreements, crossed agreements and replication},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P9625T-F/2/f8fbc47ca072695f357f2a903f86174a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Domaratzki-Salomaa/07,
AUTHOR = {Domaratzki, Michael and Salomaa, Kai},
TITLE = {Transition complexity of language operations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {2},
PAGES = {147-154},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {transition complexity, descriptional complexity, nondeterministic finite automata, regular languages},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P9625T-6/2/4886dccd9cc1bae2901ab8a5c6b2cb06},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gruber-Holzer/07,
AUTHOR = {Gruber, Hermann and Holzer, Markus},
TITLE = {On the average state and transition complexity of finite languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {2},
PAGES = {155-166},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {finite automata, descriptional complexity, average case complexity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P9625T-K/2/de8eb3355a266157c15214e1f0654c47},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gruber-Holzer-Kutrib/07,
AUTHOR = {Gruber, Hermann and Holzer, Markus and Kutrib, Martin},
TITLE = {The size of Higman-Haines sets},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {2},
PAGES = {167-176},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {finite automata, higman's theorem, well-partial order, descriptional complexity, non-recursive trade-offs},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P9625T-M/2/99d8820ff7f4497511df360328ce3f49},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mereghetti-Palano/07,
AUTHOR = {Mereghetti, Carlo and Palano, Beatrice},
TITLE = {Quantum automata for some multiperiodic languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {2},
PAGES = {177-186},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {quantum automata, periodic languages},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P9625T-7/2/78ebed1ef1127fd140f317847cff13e9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fenwick/07,
AUTHOR = {Fenwick, Peter},
TITLE = {Burrows-Wheeler compression: Principles and reflections},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {3},
PAGES = {200-219},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {burrows-wheeler transform, run encoding, ppm, recovered contexts, erasure channels},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P940TB-6/2/fcf38b43a47e8afcaf82099b72758ebb},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kaplan-Landau-Verbin/07,
AUTHOR = {Kaplan, Haim and Landau, Shir and Verbin, Elad},
TITLE = {A simpler analysis of Burrows-Wheeler-based compression},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {3},
PAGES = {220-235},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {text compression, burrows-wheeler transform, distance coding, worst-case analysis},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P940TB-4/2/99b5e8f78b0aa6467e449d0fd9323813},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Giancarlo-Restivo-Sciortino/07,
AUTHOR = {Giancarlo, R. and Restivo, A. and Sciortino, M.},
TITLE = {From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {3},
PAGES = {236-248},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {burrows-wheeler transform, optimal word permutation, suffix tree, lyndon word},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P940TB-7/2/45bcbaebb82069db832caf92865fb0a0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Karkkainen/07,
AUTHOR = {K{\"a}rkk{\"a}inen, Juha},
TITLE = {Fast BWT in small space by blockwise suffix sorting},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {3},
PAGES = {249-257},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {burrows-wheeler transform, suffix sorting, suffix array, space-efficient algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P940TB-2/2/546fd4ec627ec782f7492eaa8f155a7b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Larsson-Sadakane/07,
AUTHOR = {Larsson, N. Jesper and Sadakane, Kunihiko},
TITLE = {Faster suffix sorting},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {3},
PAGES = {258-272},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {suffix arrays, burrows-wheeler transform},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P9625T-1/2/463bb434972e4e0511eeaf8e3ae3e121},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Barbay-Golynski-Munro-Rao/07,
AUTHOR = {Barbay, J{\'e}r{\'e}my and Golynski, Alexander and Munro, J. Ian and Rao, S. Srinivasa},
TITLE = {Adaptive searching in succinctly encoded binary relations and tree-structured documents},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {3},
PAGES = {284-297},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {adaptive algorithms, conjunctive queries, intersection problem, labeled trees, multi-labeled trees, path queries, succinct data structures},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P940TB-5/2/8aadb9bc5bf660e7c48ab7a34353d404},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mantaci-Restivo-Rosone-Sciortino/07,
AUTHOR = {Mantaci, S. and Restivo, A. and Rosone, G. and Sciortino, M.},
TITLE = {An extension of the Burrows-Wheeler Transform},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {3},
PAGES = {298-312},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {burrows-wheeler transform, sequence comparison, alignment-free distance measure},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P940TB-8/2/2660a04815796068822bd34f07b78c14},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gupta-Hon-Shah-Vitter/07a,
AUTHOR = {Gupta, Ankur and Hon, Wing-Kai and Shah, Rahul and Vitter, Jeffrey Scott},
TITLE = {Compressed data structures: Dictionaries and data-aware measures},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {3},
PAGES = {313-331},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {dictionary problem, compressed, gap encoding, rank, select, predecessor, bsgap},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PC3SM2-1/2/6f4de6a6cfc766aa520e2b635bd43e59},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Makinen-Navarro/07,
AUTHOR = {M{\"a}kinen, Veli and Navarro, Gonzalo},
TITLE = {Rank and select revisited and extended},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {3},
PAGES = {332-347},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {succinct data structures, compressed data structures, gap encoding, range searching, position-restricted substring searching, wavelet trees, substring rank and select},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P940TB-9/2/80c0d278e0cf07f62f15b95b8e495f2a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Golynski/07,
AUTHOR = {Golynski, Alexander},
TITLE = {Optimal lower bounds for rank and select indexes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {387},
NUMBER = {3},
PAGES = {348-359},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {fully indexable dictionary, lower bounds, succinct data structures},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PBDR4H-1/2/54535eb3cee54e6f15eccf6523b573ce},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Barrett-Hunt-Marathe-Ravi-Rosenkrantz-Stearns-Thakur/07,
AUTHOR = {Barrett, Chris and Hunt III, Harry B. and Marathe, Madhav V. and Ravi, S.S. and Rosenkrantz, Daniel J. and Stearns, Richard E. and Thakur, Mayur},
TITLE = {Predecessor existence problems for finite discrete dynamical systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {386},
NUMBER = {1-2},
PAGES = {3-37},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {discrete dynamical systems, cellular automata, predecessor existence, data flow analysis, software and hardware verification, computational complexity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NN0WHC-3/2/72a3be5b6e4dd2c2cd6c7c3035f9ef65},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
NOTE = {see Erratum in Theor.~Comput.~Sci., Vol. 395, 2008, No. 1, 132-133},
}
@article{Carnell-Richardson/07,
AUTHOR = {Carnell, Andrew and Richardson, Daniel},
TITLE = {Parallel computation in spiking neural nets},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {386},
NUMBER = {1-2},
PAGES = {57-72},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {spiking neural nets, oscillators, turing completeness, parallel processing, arithmetic},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P61NCC-1/2/5e08eedee54360cf5462799c96243dc6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jansen-Wegener/07,
AUTHOR = {Jansen, Thomas and Wegener, Ingo},
TITLE = {A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {386},
NUMBER = {1-2},
PAGES = {73-93},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {evolutionary algorithms, run time analysis, landscape analysis},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P37JP7-7/2/79d24c13d2fd6019b1af3d1cc338e857},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Benfold-Hallam-Prugel-Bennett/07,
AUTHOR = {Benfold, W. and Hallam, J. and Pr{\"u}gel-Bennett, A.},
TITLE = {Optimal parameters for search using a barrier tree Markov model},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {386},
NUMBER = {1-2},
PAGES = {94-113},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {optimal search, optimal annealing schedule, variable mutation, barrier tree},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P37JP7-1/2/fa4195fd780f09156458a974180624e8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Loos-Ogihara/07,
AUTHOR = {Loos, Remco and Ogihara, Mitsunori},
TITLE = {Complexity theory for splicing systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {386},
NUMBER = {1-2},
PAGES = {132-150},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {dna computing, computational complexity, splicing systems},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P429FT-1/2/cfa7f8521c5c0897aa5788b8b5dbc167},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Feng-Duan-Ji-Ying/07a,
AUTHOR = {Feng, Yuan and Duan, Runyao and Ji, Zhengfeng and Ying, Mingsheng},
TITLE = {Proof rules for the correctness of quantum programs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {386},
NUMBER = {1-2},
PAGES = {151-166},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {quantum programming language, quantum predicate, quantum loops, proof rules},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P37JP7-4/2/6f693b5231d44256f7b4b38591276170},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Froschle-Lasota/07,
AUTHOR = {Fr{\"o}schle, Sibylle and Lasota, S{\l}awomir},
TITLE = {Causality versus true-concurrency},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {386},
NUMBER = {3},
PAGES = {169-187},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {event structures, causal trees, history preserving bisimulation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P8B11M-2/2/44a63c7c27ee8230cf200efd7294baea},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cacciagrano-Corradini-Palamidessi/07,
AUTHOR = {Cacciagrano, D. and Corradini, F. and Palamidessi, C.},
TITLE = {Separation of synchronous and asynchronous communication via testing},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {386},
NUMBER = {3},
PAGES = {218-235},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {asynchronous [pi]-calculus, synchronous communication, encoding, testing semantics},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P8B11M-4/2/197f04018a7e1422183834725fb77e31},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Briais-Nestmann/07,
AUTHOR = {Briais, S{\'e}bastien and Nestmann, Uwe},
TITLE = {Open bisimulation, revisited},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {386},
NUMBER = {3},
PAGES = {236-271},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {$\pi$-calculus, spi-calculus, open bisimulation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P8B11M-5/2/70b15217af0cc75a5836cfd66521f41b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Li-Zhang/07,
AUTHOR = {Li, Xueliang and Zhang, Xiaoyan},
TITLE = {On the minimum monochromatic or multicolored subgraph partition problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {1-10},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {monochromatic, multicolored, partition, complexity, inapproximability},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NNWCMN-3/2/09f6bddd23ea682ba70c43b45f48b5b1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Andre-Caron-Debarbieux-Roos-Tison/07,
AUTHOR = {Andr{\'e}, Y. and Caron, A.C. and Debarbieux, D. and Roos, Y. and Tison, S.},
TITLE = {Path constraints in semistructured data},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {11-33},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {semistructured data graph, path inclusion, prefix rewriting, (finite) exact model},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NS0KYP-1/2/cdaddeadd06a63f9450e478a2d1053c1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Das-Flocchini-Kutten-Nayak-Santoro/07,
AUTHOR = {Das, Shantanu and Flocchini, Paola and Kutten, Shay and Nayak, Amiya and Santoro, Nicola},
TITLE = {Map construction of unknown graphs by multiple agents},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {34-48},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {labelled map construction, graph exploration, leader election, rendezvous, anonymous mobile agents},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NS0KYP-3/2/30d5debd630f51800fb9c65457319fa1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Broersma-Li/07,
AUTHOR = {Broersma, Hajo and Li, Xueliang},
TITLE = {On the complexity of dominating set problems related to the minimum all-ones problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {60-70},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {all-ones problem, odd dominating set, computational complexity, bipartite graph, planar graph},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NXHCH1-1/2/dadf37ce32991ed0757df3f26efd21f6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Galbiati-Maffioli/07,
AUTHOR = {Galbiati, Giulia and Maffioli, Francesco},
TITLE = {Approximation algorithms for maximum cut with limited unbalance},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {78-87},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {randomized approximation algorithm, semidefinite programming, maximum cut, limited unbalance cut},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NYSXTN-1/2/2b370b9cf66a833f9a0c3726ca58cfbb},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hsieh-Tsai/07,
AUTHOR = {Hsieh, Ming Yu and Tsai, Shi-Chun},
TITLE = {On the fairness and complexity of generalized $k$-in-a-row games},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {88-100},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {k-in-a-row games, computational complexity, mathematical games},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NXHCH1-4/2/1257df011f17ad9e7d2868f5e5a5a19f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Khan-Pandurangan-Kumar/07,
AUTHOR = {Khan, Maleq and Pandurangan, Gopal and Kumar, V.S. Anil},
TITLE = {A simple randomized scheme for constructing low-weight $k$-connected spanning subgraphs with applications to distributed algorithms},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {101-114},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {k-connected spanning subgraph, minimum spanning tree, randomized approximation algorithm, distributed algorithm, probabilistic analysis},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NXHCH1-5/2/14a7e5131aab110d035b338785adcdb2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Carpi/07,
AUTHOR = {Carpi, Arturo},
TITLE = {On Dejean's conjecture over large alphabets},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {137-151},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {fractional repetition, repetition threshold, dejean conjecture},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NYJ0YH-2/2/f503030ef089ddfdaac1fc0bdf3d621d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Epifanio-Gabriele-Mignosi-Restivo-Sciortino/07,
AUTHOR = {Epifanio, C. and Gabriele, A. and Mignosi, F. and Restivo, A. and Sciortino, M.},
TITLE = {Languages with mismatches},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {152-166},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {combinatorics on words, formal languages, approximate string matching, indexing},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P37JP7-8/2/0e3a1d3351e2b28b03a8bb9d417dd94a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Blanchet-Sadri-Wetzler/07,
AUTHOR = {Blanchet-Sadri, F. and Wetzler, Nathan D.},
TITLE = {Partial words and the critical factorization theorem revisited},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {179-192},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {word, partial word, period, weak period, local period},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P47GPW-1/2/f45e4e614062f0afed249eb0200c7702},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Becher-Grigorieff/07,
AUTHOR = {Becher, Ver{\'o}nica and Grigorieff, Serge},
TITLE = {Random reals {\`a} la Chaitin with or without prefix-freeness},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {193-201},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {algorithmic randomness, random reals, kolmogorov complexity, omega numbers},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P37JP7-9/2/84d4f40cb026f41c73648c34883466fb},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Berger-Fukunaga-Nagamochi-Parekh/07,
AUTHOR = {Berger, Andr{\'e} and Fukunaga, Takuro and Nagamochi, Hiroshi and Parekh, Ojas},
TITLE = {Approximability of the capacitated $b$-edge dominating set problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {202-213},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {edge dominating set, approximation algorithm, integrality gap},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P37JP7-2/2/4923e7c310252ec5013c8091218138b1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bedaride/07,
AUTHOR = {Bedaride, Nicolas},
TITLE = {Classification of rotations on the torus $T^2$},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {214-225},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {billiard, symbolic dynamic, words, complexity, sturmian words},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P37JP7-3/2/2c4a35fe5adbc85f9b4de2f20846e0f9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kratsch-Liedloff/07,
AUTHOR = {Kratsch, Dieter and Liedloff, Mathieu},
TITLE = {An exact algorithm for the minimum dominating clique problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {226-240},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph algorithms, exponential time algorithms, dominating clique, dominating set},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P4NPMF-2/2/1eaaf63361dc72aac4f4e7f08d2557e5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Blin-Fertin-Vialette/07,
AUTHOR = {Blin, Guillaume and Fertin, Guillaume and Vialette, St{\'e}phane},
TITLE = {Extracting constrained 2-interval subsets in 2-interval sets},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {241-263},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {2-intervals, pattern matching, computational complexity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P4NPMF-5/2/7e970a537b17994b32c892b6acb214b8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Malvestuto-Mezzini-Moscarini/07,
AUTHOR = {Malvestuto, Francesco M. and Mezzini, Mauro and Moscarini, Marina},
TITLE = {An analytical approach to the inference of summary data of additive type},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {264-285},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {category hierarchy, summary database, evaluability},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P7R8CX-1/2/c27fd11e438d37fc6278b2296c813ea1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fang/07,
AUTHOR = {Fang, Jywe-Fei},
TITLE = {The bipanconnectivity and $m$-panconnectivity of the folded hypercube},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {286-300},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {interconnection networks, algorithms, panconnectivity, folded hypercubes},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4P7R8CX-2/2/0c33253ddd675aac5512b39a4065a630},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Arpe-Reischuk/07a,
AUTHOR = {Arpe, Jan and Reischuk, R{\"u}diger},
TITLE = {Learning juntas in the presence of noise},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {384},
NUMBER = {1},
PAGES = {2-21},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {learning of boolean functions, learning in the presence of noise, learning in the presence of irrelevant information, juntas, fourier analysis},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NT84WC-3/2/23160d6665af7fbdbd5bdda44fd243d4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cai-Choudhary/07,
AUTHOR = {Cai, Jin-Yi and Choudhary, Vinay},
TITLE = {Valiant's Holant Theorem and matchgate tensors},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {384},
NUMBER = {1},
PAGES = {22-32},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {holographic algorithms, perfect matchings, matchgates, matchcircuit, matchgrid, signatures, grassmann-plucker identities, covariant and contravariant tensors, holant},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NT9GJ4-5/2/ce1fd1a64029fbaf0a4e6b2d3ca4a942},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hutter/07,
AUTHOR = {Hutter, Marcus},
TITLE = {On universal prediction and Bayesian confirmation},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {384},
NUMBER = {1},
PAGES = {33-48},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {sequence prediction, bayes, solomonoff prior, kolmogorov complexity, occam's razor, prediction bounds, model classes, philosophical issues, symmetry principle, confirmation theory, black raven paradox, reparametrization invariance, old-evidence/updating problem, (non)computable environments},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NT9GJ4-6/2/3f278415d8d9df126f2846dc47e4084b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jain-Nessel-Stephan/07,
AUTHOR = {Jain, Sanjay and Nessel, Jochen and Stephan, Frank},
TITLE = {Invertible classes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {384},
NUMBER = {1},
PAGES = {49-65},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NT9GJ4-1/2/6a6f73468591548fe15f6cb521670767},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hellerstein-Servedio/07,
AUTHOR = {Hellerstein, Lisa and Servedio, Rocco A.},
TITLE = {On PAC learning algorithms for rich Boolean function classes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {384},
NUMBER = {1},
PAGES = {66-76},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computational learning theory, pac learning, polynomial threshold function},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NT9GJ4-9/2/5fd2ae28cd60ac013ffd92c85d9e80a4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bermond-Braud-Coudert/07,
AUTHOR = {Bermond, Jean-Claude and Braud, Laurent and Coudert, David},
TITLE = {Traffic grooming on the path},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {384},
NUMBER = {2-3},
PAGES = {139-151},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {traffic grooming, graph, design theory, wdm},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NKXWR9-2/2/d880812614c566d90a529c5f2d69b265},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Caragiannis-Fishkin-Kaklamanis-Papaioannou/07,
AUTHOR = {Caragiannis, Ioannis and Fishkin, Aleksei V. and Kaklamanis, Christos and Papaioannou, Evi},
TITLE = {A tight bound for online colouring of disk graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {384},
NUMBER = {2-3},
PAGES = {152-160},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph colouring, online algorithms, disk graphs},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NN0WHC-4/2/fbf8d0b876d8cd0c440de5f1e569e311},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Clementi-Di_Ianni-Lauria-Monti-Rossi-Silvestri/07,
AUTHOR = {Clementi, Andrea E.F. and Di Ianni, Miriam and Lauria, Massimo and Monti, Angelo and Rossi, Gianluca and Silvestri, Riccardo},
TITLE = {On the bounded-hop MST problem on random Euclidean instances},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {384},
NUMBER = {2-3},
PAGES = {161-167},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {approximation algorithms, randomized algorithms, bounded height minimum spanning tree},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NSX074-1/2/ce4adc71dd04b936d05571c51981833a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dinitz-Solomon/07,
AUTHOR = {Dinitz, Yefim and Solomon, Noam},
TITLE = {Two absolute bounds for distributed bit complexity},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {384},
NUMBER = {2-3},
PAGES = {168-183},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {distributed computing, leader election, bit complexity, absolute bound},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NN0WHC-5/2/5e2ea908ec04c5729b0d1cb4ad4a67a7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hinkelmann-Jakoby/07,
AUTHOR = {Hinkelmann, Markus and Jakoby, Andreas},
TITLE = {Communications in unknown networks: Preserving the secret of topology},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {384},
NUMBER = {2-3},
PAGES = {184-200},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {communication in unknown networks, security of the topology, network entropy},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NN6TN9-1/2/170dabf52a827b9bfe2b90c3417715ea},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Klasing-Markou-Radzik-Sarracco/07,
AUTHOR = {Klasing, Ralf and Markou, Euripides and Radzik, Tomasz and Sarracco, Fabiano},
TITLE = {Hardness and approximation results for Black Hole Search in arbitrary networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {384},
NUMBER = {2-3},
PAGES = {201-221},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {approximation algorithm, black hole search, graph exploration, mobile agent, np-hardness},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NN0WHC-7/2/bbc321ae7d26a7edd7b9ab06eb3d2bc2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chlebus-Rokicki/07,
AUTHOR = {Chlebus, Bogdan S. and Rokicki, Mariusz A.},
TITLE = {Centralized asynchronous broadcast in radio networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {383},
NUMBER = {1},
PAGES = {5-22},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {radio network, asynchrony, broadcast protocol, centralized algorithm, lower bound, complexity class, completeness},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NH7F4B-1/2/238f4d5d4902c6b4801961cac5e5c3d7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Di_Salvo-Proietti/07,
AUTHOR = {Di Salvo, Aleksej and Proietti, Guido},
TITLE = {Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {383},
NUMBER = {1},
PAGES = {23-33},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {network survivability, single source shortest paths tree, swap algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NCSGVY-4/2/975d470128d86ecfcdcf634658a45506},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dourisboure-Dragan-Gavoille-Yan/07,
AUTHOR = {Dourisboure, Yon and Dragan, Feodor F. and Gavoille, Cyril and Yan, Chenyu},
TITLE = {Spanners for bounded tree-length graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {383},
NUMBER = {1},
PAGES = {34-44},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {additive spanner, tree-decomposition, tree-length, chordality},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NH7F4B-2/2/8f182432c5b04b23ea447838fb83d481},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gasieniec-Potapov-Xin/07,
AUTHOR = {G{\c{a}}sieniec, Leszek and Potapov, Igor and Xin, Qin},
TITLE = {Time efficient centralized gossiping in radio networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {383},
NUMBER = {1},
PAGES = {45-58},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {radio networks, broadcasting and gossiping, centralized algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NK4GB8-1/2/2b210477e9291828c565a73524037061},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Georgiou-Musial-Shvartsman/07,
AUTHOR = {Georgiou, Chryssis and Musial, Peter M. and Shvartsman, Alexander A.},
TITLE = {Long-lived Rambo: Trading knowledge for communication},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {383},
NUMBER = {1},
PAGES = {59-85},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {distributed algorithms, atomic memory service, long-lived executions},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NF4F7P-6/2/f6947850d6699d3848df557413e40824},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Luccio-Sibeyn/07,
AUTHOR = {Luccio, Flaminia L. and Sibeyn, Jop F.},
TITLE = {Feedback vertex sets in mesh-based networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {383},
NUMBER = {1},
PAGES = {86-101},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {combinatorial optimization, feedback vertex set, mesh of trees, tree of meshes, pyramid},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NF4F7P-5/2/2edb024ad0837163f6b317aee82279a9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Matichin-Peleg/07,
AUTHOR = {Matichin, Rachel and Peleg, David},
TITLE = {Approximation algorithm for hotlink assignment in the greedy model},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {383},
NUMBER = {1},
PAGES = {102-110},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {www, search algorithms, hotlinks},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NCSGVY-3/2/c209c69301651576d71b7b6982d337ed},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Calvin/07,
AUTHOR = {Calvin, James M.},
TITLE = {A lower bound on complexity of optimization on the Wiener space},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {383},
NUMBER = {2-3},
PAGES = {132-139},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {global optimization, wiener measure, average-case complexity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NGKWGF-9/2/5d66b9e9b3272e4d55dcb6b25e836fe1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hemaspaandra-Thakur/07,
AUTHOR = {Hemaspaandra, Lane A. and Thakur, Mayur},
TITLE = {Query-monotonic Turing reductions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {383},
NUMBER = {2-3},
PAGES = {153-186},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {np-completeness, paddable set, query-decreasing turing reduction, query-increasing turing reduction, query-monotonic turing reduction, query-nondecreasing turing reduction, query-nonincreasing turing reduction, tight paddable set, turing reduction},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NGKWGF-3/2/89af89d353c57d7a3b94d6115e27e84b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Eberbach/07,
AUTHOR = {Eberbach, Eugene},
TITLE = {The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {383},
NUMBER = {2-3},
PAGES = {200-243},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {problem solving, process algebras, anytime algorithms, superturing models of computation, bounded rational agents, $-calculus, intractability, undecidability, completeness, optimality, search optimality, total optimality},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NGKWGF-7/2/07c09787a0b898de98e171ac414f6ddc},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Burgin/07,
AUTHOR = {Burgin, Mark},
TITLE = {Algorithmic complexity as a criterion of unsolvability},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {383},
NUMBER = {2-3},
PAGES = {244-259},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {kolmogorov complexity, recursive algorithmic complexity, inductive turing machine, algorithmic problem, inductive algorithmic complexity, decidability, super-recursive algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NGKWGF-C/2/def7e37d3daf3d575356b7cdb84d6451},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kelly/07,
AUTHOR = {Kelly, Kevin T.},
TITLE = {Ockham's razor, empirical complexity, and truth-finding efficiency},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {383},
NUMBER = {2-3},
PAGES = {270-289},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NGKWGF-8/2/8416ffcc45ba2606ef99bbf9f6778bb0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Aldini-Bernardo/07,
AUTHOR = {Aldini, Alessandro and Bernardo, Marco},
TITLE = {Mixing logics and rewards for the component-oriented specification of performance measures},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {382},
NUMBER = {1},
PAGES = {3-23},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {continuous-time markov chains, stochastic process algebra, reward structures, component oriented modeling, measure specification language},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NR18K8-2/2/20bcc81885846b23021f564d24074336},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{De_Nicola-Katoen-Latella-Loreti-Massink/07,
AUTHOR = {De Nicola, Rocco and Katoen, Joost-Pieter and Latella, Diego and Loreti, Michele and Massink, Mieke},
TITLE = {Model checking mobile stochastic logic},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {382},
NUMBER = {1},
PAGES = {42-70},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {stochastic process algebra, mobility, global computing, stochastic logics, stochastic model-checking},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NR18K8-1/2/8bc34732588daf49cec1ed51e66715f3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hasan-Tahar/07,
AUTHOR = {Hasan, Osman and Tahar, Sofi{\`e}ne},
TITLE = {Formalization of the Standard Uniform random variable},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {382},
NUMBER = {1},
PAGES = {71-83},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {continuous probability distributions, probabilistic analysis, formal verification, theorem proving, hol theorem prover},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NR18K8-4/2/a1dcd072b6321368b3abf1ff58515abd},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Badoiu-Cole-Demaine-Iacono/07,
AUTHOR = {B{\u{a}}doiu, Mihai and Cole, Richard and Demaine, Erik D. and Iacono, John},
TITLE = {A unified access bound on comparison-based dynamic dictionaries},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {382},
NUMBER = {2},
PAGES = {86-96},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N66R4X-6/2/31e512320528258322e0a92e23f596c0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Caminiti-Finocchi-Petreschi/07,
AUTHOR = {Caminiti, Saverio and Finocchi, Irene and Petreschi, Rossella},
TITLE = {On coding labeled trees},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {382},
NUMBER = {2},
PAGES = {97-108},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph algorithms, labeled trees, prufer-like codes, data structures},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N66R4X-3/2/894e9b281a2cc7e010275522eb02b438},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Carton-Rispal/07,
AUTHOR = {Carton, Olivier and Rispal, Chlo{\'e}},
TITLE = {Complementation of rational sets on scattered linear orderings of finite rank},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {382},
NUMBER = {2},
PAGES = {109-119},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {automata, complementation, linear orderings},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N66R4X-1/2/068e422675165f587adc800d585a103e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Diaz-Serna-Wormald/07,
AUTHOR = {D{\'{i}}az, J. and Serna, M.J. and Wormald, N.C.},
TITLE = {Bounds on the bisection width for random $d$-regular graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {382},
NUMBER = {2},
PAGES = {120-130},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {bisection width, random regular graphs},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N7RWCR-1/2/d0a0d8f30deb3009021e422fc4547377},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gutierrez-Gutierrez-Rivara/07,
AUTHOR = {Gutierrez, Claudio and Gutierrez, Flavio and Rivara, Maria-Cecilia},
TITLE = {Complexity of the bisection method},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {382},
NUMBER = {2},
PAGES = {131-138},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {bisection method, longest edge bisection, triangulation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N66R4X-2/2/980961ea4203c6c17f2f758bde3b449e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Khachiyan-Boros-Elbassioni-Gurvich/07a,
AUTHOR = {Khachiyan, Leonid and Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir},
TITLE = {On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {382},
NUMBER = {2},
PAGES = {139-150},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {bounded degree, bounded dimension, conformal hypergraph, dualization, incremental generating, maximal independent set, minimal transversal, polynomial space},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N66R4X-4/2/13b3c4aa868a702b73b6e0d69ddb4ec7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Martin-Sharma-Stephan/07,
AUTHOR = {Martin, Eric and Sharma, Arun and Stephan, Frank},
TITLE = {On the data consumption benefits of accepting increased uncertainty},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {382},
NUMBER = {3},
PAGES = {170-182},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {inductive inference, mind change bounds, iterative learning, memory limitations},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NCJCYC-2/2/e27fdff6d1bbe4cc22b508f2ed9a8a50},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Besombes-Marion/07,
AUTHOR = {Besombes, J{\'e}r{\^o}me and Marion, Jean-Yves},
TITLE = {Learning tree languages from positive examples and membership queries},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {382},
NUMBER = {3},
PAGES = {183-197},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {learning, grammatical inference, regular tree language, positive example, queries},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NCJCYC-5/2/098af80adf025cb6797031598e996b69},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bulatov-Chen-Dalmau/07,
AUTHOR = {Bulatov, Andrei and Chen, Hubie and Dalmau, V{\'{i}}ctor},
TITLE = {Learning intersection-closed classes with signatures},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {382},
NUMBER = {3},
PAGES = {209-220},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computational learning, closure algorithm, polymorphism, quantified formulas},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NCJCYC-3/2/aceb85e48bfa019f0587d45cd630f2e7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cesa-Bianchi/07,
AUTHOR = {Cesa-Bianchi, Nicol{\`o}},
TITLE = {Applications of regularized least squares to pattern classification},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {382},
NUMBER = {3},
PAGES = {221-231},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {on-line learning, selective sampling, ridge regression, perceptron},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NF4F7P-1/2/87589783f8e7ff4a18fe41f3693e0ff3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ambroladze-Parrado-Hernandez-Shawe-Taylor/07,
AUTHOR = {Ambroladze, Amiran and Parrado-Hern{\'a}ndez, Emilio and Shawe-Taylor, John},
TITLE = {Complexity of pattern classes and the Lipschitz property},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {382},
NUMBER = {3},
PAGES = {232-246},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {lipschitz functions, rademacher complexity, empirical complexity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NF4F7P-2/2/0ced79aed91c09522eccf3849eb95225},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hutter-Muchnik/07,
AUTHOR = {Hutter, Marcus and Muchnik, Andrej},
TITLE = {On semimeasures predicting Martin-L{\"o}f random sequences},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {382},
NUMBER = {3},
PAGES = {247-261},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {sequence prediction, algorithmic information theory, universal enumerable semimeasure, mixture distributions, predictive convergence, martin-lof randomness, supermartingales, quasimeasures},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NCJCYC-4/2/92107d841b924d1d6b67d5202b87446a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cervelle-Formenti-Masson/07,
AUTHOR = {Cervelle, Julien and Formenti, Enrico and Masson, Beno{\^{i}}t},
TITLE = {From sandpiles to sand automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {381},
NUMBER = {1-3},
PAGES = {1-28},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {sandpiles, sand automata, reversibility, undecidability, grain conservation, ultimate periodicity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NCJCYC-7/2/25824a1b82cc1465336ac7982558126c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jurgensen-Staiger-Yamasaki/07,
AUTHOR = {J{\"u}rgensen, Helmut and Staiger, Ludwig and Yamasaki, Hideki},
TITLE = {Finite automata encoding geometric figures},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {381},
NUMBER = {1-3},
PAGES = {33-43},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {black-and-white images, rational affine transformations, regular [omega]-languages, zoom-ins},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NCJCYC-1/2/26f8622b70bc4d14c69e8e0c5bc3c994},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Koukopoulos-Mavronicolas-Spirakis/07a,
AUTHOR = {Koukopoulos, Dimitrios and Mavronicolas, Marios and Spirakis, Paul},
TITLE = {The increase of the instability of networks due to quasi-static link capacities},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {381},
NUMBER = {1-3},
PAGES = {44-56},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {adversarial queuing theory, adversarial quasi-static queuing theory, network stability, greedy protocols},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NGKWGF-1/2/06ba52d6952924b299b28f117150963d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gomez-Gutierrez-Ibeas/07a,
AUTHOR = {G{\'o}mez, Domingo and Gutierrez, Jaime and Ibeas, {\'A}lvar},
TITLE = {Optimal routing in double loop networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {381},
NUMBER = {1-3},
PAGES = {68-85},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {double loop networks, cayley graphs, shortest path, lattices, closest vector problem},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NF7Y8X-2/2/d5fd00685962de3aec41cc4405af93de},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bassino-Nicaud/07,
AUTHOR = {Bassino, Fr{\'e}d{\'e}rique and Nicaud, Cyril},
TITLE = {Enumeration and random generation of accessible automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {381},
NUMBER = {1-3},
PAGES = {86-104},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {finite automata, bijections, asymptotic enumeration, random generation, boltzmann samplers},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NG3TDT-2/2/6c86d0b09da975bff08fc927fcdad1b8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Doty-Nichols/07,
AUTHOR = {Doty, David and Nichols, Jared},
TITLE = {Pushdown dimension},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {381},
NUMBER = {1-3},
PAGES = {105-123},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {resource-bounded dimension, martingale, finite-state, pushdown},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NG3TDT-3/2/8b1434b6dfc846e1c23bd909b7f4a1eb},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Li-Li-Li-Wang/07,
AUTHOR = {Chen, Mingxia and Li, Jianbo and Li, Jianping and Li, Weidong and Wang, Lusheng},
TITLE = {Some approximation algorithms for the clique partition problem in weighted interval graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {381},
NUMBER = {1-3},
PAGES = {124-133},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {weighted interval graphs, cliques, approximation algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NKXWR9-1/2/83d90eba30c358e48ed034af65e3ab74},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Amiraslani-Aruliah-Corless/07,
AUTHOR = {Amiraslani, A. and Aruliah, D.A. and Corless, R.M.},
TITLE = {Block LU factors of generalized companion matrix pencils},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {381},
NUMBER = {1-3},
PAGES = {134-147},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {matrix polynomials, polynomial eigenvalues, block factoring},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NJ20K3-1/2/fe5e0adab5290a637d76bbb03107f791},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ko-Yu/07,
AUTHOR = {Ko, Ker-I and Yu, Fuxiang},
TITLE = {Jordan curves with polynomial inverse moduli of continuity},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {381},
NUMBER = {1-3},
PAGES = {148-161},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computational complexity of real functions, jordan curve, polynomial inverse modulus of continuity, p},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NJ20K3-2/2/bfb9ff5fc8212db8b51882563adf4fdc},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fleiner-Irving-Manlove/07,
AUTHOR = {Fleiner, Tam{\'a}s and Irving, Robert W. and Manlove, David F.},
TITLE = {Efficient algorithms for generalized Stable Marriage and Roommates problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {381},
NUMBER = {1-3},
PAGES = {162-176},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {stable roommates problem, stable marriage problem, partial order, forbidden pair, super-stable matching},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NKXWR9-3/2/430886e6c8cd3985af6cfafd09941363},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Krieger-Shallit/07,
AUTHOR = {Krieger, Dalia and Shallit, Jeffrey},
TITLE = {Every real number greater than 1 is a critical exponent},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {381},
NUMBER = {1-3},
PAGES = {177-182},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {critical exponents},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NNWCMN-2/2/e8465658ab11e0d4999e681c4caa2e31},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Alvarez-Cases-Diaz-Petit-Serna/07,
AUTHOR = {{\`A}lvarez, Carme and Cases, Rafel and D{\'{i}}az, Josep and Petit, Jordi and Serna, Maria},
TITLE = {Communication tree problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {381},
NUMBER = {1-3},
PAGES = {197-217},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {communication tree, tree layout, approximation algorithms, random graphs},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NP9876-1/2/b7460cad5eb5ef10f61b43a2d66de508},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lin-Tan-Hsu-Hsu/07,
AUTHOR = {Lin, Cheng-Kuan and Tan, Jimmy J.M. and Hsu, D. Frank and Hsu, Lih-Hsing},
TITLE = {On the spanning connectivity and spanning laceability of hypercube-like networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {381},
NUMBER = {1-3},
PAGES = {218-229},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {hamiltonian, hamiltonian connected, hamiltonian laceable, hypercube networks, hypercube-like networks, w*-connected, w*-laceable, spanning connectivity, spanning laceability, graph container},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NNYJF2-4/2/c32bd0632e71da6fff29bad41c0f5d05},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{He-Lin-Yuan/07,
AUTHOR = {He, Cheng and Lin, Yixun and Yuan, Jinjiang},
TITLE = {Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {381},
NUMBER = {1-3},
PAGES = {234-240},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {multicriteria scheduling, batching machine, maximum lateness, pareto optimal solutions},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NNYJF2-2/2/a6b8fe79e97513b94db1fc2f13e00094},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Asdre-Nikolopoulos/07a,
AUTHOR = {Asdre, Katerina and Nikolopoulos, Stavros D.},
TITLE = {$NP$-completeness results for some problems on subclasses of bipartite and chordal graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {381},
NUMBER = {1-3},
PAGES = {248-259},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {harmonious coloring, pair-complete coloring, k-path partition, bipartite permutation graphs, convex graphs, quasi-threshold graphs, threshold graphs, np-completeness},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NS0KYP-2/2/27e940d1bb9928bbd5028ada6492c6d7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Brandstadt-Eschen-Sritharan/07,
AUTHOR = {Brandst{\"a}dt, Andreas and Eschen, Elaine M. and Sritharan, R.},
TITLE = {The induced matching and chain subgraph cover problems for convex bipartite graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {381},
NUMBER = {1-3},
PAGES = {260-265},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {chain cover, induced matching, convex bipartite graph},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NG3TDT-1/2/9b8c68c3e9ae29971c36e7a679712193},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lavallee-Reutenauer/07,
AUTHOR = {Lavall{\'e}e, Sylvain and Reutenauer, Christophe},
TITLE = {On a zeta function associated with automata and codes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {381},
NUMBER = {1-3},
PAGES = {266-273},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {automata, codes, zeta function, noncommutative series, rational aperiodic},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NF7Y8X-1/2/93df8f575bb9ad9682555b90cec2216d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Choffrut-DAlessandro-Varricchio/07,
AUTHOR = {Choffrut, Christian and D'Alessandro, Flavio and Varricchio, Stefano},
TITLE = {On the separability of sparse context-free languages and of bounded rational relations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {381},
NUMBER = {1-3},
PAGES = {274-279},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {bounded languages, context-free languages, rational relations, decisional problems},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NF7Y8X-3/2/b78fa0aa23fbd50135f3e0b29bb8583d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bonifaci/07,
AUTHOR = {Bonifaci, Vincenzo},
TITLE = {An adversarial queueing model for online server routing},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {381},
NUMBER = {1-3},
PAGES = {280-287},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {online algorithms, adversarial queueing theory, server routing},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NXHCH1-8/2/8ba0669453a23a42e70163e8062afb6e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hsieh-Yang/07,
AUTHOR = {Hsieh, Sun-Yuan and Yang, Shih-Cheng},
TITLE = {Approximating the selected-internal Steiner tree},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {381},
NUMBER = {1-3},
PAGES = {288-291},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {design and analysis of algorithms, approximation algorithms, steiner tree, the selected-internal steiner tree problem, max snp-hard},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NYJ0YH-1/2/cef1a52743697a6ea0ef97bdca7a9120},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Avin-Ercal/07,
AUTHOR = {Avin, Chen and Ercal, Gunes},
TITLE = {On the cover time and mixing time of random geometric graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {380},
NUMBER = {1-2},
PAGES = {2-22},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {random walks, cover time, mixing time, random graphs},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N68NN1-2/2/08bd3c4cf2646138af8097c8521c222b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Czeizler-Kari/07,
AUTHOR = {Czeizler, Eugen and Kari, Jarkko},
TITLE = {A tight linear bound on the synchronization delay of bijective automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {380},
NUMBER = {1-2},
PAGES = {23-36},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {reversible cellular automata, inverse neighborhood, local automata, synchronization delay},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N56BWF-3/2/a62ccffe319280f423876f3075ad64be},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Czumaj-Kowaluk-Lingas/07,
AUTHOR = {Czumaj, Artur and Kowaluk, Miroslaw and Lingas, Andrzej},
TITLE = {Faster algorithms for finding lowest common ancestors in directed acyclic graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {380},
NUMBER = {1-2},
PAGES = {37-46},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {directed acyclic graphs, lowest common ancestors, matrix multiplication, time complexity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N56BWF-4/2/82ad690835286f92009e3cab71e826ac},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dietzfelbinger-Weidling/07,
AUTHOR = {Dietzfelbinger, Martin and Weidling, Christoph},
TITLE = {Balanced allocation and dictionaries with tightly packed constant size bins},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {380},
NUMBER = {1-2},
PAGES = {47-68},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {randomized algorithms, data structures, dictionaries, hashing, random graphs, balanced allocation, storage space},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N56BWF-5/2/e7895608ad0aafc2ed09b5e527268224},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Droste-Gastin/07,
AUTHOR = {Droste, Manfred and Gastin, Paul},
TITLE = {Weighted automata and weighted logics},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {380},
NUMBER = {1-2},
PAGES = {69-86},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {formal power series, weighted automata, weighted logics},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N56BWF-6/2/fae888f6f8e83b817e66af7b9ed7f30f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gairing-Monien-Woclaw/07,
AUTHOR = {Gairing, Martin and Monien, Burkhard and Woclaw, Andreas},
TITLE = {A faster combinatorial approximation algorithm for scheduling unrelated parallel machines},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {380},
NUMBER = {1-2},
PAGES = {87-99},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {scheduling, unrelated parallel machines, approximation algorithms, unsplittable network flow},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N5CXMV-7/2/5aa903859ff154f860d57f897d8bca3b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hromkovic-Schnitger/07,
AUTHOR = {Hromkovi{\v{c}}, Juraj and Schnitger, Georg},
TITLE = {Comparing the size of NFAs with and without $\epsilon$-transitions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {380},
NUMBER = {1-2},
PAGES = {100-114},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {finite automata, descriptional complexity, lower bounds on complexity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N68NN1-3/2/4a967585674aaeae7fcdec357a959739},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Koiran-Nesme-Portier/07,
AUTHOR = {Koiran, Pascal and Nesme, Vincent and Portier, Natacha},
TITLE = {The quantum query complexity of the Abelian hidden subgroup problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {380},
NUMBER = {1-2},
PAGES = {115-126},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {quantum computing, query complexity, lower bounds, polynomial method, hidden subgroup problems, simon's problem},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N5CXMV-8/2/0ef1f6f6521eb7676f46491b829ef2a3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mislove/07,
AUTHOR = {Mislove, Michael},
TITLE = {Discrete random variables over domains},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {380},
NUMBER = {1-2},
PAGES = {181-198},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N5CXMV-9/2/da710e212296123b8f22307e9d04f53f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Grohe-Koch-Schweikardt/07,
AUTHOR = {Grohe, Martin and Koch, Christoph and Schweikardt, Nicole},
TITLE = {Tight lower bounds for query processing on streaming and external memory data},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {380},
NUMBER = {1-2},
PAGES = {199-217},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {data streams, external memory, lower bounds, machine models, xml query languages},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N5CXMV-6/2/09e018d79ee4d091aa5a890f2971f61d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Adamczewski-Allouche/07,
AUTHOR = {Adamczewski, Boris and Allouche, Jean-Paul},
TITLE = {Reversals and palindromes in continued fractions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {380},
NUMBER = {3},
PAGES = {220-237},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {continued fractions, combinatorics on words, palindromes, sturmian sequences, mirror formula, folding lemma, diophantine approximation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N7RY6S-1/2/d358d776a4908fb833fa3a6306330f97},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ambroz-Frougny/07,
AUTHOR = {Ambro{\v{z}}, Petr and Frougny, Christiane},
TITLE = {On alpha-adic expansions in Pisot bases},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {380},
NUMBER = {3},
PAGES = {238-250},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {beta-expansion, alpha-adic expansion, pisot number},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N7XPF1-1/2/9cb863ad6a0cd7e6e8ebae65e5a06773},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Arnoux-Berthe-Fernique-Jamet/07,
AUTHOR = {Arnoux, Pierre and Berth{\'e}, Val{\'e}rie and Fernique, Thomas and Jamet, Damien},
TITLE = {Functional stepped surfaces, flips, and generalized substitutions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {380},
NUMBER = {3},
PAGES = {251-265},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {generalized substitution, discrete geometry, arithmetical discrete plane, discrete surface, word combinatorics, flip, lozenge tiling, dimer tiling, sturmian word},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N8M8CD-1/2/a259072688c490f6f2fa1191cbad8b96},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Balazi-Masakova-Pelantova/07,
AUTHOR = {Bal{\'a}{\v{z}}i, Peter and Mas{\'a}kov{\'a}, Zuzana and Pelantov{\'a}, Edita},
TITLE = {Factor versus palindromic complexity of uniformly recurrent infinite words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {380},
NUMBER = {3},
PAGES = {266-275},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {palindrome, infinite words, interval exchange transformations, palindromic complexity, factor complexity, uniformly recurrent words},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N7S57S-2/2/b9f53e2fddd1b4ad63510a62a5bd3628},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Berthe-Nouvel/07,
AUTHOR = {Berth{\'e}, Val{\'e}rie and Nouvel, Bertrand},
TITLE = {Discrete rotations and symbolic dynamics},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {380},
NUMBER = {3},
PAGES = {276-285},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {discrete rotations, discrete geometry, word combinatorics, two-dimensional words, symbolic dynamics},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N8M8CD-2/2/2477c51864e1b751f099f6b6cf585f51},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Borel/07,
AUTHOR = {Borel, Jean-Pierre},
TITLE = {A geometrical characterization of factors of multidimensional Billiard words and some applications},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {380},
NUMBER = {3},
PAGES = {286-303},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {languages, billiard words, complexity, factors, palindromic factors},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N7S57S-3/2/7c8700e09f30539b7af84d17c75a0904},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cassaigne-Frid/07,
AUTHOR = {Cassaigne, J. and Frid, A.E.},
TITLE = {On the arithmetical complexity of Sturmian words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {380},
NUMBER = {3},
PAGES = {304-316},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {arithmetical complexity, sturmian word, infinite word, subword complexity, rotation word, fibonacci word},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N7S57S-8/2/8d608a6397192f8cf2eecefd7f0f910c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fernique/07,
AUTHOR = {Fernique, Thomas},
TITLE = {Local rule substitutions and stepped surfaces},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {380},
NUMBER = {3},
PAGES = {317-329},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {multi-dimensional word, generalized substitution, stepped surface},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N8BN37-1/2/59a941ee7e88e83015f29a16a66147f2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Glen/07,
AUTHOR = {Glen, Amy},
TITLE = {Powers in a class of $A$-strict standard episturmian words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {380},
NUMBER = {3},
PAGES = {330-354},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {episturmian word, sturmian word, arnoux-rauzy sequence, k-bonacci word, singular word, index, powers},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N7S57S-4/2/50fecd51e9dde9ad527eb721a247b35f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Halava-Harju-Karhumaki-Latteux/07,
AUTHOR = {Halava, Vesa and Harju, Tero and Karhum{\"a}ki, Juhani and Latteux, Michel},
TITLE = {Extension of the decidability of the marked PCP to instances with unique blocks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {380},
NUMBER = {3},
PAGES = {355-362},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {post correspondence problem, infinite post correspondence problem, marked morphism, unique continuation, unique block, decidability},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N7S57S-9/2/73f766078beda014a561f1f46139bc9b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Holub-Kortelainen/07,
AUTHOR = {Holub, {\v{S}}t{\v{e}}p{\'a}n and Kortelainen, Juha},
TITLE = {On systems of word equations with simple loop sets},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {380},
NUMBER = {3},
PAGES = {363-372},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {combinatorics on words, equivalent subsystems, pumping property},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N7S57S-C/2/e5207275978ce6d38ba0d9a8296383eb},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ilie/07,
AUTHOR = {Ilie, Lucian},
TITLE = {A note on the number of squares in a word},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {380},
NUMBER = {3},
PAGES = {373-376},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {combinatorics on words, repetitions, squares},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N7S57S-5/2/f812e59dbbeed257b729f70fc20cc850},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lepisto-Pappalardi-Saari/07,
AUTHOR = {Lepist{\"o}, Arto and Pappalardi, Francesco and Saari, Kalle},
TITLE = {Transposition invariant words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {380},
NUMBER = {3},
PAGES = {377-387},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {transposition invariant words, partition generated by a subgroup, primitive roots, favorable prime numbers},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N7S57S-7/2/aa95879a3318cd6df3a2dbf60dbf2d22},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Groote-Voorhoeve/07,
AUTHOR = {Groote, Jan Friso and Voorhoeve, Marc},
TITLE = {Operational semantics for Petri net components},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {1-2},
PAGES = {1-19},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {semantics, petri nets, process algebra, bisimulation, modelling, verification},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MSXT9H-4/2/f7a86b37c5807a23595bbad6ba45ad9b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Japaridze/07,
AUTHOR = {Japaridze, Giorgi},
TITLE = {From truth to computability II},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {1-2},
PAGES = {20-52},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computability logic, interactive computation, game semantics, linear logic, constructive logic},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MV758R-2/2/aa91a59a421105a76e8ded822d3ffabe},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Martins/07,
AUTHOR = {Martins, Manuel A.},
TITLE = {Closure properties for the class of behavioral models},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {1-2},
PAGES = {53-83},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {behavioral specification, behavioral equivalence, hidden equational logic, leibniz operator, equivalential logic},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N2TS51-2/2/07dd35ebdf176ae5ae86682c522c6a2c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kanovich-Vauzeilles/07,
AUTHOR = {Kanovich, Max and Vauzeilles, Jacqueline},
TITLE = {Strong planning under uncertainty in domains with numerous but identical elements (a generic approach)},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {1-2},
PAGES = {84-119},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {ai planning under uncertainty, linear logic, proofs as programs, deterministic and non-deterministic planning domains, horn linear logic},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N02J7J-4/2/b93c96f156866224a0e67b49570a4787},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Marcial-Romero-Escardo/07,
AUTHOR = {Marcial-Romero, J. Raymundo and Escard{\'o}, Mart{\'{i}}n H.},
TITLE = {Semantics of a sequential language for exact real-number computation},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {1-2},
PAGES = {120-141},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {exact real-number computation, sequential computation, semantics, non-determinism, pcf},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N0X5XT-1/2/fe86af017d5f29944071663c690dee55},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chadha-Cruz-Filipe-Mateus-Sernadas/07,
AUTHOR = {Chadha, R. and Cruz-Filipe, L. and Mateus, P. and Sernadas, A.},
TITLE = {Reasoning about probabilistic sequential programs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {1-2},
PAGES = {142-165},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {probabilistic reasoning, hoare calculus, completeness, decidability},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N5CXMV-1/2/201adbce40a0b93b7d748dfee0640204},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Diaconescu-Stefaneas/07,
AUTHOR = {Diaconescu, R{\u{a}}zvan and Stefaneas, Petros},
TITLE = {Ultraproducts and possible worlds semantics in institutions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {1-2},
PAGES = {210-230},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {institutions, possible worlds, kripke models, modal logic, ultraproducts},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NBBYWY-1/2/f3f022cc4adf5b3056da44c20ff1f5d1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Asarin-Schneider-Yovine/07,
AUTHOR = {Asarin, Eugene and Schneider, Gerardo and Yovine, Sergio},
TITLE = {Algorithmic analysis of polygonal hybrid systems, part I: Reachability},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {1-2},
PAGES = {231-265},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {hybrid systems, differential inclusions, verification, decision algorithm, reachability analysis},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NF4F7P-4/2/192854ed18aa9476a68d51e2999ecc91},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dawar-Kreutzer/07,
AUTHOR = {Dawar, Anuj and Kreutzer, Stephan},
TITLE = {Generalising automaticity to modal properties of finite structures},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {1-2},
PAGES = {266-285},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {modal logics, fixed-point logics, automata, complexity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NF4F7P-7/2/0933e2d1abf05679a9ac4db49d26aec0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bozzelli/07,
AUTHOR = {Bozzelli, Laura},
TITLE = {Complexity results on branching-time pushdown model checking},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {1-2},
PAGES = {286-297},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {infinite-state systems, pushdown systems, model checking, regular propositional temporal logics},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NF4F7P-8/2/c09519344f331c9701f700ea3cbfc926},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Berger-Bollobas-Borgs-Chayes-Riordan/07,
AUTHOR = {Berger, Noam and Bollob{\'a}s, B{\'e}la and Borgs, Christian and Chayes, Jennifer and Riordan, Oliver},
TITLE = {Degree distribution of the FKP network model},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {3},
PAGES = {306-316},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {power-law degree distribution, hot model},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N4PY45-3/2/e66dc0fd0973e66698d80951327065e0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bansal-Agrawal-Malhotra/07,
AUTHOR = {Bansal, Vipul and Agrawal, Aseem and Malhotra, Varun S.},
TITLE = {Polynomial time algorithm for an optimal stable assignment with multiple partners},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {3},
PAGES = {317-328},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {stable marriage, multiple partners, optimal assignment, substitutes, dis-satisfaction score, meta-rotation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N4PY45-4/2/51382594d46856ccb3dac02e2b3f45f8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jagerskupper/07,
AUTHOR = {J{\"a}gersk{\"u}pper, Jens},
TITLE = {Algorithmic analysis of a basic evolutionary algorithm for continuous optimization},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {3},
PAGES = {329-347},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {runtime analysis, evolutionary algorithms, continuous optimization},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N56BWF-2/2/50c628d00698fec7043abc0b0d86c843},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bleichenbacher-Kiayias-Yung/07,
AUTHOR = {Bleichenbacher, Daniel and Kiayias, Aggelos and Yung, Moti},
TITLE = {Decoding interleaved Reed-Solomon codes over noisy channels},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {3},
PAGES = {348-360},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {efficient decoding, probabilistic algorithms, reed-solomon codes, polynomial reconstruction},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N4PY45-1/2/536da4501de89af02b893f978ed37cf7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Khachiyan-Boros-Elbassioni-Gurvich-Makino/07,
AUTHOR = {Khachiyan, Leonid and Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir and Makino, Kazuhisa},
TITLE = {Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {3},
PAGES = {361-376},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {incremental generation, maximal empty boxes, p-efficient points},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N4PY45-8/2/8b877fe2b0a7149403a8aab754c03657},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bodirsky-Gropl-Kang/07,
AUTHOR = {Bodirsky, Manuel and Gr{\"o}pl, Clemens and Kang, Mihyun},
TITLE = {Generating labeled planar graphs uniformly at random},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {3},
PAGES = {377-386},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {labeled planar graph, enumeration, decomposition, sampling algorithm, dynamic programming, graph theory},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N4PY45-5/2/4c06fbabe635c3a288cbf0427e0b395d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hall-Hippler-Skutella/07,
AUTHOR = {Hall, Alex and Hippler, Steffen and Skutella, Martin},
TITLE = {Multicommodity flows over time: Efficient algorithms and complexity},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {3},
PAGES = {387-404},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {network flow, routing, flow over time, dynamic flow, complexity, efficient algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N4PY45-6/2/f69a05fcd824036c9b8aac5c14fd8b2d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gal-Miltersen/07,
AUTHOR = {G{\'a}l, Anna and Miltersen, Peter Bro},
TITLE = {The cell probe complexity of succinct data structures},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {3},
PAGES = {405-417},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {succinct data structures, cell probe complexity, polynomial evaluation with preprocessing},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N4PY45-9/2/10c622972c00e5d3fc2a780a0c0435c7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Matias-Porat/07,
AUTHOR = {Matias, Yossi and Porat, Ely},
TITLE = {Efficient pebbling for list traversal synopses with application to program rollback},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {3},
PAGES = {418-436},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N4PY45-7/2/de0155fe49b9cc3d02f13a83775cbc73},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Manea-Martin-Vide-Mitrana/07a,
AUTHOR = {Manea, Florin and Martin-Vide, Carlos and Mitrana, Victor},
TITLE = {Erratum to ''Accepting networks of splicing processors: Complexity results''},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {378},
NUMBER = {1},
PAGES = {131},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NC4MDD-1/2/05a1cac27297da71dd6892d0490c1660},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
NOTE = {Originally in Theor.~Comput.~Sci., Vol. 371, 2007, No. 1-2, 72-82},
}
@article{Daley-Domaratzki/07,
AUTHOR = {Daley, Mark and Domaratzki, Michael},
TITLE = {On codes defined by bio-operations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {378},
NUMBER = {1},
PAGES = {3-16},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {theory of codes, bio-operations, synchronized insertion, synchronized deletion, ciliates},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4M4KDMX-2/2/2474723ed5cd5c1b644e0177144887de},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Brun/07,
AUTHOR = {Brun, Yuriy},
TITLE = {Arithmetic computation in the tile assembly model: Addition and multiplication},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {378},
NUMBER = {1},
PAGES = {17-31},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {self-assembly, adder, multiplier, tile assembly model, crystal growth, molecular computation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4M91NYF-2/2/43eb49a8294f326e6edb003004b6bd97},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ambainis-Iwama-Kawachi-Raymond-Yamashita/07,
AUTHOR = {Ambainis, Andris and Iwama, Kazuo and Kawachi, Akinori and Raymond, Rudy and Yamashita, Shigeru},
TITLE = {Improved algorithms for quantum identification of Boolean oracles},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {378},
NUMBER = {1},
PAGES = {41-53},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {quantum computing, query complexity, algorithmic learning theory},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MMWHMX-1/2/30cf0fb055d2b67dbdf23cb56fb53e22},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kashefi-Kerenidis/07,
AUTHOR = {Kashefi, Elham and Kerenidis, Iordanis},
TITLE = {Statistical zero knowledge and quantum one-way functions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {378},
NUMBER = {1},
PAGES = {101-116},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {quantum computing, cryptography, one-way functions, quantum sampling},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N7SBW8-1/2/33750f62b54ef99acccea4269aba3189},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ciobanu-Pan-Paun-Perez-Jimenez/07,
AUTHOR = {Ciobanu, Gabriel and Pan, Linqiang and P{\u{a}}un, Gheorghe and P{\'e}rez-Jim{\'e}nez, Mario J.},
TITLE = {$P$ systems with minimal parallelism},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {378},
NUMBER = {1},
PAGES = {117-130},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {membrane computing, p system, universality, sat problem},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NCJCYC-6/2/504442139c4d241b7de81f444297452f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Garg-Jain-Talwar-Vazirani/07,
AUTHOR = {Garg, Dinesh and Jain, Kamal and Talwar, Kunal and Vazirani, Vijay V.},
TITLE = {A primal-dual algorithm for computing Fisher equilibrium in the absence of Gross substitutability property},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {378},
NUMBER = {2},
PAGES = {143-152},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computing market equilibria, fisher equilibrium, gross substitutability property, strongly polynomial time exact algorithm, combinatorial algorithm, primal-dual algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N2D304-2/2/40f7c5e1975faa3e9e9ab138efcc6216},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kapoor-Mehta-Vazirani/07,
AUTHOR = {Kapoor, Sanjiv and Mehta, Aranyak and Vazirani, Vijay},
TITLE = {An auction-based market equilibrium algorithm for a production model},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {378},
NUMBER = {2},
PAGES = {153-164},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {market equilibrium, auction, algorithm, production},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N2D304-3/2/0490735aa30956fa5a4014dcb5d0485c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fischer-Vocking/07,
AUTHOR = {Fischer, Simon and V{\"o}cking, Berthold},
TITLE = {On the structure and complexity of worst-case equilibria},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {378},
NUMBER = {2},
PAGES = {165-174},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {load balancing, fully mixed nash equilibrium, price of anarchy, job scheduling, balls and bins processes},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N2D304-4/2/a509d7c1b4dc8c34a46e0c753f79b8ca},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Feigenbaum-Karger-Mirrokni-Sami/07,
AUTHOR = {Feigenbaum, Joan and Karger, David R. and Mirrokni, Vahab S. and Sami, Rahul},
TITLE = {Subjective-cost policy routing},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {378},
NUMBER = {2},
PAGES = {175-189},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {policy routing, path-vector routing, algorithmic mechanism design},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N2D304-5/2/704ee2ae249852233e4ecb4d99cd6a8b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cheng-Li-Shi/07,
AUTHOR = {Cheng, Gang and Li, Ping and Shi, Peng},
TITLE = {A new algorithm based on copulas for VaR valuation with empirical calculations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {378},
NUMBER = {2},
PAGES = {190-197},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {value-at-risk, copulas, spearman's rho, monte carlo simulation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N49VS1-1/2/f07b2e092f28ab527fd9877781cb43bd},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ganguly/07,
AUTHOR = {Ganguly, Sumit},
TITLE = {Counting distinct items over update streams},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {378},
NUMBER = {3},
PAGES = {211-222},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {randomized algorithm, online algorithm, data stream, distinct items, negative dependence},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N43S08-1/2/8de32968a4dfdeb738420dbd4732b4de},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Yang-Yuan/07,
AUTHOR = {Chen, Erdong and Yang, Linji and Yuan, Hao},
TITLE = {Longest increasing subsequences in windows based on canonical antichain partition},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {378},
NUMBER = {3},
PAGES = {223-236},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {longest increasing subsequences, canonical antichain partition, data streaming model},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N49VS1-7/2/0496fa6931508826c8d87925e457e18b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ben-Moshe-Bhattacharya-Shi-Tamir/07,
AUTHOR = {Ben-Moshe, Boaz and Bhattacharya, Binay and Shi, Qiaosheng and Tamir, Arie},
TITLE = {Efficient algorithms for center problems in cactus networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {378},
NUMBER = {3},
PAGES = {237-252},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {facility location optimization, center problems, cactus networks},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N49VS1-8/2/dcc11d841aa503e004b7daea5bdd9c31},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ackermann-Newman-Roglin-Vocking/07,
AUTHOR = {Ackermann, Heiner and Newman, Alantha and R{\"o}glin, Heiko and V{\"o}cking, Berthold},
TITLE = {Decision-making based on approximate and smoothed Pareto curves},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {378},
NUMBER = {3},
PAGES = {253-270},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {decision making, multicriteria optimization, pareto curve, smoothed analysis},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N49VS1-9/2/5bc1d961ef4ef273afddae72ec861741},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kao-Li-Wang/07,
AUTHOR = {Kao, Ming-Yang and Li, Xiang-Yang and Wang, Weizhao},
TITLE = {Average case analysis for tree labelling schemes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {378},
NUMBER = {3},
PAGES = {271-291},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {tree labelling, average case analysis, separator},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N5TNG3-1/2/270db6bbcb11035afb50c50b2e4a27b6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Manthey-Reischuk/07,
AUTHOR = {Manthey, Bodo and Reischuk, R{\"u}diger},
TITLE = {Smoothed analysis of binary search trees},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {378},
NUMBER = {3},
PAGES = {292-315},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {smoothed analysis, binary search trees, discrete perturbations, permutations},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N49VS1-4/2/3d5a16b4da8575e02769650e54c50b57},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Liu-Xi-Xiao-Jiang/07,
AUTHOR = {Liu, Lan and Xi, Chen and Xiao, Jing and Jiang, Tao},
TITLE = {Complexity and approximation of the minimum recombinant haplotype configuration problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {378},
NUMBER = {3},
PAGES = {316-330},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {haplotyping, pedigree, recombinant, snp, complexity, approximation, l-reduction, positive result, negative result, bounded number, children, mates},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N43S08-2/2/8b02b21977d60427ea81a61a79f33a7d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Avidor-Langberg/07,
AUTHOR = {Avidor, Adi and Langberg, Michael},
TITLE = {The multi-multiway cut problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {377},
NUMBER = {1-3},
PAGES = {35-42},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {approximation algorithms, linear programming, minimum multicut, minimum multiway cut},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N3GFR7-1/2/6f1407c03563dfa13e81b0ecb265592a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Epstein-Kleiman-Sgall-van_Stee/07,
AUTHOR = {Epstein, Leah and Kleiman, Yanir and Sgall, Ji{\v{r}}{\'{i}} and van Stee, Rob},
TITLE = {Paging with connections: FIFO strikes again},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {377},
NUMBER = {1-3},
PAGES = {55-64},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {paging, connection caching, online algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N1T1XX-5/2/de788b27a126bae96661e4090c688353},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Marco-Martinez/07,
AUTHOR = {Marco, Ana and Mart{\'{i}}nez, Jos{\'e}-Javier},
TITLE = {Bernstein-Bezoutian matrices and curve implicitization},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {377},
NUMBER = {1-3},
PAGES = {65-72},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {bernstein basis, bezoutian matrices, curve, implicitization, interpolation, total positivity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N1T1XX-2/2/d4b50356737b271d00d2b0a2bdae1f5e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{DAlessandro-Richomme-Varricchio/07,
AUTHOR = {D'Alessandro, Flavio and Richomme, Gw{\'e}na{\"e}l and Varricchio, Stefano},
TITLE = {Well quasi-orders generated by a word-shuffle rewriting},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {377},
NUMBER = {1-3},
PAGES = {73-92},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {formal languages, well quasi-orders, shuffle},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N1T1XX-6/2/453cfcd427f034ff17fa41478b03702b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Beyersdorff/07a,
AUTHOR = {Beyersdorff, Olaf},
TITLE = {Classes of representable disjoint $NP$-pairs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {377},
NUMBER = {1-3},
PAGES = {93-109},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {disjoint -pairs, propositional proof systems},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N1T1XX-7/2/f710db0e1175efa9a6da569e0377bf8b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Becher-Figueira-Picchi/07,
AUTHOR = {Becher, V{\'e}ronica and Figueira, Santiago and Picchi, Rafael},
TITLE = {Turing's unpublished algorithm for normal numbers},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {377},
NUMBER = {1-3},
PAGES = {126-138},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computable absolutely normal numbers, algorithm for normal numbers, turing's unpublished manuscript},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N2KTMS-2/2/9e54b004af79e20eb821d796371e56fa},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lin-Lee/07,
AUTHOR = {Lin, Tien-Ching and Lee, D.T.},
TITLE = {Randomized algorithm for the sum selection problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {377},
NUMBER = {1-3},
PAGES = {151-156},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {bioinformatics, randomized algorithm, random sampling, order-statistic tree, k maximum sums problem, sum selection problem, selection problem, maximum sum segment problem, maximum sum problem},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N2TS51-5/2/a11778e475dee20b846fd9333bf15f37},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Diedrich-Jansen/07,
AUTHOR = {Diedrich, Florian and Jansen, Klaus},
TITLE = {Faster and simpler approximation algorithms for mixed packing and covering problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {377},
NUMBER = {1-3},
PAGES = {181-204},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {approximation algorithm, linear and convex programming, optimization, packing and covering problem, lagrangian decomposition, logarithmic potential},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N68NN1-1/2/2e69df8c1a1a9a5fdce46a32629858dc},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bengtsson-Chen/07,
AUTHOR = {Bengtsson, Fredrik and Chen, Jingsen},
TITLE = {Ranking $k$ maximum sums},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {377},
NUMBER = {1-3},
PAGES = {229-237},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {maximum sum subsequence, maximum sum subarray, algorithm design},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N7RWCR-3/2/55aa9dc4bf7afd505e0b380a48f0fb69},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lai-Tian/07,
AUTHOR = {Lai, Yung-Ling and Tian, Chang-Sin},
TITLE = {An extremal graph with given bandwidth},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {377},
NUMBER = {1-3},
PAGES = {238-242},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {bandwidth, extremal graph},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N7RWCR-2/2/140c7bac9eae034d2d88e8821ea895f0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Diaz-Kaminski/07,
AUTHOR = {D{\'{i}}az, Josep and Kami{\'n}ski, Marcin},
TITLE = {MAX-CUT and MAX-BISECTION are $NP$-hard on unit disk graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {377},
NUMBER = {1-3},
PAGES = {271-276},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computational complexity, max-cut, max-bisection, np-hard, unit disk graphs},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N1JRV5-2/2/c643eb9c3967362d9d0f8e6494f42562},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cleary-Luccio-Pagli/07,
AUTHOR = {Cleary, Sean and Luccio, Fabrizio and Pagli, Linda},
TITLE = {Refined upper bounds for right-arm rotation distances},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {377},
NUMBER = {1-3},
PAGES = {277-281},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {rotation distance, restricted rotation, right arm, binary tree, design of algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N2TS51-4/2/99823c492346552e5f652cbce8561be3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ehrenfeucht-Rozenberg/07,
AUTHOR = {Ehrenfeucht, A. and Rozenberg, G.},
TITLE = {Events and modules in reaction systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {376},
NUMBER = {1-2},
PAGES = {3-16},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {natural computing, biochemical reactions, partial orders},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MWGFJY-7/2/d4dd9df3de51bb29da6379e5e02c33a9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gurevich-Veanes-Wallace/07,
AUTHOR = {Gurevich, Yuri and Veanes, Margus and Wallace, Charles},
TITLE = {Can abstract state machines be useful in language theory?},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {376},
NUMBER = {1-2},
PAGES = {17-29},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {abstract state machine, asml, evolutionary algorithms, graph-partition algorithm, language theory},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MWGFJY-2/2/69ae8f49909cc6d3e3b6eaa35ee42417},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ananichev-Volkov-Zaks/07,
AUTHOR = {Ananichev, D.S. and Volkov, M.V. and Zaks, Yu.I.},
TITLE = {Synchronizing automata with a letter of deficiency 2},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {376},
NUMBER = {1-2},
PAGES = {30-41},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {deterministic finite automaton, synchronizing automaton, reset word, cerny conjecture, deficiency of a transformation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MWGFJY-8/2/6b7b3d6869a7491ab1ee2dd19542eb36},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bastien-Czyzowicz-Fraczak-Rytter/07a,
AUTHOR = {Bastien, C{\'e}dric and Czyzowicz, Jurek and Fraczak, Wojciech and Rytter, Wojciech},
TITLE = {Equivalence of simple functions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {376},
NUMBER = {1-2},
PAGES = {42-51},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {formal language, context-free grammar, push-down transducer, equivalence problem, simple grammar, simple function},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MXJ3V3-1/2/d276d741743c365461f76aa68b3b48ca},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Carton/07,
AUTHOR = {Carton, Olivier},
TITLE = {The growth ratio of synchronous rational relations is unique},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {376},
NUMBER = {1-2},
PAGES = {52-59},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MWGFJY-3/2/d715204d1b68705d51a4735c8976e08a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Han-Salomaa-Salomaa-Wood-Yu/07,
AUTHOR = {Han, Yo-Sub and Salomaa, Arto and Salomaa, Kai and Wood, Derick and Yu, Sheng},
TITLE = {On the existence of prime decompositions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {376},
NUMBER = {1-2},
PAGES = {60-69},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {language decompositions, primality, unary languages},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MWGFJY-9/2/769c1ad5de20ed1d290a93a18392cf38},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Krieger/07,
AUTHOR = {Krieger, Dalia},
TITLE = {On critical exponents in fixed points of non-erasing morphisms},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {376},
NUMBER = {1-2},
PAGES = {70-88},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {critical exponent, circular d0l languages},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MYD67V-2/2/19134bc5940fe94e4736d7d350903176},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kufleitner/07,
AUTHOR = {Kufleitner, Manfred},
TITLE = {Polynomials, fragments of temporal logic and the variety {\bf DA} over traces},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {376},
NUMBER = {1-2},
PAGES = {89-100},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {mazurkiewicz traces, polynomial closure, temporal logic},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MWGFJY-4/2/d3bb2950254752d82e38e57cf8db8502},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kutrib-Malcher/07a,
AUTHOR = {Kutrib, Martin and Malcher, Andreas},
TITLE = {Context-dependent nondeterminism for pushdown automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {376},
NUMBER = {1-2},
PAGES = {101-111},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {deterministic pushdown automata, computational capacity, time-efficient recognizers, closures of languages, context-free languages},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MWGFJY-5/2/d8dc3074e9a84283994b2b4055093cab},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Furia-Rossi-Mandrioli-Morzenti/07,
AUTHOR = {Furia, Carlo A. and Rossi, Matteo and Mandrioli, Dino and Morzenti, Angelo},
TITLE = {Automated compositional proofs for real-time systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {376},
NUMBER = {3},
PAGES = {164-184},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {formal verification, modular systems, real-time, compositionality, rely/guarantee},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N02J7J-1/2/88b807ae8c0f8ed5687e529c537b851b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hermida-Tennent/07,
AUTHOR = {Hermida, C. and Tennent, R.D.},
TITLE = {A fibrational framework for possible-world semantics of ALGOL-like languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {375},
NUMBER = {1-3},
PAGES = {3-19},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MPC46J-2/2/5c87656ad10cb1b1b1e308afeb8829be},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hyland-Levy-Plotkin-Power/07,
AUTHOR = {Hyland, Martin and Levy, Paul Blain and Plotkin, Gordon and Power, John},
TITLE = {Combining algebraic effects with continuations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {375},
NUMBER = {1-3},
PAGES = {20-40},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computational effect, lawvere theory, modularity, monad},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MPC46J-B/2/8e9983737a552bc3bf462b75891c23b6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Filinski/07,
AUTHOR = {Filinski, Andrzej},
TITLE = {On the relations between monadic semantics},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {375},
NUMBER = {1-3},
PAGES = {41-75},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {monads, computational metalanguage, logical relations, recursive types, continuations},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MPC46J-3/2/410e402f8f0945eb45426848bea13a00},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Biernacka-Danvy/07,
AUTHOR = {Biernacka, Ma{\l}gorzata and Danvy, Olivier},
TITLE = {A syntactic correspondence between context-sensitive calculi and abstract machines},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {375},
NUMBER = {1-3},
PAGES = {76-108},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {refocusing, reduction semantics, contexts, continuations, delimited continuations, defunctionalization, explicit substitutions, environment-based machines, proper tail recursion, stack inspection},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MPKBVB-6/2/2eacc63e38f6eb057a31fdafa2e06200},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jones/07a,
AUTHOR = {Jones, C.B.},
TITLE = {Splitting atoms safely},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {375},
NUMBER = {1-3},
PAGES = {109-119},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {formal methods, concurrency, atomicity, granularity, rely/guarantee conditions, refining atomicity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MPC46J-4/2/5d54002ad77abb3e5748e7e799a82355},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jones-Andersen/07,
AUTHOR = {Jones, Neil D. and Andersen, Nils},
TITLE = {Flow analysis of lazy higher-order functional programs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {375},
NUMBER = {1-3},
PAGES = {120-136},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {collecting semantics, higher-order program, program flow analysis, lazy evaluation, reynolds analysis of applicative lisp programs term rewriting system, tree grammar},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MPC46J-5/2/9270a15e14345e4de06b194031a1010d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Might-Shivers/07,
AUTHOR = {Might, Matthew and Shivers, Olin},
TITLE = {Analyzing the environment structure of higher-order languages using frame strings},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {375},
NUMBER = {1-3},
PAGES = {137-168},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {lambda calculus, program analysis, super-beta, higher-order functional languages, delta-cfa, control-flow analysis, data-flow analysis, frame strings, continuation-passing style, cps, abstract interpretation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MPC46J-C/2/f8340c64ae6a429375a09f737d6a7439},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Freyd/07,
AUTHOR = {Freyd, Peter},
TITLE = {Core algebra revisited},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {375},
NUMBER = {1-3},
PAGES = {193-200},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {reynolds, polymorphism, parametricity, core algebra},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MR86NJ-1/2/5fabe2a5a48dc47dcf93778fefbd5d21},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Brookes/07,
AUTHOR = {Brookes, Stephen},
TITLE = {A semantics for concurrent separation logic},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {375},
NUMBER = {1-3},
PAGES = {227-270},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {concurrency, pointers, race condition, semantics, logic},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MPKBVB-2/2/a4b1791ef798c87e572ae739ce786047},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Morris/07,
AUTHOR = {Morris, F. Lockwood},
TITLE = {A few exercises in theorem processing},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {375},
NUMBER = {1-3},
PAGES = {335-345},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {theorem processing, derived inference rules, conversions, list processing},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MPKBVB-4/2/e0cf948695540e72acb09207cefcaed8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cheng/07a,
AUTHOR = {Cheng, Yongxi},
TITLE = {Lattice grids and prisms are antimagic},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {374},
NUMBER = {1-3},
PAGES = {66-73},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {antimagic, labelling, lattice grid, prism},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MK02TD-4/2/7d87b7d0bf613a3e1ac39034110f5405},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Csuhaj-Varju-Petre-Vaszil/07,
AUTHOR = {Csuhaj-Varj{\'u}, Erzs{\'e}bet and Petre, Ion and Vaszil, Gy{\"o}rgy},
TITLE = {Self-assembly of strings and languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {374},
NUMBER = {1-3},
PAGES = {74-81},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {self-assembly, word, combinatorics, generator, base},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MK02TD-5/2/0c3c7084bbf81064d2c471366acde5f3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chang-Eu-Yeh/07,
AUTHOR = {Chang, Gerard J. and Eu, Sen-Peng and Yeh, Chung-Heng},
TITLE = {On the $(n, t)$-antipodal Gray codes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {374},
NUMBER = {1-3},
PAGES = {82-90},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {antipodal, gray code, hamiltonian cycle, n-cube, complement, period},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MK02TD-2/2/7778ddc63e76dc9f0cf4f66f8e43625c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Eriksen/07,
AUTHOR = {Eriksen, Niklas},
TITLE = {Reversal and transposition medians},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {374},
NUMBER = {1-3},
PAGES = {111-126},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {median, reversal, transposition, genome rearrangement},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MKKCP7-3/2/9233be9083d982db00dd505e4cc52df0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kuske/07,
AUTHOR = {Kuske, Dietrich},
TITLE = {Weighted asynchronous cellular automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {374},
NUMBER = {1-3},
PAGES = {127-148},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {weighted automata, trace theory},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MKKCP7-2/2/31f011255c3eb6363ecac34225c12bbd},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Alon-Lingas-Wahlen/07,
AUTHOR = {Alon, Noga and Lingas, Andrzej and Wahlen, Martin},
TITLE = {Approximating the maximum clique minor and some subgraph homeomorphism problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {374},
NUMBER = {1-3},
PAGES = {149-158},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {approximation, graph minors, graph homeomorphism},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MPC46J-6/2/6aa931ca45c1c442453da52a46256775},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Liu-Ng-Cheng/07,
AUTHOR = {Liu, L.L. and Ng, C.T. and Cheng, T.C.E.},
TITLE = {Scheduling jobs with agreeable processing times and due dates on a single batch processing machine},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {374},
NUMBER = {1-3},
PAGES = {159-169},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {scheduling, batch processing, agreeable},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MSXT9H-2/2/a75d32455142c615a719a4176f72649e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Her-Ramakrishna/07,
AUTHOR = {Her, Jun-Ho and Ramakrishna, R.S.},
TITLE = {An external-memory depth-first search algorithm for general grid graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {374},
NUMBER = {1-3},
PAGES = {170-180},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {i/o-complexity, external-memory algorithms, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MPC46J-7/2/b7d7c89b0a6de6a66f1da48ba1167f3b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Meng/07b,
AUTHOR = {Chen, Wenbin and Meng, Jiangtao},
TITLE = {Hardness of approximating the Minimum Solutions of Linear Diophantine Equations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {374},
NUMBER = {1-3},
PAGES = {191-195},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {np-hardness, computational complexity, linear diophantine equations, approximation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MPC46J-9/2/6033cc458bec540160f084a8ea8b8659},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fu-Tian-Yuan-Lin/07,
AUTHOR = {Fu, Ruyan and Tian, Ji and Yuan, Jinjiang and Lin, Yixun},
TITLE = {Online scheduling in a parallel batch processing system to minimize makespan using restarts},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {374},
NUMBER = {1-3},
PAGES = {196-202},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {single machine scheduling, parallel batch, online algorithm, restart, competitive ratio},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MSXT9H-5/2/ab5ff46bd7253e1410ee2e8c51e3fb7c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kralovic-Ruzicka/07,
AUTHOR = {Kr{\'a}lovi{\v{c}}, R. and Ru{\v{z}}i{\v{c}}ka, P.},
TITLE = {Ranks of graphs: The size of acyclic orientation cover for deadlock-free packet routing},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {374},
NUMBER = {1-3},
PAGES = {203-213},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {communication networks, packet routing, acyclic orientation cover},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MVF51B-1/2/55462757b0a17e99df97a45ad01e3f36},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Maurer/07,
AUTHOR = {M{\"a}urer, Ina},
TITLE = {Characterizations of recognizable picture series},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {374},
NUMBER = {1-3},
PAGES = {214-228},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {picture series, two-dimensional languages, unambiguity, automata},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MYD67V-1/2/936dc6393ec545e7e9ea78776873a5cc},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Catalano-Visconti/07,
AUTHOR = {Catalano, Dario and Visconti, Ivan},
TITLE = {Hybrid commitments and their applications to zero-knowledge proof systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {374},
NUMBER = {1-3},
PAGES = {229-260},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {commitment schemes, zero-knowledge proofs},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MVVSTT-1/2/c9b552eaf007877507c01c320186ed59},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cimato-De_Prisco-De_Santis/07,
AUTHOR = {Cimato, S. and De Prisco, R. and De Santis, A.},
TITLE = {Colored visual cryptography without color darkening},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {374},
NUMBER = {1-3},
PAGES = {261-276},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {visual cryptography, secret sharing, colored visual cryptography},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MVVSTT-2/2/4e91e6aa22e1108770dd2e008976efcf},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Danicic-Harman-Hierons-Howroyd-Laurence/07,
AUTHOR = {Danicic, Sebastian and Harman, Mark and Hierons, Rob and Howroyd, John and Laurence, Michael R.},
TITLE = {Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {373},
NUMBER = {1-2},
PAGES = {1-18},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {structured program schemas, conservative schemas, liberal schemas, free schemas, linear schemas, schema equivalence, static analysis, program slicing},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4M40041-1/2/54642ac0bdc6022b30ea89fe4261e998},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Luttgen-Vogler/07a,
AUTHOR = {L{\"u}ttgen, Gerald and Vogler, Walter},
TITLE = {Conjunction on processes: Full abstraction via ready-tree semantics},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {373},
NUMBER = {1-2},
PAGES = {19-40},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {labelled transition system, conjunction, consistency preorder, ready-tree semantics, ready-tree preorder, full abstraction},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4M9RKMB-2/2/1195104e8b01653c887b4e75f06352d5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Barbanera-Bugliesi-Dezani-Ciancaglini-Sassone/07,
AUTHOR = {Barbanera, Franco and Bugliesi, Michele and Dezani-Ciancaglini, Mariangiola and Sassone, Vladimiro},
TITLE = {Space-aware ambients and processes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {373},
NUMBER = {1-2},
PAGES = {41-69},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {distributed systems, resource control, ambient calculi, type-and-effect systems, behavioural semantics},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MG065P-2/2/71b8c1300371559db643c884aa09e5f0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Clavel-Meseguer-Palomino/07,
AUTHOR = {Clavel, Manuel and Meseguer, Jos{\'e} and Palomino, Miguel},
TITLE = {Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {373},
NUMBER = {1-2},
PAGES = {70-91},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {reflection, reflective logics, reflective programming languages, universal theories, rewriting logic, membership equational logic, maude},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MMFJ5C-1/2/aabedb72e393e5e2746afe8e24029c98},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Deng-Palamidessi/07,
AUTHOR = {Deng, Yuxin and Palamidessi, Catuscia},
TITLE = {Axiomatizations for probabilistic finite-state behaviors},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {373},
NUMBER = {1-2},
PAGES = {92-114},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {process calculus, probability, nondeterminism, axiomatizations, behavioral equivalences},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MM7TFY-1/2/7b2b0c3e9862b4aa820d0841df420771},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dal_Lago-Montanari-Puppis/07,
AUTHOR = {Dal Lago, Ugo and Montanari, Angelo and Puppis, Gabriele},
TITLE = {Compact and tractable automaton-based representations of time granularities},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {373},
NUMBER = {1-2},
PAGES = {115-141},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {time granularities, automata, temporal databases},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MMWHMX-3/2/ed8d999bdce80ccb7692e1de0c1bb2ed},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Andrei-Ciobanu-Lucanu/07,
AUTHOR = {Andrei, Oana and Ciobanu, Gabriel and Lucanu, Dorel},
TITLE = {A rewriting logic framework for operational semantics of membrane systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {373},
NUMBER = {3},
PAGES = {163-181},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {membrane systems, operational semantics, rewriting logic, maude},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MP0011-1/2/e6d1d6a9c1b1b24a643fbf388a17549e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hym-Hennessy/07,
AUTHOR = {Hym, Samuel and Hennessy, Matthew},
TITLE = {Adding recursion to DPI},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {373},
NUMBER = {3},
PAGES = {182-212},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {dpi-calculus, recursion, implementation using replication, recursive and co-inductive types},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MP0011-3/2/236d08b5ba57af7700ccdd2dfcfb4878},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Meseguer-Rosu/07,
AUTHOR = {Meseguer, Jos{\'e} and Ro{\c{s}}u, Grigore},
TITLE = {The rewriting logic semantics project},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {373},
NUMBER = {3},
PAGES = {213-237},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {semantics and analysis of programming languages, rewriting logic},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MPC46J-1/2/1e004b1fcb13cf470c211ae83e29391c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dolinka/07,
AUTHOR = {Dolinka, Igor},
TITLE = {Axiomatizing the identities of binoid languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {1},
PAGES = {1-14},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MG5WD0-1/2/7d2c9748df0e04bf55a86c25aa2ab640},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Leve-Richomme/07,
AUTHOR = {Lev{\'e}, F. and Richomme, G.},
TITLE = {Quasiperiodic Sturmian words and morphisms},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {1},
PAGES = {15-25},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {sturmian words, quasiperiodicity, lyndon words, morphisms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MBJK4H-3/2/0a1d8f661dd21a14f848f213c125f984},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Berman-Karpinski-Nekrich/07,
AUTHOR = {Berman, Piotr and Karpinski, Marek and Nekrich, Yakov},
TITLE = {Optimal trade-off for Merkle tree traversal},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {1},
PAGES = {26-36},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {time and space complexity, optimality, trade-offs, merkle trees, merkle tree traversal, authentification path, amortization},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MGM2SG-1/2/bab5d3877390b877757f2b488f27916b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bell-Potapov/07a,
AUTHOR = {Bell, Paul and Potapov, Igor},
TITLE = {On the membership of invertible diagonal and scalar matrices},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {1},
PAGES = {37-45},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {membership problem, matrix semigroups, diagonal matrix, undecidability, post correspondence problem},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MGDYX7-2/2/361256e23fae22365e02a25ea208d226},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ishii-Fujita-Nagamochi/07,
AUTHOR = {Ishii, Toshimasa and Fujita, Hitoshi and Nagamochi, Hiroshi},
TITLE = {Minimum cost source location problem with local 3-vertex-connectivity requirements},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {1},
PAGES = {81-93},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph algorithm, undirected graph, location problem, local vertex-connectivity, polynomial time algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MDWY3H-2/2/f9d02b50b026f8bfccf585a12caf0ccc},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dou-Yao/07,
AUTHOR = {Dou, Wenqing and Yao, Enyu},
TITLE = {On rearrangeable multirate three-stage Clos networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {1},
PAGES = {103-107},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {three-stage clos network, multirate network, rearrangeable},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MKKCP7-1/2/bd88a249def98fe50130971a019c69a1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gurski/07a,
AUTHOR = {Gurski, Frank},
TITLE = {Characterizations for restricted graphs of NLC-width 2},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {1},
PAGES = {108-114},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {nlc-width, nlct-width, linear nlc-width, graph characterizations},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MMFJ5C-2/2/711258d3e0c1f7ec59dfd12a44472518},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ferragina-Venturini/07,
AUTHOR = {Ferragina, Paolo and Venturini, Rossano},
TITLE = {A simple storage scheme for strings achieving entropy bounds},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {1},
PAGES = {115-121},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {data structures for strings, data compression},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MSXT9H-1/2/7bc0e522e57afb1ff4e6e7c9e173a083},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Busi/07,
AUTHOR = {Busi, Nadia},
TITLE = {Using well-structured transition systems to decide divergence for catalytic $P$ systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {2-3},
PAGES = {125-135},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {membrane computing, catalytic p system, decidability, well-structured transition system},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MG065P-7/2/fe1c6cf1a620abd75bbb865fac63a417},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cavaliere-Freund-Oswald-Sburlan/07,
AUTHOR = {Cavaliere, Matteo and Freund, Rudolf and Oswald, Marion and Sburlan, Drago{\c{s}}},
TITLE = {Multiset random context grammars, checkers, and transducers},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {2-3},
PAGES = {136-151},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {antiport, checker, multiset grammar, p system, random context, transducer},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MG065P-8/2/2a4424231f5f82e66ef0d8942e7fb35a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Csuhaj-Varju-Margenstern-Vaszil-Verlan/07,
AUTHOR = {Csuhaj-Varj{\'u}, Erzs{\'e}bet and Margenstern, Maurice and Vaszil, Gy{\"o}rgy and Verlan, Sergey},
TITLE = {On small universal antiport $P$ systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {2-3},
PAGES = {152-164},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {p systems, universality, size complexity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MG065P-5/2/f2c8b15fdf4f81e0d04a025b1d8f049c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fontana-Manca/07,
AUTHOR = {Fontana, Federico and Manca, Vincenzo},
TITLE = {Discrete solutions to differential equations by metabolic $P$ systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {2-3},
PAGES = {165-182},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {metabolic networks, ordinary differential equations, p systems, mp systems, mp graphs},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MK72JX-1/2/6f5e39621f9cd43e5dd85b2699982743},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gutierrez-Naranjo-Perez-Jimenez-Riscos-Nunez/07,
AUTHOR = {Guti{\'e}rrez-Naranjo, Miguel A. and P{\'e}rez-Jim{\'e}nez, Mario J. and Riscos-N{\'u}{\~n}ez, Agust{\'{i}}n},
TITLE = {On the degree of parallelism in membrane systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {2-3},
PAGES = {183-195},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {membrane computing, p systems, dependency graph, degree of parallelism},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MG065P-3/2/7b615979b688bc0af85aa6e59451c53c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ibarra-Paun-Paun-Rodriguez-Paton-Sosik-Woodworth/07,
AUTHOR = {Ibarra, Oscar H. and P{\u{a}}un, Andrei and P{\u{a}}un, Gheorghe and Rodr{\'{i}}guez-Pat{\'o}n, Alfonso and Sos{\'{i}}k, Petr and Woodworth, Sara},
TITLE = {Normal forms for spiking neural $P$ systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {2-3},
PAGES = {196-217},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {membrane computing, spiking neural p system, universality, normal form},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MG065P-4/2/51d1b95537615f8d2e9a6e587d046371},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Leporati-Felloni/07,
AUTHOR = {Leporati, Alberto and Felloni, Sara},
TITLE = {Three ''quantum'' algorithms to solve 3-SATt},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {2-3},
PAGES = {218-241},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {quantum p systems, membrane computing, quantum register machines, quantum circuits, np-complete problems, 3-sat},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MG065P-9/2/4b6f5cfbb3a1d51f932b9f0298b7c1e7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Beggs-Tucker/07,
AUTHOR = {Beggs, Edwin J. and Tucker, John V.},
TITLE = {Can Newtonian systems, bounded in space, time, mass and energy compute all functions?},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {371},
NUMBER = {1-2},
PAGES = {4-19},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {newtonian machines, computability, hypercomputation, experimental computation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4M5F330-3/2/653b5d1cd344fd3fc9e634e7634862c8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bernardini-Gheorghe-Krasnogor/07,
AUTHOR = {Bernardini, Francesco and Gheorghe, Marian and Krasnogor, Natalio},
TITLE = {Quorum sensing $P$ systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {371},
NUMBER = {1-2},
PAGES = {20-33},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {p systems, turing machines, quorum sensing, vibrio fischeri},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4M6937D-1/2/369cad4d950d33551af24011a91ebe43},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gutierrez-Naranjo-Perez-Jimenez-Romero-Campero/07,
AUTHOR = {Guti{\'e}rrez-Naranjo, Miguel A. and P{\'e}rez-Jim{\'e}nez, Mario J. and Romero-Campero, Francisco J.},
TITLE = {A uniform solution to SAT using membrane creation},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {371},
NUMBER = {1-2},
PAGES = {54-61},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {natural computing, membrane computing, cellular complexity classes, sat problem},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4M6RXKN-1/2/b612fe05c1dcf09c50ff293b62f0933d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Michalak-Kwasnicka/07,
AUTHOR = {Michalak, Krzysztof and Kwa{\'s}nicka, Halina},
TITLE = {Influence of data dimensionality on the quality of forecasts given by a multilayer perceptron},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {371},
NUMBER = {1-2},
PAGES = {62-71},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {correlation dimension, data dimensionality, neural networks, multilayer perceptron, time series prediction},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4M6XMHG-1/2/debabde42db287dd45da4fa03049895e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Manea-Martin-Vide-Mitrana/07,
AUTHOR = {Manea, Florin and Mart{\'{i}}n-Vide, Carlos and Mitrana, Victor},
TITLE = {Accepting networks of splicing processors: Complexity results},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {371},
NUMBER = {1-2},
PAGES = {72-82},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {splicing processor, communication, complexity class, problem solving},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4M7YK1V-1/2/c4ab7156510236c822bf520aad33fc70},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
NOTE = {see Erratum in Theor.~Comput.~Sci.\ 378, 2007, No. 1, 131},
}
@article{Krishna/07,
AUTHOR = {Krishna, Shankara Narayanan},
TITLE = {Universality results for $P$ systems based on brane calculi operations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {371},
NUMBER = {1-2},
PAGES = {83-105},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {brane calculi, membrane computing, universality, matrix grammars},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4M6XMHG-4/2/e8efcd44db6abc062cc986d7455e502c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Koltun-Papadimitriou/07,
AUTHOR = {Koltun, Vladlen and Papadimitriou, Christos H.},
TITLE = {Approximately dominating representatives},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {371},
NUMBER = {3},
PAGES = {148-154},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MC81PN-2/2/59707994a98a9347bc57dee812da0a5a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Atserias/07,
AUTHOR = {Atserias, Albert},
TITLE = {Conjunctive query evaluation by search-tree revisited},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {371},
NUMBER = {3},
PAGES = {155-168},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {conjunctive query, constraint-satisfaction problem, treewidth},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MDGPB5-4/2/c81ed35d48fe7974af0321bdfc017d85},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Calvanese-De_Giacomo-Lenzerini-Vardi/07,
AUTHOR = {Calvanese, Diego and De Giacomo, Giuseppe and Lenzerini, Maurizio and Vardi, Moshe Y.},
TITLE = {View-based query processing: On the relationship between rewriting, answering and losslessness},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {371},
NUMBER = {3},
PAGES = {169-182},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {query containment, query rewriting, query answering, losslessness, conjunctive queries, regular path queries, semistructured data},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MDGPB5-3/2/3a696dabaf4fb96b852671969260dfd9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Deutsch-Ludascher-Nash/07,
AUTHOR = {Deutsch, Alin and Lud{\"a}scher, Bertram and Nash, Alan},
TITLE = {Rewriting queries using views with access patterns under integrity constraints},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {371},
NUMBER = {3},
PAGES = {200-226},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {views, access patterns, integrity constraints, query rewriting},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MDGPB5-2/2/ee0e6bd07f01789024ca827d27b31310},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Matias-Urieli/07,
AUTHOR = {Matias, Yossi and Urieli, Daniel},
TITLE = {Optimal workload-based weighted wavelet synopses},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {371},
NUMBER = {3},
PAGES = {227-246},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {approximation theory, massive data sets, workload-based, wavelet synopses, weighted wavelets, weighted inner product},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MG065P-1/2/afffe19e6d2537d71545aaaa48c36a7a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Balcazar-Garriga/07,
AUTHOR = {Balc{\'a}zar, Jos{\'e} L. and Garriga, Gemma C.},
TITLE = {Horn axiomatizations for sequential data},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {371},
NUMBER = {3},
PAGES = {247-264},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {sequential patterns, association rules, closure operators, propositional horn theories},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MDGPB5-5/2/4661a1256a2eca99ce83902d47c47f22},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kim-Park/07a,
AUTHOR = {Kim, Jin Wook and Park, Kunsoo},
TITLE = {An efficient alignment algorithm for masked sequences},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {370},
NUMBER = {1-3},
PAGES = {19-33},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {local alignment, global alignment, affine gap penalty, masked sequence},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4M4KDMX-6/2/735b6e605c9a7d4e0242a05ff0eec19c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gajardo-Mazoyer/07,
AUTHOR = {Gajardo, A. and Mazoyer, J.},
TITLE = {One Head machines from a symbolic approach},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {370},
NUMBER = {1-3},
PAGES = {34-47},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {turing machine, symbolic dynamics, formal language, discrete dynamical system},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4M4KDMX-3/2/da9748f172340e81db882c138dfd9762},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Avigad-Yin/07,
AUTHOR = {Avigad, Jeremy and Yin, Yimu},
TITLE = {Quantifier elimination for the reals with a predicate for the powers of two},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {370},
NUMBER = {1-3},
PAGES = {48-59},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {real closed fields, quantifier elimination},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4M4KDMX-4/2/ab2ccb170d1a0aada3b3a861629d7676},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Glasser-Selman-Zhang/07a,
AUTHOR = {Gla{\ss}er, Christian and Selman, Alan L. and Zhang, Liyu},
TITLE = {Canonical disjoint $NP$-pairs of propositional proof systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {370},
NUMBER = {1-3},
PAGES = {60-73},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {disjoint np-pairs, propositional proof systems, degrees, p-separable},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4M4KDMX-5/2/82e7ea235f66a233ad7a8ac5a0eea27c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Giakoumakis-Olariu/07,
AUTHOR = {Giakoumakis, Vassilis and Olariu, Stephan},
TITLE = {All minimal prime extensions of hereditary classes of graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {370},
NUMBER = {1-3},
PAGES = {74-93},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph theory, graph decompositions, modular decomposition},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4M9RM3Y-1/2/3d2a828f7ad04bb8afca17499ab00a4a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Han-Wood/07,
AUTHOR = {Han, Yo-Sub and Wood, Derick},
TITLE = {Obtaining shorter regular expressions from finite-state automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {370},
NUMBER = {1-3},
PAGES = {110-120},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {regular languages, finite-state automata, state elimination, bridge states, vertical chopping, horizontal chopping},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4M6HY9N-1/2/fe3d44c4aa81a2d8e74f344d4afedd4b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Almeida-Zeitoun/07,
AUTHOR = {Almeida, Jorge and Zeitoun, Marc},
TITLE = {An automata-theoretic approach to the word problem for $\omega$-terms over $R$},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {370},
NUMBER = {1-3},
PAGES = {131-169},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {semigroup, pseudovariety, word problem, automata minimization, pseudoword, omega-term, identity basis},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4M7YK1V-2/2/106920f822cb9d5b0b5fb3ab1d9d1244},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Leupold/07,
AUTHOR = {Leupold, Peter},
TITLE = {Languages generated by iterated idempotency},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {370},
NUMBER = {1-3},
PAGES = {170-185},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {formal languages, idempotency, string-rewriting},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4M9RKMB-1/2/bfef682459e7cdd95cfaaa281d282b74},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Catalano-Gennaro/07,
AUTHOR = {Catalano, Dario and Gennaro, Rosario},
TITLE = {Cramer-D{\aa}mgard signatures revisited: Efficient flat-tree signatures based on factoring},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {370},
NUMBER = {1-3},
PAGES = {186-200},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {cryptography, digital signatures, factoring},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4M9Y1WX-1/2/00462055a1991ea2e61a3d6a02f2c8bf},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Frosini-Nivat/07,
AUTHOR = {Frosini, Andrea and Nivat, Maurice},
TITLE = {Binary matrices under the microscope: A tomographical problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {370},
NUMBER = {1-3},
PAGES = {201-217},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {discrete tomography, reconstruction algorithm, computational complexity, projection, rectangular scan},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4M9RM3Y-2/2/97f210a4536c81eb805aefb458130d16},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Brandstadt-Le-Mahfud/07,
AUTHOR = {Brandst{\"a}dt, Andreas and Le, Van Bang and Mahfud, Suhail},
TITLE = {New applications of clique separator decomposition for the Maximum Weight Stable Set problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {370},
NUMBER = {1-3},
PAGES = {229-239},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {maximum stable set problem, clique separators in graphs, graph decompositions, p5-free graphs, efficient graph algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MC81PN-1/2/c8b59ac73e3aa8c901c63b1f13492ae2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cheng-Chen-Yin/07,
AUTHOR = {Cheng, Yongxi and Chen, Xi and Yin, Yiqun Lisa},
TITLE = {On searching a table consistent with division poset},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {370},
NUMBER = {1-3},
PAGES = {240-253},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {search algorithm, complexity, partially ordered set, divisibility},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4M93KDS-1/2/ff9287dbc6cef884eef53c40d278b1d3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kuba-Panholzer/07a,
AUTHOR = {Kuba, Markus and Panholzer, Alois},
TITLE = {The left-right-imbalance of binary search trees},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {370},
NUMBER = {1-3},
PAGES = {265-278},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {binary search trees, imbalance, limiting distribution},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MC12KT-1/2/6781926de636986cbef116bed8d07a84},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lu-Tsai-Wu/07a,
AUTHOR = {Lu, Chi-Jen and Tsai, Shi-Chun and Wu, Hsin-Lung},
TITLE = {Improved hardness amplification in $NP$},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {370},
NUMBER = {1-3},
PAGES = {293-298},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computational complexity, hardness amplification, pseudorandom generator, np},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4M5F330-1/2/cf3befbef1fe491112d8e3cb6b383206},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hsieh/07,
AUTHOR = {Hsieh, Sun-Yuan},
TITLE = {Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {370},
NUMBER = {1-3},
PAGES = {299-308},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {design and analysis of algorithms, phylogenetic trees, maximal leaf-agreement descendent subtrees, maximal leaf-agreement isomorphic descendent subtrees},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4M9RM3Y-3/2/29932ac47885cf3e017196582beb2baa},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}