@article{Hochbaum-Levin/10,
AUTHOR = {Hochbaum, Dorit S. and Levin, Asaf},
TITLE = {Covering the edges of bipartite graphs using $K_{2,2}$ graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {1},
PAGES = {1-9},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {approximation algorithms, network design, set cover},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X49YJK-3/2/28f072c1bfc0ea65fdf563533bca5a73},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lyaudet/10,
AUTHOR = {Lyaudet, Laurent},
TITLE = {$NP$-hard and linear variants of hypergraph partitioning},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {1},
PAGES = {10-21},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {hypergraph partitioning, np-completeness, threshold effect, reversal, inversion of complexity, branchwidth, fixed parameter tractable, parametrised complexity, transportation problem},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X9FGX2-1/2/f473c6bc2f76fc32e1e183909bc80340},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tadaki-Yamakami-Lin/10,
AUTHOR = {Tadaki, Kohtaro and Yamakami, Tomoyuki and Lin, Jack C.H.},
TITLE = {Theory of one-tape linear-time turing machines},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {1},
PAGES = {22-43},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {one-tape turing machine, crossing sequence, finite state automaton, regular language, one-way function, low set, advice, many-one reducibility},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X5JSWD-1/2/db744dca46761d47680f0fa3a46cecb7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Epstein-van_Stee/10,
AUTHOR = {Epstein, Leah and van Stee, Rob},
TITLE = {Maximizing the minimum load for selfish agents},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {1},
PAGES = {44-57},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {scheduling, monotone approximation algorithms, maximizing minimum load, selfish agents},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X5JSWD-2/2/7b7cb0d83812789b663c3be24683e31a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mostefaoui-Raynal-Travers/10,
AUTHOR = {Most{\'e}faoui, Achour and Raynal, Michel and Travers, Corentin},
TITLE = {Narrowing power vs. efficiency in synchronous set agreement: Relationship, algorithms and lower bound},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {1},
PAGES = {58-69},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {consensus, efficiency, lower bound, round-based algorithm, set agreement, synchronous system, t-resilience},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X6FNPS-4/2/8bdae96ac075d18ccb8bc3c4a97819fe},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Stapleton-Howse-Rodgers/10,
AUTHOR = {Stapleton, Gem and Howse, John and Rodgers, Peter},
TITLE = {A graph theoretic approach to general Euler diagram drawing},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {1},
PAGES = {91-112},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {euler diagrams, venn diagrams, graph drawing, information visualization},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X6FNPS-5/2/b250ab39f62566f104f21ab13d69ef03},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Muller/10,
AUTHOR = {M{\"u}ller, Markus},
TITLE = {Stationary algorithmic probability},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {1},
PAGES = {113-130},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {algorithmic probability, kolmogorov complexity, markov chain, emulation, emulation complexity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X85FF2-3/2/4b472fc60f7fd086ff1b5880073fd291},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chrobak-Sgall/10,
AUTHOR = {Chrobak, Marek and Sgall, Ji{\v{r}}{\'{i}}},
TITLE = {Three results on frequency assignment in linear cellular networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {1},
PAGES = {131-137},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {frequency assignment, cellular networks, online algorithms, competitive analysis, -completeness},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X908WW-1/2/fbccc21f56910ec7ef61a33982702070},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Anthony-Ratsaby/10,
AUTHOR = {Anthony, Martin and Ratsaby, Joel},
TITLE = {Maximal width learning of binary functions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {1},
PAGES = {138-147},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {binary function classes, learning algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X9NV9P-1/2/4315dd456b154f1b77d4b5cc71d0479d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Merlini-Sprugnoli/10,
AUTHOR = {Merlini, D. and Sprugnoli, R.},
TITLE = {The relevant prefixes of coloured Motzkin walks: An average case analysis},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {1},
PAGES = {148-163},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {average case analysis, coloured motzkin walks, probability generating functions, random generation, ranking},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X9NV9P-2/2/49279781ed39029b138634c0dfd848a6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bosse-Byrka-Markakis/10,
AUTHOR = {Bosse, Hartwig and Byrka, Jaroslaw and Markakis, Evangelos},
TITLE = {New algorithms for approximate Nash equilibria in bimatrix games},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {1},
PAGES = {164-173},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {noncooperative games, approximate nash equilibria},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X9NV9P-3/2/ca67aa4e2d70d094c622ad3070afa626},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Li-Sun-Wang-Chu-Tang-Xu/10,
AUTHOR = {Li, Xiang-Yang and Sun, Zheng and Wang, WeiZhao and Chu, Xiaowen and Tang, ShaoJie and Xu, Ping},
TITLE = {Mechanism design for set cover games with selfish element agents},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {1},
PAGES = {174-187},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {set cover, mechanism design, strategyproof},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X9TV07-1/2/2c15c94ed379496709206d201b3fbdb2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Laube-Nebel/10,
AUTHOR = {Laube, Ulrich and Nebel, Markus E.},
TITLE = {Maximum likelihood analysis of algorithms and data structures},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {1},
PAGES = {188-212},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {analysis of algorithms, stochastic context free grammars, generating functions, maximum likelihood method, tries, sorting},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X9NV9P-4/2/f494f38e0c23334dd47f6cd124bf0d94},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{DArco-De_Santis-Ferrara-Masucci/10,
AUTHOR = {D'Arco, Paolo and De Santis, Alfredo and Ferrara, Anna Lisa and Masucci, Barbara},
TITLE = {Variations on a theme by Akl and Taylor: Security and tradeoffs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {1},
PAGES = {213-227},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {access control, key assignment, provable security, efficiency},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X9TV07-2/2/bd921f718164ebcbe43ee0f56e59b523},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Liu/10b,
AUTHOR = {Liu, Yun},
TITLE = {Compositions of maximal codes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {1},
PAGES = {228-238},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {maximal code, composition, variable-length code, semigroup},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X9TV07-5/2/6512b3a0f9872b2fe3b4a6f831899b81},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Borodin-Boyar-Larsen-Mirmohammadi/10,
AUTHOR = {Borodin, Allan and Boyar, Joan and Larsen, Kim S. and Mirmohammadi, Nazanin},
TITLE = {Priority algorithms for graph optimization problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {1},
PAGES = {239-258},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {approximation algorithms, priority algorithms, greedy algorithms, vertex cover, independent set, vertex coloring},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XDD08S-1/2/048fd8d1fed72a749c902674066a5543},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Richeson-Winkler-Wiseman/10,
AUTHOR = {Richeson, David and Winkler, Paul and Wiseman, Jim},
TITLE = {Itineraries of rigid rotations and diffeomorphisms of the circle},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {1},
PAGES = {259-265},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {symbolic dynamics, rotations},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XCYJH8-5/2/8364481cb3676800d2a3e86f34a754fa},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Terrier/10,
AUTHOR = {Terrier, V{\'e}ronique},
TITLE = {Simulation of one-way cellular automata by Boolean circuits},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {1},
PAGES = {266-276},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {parallel computation, one-way cellular automata, boolean circuit},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XFY0MS-1/2/da0b16780953e2f687044a612f063ca5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lin-Yang-Xu/10a,
AUTHOR = {Lin, Mingen and Yang, Yang and Xu, Jinhui},
TITLE = {On Lazy Bin Covering and Packing Problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {1},
PAGES = {277-284},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {maximum resource bin packing, lazy bin covering, approximation algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XFY0MS-2/2/f0d5f907c01bf69d0f911d801bf57d9d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hasan-Kaykobad-Lee-Lee/10,
AUTHOR = {Hasan, Md. Kamrul and Kaykobad, Mohammad and Lee, Young-Koo and Lee, Sungyoung},
TITLE = {A comprehensive analysis of degree based condition for Hamiltonian cycles},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {1},
PAGES = {285-287},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {hamiltonian cycle, hamiltonian path, graphs},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X85FF2-4/2/293cc2c92d51e403c7de9d918a40800f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chmielowiec/10,
AUTHOR = {Chmielowiec, Andrzej},
TITLE = {Fixed points of the RSA encryption algorithm},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {1},
PAGES = {288-292},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {cryptography, rsa cryptosystem, fixed point, chinese remainder theorem (crt), greatest common divisor (gcd)},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X9TV07-3/2/5833a5307df8a062806cc4ae7e94e310},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Du-Sami-Shi/10,
AUTHOR = {Du, Ye and Sami, Rahul and Shi, Yaoyun},
TITLE = {Path auctions with multiple edge ownership},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {1},
PAGES = {293-300},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {distributed system, theory of computation, game theory},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XCYJH8-1/2/6fe0f4a7d660aadc253cdcb8207def41},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kaneiwa-Satoh/10,
AUTHOR = {Kaneiwa, Ken and Satoh, Ken},
TITLE = {On the complexities of consistency checking for restricted UML class diagrams},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {2},
PAGES = {301-323},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XDCHSH-1/2/c85ba7df12acb68d2d9a3d4301801ad9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fujita/10a,
AUTHOR = {Fujita, Ken-etsu},
TITLE = {CPS-translation as adjoint},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {2},
PAGES = {324-340},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {galois connection, cps-translation, polymorphic functions, abstract data types, proof duality},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WM0JFK-1/2/f259e2d1c657174619433e077aa8919a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bloom-Esik/10,
AUTHOR = {Bloom, S.L. and {\'E}sik, Z.},
TITLE = {A Mezei-Wright theorem for categorical algebras},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {2},
PAGES = {341-359},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WPTXV1-1/2/df840a0232119a7facdeb5a827c88454},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lin-Prowell-Poore/10,
AUTHOR = {Lin, Lan and Prowell, Stacy J. and Poore, Jesse H.},
TITLE = {An axiom system for sequence-based specification},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {2},
PAGES = {360-376},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {software specification, sequence-based specification, axiom system, representation, automaton, mealy machine},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WR66M0-1/2/f4871527aba0d938036ba0f468d39dbd},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dal_Lago-Masini-Zorzi/10,
AUTHOR = {Dal Lago, Ugo and Masini, Andrea and Zorzi, Margherita},
TITLE = {Quantum implicit computational complexity},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {2},
PAGES = {377-409},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {quantum computation, implicit computational complexity, lambda calculus},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WVF6TH-1/2/69a1ae133630031558ad7c2a109b996d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Pagani-de_Falco/10,
AUTHOR = {Pagani, Michele and de Falco, Lorenzo Tortora},
TITLE = {Strong normalization property for second order linear logic},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {2},
PAGES = {410-444},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {(weak, strong) normalization, confluence, standardization, linear logic, proof-nets, additive connectives, sliced pure structures},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WW9KWK-1/2/7df6d30ac627a6a7579cd724a60ab484},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bodirsky-Chen/10a,
AUTHOR = {Bodirsky, Manuel and Chen, Hubie},
TITLE = {Peek arc consistency},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {2},
PAGES = {445-453},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X0PC4N-1/2/2c441c9f5faa77884702826950e3c9ec},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bozzelli-Lanotte/10,
AUTHOR = {Bozzelli, Laura and Lanotte, Ruggero},
TITLE = {Complexity and succinctness issues for linear-time hybrid logics},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {2},
PAGES = {454-469},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {linear temporal logics + past, hybrid logics, complexity and succinctness issues, alternating automata},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X1SBJ2-2/2/c0abe06ae86645c8ae3e71eb17e3c323},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Baillot-Mazza/10,
AUTHOR = {Baillot, Patrick and Mazza, Damiano},
TITLE = {Linear logic by levels and bounded time complexity},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {2},
PAGES = {470-503},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {implicit computational complexity, light linear logics, type systems for polynomial time},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X85FF2-1/2/4e09f2729a6637ea74aeb5b2d0a03ae6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Alpuente-Escobar-Gramlich-Lucas/10,
AUTHOR = {Alpuente, M. and Escobar, S. and Gramlich, B. and Lucas, S.},
TITLE = {On-demand strategy annotations revisited: An improved on-demand evaluation strategy},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {2},
PAGES = {504-541},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {declarative programming, demandedness, lazy evaluation, obj, on-demand strategy annotations},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X85FF2-2/2/e4a4e083e69d328215236e8d755e8b37},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Romanel-Priami/10,
AUTHOR = {Romanel, Alessandro and Priami, Corrado},
TITLE = {On the computational power of BlenX},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {2},
PAGES = {542-565},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {process calculi, random access machines, turing equivalence, termination decidability, systems biology},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XCYJH8-2/2/0383d3d89467c3709f8053ae84189fac},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hierons/10a,
AUTHOR = {Hierons, Robert M.},
TITLE = {Canonical finite state machines for distributed systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {2},
PAGES = {566-580},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {finite state machine, equivalence, distributed test architecture, canonical},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XDCHSH-2/2/741798061456458e19e8d757182ad23b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ibarra-Karhumaki-Okhotin/10,
AUTHOR = {Ibarra, Oscar H. and Karhum{\"a}ki, Juhani and Okhotin, Alexander},
TITLE = {On stateless multihead automata: Hierarchies and the emptiness problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {3},
PAGES = {581-593},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {multihead automata, stateless automata},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X66S7Y-2/2/ff28ab8466286b76f952ae14410d7e51},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Duong-Huong/10,
AUTHOR = {Duong, Phan Thi Ha and Huong, Tran Thi Thu},
TITLE = {On the stability of Sand Piles Model},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {3},
PAGES = {594-601},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {sand piles model, lattice, young lattice, avalanche chain},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XCJ4PR-1/2/31b26b912b6a4a725248df6303bd7a83},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kastermans-Lempp/10,
AUTHOR = {Kastermans, Bart and Lempp, Steffen},
TITLE = {Comparing notions of randomness},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {3},
PAGES = {602-616},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {effective randomness, kolmogorov-loveland randomness, martin-l{\'o}f randomness},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XGBG42-1/2/677fbd19bcdd5b2893a5e59c6b306f89},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Czeizler-Kari-Seki/10,
AUTHOR = {Czeizler, Elena and Kari, Lila and Seki, Shinnosuke},
TITLE = {On a special class of primitive words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {3},
PAGES = {617-630},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {word equations, fine and wilf theorem, (pseudo-)periodicity, (pseudo-)power, (pseudo-)primitivity, (anti-)morphic involution},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XCYJH8-3/2/030ebf088d243ac2acad051f7af51580},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mathissen/10,
AUTHOR = {Mathissen, Christian},
TITLE = {Definable transductions and weighted logics for texts},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {3},
PAGES = {631-659},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {weighted automata, weighted logics, monadic second-order logic, mso-definable transductions, parenthesizing automata, branching automata, recognizable series, texts},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XCYJH8-4/2/d248b9cb104152970ceedd85929089f9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bilo-Fanelli-Flammini-Moscardelli/10,
AUTHOR = {Bil{\'o}, Vittorio and Fanelli, Angelo and Flammini, Michele and Moscardelli, Luca},
TITLE = {When ignorance helps: Graphical multicast cost sharing games},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {3},
PAGES = {660-671},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {algorithmic game theory, nash equilibrium, social networks, price of anarchy},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XFY0MS-3/2/14adeaeecebf0eb083dcf251264d406e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tian-Li-Chen/10,
AUTHOR = {Tian, Wanyong and Li, Minming and Chen, Enhong},
TITLE = {Energy optimal schedules for jobs with multiple active intervals},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {3},
PAGES = {672-676},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {dynamic voltage scaling, multiple interval jobs, min-energy schedule},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XP3818-3/2/688d83aee50674558724abcddfd1f3f5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{ODunlaing-Schluter/10,
AUTHOR = {{\'O}D{\'u}nlaing, Colm and Schluter, Natalie},
TITLE = {A shorter proof that palindromes are not a Church-Rosser language, with extensions to almost-confluent and preperfect Thue systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {3},
PAGES = {677-690},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {thue systems, kolmogorov complexity, formal languages},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XFY0MS-4/2/f8036cb4630922166eec1aadbf38a3b1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Boley-Horvath-Poigne-Wrobel/10,
AUTHOR = {Boley, Mario and Horv{\'a}th, Tam{\'a}s and Poign{\'e}, Axel and Wrobel, Stefan},
TITLE = {Listing closed sets of strongly accessible set systems with applications to data mining},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {3},
PAGES = {691-700},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {algorithms, listing, closure operator, data mining},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XPP13G-1/2/40ba8326b0f3a7bc5752225feeda4021},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bjorklund-Schwentick/10,
AUTHOR = {Bj{\"o}rklund, Henrik and Schwentick, Thomas},
TITLE = {On notions of regularity for data languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {4-5},
PAGES = {702-715},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XHVH6C-5/2/c235fd10e104443eee249c77b0fa62d8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Brevier-Rizzi-Vialette/10,
AUTHOR = {Brevier, Ga{\"e}lle and Rizzi, Romeo and Vialette, St{\'e}phane},
TITLE = {Complexity issues in color-preserving graph embeddings},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {4-5},
PAGES = {716-729},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph matching, protein-protein interaction graph, color-preserving graph embedding},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XHVH6C-6/2/ea220b567c1325a58ca33b4f1fcca354},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Brijder-Langille-Petre/10,
AUTHOR = {Brijder, Robert and Langille, Miika and Petre, Ion},
TITLE = {Extended strings and graphs for simple gene assembly},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {4-5},
PAGES = {730-738},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {ciliates, simple gene assembly, strings},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XHVH6C-7/2/1f7002ffc9c210e7682c6ecee39f4ba2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cai-Lu/10,
AUTHOR = {Cai, Jin-Yi and Lu, Pinyan},
TITLE = {On blockwise symmetric signatures for matchgates},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {4-5},
PAGES = {739-750},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {matchgates, matchgate identities, blockwise symmetric signatures, holographic algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XHVH6C-2/2/25068617c809dccf107acfaf13ac9915},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Colcombet/10,
AUTHOR = {Colcombet, Thomas},
TITLE = {Factorization forests for infinite words and applications to countable scattered linear orderings},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {4-5},
PAGES = {751-764},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {formal languages, semigroups, infinite words, automata, factorization trees},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XJ17RX-1/2/17427b888d7ff5c8da3d48f734f1dcf2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Endrullis-Grabmayer-Hendriks-Isihara-Klop/10,
AUTHOR = {Endrullis, J{\"o}rg and Grabmayer, Clemens and Hendriks, Dimitri and Isihara, Ariya and Klop, Jan Willem},
TITLE = {Productivity of stream definitions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {4-5},
PAGES = {765-782},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {recursive stream definitions, productivity, functional programming, dataflow networks},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XHVH6C-8/2/495d3ed5ec24e6382149f63ac744ddba},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hemaspaandra-Hemaspaandra-Tantau-Watanabe/10,
AUTHOR = {Hemaspaandra, Edith and Hemaspaandra, Lane A. and Tantau, Till and Watanabe, Osamu},
TITLE = {On the complexity of kings},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {4-5},
PAGES = {783-798},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {diameter, kings, polynomial hierarchy, succinct representations, tournaments},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XHVH6C-3/2/c1c6fc832aa7e8ffe2ed605170e3a7d0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hoffmann-Thomas/10,
AUTHOR = {Hoffmann, Michael and Thomas, Richard M.},
TITLE = {Notions of hyperbolicity in monoids},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {4-5},
PAGES = {799-811},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {hyperbolic monoid, automatic monoid, biautomatic monoid, word problem},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XHVH6C-9/2/a39f2a5410d1db34c6b9401ad97e5fbe},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kutrib-Malcher/10,
AUTHOR = {Kutrib, Martin and Malcher, Andreas},
TITLE = {Real-time reversible iterative arrays},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {4-5},
PAGES = {812-822},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {iterative arrays, real-time reversibility, language recognition, decidability, closure properties},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XHVH6C-4/2/28832c67fe0d058a7d284fde5d749d0d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sattler-Klein/10,
AUTHOR = {Sattler-Klein, Andrea},
TITLE = {Some complexity results for prefix Gr{\"o}bner bases in free monoid rings},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {4-5},
PAGES = {823-833},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {algorithms, computational complexity, rewriting, gr{\'o}bner bases, free monoid rings},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XHVH6C-B/2/bf2d66a40c9855e0ebc921390aba4c10},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dolev-Fitoussi/10,
AUTHOR = {Dolev, Shlomi and Fitoussi, Hen},
TITLE = {Masking traveling beams: Optical solutions for $NP$-complete problems, trading space for time},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {6},
PAGES = {837-853},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {optical computing, np-complete problems},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WKK1RX-1/2/11ef8930f4a5f576a1699cd214df745b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Friedrich-Hebbinghaus-Neumann/10,
AUTHOR = {Friedrich, Tobias and Hebbinghaus, Nils and Neumann, Frank},
TITLE = {Plateaus can be harder in multi-objective optimization},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {6},
PAGES = {854-864},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {evolutionary algorithms, multi-objective optimization, runtime analysis},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WK48DR-1/2/4529d8dc7d98de99ed9e796884b8b0d7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bonizzoni/10,
AUTHOR = {Bonizzoni, Paola},
TITLE = {Constants and label-equivalence: A decision procedure for reflexive regular splicing languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {6},
PAGES = {865-877},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {splicing systems, regular languages, syntactic monoid},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WN2XYC-2/2/53d25ac54f24d441f75e24ee4c4a4e20},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Porreca-Mauri-Zandron/10,
AUTHOR = {Porreca, Antonio E. and Mauri, Giancarlo and Zandron, Claudio},
TITLE = {Non-confluence in divisionless $P$ systems with active membranes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {6},
PAGES = {878-887},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {membrane computing, complexity theory},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WTHS95-2/2/03dfa7a7afd300da0322bdd106820ee3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Liu-Yang-Li-Ding/10,
AUTHOR = {Liu, Xingchang and Yang, Xiaofan and Li, Shenglin and Ding, Yong},
TITLE = {Solving the minimum bisection problem using a biologically inspired computational model},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {6},
PAGES = {888-896},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {dna algorithm, adleman-lipton-sticker model, minimum bisection problem},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WTHS95-1/2/62627c4755e1b61647762ef1aed8399e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Brijder-Hoogeboom/10,
AUTHOR = {Brijder, Robert and Hoogeboom, Hendrik Jan},
TITLE = {Combining overlap and containment for gene assembly in ciliates},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {6},
PAGES = {897-905},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {gene assembly in ciliates, overlap graph, dna transformation, graph rewriting},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WVK4X7-2/2/6bc937baf268478f7696c21626f051f2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Pan-Paun/10,
AUTHOR = {Pan, Linqiang and P{\u{a}}un, Gheorghe},
TITLE = {Spiking neural $P$ systems: An improved normal form},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {6},
PAGES = {906-918},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {membrane computing, spiking neural p system, turing computability, semilinear set},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XP3818-6/2/727c4950e9fccca25b98c7dee7c9a486},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Keil-Liu-McQuillan/10,
AUTHOR = {Keil, J. Mark and Liu, Jing and McQuillan, Ian},
TITLE = {Algorithmic properties of ciliate sequence alignment},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {6},
PAGES = {919-925},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {ciliates, gene descrambling, complexity theory, bioinformatics, computational modeling},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XY4GRM-2/2/189426bd0f50f04acae5d5e30c86053b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-He-Chen-Yao/10,
AUTHOR = {Chen, Tianshi and He, Jun and Chen, Guoliang and Yao, Xin},
TITLE = {Choosing selection pressure for wide-gap problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {6},
PAGES = {926-934},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {evolutionary algorithm, selection pressure, first hitting time, markov chain, evolutionary computation theory},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y2PGSY-1/2/93ab137ff1ab39f913ac8bef95d185e0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Pichler-Savenkov/10,
AUTHOR = {Pichler, Reinhard and Savenkov, Vadim},
TITLE = {Towards practical feasibility of core computation in data exchange},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {7-9},
PAGES = {935-957},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {data exchange, data integration, core, universal solutions, dependencies, chase, tractability, query evaluation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XCYJH8-6/2/dd77dcffdbc483f7bb8e7c40470a7065},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mezzini-Moscarini/10,
AUTHOR = {Mezzini, Mauro and Moscarini, Marina},
TITLE = {Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {7-9},
PAGES = {958-966},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {chordal graphs, minimal triangulations, markov networks, learning decomposable models},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XG3SGM-1/2/d140b86342056fbb962e6750dfebed66},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Asdre-Nikolopoulos/10a,
AUTHOR = {Asdre, Katerina and Nikolopoulos, Stavros D.},
TITLE = {A polynomial solution to the $k$-fixed-endpoint path cover problem on proper interval graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {7-9},
PAGES = {967-975},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {perfect graphs, proper interval graphs, path cover, fixed-endpoint path cover, linear-time algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XP3818-4/2/ca24c1a588f2ae1ea617f2919dd718d6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lin-Lee/10,
AUTHOR = {Lin, Tien-Ching and Lee, D.T.},
TITLE = {Efficient algorithms for the sum selection problem and $k$ maximum sums problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {7-9},
PAGES = {986-994},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {k maximum sums problem, sum selection problem, maximum sum problem, maximum sum subarray problem},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XTG3FC-2/2/f2571a58e93cbf41682fdf29e9448b45},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sadasivam-Zhang/10,
AUTHOR = {Sadasivam, Sadish and Zhang, Huaming},
TITLE = {$NP$-completeness of $st$-orientations for plane graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {7-9},
PAGES = {995-1003},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {np-complete, st-orientation, plane graph},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XPP13G-2/2/e74470fd40385c66f7629bea0ff687e0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Render-Kambites/10,
AUTHOR = {Render, Elaine and Kambites, Mark},
TITLE = {Semigroup automata with rational initial and terminal sets},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {7-9},
PAGES = {1004-1012},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {valence automata, semigroups, extended automata, g-automata, rational subsets},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XP3818-5/2/9b665b90934c3bd17a3e38eacfab403c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cicerone-DAngelo-Di_Stefano-Frigioni/10,
AUTHOR = {Cicerone, Serafino and D'Angelo, Gianlorenzo and Di Stefano, Gabriele and Frigioni, Daniele},
TITLE = {Partially dynamic efficient algorithms for distributed shortest paths},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {7-9},
PAGES = {1013-1037},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {dynamic algorithm, distributed algorithm, shortest paths},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XPP13G-3/2/9870c3024a9908e1b63a452049853f9d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cheng-Kang-Lu/10,
AUTHOR = {Cheng, Yukun and Kang, Liying and Lu, Changhong},
TITLE = {The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {7-9},
PAGES = {1038-1044},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {location theory, median problem, subtree-shaped customers, tree graphs},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XP3818-1/2/6798a6c206a4b8949134526964f400ac},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fomin-Gaspers-Kratsch-Liedloff-Saurabh/10,
AUTHOR = {Fomin, Fedor V. and Gaspers, Serge and Kratsch, Dieter and Liedloff, Mathieu and Saurabh, Saket},
TITLE = {Iterative compression and exact algorithms},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {7-9},
PAGES = {1045-1053},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {exponential time algorithms, graph algorithms, independent set, hitting set, induced cluster, fixed parameter algorithms, iterative compression},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XSVRHD-1/2/f67e4fc8ceef9af55abb17561d4a3898},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Berenbrink-Schulte/10,
AUTHOR = {Berenbrink, Petra and Schulte, Oliver},
TITLE = {Evolutionary equilibrium in Bayesian routing games: Specialization and niche formation},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {7-9},
PAGES = {1054-1074},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {bayesian nash equilibrium, congestion game, game theory},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XVRYTN-2/2/f602bae4bd3c0a4e59a291c42b28e1b8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Di_Lena-Margara/10a,
AUTHOR = {Di Lena, P. and Margara, L.},
TITLE = {On the undecidability of the limit behavior of Cellular Automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {7-9},
PAGES = {1075-1084},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {cellular automata, undecidability, symbolic dynamics},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XSVRHD-2/2/71346e95efdb723db47fecf79b424c30},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Goodman-Strauss/10,
AUTHOR = {Goodman-Strauss, C.},
TITLE = {A hierarchical strongly aperiodic set of tiles in the hyperbolic plane},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {7-9},
PAGES = {1085-1093},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {aperiodic tiling, aperiodic sets of tiles, domino problem, tiling problem, completion problem, strong aperiodicity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XVBPBS-2/2/1d2c51c5fb9a4f6d058cfc173713af34},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Xing-Fang/10,
AUTHOR = {Wang, Zhenbo and Xing, Wenxun and Fang, Shu-Cherng},
TITLE = {Two-group knapsack game},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {7-9},
PAGES = {1094-1103},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {game theory, knapsack problem, nash equilibrium, price of anarchy},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XX15XX-1/2/fb9508e0914ef2bdf516064e556ad7be},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Abrahamson-Shokoufandeh/10,
AUTHOR = {Abrahamson, Jeff and Shokoufandeh, Ali},
TITLE = {Euclidean TSP on two polygons},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {7-9},
PAGES = {1104-1114},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computational geometry, traveling salesman problem, convex analysis, network flow},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y051HW-1/2/e6496ede930e3a0f8b1f006eb0093152},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gawrychowski-Gutan-Kisielewicz/10,
AUTHOR = {Gawrychowski, Pawe{\l} and Gutan, Marin and Kisielewicz, Andrzej},
TITLE = {On the problem of freeness of multiplicative matrix semigroups},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {7-9},
PAGES = {1115-1120},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {matrix semigroups, freenes, decidability},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XY4GRM-1/2/4c88a6d48d525a38b355aaf942c4a870},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gomez-Rodriguez-Alonso-Vilares/10,
AUTHOR = {G{\'o}mez-Rodr{\'{i}}guez, Carlos and Alonso, Miguel A. and Vilares, Manuel},
TITLE = {Error-repair parsing schemata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {7-9},
PAGES = {1121-1139},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {parsing, robust parsing, error repair, natural language processing},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XY4GRM-3/2/5826728ce01bb75bf4bc2e21ba66ff7a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lu-Feng-Li/10,
AUTHOR = {Lu, Shenpeng and Feng, Haodi and Li, Xiuqian},
TITLE = {Minimizing the makespan on a single parallel batching machine},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {7-9},
PAGES = {1140-1145},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {scheduling, parallel batching, rejection, job size, release date, ptas},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y051HW-3/2/b27b4b3fd16aa252b727f515ce722db5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gast-Gaujal/10,
AUTHOR = {Gast, Nicolas and Gaujal, Bruno},
TITLE = {Infinite labeled trees: From rational to Sturmian trees},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {7-9},
PAGES = {1146-1166},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {infinite trees, sturmian words, sturmian trees},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y051HW-4/2/2e47c0b7deac3c57f0574893be6df925},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fomin-Golovach-Kratochvil-Nisse-Suchan/10,
AUTHOR = {Fomin, Fedor V. and Golovach, Petr A. and Kratochv{\'{i}}l, Jan and Nisse, Nicolas and Suchan, Karol},
TITLE = {Pursuing a fast robber on a graph},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {7-9},
PAGES = {1167-1181},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {pursuit-evasion game on graphs, cops and robbers, complexity, parameterized complexity, cliquewidth, planar graph},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y051HW-5/2/55dae2ba8bdbae99990af1447947f42e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Iwama-Seto-Tamaki/10,
AUTHOR = {Iwama, Kazuo and Seto, Kazuhisa and Tamaki, Suguru},
TITLE = {The complexity of the Haj{\'o}s calculus for planar graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {7-9},
PAGES = {1182-1191},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {proof complexity, haj{\'o}s calculus, graph coloring, planar graph, extended frege systems},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y051HW-2/2/b27597d661ea167cbbb140d63eb17a7c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ibarra-Potapov-Yen/10,
AUTHOR = {Ibarra, Oscar H. and Potapov, Igor and Yen, Hsu-Chun},
TITLE = {On decision problems for parameterized machines},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {7-9},
PAGES = {1192-1201},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {parameterized machines, decision problems, turing machines, pushdown automata, counter machines},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y34R1D-1/2/230e1b2918e318af03b1f8ff30b9f31a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bodlaender-Fellows-Heggernes-Mancini-Papadopoulos-Rosamond/10,
AUTHOR = {Bodlaender, Hans L. and Fellows, Michael R. and Heggernes, Pinar and Mancini, Federico and Papadopoulos, Charis and Rosamond, Frances},
TITLE = {Clustering with partial information},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {7-9},
PAGES = {1202-1211},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graphs, parameterized algorithms, cluster editing, kernels},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y34WGH-1/2/f504a96aaab9bedcef1d09b11386a48c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mezzini/10,
AUTHOR = {Mezzini, Mauro},
TITLE = {On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {7-9},
PAGES = {1212-1220},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {chordless paths, bipartite graphs, interval operators, graph convexity, simple paths, even-chorded paths},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y34R1D-2/2/c5a56369cd9fb4fd4dfcf633dd114f27},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Machado-de_Figueiredo-Vuskovic/10,
AUTHOR = {Machado, R.C.S. and de Figueiredo, C.M.H. and Vu{\v{s}}kovi{\'c}, K.},
TITLE = {Chromatic index of graphs with no cycle with a unique chord},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {7-9},
PAGES = {1221-1234},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {cycle with a unique chord, decomposition, recognition, petersen graph, heawood graph, edge-colouring},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y34WGH-2/2/a4fd01df63e7f8da535a4a54d9b4fde5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Horvitz-Katz/10,
AUTHOR = {Horvitz, Omer and Katz, Jonathan},
TITLE = {Bounds on the efficiency of black-box commitment schemes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {10},
PAGES = {1251-1260},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {cryptography, commitment schemes},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XK45HK-1/2/443ac1fae44d13ea8f67c2636cc56a6b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chevalier-Rusinowitch/10a,
AUTHOR = {Chevalier, Yannick and Rusinowitch, Michael},
TITLE = {Symbolic protocol analysis in the union of disjoint intruder theories: Combining decision procedures},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {10},
PAGES = {1261-1282},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {cryptographic protocols, dolev-yao intruder, combination of decision procedures, equational theories},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XKBYW5-2/2/1191e694e6322c89670136e608d98620},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Moran-Naor/10,
AUTHOR = {Moran, Tal and Naor, Moni},
TITLE = {Basing cryptographic protocols on tamper-evident seals},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {10},
PAGES = {1283-1310},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {tamper-evident seals, human, protocol, universally composable, coin flipping},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XKBYW5-1/2/da963f21744f16673d269ad6a3092eb1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{He-Hoare/10,
AUTHOR = {He, Jifeng and Hoare, Tony},
TITLE = {CSP is a retract of CCS},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {11-13},
PAGES = {1311-1337},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {unifying theories of programming, process algebra, ccs, csp, retraction},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y3KSM7-1/2/a7c64f8735c2f517bd937e5886841416},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Orzan-Willemse/10,
AUTHOR = {Orzan, Simona and Willemse, Tim A.C.},
TITLE = {Invariants for parameterised Boolean Equation Systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {11-13},
PAGES = {1338-1371},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {parameterised boolean equation systems, invariants, fixed point theory, model checking, process theory},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XNF8GH-1/2/291203b16a2a81e1f1e6f86a5b90cf34},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Barraclough-Binkley-Danicic-Harman-Hierons-Kiss-Laurence-Ouarbya/10,
AUTHOR = {Barraclough, Richard W. and Binkley, David and Danicic, Sebastian and Harman, Mark and Hierons, Robert M. and Kiss, {\'A}kos and Laurence, Mike and Ouarbya, Lahcen},
TITLE = {A trajectory-based strict semantics for program slicing},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {11-13},
PAGES = {1372-1386},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {program slicing, program semantics, non-termination, program dependence},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XTG3FC-1/2/c9fe0960d90b373c46c752f37f3f5c99},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fu-Lu/10,
AUTHOR = {Fu, Yuxi and Lu, Hao},
TITLE = {On the expressiveness of interaction},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {11-13},
PAGES = {1387-1451},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {process calculus, expressiveness, bisimulation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XV5P4G-1/2/28db6a0c40f0c43974e4c50a4854ddec},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gaucher/10,
AUTHOR = {Gaucher, Philippe},
TITLE = {Combinatorics of labelling in higher-dimensional automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {11-13},
PAGES = {1452-1483},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {presheaf, precubical set, left adjoint, concurrency, process algebra},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XVBPBS-1/2/83f6a5723abbda70503cdc0f304d1035},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Alves-Fernandez-Florido-Mackie/10,
AUTHOR = {Alves, Sandra and Fern{\'a}ndez, Maribel and Florido, M{\'a}rio and Mackie, Ian},
TITLE = {G{\"o}del's system ${\cal T}$ revisited},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {11-13},
PAGES = {1484-1500},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {$\lambda$-calculus, system, linearity, closed reduction},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XVRYTN-1/2/3ad481430d23dbf4cc50fa903dc4f307},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hines/10,
AUTHOR = {Hines, Peter},
TITLE = {Quantum circuit oracles for Abstract Machine computations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {11-13},
PAGES = {1501-1520},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {quantum computing, circuit model, conditional iteration, abstract machines},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XVK43P-1/2/0555e0b60b532fda8118d68c58b0505a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Schmidt-Schauss-Sabel/10a,
AUTHOR = {Schmidt-Schau{\ss}, Manfred and Sabel, David},
TITLE = {On generic context lemmas for higher-order calculi with sharing},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {11-13},
PAGES = {1521-1541},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {lambda calculus, observational semantics, context lemma, functional programming languages},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XWMNH3-1/2/1111cc448ee24a080fd90b504a786c38},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ilcinkas-Kowalski-Pelc/10,
AUTHOR = {Ilcinkas, David and Kowalski, Dariusz R. and Pelc, Andrzej},
TITLE = {Fast radio broadcasting with advice},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {14-15},
PAGES = {1544-1557},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {radio network, distributed algorithm, deterministic broadcasting, advice},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y5BMJ8-2/2/58190adf0a040699513ae0e4136b04e0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Becker-Rajsbaum-Rapaport-Remila/10,
AUTHOR = {Becker, Florent and Rajsbaum, Sergio and Rapaport, Ivan and R{\'e}mila, Eric},
TITLE = {Average long-lived binary consensus: Quantifying the stabilizing role played by memory},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {14-15},
PAGES = {1558-1566},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {consensus, stability},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y5BMJ8-3/2/9c08cc164e4311b36eb72a075b63cfc4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Masuzawa-Tixeuil/10,
AUTHOR = {Masuzawa, Toshimitsu and Tixeuil, S{\'e}bastien},
TITLE = {Quiescence of self-stabilizing gossiping among mobile agents in graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {14-15},
PAGES = {1567-1582},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {self-stabilization, gossiping, quiescence, agents, distributed algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y5BMJ8-1/2/2cb2d8effe28249e068eafa7ff65186d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Flocchini-Ilcinkas-Pelc-Santoro/10,
AUTHOR = {Flocchini, Paola and Ilcinkas, David and Pelc, Andrzej and Santoro, Nicola},
TITLE = {Remembering without memory: Tree exploration by asynchronous oblivious robots},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {14-15},
PAGES = {1583-1598},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {mobile agent, robot, oblivious, asynchronous, tree, exploration},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y5BMJ8-4/2/f971e53cac09608e6032412ac779b630},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sauerwald-Sudholt/10,
AUTHOR = {Sauerwald, Thomas and Sudholt, Dirk},
TITLE = {A self-stabilizing algorithm for cut problems in synchronous networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {14-15},
PAGES = {1599-1612},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {self-stabilization, distributed computing, randomization, cut problems},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y5BMJ8-5/2/a10a662d4497b46107d48fbefdb69309},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fraigniaud-Lebhar-Lotker/10a,
AUTHOR = {Fraigniaud, Pierre and Lebhar, Emmanuelle and Lotker, Zvi},
TITLE = {Recovering the long-range links in augmented graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {14-15},
PAGES = {1613-1625},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {small world, doubling dimension, bounded growth},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y5GY34-1/2/7abb0348f98706d3a2bb18f2742bcefa},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bilo-Erlebach-Mihalak-Widmayer/10,
AUTHOR = {Bil{\`o}, Davide and Erlebach, Thomas and Mihal{\'a}k, Mat{\'u}{\v{s}} and Widmayer, Peter},
TITLE = {Discovery of network properties with all-shortest-paths queries},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {14-15},
PAGES = {1626-1637},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph property, network, discovery, query, online algorithm, shortest path},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y5BMJ8-6/2/b7215fbe4ba64fd94c3a9a7b4bda31c8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cooper-Klasing-Radzik/10,
AUTHOR = {Cooper, Colin and Klasing, Ralf and Radzik, Tomasz},
TITLE = {Locating and repairing faults in a network with mobile agents},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {14-15},
PAGES = {1638-1647},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph exploration, mobile agents, distributed computing},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y5BMJ8-7/2/766a5366cefa1279c7bd748772fa8a8f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Adjiashvili-Peleg/10,
AUTHOR = {Adjiashvili, D. and Peleg, D.},
TITLE = {Equal-area locus-based convex polygon decomposition},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {14-15},
PAGES = {1648-1667},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {polygon decomposition, equitable subdivision, ham sandwich},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y5BMJ8-8/2/cf5ace11b742f39267362f721d17591e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chou-Chen/10,
AUTHOR = {Chou, Well Y. and Chen, Chiuyuan},
TITLE = {All-to-all personalized exchange in generalized shuffle-exchange networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {16-18},
PAGES = {1669-1684},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {multistage interconnection networks, shuffle-exchange networks, omega network, parallel and distributed computing, all-to-all communication, all-to-all personalized exchange},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4XNF6JF-1/2/e37fd84cf4273dd68542a8bca79a8585},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Watanabe-Yamamoto/10,
AUTHOR = {Watanabe, Osamu and Yamamoto, Masaki},
TITLE = {Average-case analysis for the MAX-2SAT problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {16-18},
PAGES = {1685-1697},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {average case analysis, planted solution model, belief propagation, max-2sat},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y52R4X-1/2/c51c44b73df972d8f0b052e211ee9e51},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fernau/10a,
AUTHOR = {Fernau, Henning},
TITLE = {Parameterized algorithms for $d$-{\sc Hitting} {\sc Set}: The weighted case},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {16-18},
PAGES = {1698-1713},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {hitting set problems, parameterized algorithms, search tree algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y4R4F6-1/2/c23b5e537625b81c94758d74872aae3b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gaintzarain-Hermo-Lucio-Navarro/10,
AUTHOR = {Gaintzarain, Jose and Hermo, Montserrat and Lucio, Paqui and Navarro, Marisa},
TITLE = {Translating propositional extended conjunctions of Horn clauses into Boolean circuits},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {16-18},
PAGES = {1723-1733},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {boolean circuits, boolean formulas, horn clauses, horn[superset or implies] clauses},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y7P71S-1/2/27741f73a11bd46f810b2de97952844d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ehmsen-Favrholdt-Kohrt-Mihai/10,
AUTHOR = {Ehmsen, Martin R. and Favrholdt, Lene M. and Kohrt, Jens S. and Mihai, Rodica},
TITLE = {Comparing First-Fit and Next-Fit for online edge coloring},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {16-18},
PAGES = {1734-1741},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {online algorithms, edge coloring, competitive ratio, relative worst-order ratio, next-fit, first-fit},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y7P71S-3/2/a2e542ea83638ff666ab5c427adbf5d0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chang-Lyuu/10b,
AUTHOR = {Chang, Ching-Lueh and Lyuu, Yuh-Dauh},
TITLE = {Optimal bounds on finding fixed points of contraction mappings},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {16-18},
PAGES = {1742-1749},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {contraction mapping principle, banach fixed-point theorem, caristi-kirk fixed-point theorem, query complexity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y7P71S-2/2/78b9cbe75a118dece9c9f597eed5bba3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Borbelova-Cechlarova/10,
AUTHOR = {Borbel'ov{\'a}, Viera and Cechl{\'a}rov{\'a}, Katar{\'{i}}na},
TITLE = {Rotations in the stable $b$-matching problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {16-18},
PAGES = {1750-1762},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {stable -matching, rotation poset, minimum regret, egalitarian},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y7P71S-4/2/5e1ea1f01373d8417e6ae8cfe913394f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mahmoud/10,
AUTHOR = {Mahmoud, Hosam M.},
TITLE = {Distributional analysis of swaps in Quick Select},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {16-18},
PAGES = {1763-1769},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {sorting, quick sort, combinatorial probability, algorithm, recurrence, average-case analysis, grand average, perpetuity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y95X8H-4/2/d5bced6945b138ec3f28455b3e5899d9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ipate/10,
AUTHOR = {Ipate, Florentin},
TITLE = {Bounded sequence testing from deterministic finite state machines},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {16-18},
PAGES = {1770-1784},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {finite state machines, test selection, w-method, wp-method, specification-based testing},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YC1K8T-1/2/3f3c08de8c3496b95c980cfd26fdd55e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Giambruno-Mantaci/10,
AUTHOR = {Giambruno, Laura and Mantaci, Sabrina},
TITLE = {Transducers for the bidirectional decoding of prefix codes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {16-18},
PAGES = {1785-1792},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {prefix codes, girod's encoding, transducers},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YB5M8S-5/2/29b3353e2798419e62e5661e027be80d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Geffert-Gajdos/10,
AUTHOR = {Geffert, Viliam and Gajdo{\v{s}}, Jozef},
TITLE = {Multiway in-place merging},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {16-18},
PAGES = {1793-1808},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {in-place algorithms, merging, sorting},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YC2XM6-1/2/42a5919f9a6da176cf85c11185d87f97},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Shin/10,
AUTHOR = {Shin, Sujin},
TITLE = {Codes and maximal monoids},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {16-18},
PAGES = {1809-1817},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {code, prefix, cyclic, maximal monoid, indecomposable, synchronizing},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YB5M8S-7/2/c8bf4158932dbf92fce4716e76a95e3f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Salomaa/10a,
AUTHOR = {Salomaa, Arto},
TITLE = {Criteria for the matrix equivalence of words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {16-18},
PAGES = {1818-1827},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {subword, scattered subword, parikh matrix, matrix equivalence, number of subwords},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YB5M8S-8/2/eb54a9f5af25244954c5e57068a6d6b5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Biro-Manlove-Mittal/10,
AUTHOR = {Bir{\'o}, P{\'e}ter and Manlove, David F. and Mittal, Shubham},
TITLE = {Size versus stability in the marriage problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {16-18},
PAGES = {1828-1841},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {stable marriage problem, stable matching, blocking pair, blocking agent, inapproximability result, polynomial-time algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YCG07K-2/2/193c7cdd3f8997df5337266b90972d1a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hrubes-Jukna-Kulikov-Pudlak/10,
AUTHOR = {Hrube{\v{s}}, P. and Jukna, S. and Kulikov, A. and Pudl{\'a}k, P.},
TITLE = {On convex complexity measures},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {16-18},
PAGES = {1842-1854},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {boolean formula, complexity measure, combinatorial rectangle, convexity, rank, matrix norm},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YCG07K-3/2/8a93908b82366f09442d790b483e3019},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cardinal-Hoefer/10,
AUTHOR = {Cardinal, Jean and Hoefer, Martin},
TITLE = {Non-cooperative facility location and covering games},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {16-18},
PAGES = {1855-1876},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {cost sharing, nash equilibrium, price of anarchy, approximate equilibrium, facility location},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YCG07K-4/2/5dbc321f105e4c9f60c0b2367d417805},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Li-Liu/10,
AUTHOR = {Li, Xin and Liu, Tian},
TITLE = {On exponential time lower bound of Knapsack under backtracking},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {16-18},
PAGES = {1883-1888},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {model of algorithms, the pbt model, knapsack problem, exponential time lower bounds, backtracking},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y3TXDY-1/2/38a5b758ad69fcfb0ebb5f0ea432e3ba},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Nonaka-Ono-Sadakane-Yamashita/10,
AUTHOR = {Nonaka, Yoshiaki and Ono, Hirotaka and Sadakane, Kunihiko and Yamashita, Masafumi},
TITLE = {The hitting and cover times of Metropolis walks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {16-18},
PAGES = {1889-1894},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {metropolis walks, metropolis-hastings algorithm, markov chain monte carlo, random walk monte carlo, hitting time, cover time},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YB5M8S-6/2/595447ed4c16d2015b61ad766d6d2d48},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hong/10,
AUTHOR = {Hong, Cheng W.},
TITLE = {The biased, distance-restricted $n$-in-a-row game for small $p$},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {16-18},
PAGES = {1895-1897},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {n-in-a-row, distance-restricted, maker, breaker},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YCG07K-1/2/e3c716425b7b99c7e9288d510cca304f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Battenfeld/10,
AUTHOR = {Battenfeld, Ingo},
TITLE = {Comparing free algebras in Topological and Classical Domain Theory},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {19},
PAGES = {1900-1917},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {domain theory, denotational semantics, computational effects, topological domain theory},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YB5M8S-1/2/c927fab11644a1cd3d10804dc1dacc63},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Martin-Moskowitz-Allwein/10,
AUTHOR = {Martin, Keye and Moskowitz, Ira S. and Allwein, Gerard},
TITLE = {Algebraic information theory for binary channels},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {19},
PAGES = {1918-1927},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {information theory, domain theory, covert channel, monoid},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YB5M8S-2/2/1981d535a7047c60734d9f368967e183},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lanese-Sangiorgi/10,
AUTHOR = {Lanese, Ivan and Sangiorgi, Davide},
TITLE = {An operational semantics for a calculus for wireless systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {19},
PAGES = {1928-1948},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {wireless systems, broadcast, reduction semantics, labelled transition semantics, interference},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y95X8H-1/2/9d99c85e02505a0f9863a0b4353fcdf2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Varacca-Yoshida/10,
AUTHOR = {Varacca, Daniele and Yoshida, Nobuko},
TITLE = {Typed event structures and the linear $\pi$-calculus},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {19},
PAGES = {1949-1973},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {event structures, types, linearity, confusion freeness, [pi]-calculus},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YB5M8S-3/2/7018a111182284cb41812db3de58a5f0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Li-Zdancewic/10,
AUTHOR = {Li, Peng and Zdancewic, Steve},
TITLE = {Arrows for secure information flow},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {19},
PAGES = {1974-1994},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {information flow, security, haskell, arrows, type systems, combinators},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y95X8H-2/2/5b2b0710deb5daf5c54cafdfc795340e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bartocci-Corradini-Merelli-Tesei/10,
AUTHOR = {Bartocci, Ezio and Corradini, Flavio and Merelli, Emanuela and Tesei, Luca},
TITLE = {Detecting synchronisation of biological oscillators by model checking},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {20},
PAGES = {1999-2018},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computational systems biology, timed automata, biological oscillators, model checking, simulation, spontaneous synchronisation, kuramoto model, peskin model, pacemaker cells},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y3JYFM-2/2/338316d2cc1e2f19e1b353ca59d04a2e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ballarini-Guerriero/10,
AUTHOR = {Ballarini, Paolo and Guerriero, Maria Luisa},
TITLE = {Query-based verification of qualitative trends and oscillations in biochemical systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {20},
PAGES = {2019-2036},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {model-checking, stochastic methods, qualitative/quantitative analysis of biochemical systems},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YHT831-1/2/ab658f11c020d3febdb217b0536f6345},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Campagna-Piazza/10,
AUTHOR = {Campagna, Dario and Piazza, Carla},
TITLE = {Hybrid automata, reachability, and Systems Biology},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {20},
PAGES = {2037-2051},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {semi-algebraic automata, reachability, systems biology},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y3JYFM-1/2/30a469193763627f39c3e7dd8e394936},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bortolussi-Policriti/10,
AUTHOR = {Bortolussi, Luca and Policriti, Alberto},
TITLE = {Hybrid dynamics of stochastic programs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {20},
PAGES = {2052-2077},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {stochastic concurrent constraint programming, hybrid automata, dynamical systems, robustness, discreteness},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YCWNNP-1/2/f4881b05e21f780705c34f003f0766c1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sudholt-Witt/10,
AUTHOR = {Sudholt, Dirk and Witt, Carsten},
TITLE = {Runtime analysis of a binary particle swarm optimizer},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {21},
PAGES = {2084-2100},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {particle swarm optimization, runtime analysis},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YJ4NJ6-2/2/aee1176acb161958ea4a805a31b6baa1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Jiang/10,
AUTHOR = {Chen, Ying-ping and Jiang, Pei},
TITLE = {Analysis of particle interaction in particle swarm optimization},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {21},
PAGES = {2101-2115},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {particle swarm optimization, particle interaction, social-only model, statistical interpretation, theoretical analysis, progress rate, convergence, sphere function},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YJ4NJ6-4/2/891942ec3894d0006f42f6ab825e8aad},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Vrancx-Verbeeck-Nowe/10,
AUTHOR = {Vrancx, Peter and Verbeeck, Katja and Now{\'e}, Ann},
TITLE = {Analyzing the dynamics of stigmergetic interactions through pheromone games},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {21},
PAGES = {2116-2126},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {stigmergy, game theory, pheromone, nash equilibrium},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YJ4NJ6-5/2/9fb942449cb26ded2d7dffa0c5c8a37d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Biswas-Das-Abraham-Dasgupta/10,
AUTHOR = {Biswas, Arijit and Das, Swagatam and Abraham, Ajith and Dasgupta, Sambarta},
TITLE = {Stability analysis of the reproduction operator in bacterial foraging optimization},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {21},
PAGES = {2127-2139},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {foraging based optimization, bacterial foraging, reproduction, selection, global optimization, computational chemotaxis},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YJ4NJ6-6/2/e5318bf19b52acd2f4ff64a909d38df7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gokce-Sahin/10,
AUTHOR = {G{\"o}k{\c{c}}e, Fatih and {\c{S}}ahin, Erol},
TITLE = {The pros and cons of flocking in the long-range ``migration'' of mobile robot swarms},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {21},
PAGES = {2140-2154},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {swarm robotics, flocking, migration},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YJCKXW-1/2/93e818f8c682364114700bec92117557},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bertet-Monjardet/10,
AUTHOR = {Bertet, K. and Monjardet, B.},
TITLE = {The multiple facets of the canonical direct unit implicational basis},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {22-24},
PAGES = {2155-2166},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {implicational system, closure operator, closure system, canonical direct unit basis, lattice, horn boolean function},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y6J40T-1/2/0d4f1201c5b05452df9255658c5f4c3a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{De_Francesco-Lettieri-Martini/10,
AUTHOR = {De Francesco, Nicoletta and Lettieri, Giuseppe and Martini, Luca},
TITLE = {Using abstract interpretation to add type checking for interfaces in Java bytecode verification},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {22-24},
PAGES = {2174-2201},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {bytecode verification, abstract interpretation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y95X8H-3/2/3debde6004d78daf5d97bee170381a6d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tini/10,
AUTHOR = {Tini, Simone},
TITLE = {Non-expansive $\epsilon$-bisimulations for probabilistic processes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {22-24},
PAGES = {2202-2222},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {$\epsilon$-bisimulation, behavioral distance, non-expansiveness, transition rule formats, probabilistic processes},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y8G5YW-2/2/54475bb21901732cec18ac3e1da13772},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Honda-Laurent/10,
AUTHOR = {Honda, Kohei and Laurent, Olivier},
TITLE = {An exact correspondence between a typed pi-calculus and polarised proof-nets},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {22-24},
PAGES = {2223-2238},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {pi-calculus, proof-nets, processes, logics, proofs, types, interaction, concurrency, linear logic, polarity, embedding, determinism, non-determinism},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y8G5YW-1/2/504fbd90485c93b6ef120ea5be2df553},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hasuo-Kawabe-Sakurada/10,
AUTHOR = {Hasuo, Ichiro and Kawabe, Yoshinobu and Sakurada, Hideki},
TITLE = {Probabilistic anonymity via coalgebraic simulations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {22-24},
PAGES = {2239-2259},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {anonymity, automaton, coalgebra, privacy, probability},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YB5M8S-4/2/00b9d79f5203f8d9fd1b96e9e329d336},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hayden-Bradley/10,
AUTHOR = {Hayden, Richard A. and Bradley, Jeremy T.},
TITLE = {A fluid analysis framework for a Markovian process algebra},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {22-24},
PAGES = {2260-2297},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {stochastic process algebra, fluid approximation, differential equations, higher moments},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YDKK19-1/2/f07a584d53e0647cd25695cd34d70481},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Demri-Lazic-Sangnier/10,
AUTHOR = {Demri, St{\'e}phane and Lazi{\'c}, Ranko and Sangnier, Arnaud},
TITLE = {Model checking memoryful linear-time logics over one-counter automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {22-24},
PAGES = {2298-2316},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {one-counter automaton, temporal logic, first-order logic, computational complexity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YJ6GKT-1/2/589a746db8dd535ec62dfdc65b57fe5c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hesselink/10,
AUTHOR = {Hesselink, Wim H.},
TITLE = {Alternating states for dual nondeterminism in imperative programming},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {22-24},
PAGES = {2317-2330},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {free distributive completion, nondeterminism, angelic choice, demonic choice, refinement calculus, programming semantics},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YK7J7K-1/2/e43c994929c8e1bc9ab875b7ae071890},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Rabinovich/10,
AUTHOR = {Rabinovich, Alexander},
TITLE = {Complexity of metric temporal logics with counting and the Pnueli modalities},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {22-24},
PAGES = {2331-2342},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {real time temporal logics, complexity, expressive power},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YK2F83-7/2/d999337a94fc6bb5984c415ef6a401aa},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ishdorj-Leporati-Pan-Zeng-Zhang/10,
AUTHOR = {Ishdorj, Tseren-Onolt and Leporati, Alberto and Pan, Linqiang and Zeng, Xiangxiang and Zhang, Xingyi},
TITLE = {Deterministic solutions to QSAT and Q3SAT by spiking neural $P$ systems with pre-computed resources},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {25},
PAGES = {2345-2358},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {spiking neural p systems, pspace-complete problems, qsat, q3sat},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4Y88DG5-2/2/8d321c603f5fe44e79363bb105a841de},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Alhazov-Li-Petre/10,
AUTHOR = {Alhazov, Artiom and Li, Chang and Petre, Ion},
TITLE = {Computing the graph-based parallel complexity of gene assembly},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {25},
PAGES = {2359-2367},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {gene assembly, parallelism, signed graphs, parallel complexity, algorithmics},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YDC3RW-1/2/fdafdb89748e96548af6c95f73af8416},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hayes-Gedeon/10,
AUTHOR = {Hayes, Christina and Gedeon, Tom{\'a}{\v{s}}},
TITLE = {Hyperbolicity of the fixed point set for the simple genetic algorithm},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {25},
PAGES = {2368-2383},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {genetic algorithm, generic property, hyperbolic fixed point},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YGHGX5-1/2/122a4f81f1ce3f5d904e901fe2797bf1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Apolloni-Bassis-Gaito-Malchiodi-Zoppis/10,
AUTHOR = {Apolloni, Bruno and Bassis, Simone and Gaito, Sabrina and Malchiodi, Dario and Zoppis, Italo},
TITLE = {Playing monotone games to understand learning behaviors},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {25},
PAGES = {2384-2405},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {overtraining control, training stopping rule, monotone games, algorithmic inference, computational learning, subsymbolic learning},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YDYSNM-1/2/c6c1b6e8a10d93d63ddad67f1dbada34},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Neumann-Witt/10,
AUTHOR = {Neumann, Frank and Witt, Carsten},
TITLE = {Ant colony optimization and the minimum spanning tree problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {25},
PAGES = {2406-2413},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {ant colony optimization, combinatorial optimization, runtime analysis},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YDYSNM-2/2/3e3d5ae8574ac8f85c7a002f0f595a7d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mitrana-Petre-Rogojin/10,
AUTHOR = {Mitrana, Victor and Petre, Ion and Rogojin, Vladimir},
TITLE = {Accepting splicing systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {25},
PAGES = {2414-2422},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {formal languages, splicing, accepting splicing system},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YP0N19-6/2/ac01f5e1e0adc184cb4d9242956d8bab},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Herrbach-Denise-Dulucq/10,
AUTHOR = {Herrbach, Claire and Denise, Alain and Dulucq, Serge},
TITLE = {Average complexity of the Jiang-Wang-Zhang pairwise tree alignment algorithm and of a RNA secondary structure alignment algorithm},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {26-28},
PAGES = {2423-2432},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {average complexity, tree alignment, rna alignment, rna structure},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YBMF9V-1/2/ed6a280591a3e74bdfc8e9b321d24c00},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Shanker/10,
AUTHOR = {Shanker, O.},
TITLE = {Complex network dimension and path counts},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {26-28},
PAGES = {2454-2458},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {complex networks, graphs, fractal dimension},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YDYSNM-3/2/9ef004800833851d9cdfbbc8cafa689d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dolev-Schiller-Spirakis-Tsigas/10,
AUTHOR = {Dolev, Shlomi and Schiller, Elad M. and Spirakis, Paul G. and Tsigas, Philippas},
TITLE = {Game authority for robust and scalable distributed selfish-computer systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {26-28},
PAGES = {2459-2466},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {distributed computing, game theory, game authority, self-stabilization},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YFTM6C-1/2/8b4c90dbd75c72189bdcd25303c0676a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hua-Wang-Yu-Lau/10,
AUTHOR = {Hua, Qiang-Sheng and Wang, Yuexuan and Yu, Dongxiao and Lau, Francis C.M.},
TITLE = {Dynamic programming based algorithms for set multicover and multiset multicover problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {26-28},
PAGES = {2467-2474},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {set multicover, multiset multicover, inclusion-exclusion, dynamic programming, algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YFTM6C-2/2/024868c327c55226c57b849136fa0e37},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fertin-Hermelin-Rizzi-Vialette/10,
AUTHOR = {Fertin, Guillaume and Hermelin, Danny and Rizzi, Romeo and Vialette, St{\'e}phane},
TITLE = {Finding common structured patterns in linear graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {26-28},
PAGES = {2475-2486},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {linear graphs, approximation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YJ4NJ6-1/2/d438c01843ca1f3a1e1b682d9cb136c7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bouvel-Pergola/10,
AUTHOR = {Bouvel, Mathilde and Pergola, Elisa},
TITLE = {Posets and permutations in the duplication-loss model: Minimal permutations with $d$ descents},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {26-28},
PAGES = {2487-2501},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {permutations, duplication-loss model, poset, dyck paths, non-interval subsets, bijection},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YK2F83-1/2/2e1b50be28fa8680ed0381a8e4d01d5b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Nutov/10a,
AUTHOR = {Nutov, Zeev},
TITLE = {Approximating minimum power covers of intersecting families and directed edge-connectivity problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {26-28},
PAGES = {2502-2512},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {approximation algorithms, wireless networks, power minimization, directed graphs, edge-connectivity, intersecting families},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YK2F83-2/2/8a644188d77469b19b2b79a92a8e7c92},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Yin-Chen/10,
AUTHOR = {Chen, WenBin and Yin, Dengpan and Chen, Zhengzhang},
TITLE = {Inapproximability results for equations over infinite groups},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {26-28},
PAGES = {2513-2519},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {optimization, approximation, groups, infinite groups, cyclic groups, computational complexity, probabilistically checkable proofs, np-hardness},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YK2F83-3/2/1d8fe83f2fda52a73090c6f3960dcee6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hendrix-Schmidt-Breimyer-Samatova/10,
AUTHOR = {Hendrix, William and Schmidt, Matthew C. and Breimyer, Paul and Samatova, Nagiza F.},
TITLE = {Theoretical underpinnings for maximal clique enumeration on perturbed graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {26-28},
PAGES = {2520-2536},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph perturbation theory, maximal clique enumeration, graph algorithms, uncertain and noisy data},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YK2F83-4/2/ddb1a0c277960138448b43a4175797d8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Angelopoulos-Borodin/10,
AUTHOR = {Angelopoulos, Spyros and Borodin, Allan},
TITLE = {Randomized priority algorithms},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {26-28},
PAGES = {2542-2558},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {greedy algorithms, randomized approximation algorithms, facility location, makespan scheduling},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YK2F83-5/2/06f0c8a6eb0a37f0c987f8fa3c48b63d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Okhotin-Reitwiessner/10,
AUTHOR = {Okhotin, Alexander and Reitwie{\ss}ner, Christian},
TITLE = {Conjunctive grammars with restricted disjunction},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {26-28},
PAGES = {2559-2571},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {conjunctive grammars, single tree grammars, normal form, language equations},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YK2F83-6/2/57381dce68644758f5b0ca527c6f8a2c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Boyar-Epstein-Levin/10,
AUTHOR = {Boyar, Joan and Epstein, Leah and Levin, Asaf},
TITLE = {Tight results for Next Fit and Worst Fit with resource augmentation},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {26-28},
PAGES = {2572-2580},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {bin packing, next fit, worst fit, resource augmentation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YK7J7K-3/2/64eb40ccdcf8371464820d716b8e2bd8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cardinal-Levy/10,
AUTHOR = {Cardinal, Jean and Levy, Eythan},
TITLE = {Connected vertex covers in dense graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {26-28},
PAGES = {2581-2590},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {approximation algorithm, vertex cover, connected vertex cover, dense graph},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YP0N19-2/2/0f5c1905ee9445dffbccb9efa275e986},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kijima-Kiyomi-Okamoto-Uno/10,
AUTHOR = {Kijima, Shuji and Kiyomi, Masashi and Okamoto, Yoshio and Uno, Takeaki},
TITLE = {On listing, sampling, and counting the chordal graphs with edge constraints},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {26-28},
PAGES = {2591-2601},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph sandwich, chordal completion/deletion, enumeration, \#p-completeness, markov chain monte carlo},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YR8RM0-1/2/40412d3494ed0ce2d3d6d1d7a92592e1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Antunes-Souto/10,
AUTHOR = {Antunes, Lu{\'{i}}s and Souto, Andr{\'e}},
TITLE = {Information measures for infinite sequences},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {26-28},
PAGES = {2602-2611},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {kolmogorov complexity, sophistication, computational depth},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YP0N19-5/2/75627811d7d438349b89bcf1db75dfcf},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kawarabayashi-Ozeki/10,
AUTHOR = {Kawarabayashi, Ken-ichi and Ozeki, Kenta},
TITLE = {A simple algorithm for 4-coloring 3-colorable planar graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {26-28},
PAGES = {2619-2622},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {3-colorable graph, the four color theorem},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YH99R7-1/2/6b66e3f21eac3130efe59cf83783f7a4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tarui/10,
AUTHOR = {Tarui, Jun},
TITLE = {Smallest formulas for the parity of $2^k$ variables are essentially unique},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {26-28},
PAGES = {2623-2627},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {combinatorial complexity, uniqueness of optimal algorithms, formula complexity, karchmer-wigderson protocol, communication complexity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YP0N19-3/2/2dabe79954c754739cedbfd2e0d7e632},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Vovk-Shen/10,
AUTHOR = {Vovk, Vladimir and Shen, Alexander},
TITLE = {Prequential randomness and probability},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {29-30},
PAGES = {2632-2646},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {algorithmic randomness, farthingale, prequential statistics},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YTN445-1/2/ef71201d3be5e1eb06098401cb227551},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chernov-Kalnishkan-Zhdanov-Vovk/10,
AUTHOR = {Chernov, Alexey and Kalnishkan, Yuri and Zhdanov, Fedor and Vovk, Vladimir},
TITLE = {Supermartingales in prediction with expert advice},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {29-30},
PAGES = {2647-2669},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {prediction with expert advice, defensive forecasting algorithm, aggregating algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YTN445-2/2/832891617f4f901232df924f441ac95e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mukherjee-Schapire/10,
AUTHOR = {Mukherjee, Indraneel and Schapire, Robert E.},
TITLE = {Learning with continuous experts using drifting games},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {29-30},
PAGES = {2670-2683},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {on-line learning, expert advice, drifting game},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YT6DC0-3/2/e093d24b002de84bad8f175f97b32355},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ortner/10,
AUTHOR = {Ortner, Ronald},
TITLE = {Online regret bounds for Markov decision processes with deterministic transitions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {29-30},
PAGES = {2684-2695},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {markov decision process, regret, labeled digraph},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YTN445-3/2/c3308f243fd5fe4e643b21ad03ec59b5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Shamir-Sabato-Tishby/10,
AUTHOR = {Shamir, Ohad and Sabato, Sivan and Tishby, Naftali},
TITLE = {Learning and generalization with the information bottleneck},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {29-30},
PAGES = {2696-2711},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {statistical learning theory, information theory, information bottleneck, sufficient statistics},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YVJ48D-1/2/ac221ddd3ef8ef02e3df719f439e2cd7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Antos-Grover-Szepesvari/10,
AUTHOR = {Antos, Andr{\'a}s and Grover, Varun and Szepesv{\'a}ri, Csaba},
TITLE = {Active learning in heteroscedastic noise},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {29-30},
PAGES = {2712-2728},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {active learning, heteroscedastic noise, regression, sequential analysis, sequential allocation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YTN445-4/2/fd7487324c4c203952d4b63f478f584b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Angluin-Aspnes-Reyzin/10,
AUTHOR = {Angluin, Dana and Aspnes, James and Reyzin, Lev},
TITLE = {Optimally learning social networks with activations and suppressions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {29-30},
PAGES = {2729-2740},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {value injection queries, social networks, active learning},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YTN445-5/2/9ea5fb660dff0d4f1c567c3de07c5046},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Becerra-Bonache-Case-Jain-Stephan/10,
AUTHOR = {Becerra-Bonache, Leonor and Case, John and Jain, Sanjay and Stephan, Frank},
TITLE = {Iterative learning of simple external contextual languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {29-30},
PAGES = {2741-2756},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {grammatical inference, mildly sontext-sensitive languages, simple external contextual grammars, iterative learning},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YVJ48D-2/2/a3462dc9be41b9bb4cc2780fb5c7a841},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jain-Lange-Moelius-Zilles/10,
AUTHOR = {Jain, Sanjay and Lange, Steffen and Moelius III, Samuel E. and Zilles, Sandra},
TITLE = {Incremental learning with temporary memory},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {29-30},
PAGES = {2757-2772},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {inductive inference, formal languages, incremental learning},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YTN445-6/2/a1d091be340fa4b61139f404537fa133},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Izumi-Izumi-Ono-Wada/10,
AUTHOR = {Izumi, Tomoko and Izumi, Taisuke and Ono, Hirotaka and Wada, Koichi},
TITLE = {Approximability and inapproximability of the minimum certificate dispersal problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {31-33},
PAGES = {2773-2783},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {minimum certificate dispersal problem, graph theory, approximation algorithms, combinatorial optimization},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YPT1VW-3/2/b33bfb6af4e071525740d5d626f90988},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Horvath-Ramon/10,
AUTHOR = {Horv{\'a}th, Tam{\'a}{\v{s}} and Ramon, Jan},
TITLE = {Efficient frequent connected subgraph mining in graphs of bounded tree-width},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {31-33},
PAGES = {2784-2797},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {listing algorithms, frequent patterns, tree-width, graph mining, data mining},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YRPDYB-1/2/cb6ff0a79d653fa4a8103502f0eb1987},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Efraimidis-Tsavlidis-Mertzios/10,
AUTHOR = {Efraimidis, Pavlos S. and Tsavlidis, Lazaros and Mertzios, George B.},
TITLE = {Window-games between TCP flows},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {31-33},
PAGES = {2798-2817},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {algorithmic game theory, network games, nash equilibrium},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YRHCYX-1/2/66c50af433d116af708f9a46c5154f32},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Li-Hu-Zhang/10,
AUTHOR = {Li, Jiao-fen and Hu, Xi-yan and Zhang, Lei},
TITLE = {Dykstra's algorithm for constrained least-squares doubly symmetric matrix problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {31-33},
PAGES = {2818-2826},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {alternating projection method, doubly symmetric matrix, least-squares problem, singular value decomposition},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YWXSM9-1/2/992a52bb720b09178de21f632beb28e0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chuan-Ho/10,
AUTHOR = {Chuan, Wai-Fong and Ho, Hui-Ling},
TITLE = {Factors of characteristic words: Location and decompositions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {31-33},
PAGES = {2827-2846},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {characteristic word, location, decomposition, return words, separate factor, overlap factor},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YX001Y-1/2/43283a52746e8f35b983f2f2c4800ef4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Armon-Avidor-Schwartz/10,
AUTHOR = {Armon, Amitai and Avidor, Adi and Schwartz, Oded},
TITLE = {Cooperative TSP},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {31-33},
PAGES = {2847-2863},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {algorithms, approximation algorithms, tsp, cooperative tsp},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YX001Y-2/2/4c70f94b9b71e9dbcbcbd93e9e00881d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kleine_Buning-Remshagen/10,
AUTHOR = {Kleine B{\"u}ning, H. and Remshagen, A.},
TITLE = {An upper bound for the circuit complexity of existentially quantified Boolean formulas},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {31-33},
PAGES = {2864-2870},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {quantified boolean formulas, circuits, complexity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YWXSM9-2/2/9069c55a0a48cb7727f5c2b579750e89},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Wei-Huang-Shih-Hsu/10,
AUTHOR = {Chen, Yen-Chiu and Wei, Hsin-Wen and Huang, Pei-Chi and Shih, Wei-Kuan and Hsu, Tsan-sheng},
TITLE = {The bridge-connectivity augmentation problem with a partition constraint},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {31-33},
PAGES = {2878-2889},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {2-edge-connectivity, bridge-connectivity, augmentation, partition constraint},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YVY7H0-1/2/7c6aa5470d38fd0ba6a490ed96d7b43a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cao-Liu/10,
AUTHOR = {Cao, Qian and Liu, Zhaohui},
TITLE = {Online scheduling with reassignment on two uniform machines},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {31-33},
PAGES = {2890-2898},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {online scheduling, uniform machine, reassignment},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YWXSM9-3/2/56886e9685afbdb09947bfbef5f79a0e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Epstein/10a,
AUTHOR = {Epstein, Leah},
TITLE = {Two-dimensional online bin packing with rotation},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {31-33},
PAGES = {2899-2911},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {online algorithms, two-dimensional bin packing, non-oriented packing},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YVY7H0-6/2/8ed457fb496073742038046aa62d3615},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lai-Hsu-Tsai-Stewart/10,
AUTHOR = {Lai, Pao-Lien and Hsu, Hong-Chun and Tsai, Chang-Hsiung and Stewart, Iain A.},
TITLE = {A class of hierarchical graphs as topologies for interconnection networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {31-33},
PAGES = {2912-2924},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {hierarchical interconnection networks, hierarchical crossed cubes, hypercubes, crossed cubes, routing, broadcasting, connectivity, diameter, twisted cubes, m{\'o}bius cubes},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YWXSM9-4/2/84908fa5f33f23244ffd09fad0387dcb},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gagie-Manzini/10,
AUTHOR = {Gagie, Travis and Manzini, Giovanni},
TITLE = {Move-to-Front, Distance Coding, and Inversion Frequencies revisited},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {31-33},
PAGES = {2925-2944},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {data compression, burrows-wheeler transform, empirical entropy},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YXK4MS-1/2/a96f5e25a089a5ddd84dbdcace58d152},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Vidal/10,
AUTHOR = {Vidal, Samuel Alexandre},
TITLE = {An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {31-33},
PAGES = {2945-2967},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {triangular maps, trivalent diagrams, exhaustive genretator, cat generator},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YX001Y-3/2/344d69a4446d0a429ce1360d5cbfdb30},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Brandstadt-Le-Rautenbach/10,
AUTHOR = {Brandst{\"a}dt, Andreas and Le, Van Bang and Rautenbach, Dieter},
TITLE = {Exact leaf powers},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {31-33},
PAGES = {2968-2977},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph power, leaf power, leaf root, phylogeny, phylogenetic tree, forbidden induced subgraph},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YYRMX1-1/2/40d4a9bbb24272dbdf4ba5b3e8a0eb7c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Nong-Cheng-Ng/10,
AUTHOR = {Nong, Q.Q. and Cheng, T.C.E. and Ng, C.T.},
TITLE = {A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {31-33},
PAGES = {2978-2986},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {ring loading problem, weighted load, polynomial-time algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V1G-5009PBC-1/2/6912eea6469cde8616a2326be8be0277},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gelade/10,
AUTHOR = {Gelade, Wouter},
TITLE = {Succinctness of regular expressions with interleaving, intersection and counting},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {31-33},
PAGES = {2987-2998},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {regular expressions, succinctness},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YY8N3T-2/2/67c63cbe3b5dc749893442ca40b6bf30},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kurka/10,
AUTHOR = {K{\r{u}}rka, Petr},
TITLE = {Erratum to ``Entropy of Turing machines with moving head''},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {31-33},
PAGES = {2999-3000},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {turing machine, entropy},
URL = {http://www.sciencedirect.com/science/article/B6V1G-502Y350-1/2/c85e91d6b8839df09cdc1816f56a48cf},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
NOTE = {Originally in Theor.~Comput.~Sci., Vol 174, 1997, No. 1-2, 203-216},
}
@article{Busch-Mavronicolas/10,
AUTHOR = {Busch, Costas and Mavronicolas, Marios},
TITLE = {An efficient counting network},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {34-36},
PAGES = {3001-3030},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {counting network, balancing network, contention, shared memory, distributed data structure},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YYRMX1-2/2/eb1ea78e32f4952288d3ea4e0bbd254b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mizrahi-Moses/10,
AUTHOR = {Mizrahi, Tal and Moses, Yoram},
TITLE = {Continuous consensus with ambiguous failures},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {34-36},
PAGES = {3031-3041},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {distributed computing, fault tolerance, consensus, continuous consensus},
URL = {http://www.sciencedirect.com/science/article/B6V1G-501071F-1/2/cdd79e53e0d9f14b4dc08e070c42ed28},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Feigenblat-Itzhaki-Porat/10,
AUTHOR = {Feigenblat, Guy and Itzhaki, Ofra and Porat, Ely},
TITLE = {The frequent items problem, under polynomial decay, in the streaming model},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {34-36},
PAGES = {3048-3054},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {streaming, frequency count, polynomial decay functions, algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YX001Y-5/2/c2f07baa3cfb317ceefecd2327b98ee1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bourgeois-Lucarelli-Milis-Paschos/10,
AUTHOR = {Bourgeois, N. and Lucarelli, G. and Milis, I. and Paschos, V.Th.},
TITLE = {Approximating the max-edge-coloring problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {34-36},
PAGES = {3055-3067},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {max-edge-coloring, approximation algorithms, complexity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YXP1GN-2/2/1dd0ad631f777f06230eb1d2e76b1544},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ravaux/10,
AUTHOR = {Ravaux, Romain},
TITLE = {Decomposing trees with large diameter},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {34-36},
PAGES = {3068-3072},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {arbitrarily partitionable trees, integer partition, diameter},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YXP1GN-1/2/662b495d6772ce294836d68f1b458956},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Epstein-Imreh-Levin/10,
AUTHOR = {Epstein, Leah and Imreh, Csan{\'a}d and Levin, Asaf},
TITLE = {Class constrained bin packing revisited},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {34-36},
PAGES = {3073-3089},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {online algorithms, afptas, bin packing},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YY8N3T-3/2/62cf299336661cb5b39b1c387486b6f2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Drewes-Hoffmann-Janssens-Minas/10,
AUTHOR = {Drewes, Frank and Hoffmann, Berthold and Janssens, Dirk and Minas, Mark},
TITLE = {Adaptive star grammars and their languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {34-36},
PAGES = {3090-3109},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph grammar, graph parsing, context-free graph language, node cloning},
URL = {http://www.sciencedirect.com/science/article/B6V1G-501071F-2/2/0e7487d04d75c2c4234ab33f6128aaa7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Groult-Richomme/10,
AUTHOR = {Groult, R. and Richomme, G.},
TITLE = {Optimality of some algorithms to detect quasiperiodicities},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {34-36},
PAGES = {3110-3122},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {repetitions in words, quasiperiodicity, fibonacci words},
URL = {http://www.sciencedirect.com/science/article/B6V1G-501071F-3/2/d69d3bdc8e78a760fa35f648e35fab70},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bains-Biedl/10,
AUTHOR = {Bains, Adam and Biedl, Therese},
TITLE = {Reconstructing $hv$-convex multi-coloured polyominoes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {34-36},
PAGES = {3123-3128},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {discrete tomography, combinatorial problems, algorithms, computational geometry, theory of computation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YYXJVF-2/2/e6b227195dc0280386a8f365308848b7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Epstein-Levin/10a,
AUTHOR = {Epstein, Leah and Levin, Asaf},
TITLE = {Improved randomized results for the interval selection problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {34-36},
PAGES = {3129-3135},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {online algorithms, yao's principle, interval scheduling, competitive analysis},
URL = {http://www.sciencedirect.com/science/article/B6V1G-501FPRV-1/2/1829d1dc06541775cfd0a5b022a63ff0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Biro-Fleiner-Irving-Manlove/10,
AUTHOR = {Bir{\'o}, P{\'e}ter and Fleiner, Tam{\'a}s and Irving, Robert W. and Manlove, David F.},
TITLE = {The college admissions problem with lower and common quotas},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {34-36},
PAGES = {3136-3153},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {college admissions problem, hospitals/residents problem, lower quotas, common quotas, nested set systems, np-hardness, polynomial-time algorithm, matroids, rural hospitals theorem},
URL = {http://www.sciencedirect.com/science/article/B6V1G-5046MFK-1/2/02c0fa26df916f35d7249c0ae853bb0f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bouzid-Potop-Butucaru-Tixeuil/10,
AUTHOR = {Bouzid, Zohir and Potop-Butucaru, Maria Gradinariu and Tixeuil, S{\'e}bastien},
TITLE = {Optimal Byzantine-resilient convergence in uni-dimensional robot networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {34-36},
PAGES = {3154-3168},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {oblivious robot networks, distributed algorithms, byzantine tolerance, self-stabilization},
URL = {http://www.sciencedirect.com/science/article/B6V1G-505NSB3-1/2/cdfaea1e2b23bd91711eefe5906a853d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Duchene-Rigo/10,
AUTHOR = {Duch{\^e}ne, Eric and Rigo, Michel},
TITLE = {Invariant games},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {34-36},
PAGES = {3169-3180},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {combinatorial games, combinatorics on words, beatty sequences},
URL = {http://www.sciencedirect.com/science/article/B6V1G-505F9T5-1/2/f5bd1fb87d7135bf890ce45e37f8e4d7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mathieson/10,
AUTHOR = {Mathieson, Luke},
TITLE = {The parameterized complexity of editing graphs for bounded degeneracy},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {34-36},
PAGES = {3181-3187},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {combinatorial problems, computational complexity, parameterized complexity, degenerate graphs, graph editing},
URL = {http://www.sciencedirect.com/science/article/B6V1G-505F9T5-2/2/c855401eba1916a5b201607f10afbcfd},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Carvalho-Dalmau-Krokhin/10,
AUTHOR = {Carvalho, Catarina and Dalmau, V{\'{i}}ctor and Krokhin, Andrei},
TITLE = {CSP duality and trees of bounded pathwidth},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {34-36},
PAGES = {3188-3208},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {constraint satisfaction problem, homomorphism duality, datalog, polymorphisms, bounded pathwidth},
URL = {http://www.sciencedirect.com/science/article/B6V1G-505F9T5-3/2/50557eea1ba5018fbee9d7c255207eea},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Shur/10a,
AUTHOR = {Shur, Arseny M.},
TITLE = {Growth rates of complexity of power-free languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {34-36},
PAGES = {3209-3223},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {growth rate, regular language, power-free language, finite antidictionary},
URL = {http://www.sciencedirect.com/science/article/B6V1G-505NSB3-5/2/47fdc7901837fe1d3e9cf0630d24d5af},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cincotti/10,
AUTHOR = {Cincotti, Alessandro},
TITLE = {$N$-player partizan games},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {34-36},
PAGES = {3224-3234},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {combinatorial game theory, n-player partizan games},
URL = {http://www.sciencedirect.com/science/article/B6V1G-506RN60-1/2/f9a2ac386fab1d5d769765ae3a9a1d5e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Klasing-Kosowski-Navarra/10,
AUTHOR = {Klasing, Ralf and Kosowski, Adrian and Navarra, Alfredo},
TITLE = {Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {34-36},
PAGES = {3235-3246},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {asynchronous system, mobile robots, oblivious robots, gathering problem, ring},
URL = {http://www.sciencedirect.com/science/article/B6V1G-505NSB3-7/2/f02ffe10ea993975b3dbb9ffc17c9d03},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kuba-Panholzer/10,
AUTHOR = {Kuba, Markus and Panholzer, Alois},
TITLE = {A combinatorial approach to the analysis of bucket recursive trees},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {34-36},
PAGES = {3255-3273},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {bucket recursive trees, node-depth, number of descendants, node-degree, limiting distribution},
URL = {http://www.sciencedirect.com/science/article/B6V1G-506RCWX-1/2/015f046dc1e05cda5b665af16ad3a9ea},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Freydenberger-Reidenbach/10a,
AUTHOR = {Freydenberger, Dominik D. and Reidenbach, Daniel},
TITLE = {Existence and nonexistence of descriptive patterns},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {34-36},
PAGES = {3274-3286},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {pattern languages, descriptive patterns},
URL = {http://www.sciencedirect.com/science/article/B6V1G-506RCWX-2/2/1e0e5b0db5fbebd7a44df4c5ba61356b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Shao-Solis-Oba/10,
AUTHOR = {Shao, Zhendong and Solis-Oba, Roberto},
TITLE = {$L(2,1)$-labelings on the composition of $n$ graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {34-36},
PAGES = {3287-3292},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {channel assignment, l(2,1)-labeling, graph composition},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4YKGJBF-1/2/c4ce89bb1ebb86617dd09a678fce06fa},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ferragina-Nitto-Venturini/10,
AUTHOR = {Ferragina, Paolo and Nitto, Igor and Venturini, Rossano},
TITLE = {On compact representations of All-Pairs-Shortest-Path-Distance matrices},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {34-36},
PAGES = {3293-3300},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {succinct data structures, compressed indexes for strings and trees, all-pairs-shortest-path distances},
URL = {http://www.sciencedirect.com/science/article/B6V1G-506RN60-2/2/9d11e00ee25df352f92e7486cfce86f0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Blanqui-Kirchner-Riba/10,
AUTHOR = {Blanqui, Fr{\'e}d{\'e}ric and Kirchner, Claude and Riba, Colin},
TITLE = {On the confluence of lambda-calculus with conditional rewriting},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {37},
PAGES = {3301-3327},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WXBMDV-1/2/d19675b3068ebdc02f497104ee8b877e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Padovani/10,
AUTHOR = {Padovani, Luca},
TITLE = {Contract-based discovery of Web services modulo simple orchestrators},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {37},
PAGES = {3328-3347},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {web service discovery, behavioral contracts, orchestration, ccs, testing semantics},
URL = {http://www.sciencedirect.com/science/article/B6V1G-50297MX-1/2/0280d6af98ede40933dae73a28f6e520},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Alpuente-Comini-Escobar-Falaschi-Iborra/10,
AUTHOR = {Alpuente, M. and Comini, M. and Escobar, S. and Falaschi, M. and Iborra, J.},
TITLE = {A compact fixpoint semantics for term rewriting systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {37},
PAGES = {3348-3371},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {term rewriting systems, functional programming, denotational semantics, operational semantics, fixpoint semantics, goal-independent semantics},
URL = {http://www.sciencedirect.com/science/article/B6V1G-5051PRK-1/2/f58229704b02321d9bd2fd7693fd2892},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hierons/10b,
AUTHOR = {Hierons, Robert M.},
TITLE = {Checking experiments for stream X-machines},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {37},
PAGES = {3372-3385},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {stream x-machines, test generation, checking experiment},
URL = {http://www.sciencedirect.com/science/article/B6V1G-505NSB3-4/2/6c9298c2e6ed9ebcdf00471f2ac5ca8e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{OConnor-Spitters/10,
AUTHOR = {O'Connor, Russell and Spitters, Bas},
TITLE = {A computer-verified monadic functional implementation of the integral},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {37},
PAGES = {3386-3402},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {type theory, functional programming, exact real analysis, monads},
URL = {http://www.sciencedirect.com/science/article/B6V1G-508K85V-1/2/60dc2511726ff76b81a8d31bf2599388},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Holzer-Maletti/10,
AUTHOR = {Holzer, Markus and Maletti, Andreas},
TITLE = {An $n\log n$ algorithm for hyper-minimizing a (minimized) deterministic automaton},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {38-39},
PAGES = {3404-3413},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {deterministic finite automaton, minimization, lossy compression},
URL = {http://www.sciencedirect.com/science/article/B6V1G-505NSB3-F/2/686966e454e220c8f6d69d451be09675},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Castiglione-Restivo-Sciortino/10,
AUTHOR = {Castiglione, G. and Restivo, A. and Sciortino, M.},
TITLE = {On extremal cases of Hopcroft's algorithm},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {38-39},
PAGES = {3414-3422},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {deterministic finite state automata, hopcroft's minimization algorithm, standard trees, word trees},
URL = {http://www.sciencedirect.com/science/article/B6V1G-505NSB3-C/2/1741706000a89c7b108ab7e7a3d740a9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Caron-Champarnaud-Mignot/10,
AUTHOR = {Caron, Pascal and Champarnaud, Jean-Marc and Mignot, Ludovic},
TITLE = {Acyclic automata and small expressions using multi-tilde-bar operators},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {38-39},
PAGES = {3423-3435},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {regular languages, finite-state automata, regular operators},
URL = {http://www.sciencedirect.com/science/article/B6V1G-505NSB3-9/2/e8312426b55ece294cfa75bd2d14e4a5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
NOTE = {see Erratum in Theor.~Comput.~Sci., Vol. 412, 2011, No. 29, 3795-3796},
}
@article{Freivalds/10,
AUTHOR = {Freivalds, R{\=u}si{\c{n}}{\v{s}}},
TITLE = {Amount of nonconstructivity in deterministic finite automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {38-39},
PAGES = {3436-3443},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {finite automata, nonconstructive methods, kolmogorov complexity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-506RCWX-6/2/c24039da1b717e5a2aca7d72b0a15a3c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ganty-Maquet-Raskin/10,
AUTHOR = {Ganty, Pierre and Maquet, Nicolas and Raskin, Jean-Fran{\c{c}}ois},
TITLE = {Fixed point guided abstraction refinement for alternating automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {38-39},
PAGES = {3444-3459},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {alternating automata, abstract interpretation, antichains},
URL = {http://www.sciencedirect.com/science/article/B6V1G-506RCWX-5/2/92af65045770105ea7534e59ebb5f88c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Touili-Atig/10,
AUTHOR = {Touili, Tayssir and Atig, Mohamed Faouzi},
TITLE = {Verifying parallel programs with dynamic communication structures},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {38-39},
PAGES = {3460-3468},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {model checking, concurrent programs, reachability analysis, pushdown networks, recognizable sets},
URL = {http://www.sciencedirect.com/science/article/B6V1G-506W6VT-2/2/f58d232d329453851fb0a892832ccdb3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Heam-Nicaud-Schmitz/10,
AUTHOR = {H{\'e}am, Pierre-Cyrille and Nicaud, Cyril and Schmitz, Sylvain},
TITLE = {Parametric random generation of deterministic tree automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {38-39},
PAGES = {3469-3480},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {random generation, average complexity, tree automaton},
URL = {http://www.sciencedirect.com/science/article/B6V1G-506RCWX-4/2/49f6f45e1a7a3bb71db154577c959f55},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Inaba-Hosoya/10,
AUTHOR = {Inaba, Kazuhiro and Hosoya, Haruo},
TITLE = {Compact representation for answer sets of $n$-ary regular queries},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {38-39},
PAGES = {3481-3492},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {tree automata, data structure, xml},
URL = {http://www.sciencedirect.com/science/article/B6V1G-505NSB3-D/2/d6976204e8135312fb6da4cc7f1e9605},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fujiyoshi/10,
AUTHOR = {Fujiyoshi, Akio},
TITLE = {Recognition of directed acyclic graphs by spanning tree automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {38-39},
PAGES = {3493-3506},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {tree automaton, directed acyclic graph, spanning tree, np-completeness, series-parallel graph, generalized series-parallel graph},
URL = {http://www.sciencedirect.com/science/article/B6V1G-5093N8R-5/2/f90240d325b6e3b99df2ac18f6b14805},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Clarridge-Salomaa/10,
AUTHOR = {Clarridge, Adam and Salomaa, Kai},
TITLE = {Analysis of a cellular automaton model for car traffic with a slow-to-stop rule},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {38-39},
PAGES = {3507-3515},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {cellular automata, car traffic, highway, single lane, model, simulation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-506W6VT-1/2/97f3bebbb3150c94c99d14131854c465},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kutrib-Malcher/10a,
AUTHOR = {Kutrib, Martin and Malcher, Andreas},
TITLE = {Cellular automata with sparse communication},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {38-39},
PAGES = {3516-3526},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {cellular automata, restricted communication, formal languages, computational capacity, parallel computing, decidability questions},
URL = {http://www.sciencedirect.com/science/article/B6V1G-505NSB3-B/2/84b9bde4786d40ca72ca3346bdcaa3c2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Denise-Ponty-Termier/10,
AUTHOR = {Denise, A. and Ponty, Y. and Termier, M.},
TITLE = {Controlled non-uniform random generation of decomposable structures},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {40-42},
PAGES = {3527-3552},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {combinatorics, random generation, decomposable structures, combinatorial specification, non-uniform distribution},
URL = {http://www.sciencedirect.com/science/article/B6V1G-50B5PTK-1/2/29e33f4ed0156fcba3fbf20c844b1f84},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Flammini-Monaco-Moscardelli-Shachnai-Shalom-Tamir-Zaks/10,
AUTHOR = {Flammini, Michele and Monaco, Gianpiero and Moscardelli, Luca and Shachnai, Hadas and Shalom, Mordechai and Tamir, Tami and Zaks, Shmuel},
TITLE = {Minimizing total busy time in parallel scheduling with application to optical networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {40-42},
PAGES = {3553-3562},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {scheduling, optical networks, approximation algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-505NSB3-2/2/688c1cc057a5fff3b4e49445e1a4ec25},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ciancarini-Favini/10,
AUTHOR = {Ciancarini, Paolo and Favini, Gian Piero},
TITLE = {Playing the perfect Kriegspiel endgame},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {40-42},
PAGES = {3563-3577},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {game theory, kriegspiel, retrograde analysis, chess},
URL = {http://www.sciencedirect.com/science/article/B6V1G-505NSB3-6/2/0d4b6f0ff0a9f3d7c7a5573d714fec30},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ng-Li-Cheng-Yuan/10,
AUTHOR = {Ng, C.T. and Li, Shisheng and Cheng, T.C.E. and Yuan, Jinjiang},
TITLE = {Preemptive scheduling with simple linear deterioration on a single machine},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {40-42},
PAGES = {3578-3586},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {scheduling, linear deterioration, preemption, release dates, regular function},
URL = {http://www.sciencedirect.com/science/article/B6V1G-508K85V-2/2/e1a3d337c6406b6c502ac939ff772eb6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Han-Lam-Lee-To-Wong/10,
AUTHOR = {Han, Xin and Lam, Tak-Wah and Lee, Lap-Kei and To, Isaac K.K. and Wong, Prudence W.H.},
TITLE = {Deadline scheduling and power management for speed bounded processors},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {40-42},
PAGES = {3587-3600},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {online algorithms, competitive analysis, deadline scheduling, speed scaling, sleep management, energy saving},
URL = {http://www.sciencedirect.com/science/article/B6V1G-506RCWX-3/2/9f80901fdb953b8da2ab78c1dbfbd279},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bell-Delvenne-Jungers-Blondel/10,
AUTHOR = {Bell, Paul C. and Delvenne, Jean-Charles and Jungers, Rapha{\"e}l M. and Blondel, Vincent D.},
TITLE = {The continuous Skolem-Pisot problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {40-42},
PAGES = {3625-3634},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {skolem-pisot problem, exponential polynomials, continuous time dynamical system, decidability, ordinary differential equations},
URL = {http://www.sciencedirect.com/science/article/B6V1G-5093N8R-4/2/cd0aeaafa7dcf556c446a6066b7b94f4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Matsui-Uehara-Uno/10,
AUTHOR = {Matsui, Yasuko and Uehara, Ryuhei and Uno, Takeaki},
TITLE = {Enumeration of the perfect sequences of a chordal graph},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {40-42},
PAGES = {3635-3641},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {chordal graph, clique tree, enumeration, perfect sequence},
URL = {http://www.sciencedirect.com/science/article/B6V1G-509W7D5-1/2/47d24da05eca52aecfd3a710d284d17c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Li-Yuan/10,
AUTHOR = {Li, Shisheng and Yuan, Jinjiang},
TITLE = {Parallel-machine scheduling with deteriorating jobs and rejection},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {40-42},
PAGES = {3642-3650},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {scheduling, deteriorating jobs, rejection, fully polynomial-time approximation scheme},
URL = {http://www.sciencedirect.com/science/article/B6V1G-50B5PTK-2/2/aafd908536f47bd586f4cd72c98b867d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Finbow-Wang/10,
AUTHOR = {Wang, Weifan and Finbow, Stephen and Wang, Ping},
TITLE = {The surviving rate of an infected network},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {40-42},
PAGES = {3651-3660},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {firefighter problem, surviving rate, planar graph, k4-minor free graph, degenerate graph},
URL = {http://www.sciencedirect.com/science/article/B6V1G-50CDST2-1/2/1f24e19a1893c9944a53d378a4e756d7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Goldefus-Masopust-Meduna/10,
AUTHOR = {Goldefus, Filip and Masopust, Tom{\'a}{\v{s}} and Meduna, Alexander},
TITLE = {Left-forbidding cooperating distributed grammar systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {40-42},
PAGES = {3661-3667},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {cooperating distributed grammar system, cooperating derivation mode, left-forbidding grammar, generative power, descriptional complexity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-50B5PTK-3/2/3b49c4eea6fddeb25d501556b4897083},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bucci-de_Luca-De_Luca/10,
AUTHOR = {Bucci, Michelangelo and de Luca, Aldo and De Luca, Alessandro},
TITLE = {On the number of Episturmian palindromes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {40-42},
PAGES = {3668-3684},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {episturmian words, sturmian words, epicentral words, palindromes, palindromization map},
URL = {http://www.sciencedirect.com/science/article/B6V1G-50DF8GX-1/2/886b7b286b6ff4a1aa48878e84a63765},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Meister/10,
AUTHOR = {Meister, Daniel},
TITLE = {Treewidth and minimum fill-in on permutation graphs in linear time},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {40-42},
PAGES = {3685-3700},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph algorithms, treewidth, minimal triangulation, linear time, permutation graphs, interval graphs},
URL = {http://www.sciencedirect.com/science/article/B6V1G-50DW407-1/2/cd9f61cdbefcf44e0c42ee6cf58f691d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cygan-Pilipczuk/10,
AUTHOR = {Cygan, Marek and Pilipczuk, Marcin},
TITLE = {Exact and approximate bandwidth},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {40-42},
PAGES = {3701-3713},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {bandwidth, exponential algorithm, exact algorithm, approximate algorithm, graph},
URL = {http://www.sciencedirect.com/science/article/B6V1G-50DW407-2/2/6d5586d36a7477d5b73788178e38033b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Efthymiou-Spirakis/10,
AUTHOR = {Efthymiou, Charilaos and Spirakis, Paul G.},
TITLE = {Sharp thresholds for Hamiltonicity in random intersection graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {40-42},
PAGES = {3714-3730},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {random intersection graph, hamilton cycles, sharp threshold, stochastic order relation between gn,p and gn,m,p},
URL = {http://www.sciencedirect.com/science/article/B6V1G-50DF8GX-2/2/c59cbfed76be75c8e2a8b93c4e099f36},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Huang-Weakley/10,
AUTHOR = {Huang, Yun Bao and Weakley, William D.},
TITLE = {A note on the complexity of $C^{\infty}$-words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {40-42},
PAGES = {3731-3735},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {kolakoski sequence, c[infinity]-word},
URL = {http://www.sciencedirect.com/science/article/B6V1G-50DF8GX-4/2/4f4276c30e460c6ddc090c149201db65},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Kanj-Xia/10,
AUTHOR = {Chen, Jianer and Kanj, Iyad A. and Xia, Ge},
TITLE = {Improved upper bounds for vertex cover},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {40-42},
PAGES = {3736-3756},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {vertex cover, parameterized algorithm, np-complete problem, branch-and-search},
URL = {http://www.sciencedirect.com/science/article/B6V1G-50G6W97-1/2/78d0145b94f3dfa9d78464bd74f226a7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Csernenszky/10,
AUTHOR = {Csernenszky, Andr{\'a}s},
TITLE = {The Picker-Chooser diameter game},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {40-42},
PAGES = {3757-3762},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {positional games, random graphs, diameter, picker-chooser games},
URL = {http://www.sciencedirect.com/science/article/B6V1G-50G6W97-2/2/5b7c0fbc37822479b5485e84df462a65},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lai-Tsai/10,
AUTHOR = {Lai, Pao-Lien and Tsai, Chang-Hsiung},
TITLE = {Embedding of tori and grids into twisted cubes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {40-42},
PAGES = {3763-3773},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {interconnection networks, twisted cubes, torus-embedding, mesh-embedding, hypercube-embedding, algorithm, disjoint tori, disjoint meshes, disjoint hypercubes},
URL = {http://www.sciencedirect.com/science/article/B6V1G-50FGYD5-1/2/41fb7344dfe87bcaae6e5c4a28671f36},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dvorak-Koubek/10,
AUTHOR = {Dvo{\v{r}}{\'a}k, Tom{\'a}{\v{s}} and Koubek, V{\'a}clav},
TITLE = {Computational complexity of long paths and cycles in faulty hypercubes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {40-42},
PAGES = {3774-3786},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {faulty vertex, hypercube, long path, long cycle, np-hard},
URL = {http://www.sciencedirect.com/science/article/B6V1G-50H1WV3-2/2/272e7045e61f172f38631eb34dc6dedf},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Okun/10,
AUTHOR = {Okun, Michael},
TITLE = {Strong order-preserving renaming in the synchronous message passing model},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {40-42},
PAGES = {3787-3794},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {renaming, approximate agreement, wait-free computation, crash failures, message passing systems},
URL = {http://www.sciencedirect.com/science/article/B6V1G-508FF36-1/2/51beba32fcd6ad074c60cb9101767d96},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cohen-Porat/10a,
AUTHOR = {Cohen, Hagai and Porat, Ely},
TITLE = {Fast set intersection and two-patterns matching},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {40-42},
PAGES = {3795-3800},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {set intersection, two patterns},
URL = {http://www.sciencedirect.com/science/article/B6V1G-5093N8R-1/2/4ebd403c4d8e831e293d3126c81f6c4d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ravelomanana/10,
AUTHOR = {Ravelomanana, Vlady},
TITLE = {Birth and growth of multicyclic components in random hypergraphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {43},
PAGES = {3801-3813},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {random hypergraphs, probabilistic/analytic combinatorics, asymptotic enumeration, extremal hypergraphs},
URL = {http://www.sciencedirect.com/science/article/B6V1G-508FF36-2/2/88a30714487722d23d94bf5e57eda9c9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dombb-Lipsky-Porat-Porat-Tsur/10,
AUTHOR = {Dombb, Yair and Lipsky, Ohad and Porat, Benny and Porat, Ely and Tsur, Asaf},
TITLE = {The approximate swap and mismatch edit distance},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {43},
PAGES = {3814-3822},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {pattern matching, swap, edit operations, mismatch},
URL = {http://www.sciencedirect.com/science/article/B6V1G-5093N8R-3/2/992e7d99a9657ce1db7a71cde30a1c9f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Busch-Tirthapura/10,
AUTHOR = {Busch, Costas and Tirthapura, Srikanta},
TITLE = {Concurrent counting is harder than queuing},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {43},
PAGES = {3823-3833},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {distributed algorithms, distributed data structures, distributed counting, distributed queuing},
URL = {http://www.sciencedirect.com/science/article/B6V1G-50HYGCS-1/2/6f1b7241cbbb98dde87f544c67f0aa28},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bonato-Chiniforooshan-Pralat/10,
AUTHOR = {Bonato, Anthony and Chiniforooshan, Ehsan and Pra{\l}at, Pawe{\l}},
TITLE = {Cops and Robbers from a distance},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {43},
PAGES = {3834-3844},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graphs, cop number, polynomial time algorithm, strong product, np-hard, random graph},
URL = {http://www.sciencedirect.com/science/article/B6V1G-50H7D8H-1/2/d865f78a1777eef453ecefa9c7b6210b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Scott-Stege/10,
AUTHOR = {Scott, Allan and Stege, Ulrike},
TITLE = {Parameterized pursuit-evasion games},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {43},
PAGES = {3845-3858},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {parameterized complexity, cops and robber, algorithmic combinatorial game theory},
URL = {http://www.sciencedirect.com/science/article/B6V1G-50GWNCW-1/2/85f30930d3393e3e02b70578ed81cfdb},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kiyomi-Saitoh-Uehara/10,
AUTHOR = {Kiyomi, Masashi and Saitoh, Toshiki and Uehara, Ryuhei},
TITLE = {Reconstruction of interval graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {43},
PAGES = {3859-3866},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {the graph reconstruction conjecture, interval graphs, polynomial time algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V1G-50H1WV3-3/2/167e6cfafb3fc3cf99cbb96faf43349c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Pasanen/10,
AUTHOR = {Pasanen, Tomi A.},
TITLE = {Random binary search tree with equal elements},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {43},
PAGES = {3867-3872},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {data structures, multiset, equal elements, monoset},
URL = {http://www.sciencedirect.com/science/article/B6V1G-50DF8GX-3/2/79e9159705787d9423a0b8e0581b2c4d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Caterina-Boghosian/10,
AUTHOR = {Caterina, Gianluca and Boghosian, Bruce},
TITLE = {An order-preserving property of additive invariants for Takesue-type reversible cellular automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {43},
PAGES = {3877-3881},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {cellular automata, reversibility, conserved quantities, noether's theorem, invariants, elementary reversible cellular automata (erca), discrete dynamical systems},
URL = {http://www.sciencedirect.com/science/article/B6V1G-50MN7PT-2/2/2657693af17db9e4809482d38bca0489},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gao-Fu/10,
AUTHOR = {Gao, Zhi-Han and Fu, Fang-Wei},
TITLE = {The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {44-46},
PAGES = {3883-3893},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {linear recurring sequence, minimal polynomial, linear complexity, linear transformation, m-sequence},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397510004007},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Herrero-Jeronimo-Sabia/10,
AUTHOR = {Herrero, Mar{\'{i}}a Isabel and Jeronimo, Gabriela and Sabia, Juan},
TITLE = {Computing isolated roots of sparse polynomial systems in affine space},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {44-46},
PAGES = {3894-3904},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {sparse polynomial systems, algorithms, complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397510004019},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Frisco-Ibarra/10,
AUTHOR = {Frisco, Pierluigi and Ibarra, Oscar H.},
TITLE = {On sets of numbers accepted by P/T systems composed by {\it join}},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {44-46},
PAGES = {3905-3916},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {p/t systems, j languages, join},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397510004020},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Huss-Sava-Woess/10,
AUTHOR = {Huss, Wilfried and Sava, Ecaterina and Woess, Wolfgang},
TITLE = {Entropy sensitivity of languages defined by infinite automata, via Markov chains with forbidden transitions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {44-46},
PAGES = {3917-3922},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {formal language, oriented graph, infinite sofic system, growth sensitivity, entropy, irreducible markov chain, spectral radius},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397510004068},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Carpi-DAlonzo/10,
AUTHOR = {Carpi, Arturo and D'Alonzo, Valerio},
TITLE = {On factors of synchronized sequences},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {44-46},
PAGES = {3932-3937},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {synchronized sequence, automatic sequence, factor complexity, palindromic complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397510004226},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Uchizawa-Nishizeki-Takimoto/10,
AUTHOR = {Uchizawa, Kei and Nishizeki, Takao and Takimoto, Eiji},
TITLE = {Energy and depth of threshold circuits},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {44-46},
PAGES = {3938-3946},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {threshold circuits, neural networks, depth, energy complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397510004238},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Huo-Leung/10,
AUTHOR = {Huo, Yumei and Leung, Joseph Y.-T.},
TITLE = {Fast approximation algorithms for job scheduling with processing set restrictions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {44-46},
PAGES = {3947-3955},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {tree-hierarchical processing set, inclusive processing set, nested processing set, makespan minimization, polynomial-time approximation algorithm, np-hard, nonpreemptive scheduling},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397510004251},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Han-Makino/10,
AUTHOR = {Han, Xin and Makino, Kazuhisa},
TITLE = {Online removable knapsack with limited cuts},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {44-46},
PAGES = {3956-3964},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {knapsack problem, online algorithms, competitive ratio},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397510004263},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Morales-Sudborough/10,
AUTHOR = {Morales, Linda and Sudborough, Hal},
TITLE = {A quadratic lower bound for topswops},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {44-46},
PAGES = {3965-3970},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {topswops, reverse card shuffle, pancake problem, prefix reversals, lower bounds, permutations, conway card games},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397510004287},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dereniowski/10a,
AUTHOR = {Dereniowski, Dariusz},
TITLE = {Phutball is PSPACE-hard},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {44-46},
PAGES = {3971-3978},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computational complexity, games, phutball, pspace hardness},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397510004548},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ota-Morsy-Nagamochi/10,
AUTHOR = {Ota, Shunsuke and Morsy, Ehab and Nagamochi, Hiroshi},
TITLE = {A plane graph representation of triconnected graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {44-46},
PAGES = {3979-3993},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {algorithms, connectivity, plane graphs, graph embedding, data structure, independent trees, partition},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397510004640},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Demetrescu-Escoffier-Moruz-Ribichini/10,
AUTHOR = {Demetrescu, Camil and Escoffier, Bruno and Moruz, Gabriel and Ribichini, Andrea},
TITLE = {Adapting parallel algorithms to the W-Stream model, with applications to graph problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {44-46},
PAGES = {3994-4004},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {data streaming model, reductions to parallel algorithms, graph problems},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397510004652},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Li-Chen/10,
AUTHOR = {Wang, Jianxin and Li, Wenjun and Chen, Jianer},
TITLE = {A parameterized algorithm for the hyperplane-cover problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {44-46},
PAGES = {4005-4009},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {parameterized algorithm, computational geometry, hyperplane-cover, line-cover},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397510004299},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jeandel/10,
AUTHOR = {Jeandel, Emmanuel},
TITLE = {The periodic domino problem revisited},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {44-46},
PAGES = {4010-4016},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {tilings, undecidability},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397510004524},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ackerman-Ben-Zwi-Wolfovitz/10,
AUTHOR = {Ackerman, Eyal and Ben-Zwi, Oren and Wolfovitz, Guy},
TITLE = {Combinatorial model and bounds for target set selection},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {44-46},
PAGES = {4017-4022},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {target set selection, monotone irreversible dynamic monopoly (dynamo)},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397510004561},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lozin/10,
AUTHOR = {Lozin, Vadim V.},
TITLE = {A decidability result for the dominating set problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {44-46},
PAGES = {4023-4027},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {dominating set, computational complexity, decidability, well-quasi-order, non-constructive proof},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397510004627},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Grinchtein-Jonsson-Leucker/10,
AUTHOR = {Grinchtein, Olga and Jonsson, Bengt and Leucker, Martin},
TITLE = {Learning of event-recording automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {47},
PAGES = {4029-4054},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {model inference, model learning, timed systems},
URL = {http://www.sciencedirect.com/science/article/B6V1G-50NYWWR-1/2/cb18b1a5c4e96d102d4409cab5f0f3ee},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Alpuente-Ballis-Correa-Falaschi/10,
AUTHOR = {Alpuente, M. and Ballis, D. and Correa, F. and Falaschi, M.},
TITLE = {An integrated framework for the diagnosis and correction of rule-based programs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {47},
PAGES = {4055-4101},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {debugging, narrowing, functional logic programming, program transformation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-50P9H45-1/2/c2ce65bf5302263a782560f4a5b5bc98},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Birkedal-Stovring-Thamsborg/10,
AUTHOR = {Birkedal, Lars and St{\o}vring, Kristian and Thamsborg, Jacob},
TITLE = {The category-theoretic solution of recursive metric-space equations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {47},
PAGES = {4102-4122},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {metric space, fixed point, recursive equation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-50M6XHX-1/2/273136cbfd830f62b4212a8524fa2f37},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bonizzoni-De_Felice-Zizza/10,
AUTHOR = {Bonizzoni, Paola and De Felice, Clelia and Zizza, Rosalba},
TITLE = {A characterization of (regular) circular languages generated by monotone complete splicing systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {48},
PAGES = {4149-4161},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {automata theory, formal languages, molecular computing, splicing systems},
URL = {http://www.sciencedirect.com/science/article/B6V1G-505NSB3-3/2/35ff2010a338b74e02fc5936899c70a7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Manea/10,
AUTHOR = {Manea, Florin},
TITLE = {A series of algorithmic results related to the iterated hairpin completion},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {48},
PAGES = {4162-4178},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {dna computing, hairpin completion, iterated hairpin completion, hairpin completion distance, segment tree, trie},
URL = {http://www.sciencedirect.com/science/article/B6V1G-50C71YS-1/2/09029e9ecdf54f9f39b85075c65f8cb2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Anderson/10,
AUTHOR = {Anderson, Neal G.},
TITLE = {On the physical implementation of logical transformations: Generalized $L$-machines},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {48},
PAGES = {4179-4199},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {implementation, l-machine, landauer's principle, physical information theory, physics of computation, realism about computation, representation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-50C10Y9-1/2/5ee49ec2fb62370b915447907a6dbc0f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tan-Lv-Yi-Huang/10,
AUTHOR = {Tan, Kok Kiong and Lv, Jian Cheng and Yi, Zhang and Huang, Sunan},
TITLE = {Adaptive multiple minor directions extraction in parallel using a PCA neural network},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {48},
PAGES = {4200-4215},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {minor component analysis (mca), principal component analysis (pca), global convergence, deterministic discrete time (ddt) method},
URL = {http://www.sciencedirect.com/science/article/B6V1G-50R6KFS-1/2/d01a2420088b5a67af12261ac0aee2d5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Darmann-Pferschy-Schauer/10,
AUTHOR = {Darmann, Andreas and Pferschy, Ulrich and Schauer, Joachim},
TITLE = {Resource allocation with time intervals},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {49},
PAGES = {4217-4234},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {resource allocation, proper intervals, interval scheduling, unsplittable flow},
URL = {http://www.sciencedirect.com/science/article/B6V1G-511K40T-1/2/8ec759dce6217b4913e7c6ede7400bfa},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Liu/10c,
AUTHOR = {Liu, J.J.},
TITLE = {Distinct squares in run-length encoded strings},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {49},
PAGES = {4235-4241},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {squares, repetition, rc-occurrence, run-length encoding},
URL = {http://www.sciencedirect.com/science/article/B6V1G-511K40T-2/2/f02b9a74e823edf1bcb0e40e39b929f2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jiang/10c,
AUTHOR = {Jiang, Minghui},
TITLE = {On the parameterized complexity of some optimization problems related to multiple-interval graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {49},
PAGES = {4253-4262},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computational complexity, geometric intersection graph, bioinformatics},
URL = {http://www.sciencedirect.com/science/article/B6V1G-511G1X9-1/2/3f2b0390c3d4cf2fa51ddf12f8db4d2f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Blakeley-Blanchet-Sadri-Gunter-Rampersad/10,
AUTHOR = {Blakeley, Brandon and Blanchet-Sadri, F. and Gunter, Josh and Rampersad, Narad},
TITLE = {On the complexity of deciding avoidability of sets of partial words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {49},
PAGES = {4263-4271},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {automata and formal languages, computational complexity, combinatorics on words, partial words, unavoidable sets, -hard problems, de bruijn graphs},
URL = {http://www.sciencedirect.com/science/article/B6V1G-512MHG6-3/2/99a7097ba0bcc12b02681e19f3d5fe8f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{DAgostino-Lenzi/10,
AUTHOR = {D'Agostino, Giovanna and Lenzi, Giacomo},
TITLE = {On the $\mu$-calculus over transitive and finite transitive frames},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {50},
PAGES = {4273-4290},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {fixed points, modal [mu]-calculus, alternation hierarchy, collapse, finite transitive frames},
URL = {http://www.sciencedirect.com/science/article/B6V1G-51336D8-1/2/92e1ecefbbf3b8df4f8320e848c9b6e2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lanotte-Maggiolo-Schettini-Troina/10,
AUTHOR = {Lanotte, Ruggero and Maggiolo-Schettini, Andrea and Troina, Angelo},
TITLE = {Weak bisimulation for Probabilistic Timed Automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {50},
PAGES = {4291-4322},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {probabilistic timed automata, weak bisimulation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-5137FF7-1/2/cf9e01b30468d7f906ad0e02cc24aa28},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Rybakov/10,
AUTHOR = {Rybakov, Vladimir},
TITLE = {Rules admissible in transitive temporal logic $T_{S4}$, sufficient condition},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {50},
PAGES = {4323-4332},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {algorithms, computation, decidability, temporal logic, inference rules, admissible rules},
URL = {http://www.sciencedirect.com/science/article/B6V1G-512VTNX-2/2/314037a4c34e8975830224fc0e5ebe4d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Maric/10,
AUTHOR = {Mari{\'c}, Filip},
TITLE = {Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {50},
PAGES = {4333-4356},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {formal program verification, sat problem, dpll procedure, isabelle},
URL = {http://www.sciencedirect.com/science/article/B6V1G-513F91R-2/2/3b8d7a576e19f0a815a5a563b453af03},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sumii/10,
AUTHOR = {Sumii, Eijiro},
TITLE = {A bisimulation-like proof method for contextual properties in untyped $\lambda$-calculus with references and deallocation},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {51-52},
PAGES = {4358-4378},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {environmental bisimulation, contextual equivalence, memory management and deallocation, local memory safety},
URL = {http://www.sciencedirect.com/science/article/B6V1G-5137FF7-2/2/63a8bcf92d38a8df61e7b22464c0b30b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Filipovic-OHearn-Rinetzky-Yang/10,
AUTHOR = {Filipovi{\'c}, Ivana and O'Hearn, Peter and Rinetzky, Noam and Yang, Hongseok},
TITLE = {Abstraction for concurrent objects},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {51-52},
PAGES = {4379-4398},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {linearizability, sequential consistency, observational equivalence, observational refinement},
URL = {http://www.sciencedirect.com/science/article/B6V1G-514BPP0-3/2/dab9442b76a4fe5fbd946076b026abb4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Caires-Vieira/10,
AUTHOR = {Caires, Lu{\'{i}}s and Vieira, Hugo Torres},
TITLE = {Conversation types},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {51-52},
PAGES = {4399-4440},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {behavioral types, distributed systems, program analysis, service-based systems, session types},
URL = {http://www.sciencedirect.com/science/article/B6V1G-512K1VW-1/2/bb484b6a955be068d053c04b5f3edc1c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jaskelioff-Moggi/10,
AUTHOR = {Jaskelioff, Mauro and Moggi, Eugenio},
TITLE = {Monad transformers as monoid transformers},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {411},
NUMBER = {51-52},
PAGES = {4441-4466},
YEAR = {2010},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {monad, monoid, monoidal category},
URL = {http://www.sciencedirect.com/science/article/B6V1G-512VTNX-1/2/4407ba4c6597a9043c3c04ce45ca2877},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Chen/07,
AUTHOR = {Wang, Weifan and Chen, Yongzhu},
TITLE = {A sufficient condition for a planar graph to be class 1},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {385},
NUMBER = {1-3},
PAGES = {71-77},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {planar graph, edge colouring, chromatic index, cycle},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NXHCH1-2/2/b2ddda611aca84b9de8bab0d35352010},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}