@article{Asarin-Pace-Schneider-Yovine/08,
AUTHOR = {Asarin, Eugene and Pace, Gordon and Schneider, Gerardo and Yovine, Sergio},
TITLE = {Algorithmic analysis of polygonal hybrid systems, Part II: Phase portrait and tools},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {390},
NUMBER = {1},
PAGES = {1-26},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {hybrid systems, differential inclusions, verification, phase portrait},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PR8P73-1/2/5a4cb2090d6fd02f83700c5e9cade4ce},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Klasing-Markou-Pelc/08,
AUTHOR = {Klasing, Ralf and Markou, Euripides and Pelc, Andrzej},
TITLE = {Gathering asynchronous oblivious mobile robots in a ring},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {390},
NUMBER = {1},
PAGES = {27-39},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {asynchronous, mobile robot, gathering, ring},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PV94F2-3/2/b4df806bad8c217d322607b97544a984},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Apostolico-Parida-Rombo/08,
AUTHOR = {Apostolico, Alberto and Parida, Laxmi and Rombo, Simona E.},
TITLE = {Motif patterns in 2D},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {390},
NUMBER = {1},
PAGES = {40-55},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {design and analysis of algorithms, pattern matching, pattern discovery, motif, 2d irredundant motifs},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PXDM7R-2/2/363464a6e685c74dcc0bf100d7fb0f13},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chepoi-Nouioua-Vaxes/08,
AUTHOR = {Chepoi, Victor and Nouioua, Karim and Vax{\`e}s, Yann},
TITLE = {A rounding algorithm for approximating minimum Manhattan networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {390},
NUMBER = {1},
PAGES = {56-69},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {l1-distance, network design, linear programming, approximation algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PWF0WP-1/2/a78c4186086702476e3a8fe668fbb014},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Park/08,
AUTHOR = {Park, Jung-Heum},
TITLE = {Panconnectivity and edge-pancyclicity of faulty recursive circulant $G(2^m,4)$},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {390},
NUMBER = {1},
PAGES = {70-80},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {panconnected, edge-pancyclic, embedding, linear arrays, rings, recursive circulants, fault tolerance, interconnection networks},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PWF0WP-5/2/4821d930a7cbe3587af8b1cb29870191},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Morsy-Nagamochi/08b,
AUTHOR = {Morsy, Ehab and Nagamochi, Hiroshi},
TITLE = {An improved approximation algorithm for capacitated multicast routings in networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {390},
NUMBER = {1},
PAGES = {81-91},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {approximation algorithm, graph algorithm, multicast routing problem, network optimization, tree cover},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PYJSH3-1/2/28731f1cce5c1e11d10c24e8bb82d76f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{De_Mol/08,
AUTHOR = {De Mol, Liesbeth},
TITLE = {Tag systems and Collatz-like functions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {390},
NUMBER = {1},
PAGES = {92-101},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {tag systems, limits of solvability and unsolvability, universality, 3n+1-problem, collatz-like functions},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PYGW47-1/2/121366545d6b503b771ab2d377995264},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Atanasiu-Atanasiu-Petre/08,
AUTHOR = {Atanasiu, Adrian and Atanasiu, Radu and Petre, Ion},
TITLE = {Parikh matrices and amiable words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {390},
NUMBER = {1},
PAGES = {102-109},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {parikh matrix mapping, amiable words, scattered subwords, rank distance},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PYHNWK-1/2/cca0f4e8c5038c5551a4230c87327263},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Shi-Ye/08,
AUTHOR = {Shi, Yongqiang and Ye, Deshi},
TITLE = {Online bin packing with arbitrary release times},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {390},
NUMBER = {1},
PAGES = {110-119},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {bin packing, online algorithm, performance evaluation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PYP776-1/2/f7d2dcd5e74b5d1597ba9236debb26be},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cheng-Ko-Wu/08,
AUTHOR = {Cheng, Yongxi and Ko, Ker-I and Wu, Weili},
TITLE = {On the complexity of non-unique probe selection},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {390},
NUMBER = {1},
PAGES = {120-125},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {non-unique probe selection, separable matrices, -complete, -complete},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PWF0WP-4/2/d211262a3a64ea48dab6e6a134bf5105},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Abbes-Benveniste/08,
AUTHOR = {Abbes, Samy and Benveniste, Albert},
TITLE = {True-concurrency probabilistic models: Markov nets and a law of large numbers},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {390},
NUMBER = {2-3},
PAGES = {129-170},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {probabilistic event structure, probabilistic petri net, true-concurrency, probability},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PR8P73-4/2/0e8942419e11443abda98e4ef476d4d0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jeffrey-Rathke/08,
AUTHOR = {Jeffrey, Alan and Rathke, Julian},
TITLE = {Full abstraction for polymorphic $\pi$-calculus},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {390},
NUMBER = {2-3},
PAGES = {171-196},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PR8P73-5/2/a48eda57939d353ba330a3c4a140c9d3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Larsen-Rasmussen/08,
AUTHOR = {Larsen, Kim Guldstrand and Rasmussen, Jacob Illum},
TITLE = {Optimal reachability for multi-priced timed automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {390},
NUMBER = {2-3},
PAGES = {197-213},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PR8P73-2/2/9f9dd7370633264759202418e0894b7f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Murawski-Walukiewicz/08,
AUTHOR = {Murawski, Andrzej S. and Walukiewicz, Igor},
TITLE = {Third-order idealized Algol with iteration is decidable},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {390},
NUMBER = {2-3},
PAGES = {214-229},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {game semantics, computational complexity, program analysis},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PR8P73-6/2/aff25930fb163c5c0cab2eca6bcd7b6c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Schroder/08,
AUTHOR = {Schr{\"o}der, Lutz},
TITLE = {Expressivity of coalgebraic modal logic: The limits and beyond},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {390},
NUMBER = {2-3},
PAGES = {230-247},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {coalgebra, modal logic, predicate lifting, expressivity, compositionality},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PR8P73-3/2/aad11c6d5a299ebb07e7b4282ca1e324},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Stark/08,
AUTHOR = {Stark, Ian},
TITLE = {Free-algebra models for the $\pi$-calculus},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {390},
NUMBER = {2-3},
PAGES = {248-270},
YEAR = {2008},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {denotational semantics, concurrency, computational monads, lawvere theories, nominal sets},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4PRRBSY-2/2/8fe930dc16232bb4f1cd9011fbfa0639},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}