@article{Groote-Voorhoeve/07,
AUTHOR = {Groote, Jan Friso and Voorhoeve, Marc},
TITLE = {Operational semantics for Petri net components},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {1-2},
PAGES = {1-19},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {semantics, petri nets, process algebra, bisimulation, modelling, verification},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MSXT9H-4/2/f7a86b37c5807a23595bbad6ba45ad9b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Japaridze/07,
AUTHOR = {Japaridze, Giorgi},
TITLE = {From truth to computability II},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {1-2},
PAGES = {20-52},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computability logic, interactive computation, game semantics, linear logic, constructive logic},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MV758R-2/2/aa91a59a421105a76e8ded822d3ffabe},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Martins/07,
AUTHOR = {Martins, Manuel A.},
TITLE = {Closure properties for the class of behavioral models},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {1-2},
PAGES = {53-83},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {behavioral specification, behavioral equivalence, hidden equational logic, leibniz operator, equivalential logic},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N2TS51-2/2/07dd35ebdf176ae5ae86682c522c6a2c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kanovich-Vauzeilles/07,
AUTHOR = {Kanovich, Max and Vauzeilles, Jacqueline},
TITLE = {Strong planning under uncertainty in domains with numerous but identical elements (a generic approach)},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {1-2},
PAGES = {84-119},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {ai planning under uncertainty, linear logic, proofs as programs, deterministic and non-deterministic planning domains, horn linear logic},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N02J7J-4/2/b93c96f156866224a0e67b49570a4787},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Marcial-Romero-Escardo/07,
AUTHOR = {Marcial-Romero, J. Raymundo and Escard{\'o}, Mart{\'{i}}n H.},
TITLE = {Semantics of a sequential language for exact real-number computation},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {1-2},
PAGES = {120-141},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {exact real-number computation, sequential computation, semantics, non-determinism, pcf},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N0X5XT-1/2/fe86af017d5f29944071663c690dee55},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chadha-Cruz-Filipe-Mateus-Sernadas/07,
AUTHOR = {Chadha, R. and Cruz-Filipe, L. and Mateus, P. and Sernadas, A.},
TITLE = {Reasoning about probabilistic sequential programs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {1-2},
PAGES = {142-165},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {probabilistic reasoning, hoare calculus, completeness, decidability},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N5CXMV-1/2/201adbce40a0b93b7d748dfee0640204},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Vaux/07,
AUTHOR = {Vaux, Lionel},
TITLE = {The differential $\lambda \mu$-calculus},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {1-2},
PAGES = {166-209},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {differential lambda-calculus, lambda-mu calculus, linear logic, classical logic},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N49VS1-5/2/b7f7934503045e706cac4eaa5415dfd3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Diaconescu-Stefaneas/07,
AUTHOR = {Diaconescu, R{\u{a}}zvan and Stefaneas, Petros},
TITLE = {Ultraproducts and possible worlds semantics in institutions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {1-2},
PAGES = {210-230},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {institutions, possible worlds, kripke models, modal logic, ultraproducts},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NBBYWY-1/2/f3f022cc4adf5b3056da44c20ff1f5d1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Asarin-Schneider-Yovine/07,
AUTHOR = {Asarin, Eugene and Schneider, Gerardo and Yovine, Sergio},
TITLE = {Algorithmic analysis of polygonal hybrid systems, part I: Reachability},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {1-2},
PAGES = {231-265},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {hybrid systems, differential inclusions, verification, decision algorithm, reachability analysis},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NF4F7P-4/2/192854ed18aa9476a68d51e2999ecc91},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dawar-Kreutzer/07,
AUTHOR = {Dawar, Anuj and Kreutzer, Stephan},
TITLE = {Generalising automaticity to modal properties of finite structures},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {1-2},
PAGES = {266-285},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {modal logics, fixed-point logics, automata, complexity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NF4F7P-7/2/0933e2d1abf05679a9ac4db49d26aec0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bozzelli/07,
AUTHOR = {Bozzelli, Laura},
TITLE = {Complexity results on branching-time pushdown model checking},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {1-2},
PAGES = {286-297},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {infinite-state systems, pushdown systems, model checking, regular propositional temporal logics},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NF4F7P-8/2/c09519344f331c9701f700ea3cbfc926},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Vagvolgyi/07,
AUTHOR = {V{\'a}gv{\"o}lgyi, S{\'a}ndor},
TITLE = {Losing recognizability},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {1-2},
PAGES = {298-304},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {rewrite systems, sets of descendants, tree automata, recognizability preserving},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4NF4F7P-9/2/bd20ff379e87109ec3d693b1afd7d48b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Berger-Bollobas-Borgs-Chayes-Riordan/07,
AUTHOR = {Berger, Noam and Bollob{\'a}s, B{\'e}la and Borgs, Christian and Chayes, Jennifer and Riordan, Oliver},
TITLE = {Degree distribution of the FKP network model},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {3},
PAGES = {306-316},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {power-law degree distribution, hot model},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N4PY45-3/2/e66dc0fd0973e66698d80951327065e0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bansal-Agrawal-Malhotra/07,
AUTHOR = {Bansal, Vipul and Agrawal, Aseem and Malhotra, Varun S.},
TITLE = {Polynomial time algorithm for an optimal stable assignment with multiple partners},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {3},
PAGES = {317-328},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {stable marriage, multiple partners, optimal assignment, substitutes, dis-satisfaction score, meta-rotation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N4PY45-4/2/51382594d46856ccb3dac02e2b3f45f8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jagerskupper/07,
AUTHOR = {J{\"a}gersk{\"u}pper, Jens},
TITLE = {Algorithmic analysis of a basic evolutionary algorithm for continuous optimization},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {3},
PAGES = {329-347},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {runtime analysis, evolutionary algorithms, continuous optimization},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N56BWF-2/2/50c628d00698fec7043abc0b0d86c843},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bleichenbacher-Kiayias-Yung/07,
AUTHOR = {Bleichenbacher, Daniel and Kiayias, Aggelos and Yung, Moti},
TITLE = {Decoding interleaved Reed-Solomon codes over noisy channels},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {3},
PAGES = {348-360},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {efficient decoding, probabilistic algorithms, reed-solomon codes, polynomial reconstruction},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N4PY45-1/2/536da4501de89af02b893f978ed37cf7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Khachiyan-Boros-Elbassioni-Gurvich-Makino/07,
AUTHOR = {Khachiyan, Leonid and Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir and Makino, Kazuhisa},
TITLE = {Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {3},
PAGES = {361-376},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {incremental generation, maximal empty boxes, p-efficient points},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N4PY45-8/2/8b877fe2b0a7149403a8aab754c03657},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bodirsky-Gropl-Kang/07,
AUTHOR = {Bodirsky, Manuel and Gr{\"o}pl, Clemens and Kang, Mihyun},
TITLE = {Generating labeled planar graphs uniformly at random},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {3},
PAGES = {377-386},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {labeled planar graph, enumeration, decomposition, sampling algorithm, dynamic programming, graph theory},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N4PY45-5/2/4c06fbabe635c3a288cbf0427e0b395d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hall-Hippler-Skutella/07,
AUTHOR = {Hall, Alex and Hippler, Steffen and Skutella, Martin},
TITLE = {Multicommodity flows over time: Efficient algorithms and complexity},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {3},
PAGES = {387-404},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {network flow, routing, flow over time, dynamic flow, complexity, efficient algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N4PY45-6/2/f69a05fcd824036c9b8aac5c14fd8b2d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gal-Miltersen/07,
AUTHOR = {G{\'a}l, Anna and Miltersen, Peter Bro},
TITLE = {The cell probe complexity of succinct data structures},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {3},
PAGES = {405-417},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {succinct data structures, cell probe complexity, polynomial evaluation with preprocessing},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N4PY45-9/2/10c622972c00e5d3fc2a780a0c0435c7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Matias-Porat/07,
AUTHOR = {Matias, Yossi and Porat, Ely},
TITLE = {Efficient pebbling for list traversal synopses with application to program rollback},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {379},
NUMBER = {3},
PAGES = {418-436},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4N4PY45-7/2/de0155fe49b9cc3d02f13a83775cbc73},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}