@article{Dolinka/07,
AUTHOR = {Dolinka, Igor},
TITLE = {Axiomatizing the identities of binoid languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {1},
PAGES = {1-14},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MG5WD0-1/2/7d2c9748df0e04bf55a86c25aa2ab640},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Leve-Richomme/07,
AUTHOR = {Lev{\'e}, F. and Richomme, G.},
TITLE = {Quasiperiodic Sturmian words and morphisms},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {1},
PAGES = {15-25},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {sturmian words, quasiperiodicity, lyndon words, morphisms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MBJK4H-3/2/0a1d8f661dd21a14f848f213c125f984},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Berman-Karpinski-Nekrich/07,
AUTHOR = {Berman, Piotr and Karpinski, Marek and Nekrich, Yakov},
TITLE = {Optimal trade-off for Merkle tree traversal},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {1},
PAGES = {26-36},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {time and space complexity, optimality, trade-offs, merkle trees, merkle tree traversal, authentification path, amortization},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MGM2SG-1/2/bab5d3877390b877757f2b488f27916b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bell-Potapov/07a,
AUTHOR = {Bell, Paul and Potapov, Igor},
TITLE = {On the membership of invertible diagonal and scalar matrices},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {1},
PAGES = {37-45},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {membership problem, matrix semigroups, diagonal matrix, undecidability, post correspondence problem},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MGDYX7-2/2/361256e23fae22365e02a25ea208d226},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Pivato/07,
AUTHOR = {Pivato, Marcus},
TITLE = {RealLife: The continuum limit of Larger than Life cellular automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {1},
PAGES = {46-68},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {cellular automata, game of life, continuum limit},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MGDYX7-1/2/f56e3c445a0183b56482976f66f5ff4c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tan-Wu/07,
AUTHOR = {Tan, Zhiyi and Wu, Yong},
TITLE = {Optimal semi-online algorithms for machine covering},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {1},
PAGES = {69-80},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {scheduling, design and analysis of algorithms, semi-online, competitive ratio},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MDWY3H-1/2/85517f50367e57a1b0cdcfde9376139e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ishii-Fujita-Nagamochi/07,
AUTHOR = {Ishii, Toshimasa and Fujita, Hitoshi and Nagamochi, Hiroshi},
TITLE = {Minimum cost source location problem with local 3-vertex-connectivity requirements},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {1},
PAGES = {81-93},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph algorithm, undirected graph, location problem, local vertex-connectivity, polynomial time algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MDWY3H-2/2/f9d02b50b026f8bfccf585a12caf0ccc},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ye-Zhang/07a,
AUTHOR = {Ye, Deshi and Zhang, Guochuan},
TITLE = {On-line scheduling mesh jobs with dependencies},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {1},
PAGES = {94-102},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {on-line algorithm, parallel job, scheduling, network topology},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MDWY3H-5/2/3ce8aca20b2d4a9002495c3b6fcd8e9e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dou-Yao/07,
AUTHOR = {Dou, Wenqing and Yao, Enyu},
TITLE = {On rearrangeable multirate three-stage Clos networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {1},
PAGES = {103-107},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {three-stage clos network, multirate network, rearrangeable},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MKKCP7-1/2/bd88a249def98fe50130971a019c69a1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gurski/07a,
AUTHOR = {Gurski, Frank},
TITLE = {Characterizations for restricted graphs of NLC-width 2},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {1},
PAGES = {108-114},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {nlc-width, nlct-width, linear nlc-width, graph characterizations},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MMFJ5C-2/2/711258d3e0c1f7ec59dfd12a44472518},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ferragina-Venturini/07,
AUTHOR = {Ferragina, Paolo and Venturini, Rossano},
TITLE = {A simple storage scheme for strings achieving entropy bounds},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {1},
PAGES = {115-121},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {data structures for strings, data compression},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MSXT9H-1/2/7bc0e522e57afb1ff4e6e7c9e173a083},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Busi/07,
AUTHOR = {Busi, Nadia},
TITLE = {Using well-structured transition systems to decide divergence for catalytic $P$ systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {2-3},
PAGES = {125-135},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {membrane computing, catalytic p system, decidability, well-structured transition system},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MG065P-7/2/fe1c6cf1a620abd75bbb865fac63a417},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cavaliere-Freund-Oswald-Sburlan/07,
AUTHOR = {Cavaliere, Matteo and Freund, Rudolf and Oswald, Marion and Sburlan, Drago{\c{s}}},
TITLE = {Multiset random context grammars, checkers, and transducers},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {2-3},
PAGES = {136-151},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {antiport, checker, multiset grammar, p system, random context, transducer},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MG065P-8/2/2a4424231f5f82e66ef0d8942e7fb35a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Csuhaj-Varju-Margenstern-Vaszil-Verlan/07,
AUTHOR = {Csuhaj-Varj{\'u}, Erzs{\'e}bet and Margenstern, Maurice and Vaszil, Gy{\"o}rgy and Verlan, Sergey},
TITLE = {On small universal antiport $P$ systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {2-3},
PAGES = {152-164},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {p systems, universality, size complexity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MG065P-5/2/f2c8b15fdf4f81e0d04a025b1d8f049c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fontana-Manca/07,
AUTHOR = {Fontana, Federico and Manca, Vincenzo},
TITLE = {Discrete solutions to differential equations by metabolic $P$ systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {2-3},
PAGES = {165-182},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {metabolic networks, ordinary differential equations, p systems, mp systems, mp graphs},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MK72JX-1/2/6f5e39621f9cd43e5dd85b2699982743},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gutierrez-Naranjo-Perez-Jimenez-Riscos-Nunez/07,
AUTHOR = {Guti{\'e}rrez-Naranjo, Miguel A. and P{\'e}rez-Jim{\'e}nez, Mario J. and Riscos-N{\'u}{\~n}ez, Agust{\'{i}}n},
TITLE = {On the degree of parallelism in membrane systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {2-3},
PAGES = {183-195},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {membrane computing, p systems, dependency graph, degree of parallelism},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MG065P-3/2/7b615979b688bc0af85aa6e59451c53c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ibarra-Paun-Paun-Rodriguez-Paton-Sosik-Woodworth/07,
AUTHOR = {Ibarra, Oscar H. and P{\u{a}}un, Andrei and P{\u{a}}un, Gheorghe and Rodr{\'{i}}guez-Pat{\'o}n, Alfonso and Sos{\'{i}}k, Petr and Woodworth, Sara},
TITLE = {Normal forms for spiking neural $P$ systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {2-3},
PAGES = {196-217},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {membrane computing, spiking neural p system, universality, normal form},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MG065P-4/2/51d1b95537615f8d2e9a6e587d046371},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Leporati-Felloni/07,
AUTHOR = {Leporati, Alberto and Felloni, Sara},
TITLE = {Three ''quantum'' algorithms to solve 3-SATt},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {2-3},
PAGES = {218-241},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {quantum p systems, membrane computing, quantum register machines, quantum circuits, np-complete problems, 3-sat},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MG065P-9/2/4b6f5cfbb3a1d51f932b9f0298b7c1e7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Muskulus-Besozzi-Brijder-Cazzaniga-Houweling-Pescini-Rozenberg/07,
AUTHOR = {Muskulus, Michael and Besozzi, Daniela and Brijder, Robert and Cazzaniga, Paolo and Houweling, Sanne and Pescini, Dario and Rozenberg, Grzegorz},
TITLE = {Cycles and communicating classes in membrane systems and molecular dynamics},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {372},
NUMBER = {2-3},
PAGES = {242-266},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {membrane systems, communicating classes, molecular dynamics, cycles in digraphs, vector addition systems},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MG5WD0-2/2/094636d2fd0009febe5f3747b12a8656},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}