@article{Barriere-Flocchini-Fomin-Fraigniaud-Nisse-Santoro-Thilikos/12,
AUTHOR = {Barri{\`e}re, Lali and Flocchini, Paola and Fomin, Fedor V. and Fraigniaud, Pierre and Nisse, Nicolas and Santoro, Nicola and Thilikos, Dimitrios M.},
TITLE = {Connected graph searching},
JOURNAL = {Inf.~Comput.},
VOLUME = {219},
PAGES = {1-16},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {graph searching, cops-and-robbers, network security},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001277},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Yamakami/12,
AUTHOR = {Yamakami, Tomoyuki},
TITLE = {Approximate counting for complex-weighted Boolean constraint satisfaction problems},
JOURNAL = {Inf.~Comput.},
VOLUME = {219},
PAGES = {17-38},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {constraint satisfaction problem, constraint, t-constructibility, holant problem, signature, approximation-preserving reduction, dichotomy theorem},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001174},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Benkoczi-Bhattacharya-Hu-Lin-Shi-Wang/12,
AUTHOR = {Benkoczi, Robert and Bhattacharya, Binay and Hu, Yuzhuang and Lin, Chien-Hsin and Shi, Qiaosheng and Wang, Biing-Feng},
TITLE = {Efficient algorithms for the conditional covering problem},
JOURNAL = {Inf.~Comput.},
VOLUME = {219},
PAGES = {39-57},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {algorithms, graphs, covering location problems, conditional covering, dynamic programming},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001186},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Battaglia-Grossi-Scutella/12,
AUTHOR = {Battaglia, Giovanni and Grossi, Roberto and Scutell{\`a}, Noemi},
TITLE = {Consecutive ones property and PQ-trees for multisets: Hardness of counting their orderings},
JOURNAL = {Inf.~Comput.},
VOLUME = {219},
PAGES = {58-70},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {sequences with repeated symbols, multisets, consecutive ones property, counting permutations, pq-trees, complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001289},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Rabinovich/12a,
AUTHOR = {Rabinovich, Alexander},
TITLE = {The Church problem for expansions of $(\mathbb N,<)$ by unary predicates},
JOURNAL = {Inf.~Comput.},
VOLUME = {218},
PAGES = {1-16},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001046},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Case-Jain-Le-Ong-Semukhin-Stephan/12,
AUTHOR = {Case, John and Jain, Sanjay and Le, Trong Dao and Ong, Yuh Shin and Semukhin, Pavel and Stephan, Frank},
TITLE = {Automatic learning of subclasses of pattern languages},
JOURNAL = {Inf.~Comput.},
VOLUME = {218},
PAGES = {17-35},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001137},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Mateus-Qiu-Li/12,
AUTHOR = {Mateus, Paulo and Qiu, Daowen and Li, Lvzhou},
TITLE = {On the complexity of minimizing probabilistic and quantum automata},
JOURNAL = {Inf.~Comput.},
VOLUME = {218},
PAGES = {36-53},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {probabilistic automata, quantum automata, decidability, minimization},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001149},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Benes-Kretinsky-Larsen-Srba/12,
AUTHOR = {Bene{\v{s}}, Nikola and K{\v{r}}et{\'{i}}nsk{\'y}, Jan and Larsen, Kim G. and Srba, Ji{\v{r}}{\'{i}}},
TITLE = {EXPTIME-completeness of thorough refinement on modal transition systems},
JOURNAL = {Inf.~Comput.},
VOLUME = {218},
PAGES = {54-68},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {modal transition systems, refinement, computational complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001162},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Fujita-Schubert/12,
AUTHOR = {Fujita, Ken-etsu and Schubert, Aleksy},
TITLE = {The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types},
JOURNAL = {Inf.~Comput.},
VOLUME = {218},
PAGES = {69-87},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {lambda calculus and related systems, type checking, typability, partial type inference, second-order unification, undecidability, curry-style type system, church-style type system, finitely stratified polymorphic types},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001150},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Arvind-Das-Kobler-Kuhnert/12,
AUTHOR = {Arvind, V. and Das, Bireswar and K{\"o}bler, Johannes and Kuhnert, Sebastian},
TITLE = {The isomorphism problem for $k$-trees is complete for logspace},
JOURNAL = {Inf.~Comput.},
VOLUME = {217},
PAGES = {1-11},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {graph isomorphism, graph canonization, k-trees, space complexity, logspace completeness},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112000879},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Diekert-Kopecki-Mitrana/12,
AUTHOR = {Diekert, Volker and Kopecki, Steffen and Mitrana, Victor},
TITLE = {Deciding regularity of hairpin completions of regular languages in polynomial time},
JOURNAL = {Inf.~Comput.},
VOLUME = {217},
PAGES = {12-30},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {hairpin completion, regular language, finite automaton, unambiguous linear language, rational growth},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001009},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Spivak/12,
AUTHOR = {Spivak, David I.},
TITLE = {Functorial data migration},
JOURNAL = {Inf.~Comput.},
VOLUME = {217},
PAGES = {31-51},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {category theory, databases, data migration, adjoint functors, queries},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001010},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Vasconcelos/12,
AUTHOR = {Vasconcelos, Vasco T.},
TITLE = {Fundamentals of session types},
JOURNAL = {Inf.~Comput.},
VOLUME = {217},
PAGES = {52-70},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001022},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Das-Toran-Wagner/12,
AUTHOR = {Das, Bireswar and Tor{\'a}n, Jacobo and Wagner, Fabian},
TITLE = {Restricted space algorithms for isomorphism on bounded treewidth graphs},
JOURNAL = {Inf.~Comput.},
VOLUME = {217},
PAGES = {71-83},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {complexity, algorithms, graph isomorphism problem, treewidth, logcfl},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001034},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Ozaki-Ogita-Oishi/12,
AUTHOR = {Ozaki, Katsuhisa and Ogita, Takeshi and Oishi, Shin'ichi},
TITLE = {A robust algorithm for geometric predicate by error-free determinant transformation},
JOURNAL = {Inf.~Comput.},
VOLUME = {216},
PAGES = {3-13},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {computational geometry, verified numerical computation, error-free determinant transformation},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112000752},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Melquiond/12,
AUTHOR = {Melquiond, Guillaume},
TITLE = {Floating-point arithmetic in the Coq system},
JOURNAL = {Inf.~Comput.},
VOLUME = {216},
PAGES = {14-23},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {floating-point arithmetic, formal proofs, coq system},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112000739},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Foufou-Michelucci/12,
AUTHOR = {Foufou, Sebti and Michelucci, Dominique},
TITLE = {Interrogating witnesses for geometric constraint solving},
JOURNAL = {Inf.~Comput.},
VOLUME = {216},
PAGES = {24-38},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {geometric constraints, constraint solving, constraint decomposition, dependent and independent constraints, witness configuration, infinitesimal motions},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112000740},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Lester/12,
AUTHOR = {Lester, David R.},
TITLE = {The world's shortest correct exact real arithmetic program?},
JOURNAL = {Inf.~Comput.},
VOLUME = {216},
PAGES = {39-46},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {computable reals, exact arithmetic, haskell, higher-order logic, pvs},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112000727},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Gonzalez-Navarro-Hormigo-Schulte/12,
AUTHOR = {Gonzalez-Navarro, Sonia and Hormigo, Javier and Schulte, Michael J.},
TITLE = {A study of decimal left shifters for binary numbers},
JOURNAL = {Inf.~Comput.},
VOLUME = {216},
PAGES = {47-56},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {decimal arithmetic, computer arithmetic, decimal shifter, barrel shifter, hardware designs, binary integer decimal},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112000703},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Graillat-Menissier-Morain/12,
AUTHOR = {Graillat, Stef and M{\'e}nissier-Morain, Val{\'e}rie},
TITLE = {Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic},
JOURNAL = {Inf.~Comput.},
VOLUME = {216},
PAGES = {57-71},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {complex floating point arithmetic, error-free transformations, accurate summation, accurate dot product, accurate polynomial evaluation, horner's scheme, high precision},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112000715},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Chevillard/12,
AUTHOR = {Chevillard, S.},
TITLE = {The functions erf and erfc computed with arbitrary precision and explicit error bounds},
JOURNAL = {Inf.~Comput.},
VOLUME = {216},
PAGES = {72-95},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {error function, complementary error function, erf, erfc, floating-point arithmetic, arbitrary precision, multiple precision},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112000697},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Tewari-Vinodchandran/12,
AUTHOR = {Tewari, Raghunath and Vinodchandran, N.V.},
TITLE = {Green's theorem and isolation in planar graphs},
JOURNAL = {Inf.~Comput.},
VOLUME = {215},
PAGES = {1-7},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {space complexity, green's theorem, isolating lemma},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112000594},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Mugnier-Simonet-Thomazo/12,
AUTHOR = {Mugnier, Marie-Laure and Simonet, Genevi{\`e}ve and Thomazo, Micha{\"e}l},
TITLE = {On the complexity of entailment in existential conjunctive first-order logic with atomic negation},
JOURNAL = {Inf.~Comput.},
VOLUME = {215},
PAGES = {8-31},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {complexity, first-order logic, entailment, negation, graph, homomorphism, query containment, clause implication, conceptual graph},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112000582},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Dennunzio-Formenti-Provillard/12,
AUTHOR = {Dennunzio, Alberto and Formenti, Enrico and Provillard, Julien},
TITLE = {Non-uniform cellular automata: Classes, dynamics, and decidability},
JOURNAL = {Inf.~Comput.},
VOLUME = {215},
PAGES = {32-46},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {cellular automata, non-uniform cellular automata, decidability, symbolic dynamics},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112000685},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Bagnara-Mesnard-Pescetti-Zaffanella/12,
AUTHOR = {Bagnara, Roberto and Mesnard, Fred and Pescetti, Andrea and Zaffanella, Enea},
TITLE = {A new look at the automatic synthesis of linear ranking functions},
JOURNAL = {Inf.~Comput.},
VOLUME = {215},
PAGES = {47-67},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {static analysis, computer-aided verification, termination analysis},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112000764},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Rosa-Velardo-Martos-Salgado/12,
AUTHOR = {Rosa-Velardo, Fernando and Martos-Salgado, Mar{\'{i}}a},
TITLE = {Multiset rewriting for the verification of depth-bounded processes with name binding},
JOURNAL = {Inf.~Comput.},
VOLUME = {215},
PAGES = {68-87},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {multiset rewriting, depth-boundedness, wsts, verification, decidability, petri nets, process algebra},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112000788},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Hirshfeld-Rabinovich/12,
AUTHOR = {Hirshfeld, Yoram and Rabinovich, Alexander},
TITLE = {Continuous time temporal logic with counting},
JOURNAL = {Inf.~Comput.},
VOLUME = {214},
PAGES = {1-9},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540111001696},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Leuschel-Llorens-Oliver-Silva-Tamarit/12,
AUTHOR = {Leuschel, Michael and Llorens, Marisa and Oliver, Javier and Silva, Josep and Tamarit, Salvador},
TITLE = {Static slicing of explicitly synchronized languages},
JOURNAL = {Inf.~Comput.},
VOLUME = {214},
PAGES = {10-46},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {concurrent programming, csp, program slicing},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112000417},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Moses-Raynal/12,
AUTHOR = {Moses, Yoram and Raynal, Michel},
TITLE = {No double discount: Condition-based simultaneity yields limited gain},
JOURNAL = {Inf.~Comput.},
VOLUME = {214},
PAGES = {47-58},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {agreement problem, condition-based agreement, consensus, common knowledge, distributed algorithm, early decision, lower bound, modularity, process crash failure, round-based computation model, simultaneity, synchronous message-passing system},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112000429},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Fokkink-van_Glabbeek-de_Wind/12,
AUTHOR = {Fokkink, Wan and van Glabbeek, Rob and de Wind, Paulien},
TITLE = {Divide and congruence: From decomposition of modal formulas to preservation of branching and $\eta$-bisimilarity},
JOURNAL = {Inf.~Comput.},
VOLUME = {214},
PAGES = {59-85},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {structural operational semantics, modal logic, process algebra, process semantics, congruence},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112000405},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Lagorio-Servetto-Zucca/12,
AUTHOR = {Lagorio, Giovanni and Servetto, Marco and Zucca, Elena},
TITLE = {Featherweight Jigsaw --- Replacing inheritance by composition in Java-like languages},
JOURNAL = {Inf.~Comput.},
VOLUME = {214},
PAGES = {86-111},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112000399},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Clifford-Efremenko-Porat-Porat-Rothschild/12,
AUTHOR = {Clifford, Rapha{\"e}l and Efremenko, Klim and Porat, Benny and Porat, Ely and Rothschild, Amir},
TITLE = {Mismatch sampling},
JOURNAL = {Inf.~Comput.},
VOLUME = {214},
PAGES = {112-118},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
URL = {http://www.sciencedirect.com/science/article/pii/S089054011200051X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Curien-Faggian/12,
AUTHOR = {Curien, Pierre-Louis and Faggian, Claudia},
TITLE = {An approach to innocent strategies as graphs},
JOURNAL = {Inf.~Comput.},
VOLUME = {214},
PAGES = {119-155},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112000089},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Cantone-Faro-Giaquinta/12,
AUTHOR = {Cantone, Domenico and Faro, Simone and Giaquinta, Emanuele},
TITLE = {A compact representation of nondeterministic (suffix) automata for the bit-parallel approach},
JOURNAL = {Inf.~Comput.},
VOLUME = {213},
PAGES = {3-12},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112000223},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Schnattinger-Ohlebusch-Gog/12,
AUTHOR = {Schnattinger, Thomas and Ohlebusch, Enno and Gog, Simon},
TITLE = {Bidirectional search in a string with wavelet trees and bidirectional matching statistics},
JOURNAL = {Inf.~Comput.},
VOLUME = {213},
PAGES = {13-22},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {string matching, bidirectional search, matching statistics},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112000235},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Nor-Hermelin-Charlat-Engelstadter-Reuter-Duron-Sagot/12,
AUTHOR = {Nor, Igor and Hermelin, Danny and Charlat, Sylvain and Engelstadter, Jan and Reuter, Max and Duron, Olivier and Sagot, Marie-France},
TITLE = {Mod/Resc Parsimony Inference: Theory and application},
JOURNAL = {Inf.~Comput.},
VOLUME = {213},
PAGES = {23-32},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {computational biology, biclique edge covering, bipartite graph, boolean matrix, np-completeness, graph theory, fixed-parameter tractability, kernelisation},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112000247},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Elberfeld-Tantau/12,
AUTHOR = {Elberfeld, Michael and Tantau, Till},
TITLE = {Phylogeny- and parsimony-based haplotype inference with constraints},
JOURNAL = {Inf.~Comput.},
VOLUME = {213},
PAGES = {33-47},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {haplotype inference, perfect phylogeny, maximum parsimony, polynomial-time algorithms, fixed-parameter algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112000259},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Valimaki-Ladra-Makinen/12,
AUTHOR = {V{\"a}lim{\"a}ki, Niko and Ladra, Susana and M{\"a}kinen, Veli},
TITLE = {Approximate all-pairs suffix/prefix overlaps},
JOURNAL = {Inf.~Comput.},
VOLUME = {213},
PAGES = {49-58},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {suffix/prefix matching, approximate pattern matching},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112000260},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Montes-Memelli-Ward-Kim-Mitchell-Skiena/12,
AUTHOR = {Montes, Pablo and Memelli, Heraldo and Ward, Charles B. and Kim, Joondong and Mitchell, Joseph S.B. and Skiena, Steven},
TITLE = {Optimizing restriction site placement for synthetic genomes},
JOURNAL = {Inf.~Comput.},
VOLUME = {213},
PAGES = {59-69},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {synthetic biology, restriction enzyme placement, genome refactoring},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112000272},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Okhotin-Rondogiannis/12,
AUTHOR = {Okhotin, Alexander and Rondogiannis, Panos},
TITLE = {On the expressive power of univariate equations over sets of natural numbers},
JOURNAL = {Inf.~Comput.},
VOLUME = {212},
PAGES = {1-14},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {non-periodic sets of natural numbers, language equations, conjunctive grammars},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112000107},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Okhotin/12,
AUTHOR = {Okhotin, Alexander},
TITLE = {Unambiguous finite automata over a unary alphabet},
JOURNAL = {Inf.~Comput.},
VOLUME = {212},
PAGES = {15-36},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {finite automata, unary languages, ambiguity, descriptional complexity, state complexity, landau's function},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112000090},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Epstein-van_Stee/12,
AUTHOR = {Epstein, Leah and van Stee, Rob},
TITLE = {The price of anarchy on uniformly related machines revisited},
JOURNAL = {Inf.~Comput.},
VOLUME = {212},
PAGES = {37-54},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {price of anarchy, scheduling, related machines},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112000119},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Michel-Pirillo-Pirillo/12,
AUTHOR = {Michel, Christian J. and Pirillo, Giuseppe and Pirillo, Mario A.},
TITLE = {A classification of 20-trinucleotide circular codes},
JOURNAL = {Inf.~Comput.},
VOLUME = {212},
PAGES = {55-63},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {code, circular, trinucleotide, hierarchy, classes of codes, biological computation, computational biology, computational complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540111001702},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Ravara-Resende-Vasconcelos/12,
AUTHOR = {Ravara, Ant{\'o}nio and Resende, Pedro and Vasconcelos, Vasco T.},
TITLE = {An algebra of behavioural types},
JOURNAL = {Inf.~Comput.},
VOLUME = {212},
PAGES = {64-91},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112000077},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Acciai-Boreale/12,
AUTHOR = {Acciai, Lucia and Boreale, Michele},
TITLE = {Deciding safety properties in infinite-state pi-calculus via behavioural types},
JOURNAL = {Inf.~Comput.},
VOLUME = {212},
PAGES = {92-117},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {pi-calculus, behavioural types, spatial logic, decidability, safety},
URL = {http://www.sciencedirect.com/science/article/pii/S089054011200020X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Gabbay-Mulligan/12,
AUTHOR = {Gabbay, Murdoch J. and Mulligan, Dominic P.},
TITLE = {Corrigendum to ``Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms''},
JOURNAL = {Inf.~Comput.},
VOLUME = {212},
PAGES = {119-119},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112000053},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
NOTE = {Originally in Inf.~Comput., Vol. 208, 2010, No. 3, 230-258},
}
@article{Santini/12,
AUTHOR = {Santini, Simone},
TITLE = {Regular languages with variables on graphs},
JOURNAL = {Inf.~Comput.},
VOLUME = {211},
PAGES = {1-28},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {regular expressions, graphs, paths in graphs, matching},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540111001684},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Chatterjee/12,
AUTHOR = {Chatterjee, Krishnendu},
TITLE = {The complexity of stochastic M{\"u}ller games},
JOURNAL = {Inf.~Comput.},
VOLUME = {211},
PAGES = {29-48},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {game theory, stochastic games, m{\"u}ller objectives, $\omega$-regular objectives},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540111001714},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Midtgaard-Jensen/12,
AUTHOR = {Midtgaard, Jan and Jensen, Thomas P.},
TITLE = {Control-flow analysis of function calls and returns by abstract interpretation},
JOURNAL = {Inf.~Comput.},
VOLUME = {211},
PAGES = {49-76},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {control-flow analysis, abstract interpretation},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540111001829},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Bonchi-Bonsangue-Boreale-Rutten-Silva/12,
AUTHOR = {Bonchi, Filippo and Bonsangue, Marcello and Boreale, Michele and Rutten, Jan and Silva, Alexandra},
TITLE = {A coalgebraic perspective on linear weighted automata},
JOURNAL = {Inf.~Comput.},
VOLUME = {211},
PAGES = {77-105},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540111001830},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Brochenin-Demri-Lozes/12,
AUTHOR = {Brochenin, R{\'e}mi and Demri, St{\'e}phane and Lozes, Etienne},
TITLE = {On the almighty wand},
JOURNAL = {Inf.~Comput.},
VOLUME = {211},
PAGES = {106-137},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {separation logic, second-order logic, expressive power, complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S089054011200003X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Asarin-Mysore-Pnueli-Schneider/12,
AUTHOR = {Asarin, Eugene and Mysore, Venkatesh P. and Pnueli, Amir and Schneider, Gerardo},
TITLE = {Low dimensional hybrid systems - decidable, undecidable, don't know},
JOURNAL = {Inf.~Comput.},
VOLUME = {211},
PAGES = {138-159},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {hybrid systems, undecidability, piece-wise affine maps, (hierarchical) piece-wise constant derivative systems},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112000028},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Chalcraft-Dougherty-Freiling-Teutsch/12,
AUTHOR = {Chalcraft, Adam and Dougherty, Randall and Freiling, Chris and Teutsch, Jason},
TITLE = {How to build a probability-free casino},
JOURNAL = {Inf.~Comput.},
VOLUME = {211},
PAGES = {160-164},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {algorithmic randomness, finitely-valued martingales},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112000065},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Kupferman-Tamir/12,
AUTHOR = {Kupferman, Orna and Tamir, Tami},
TITLE = {Coping with selfish on-going behaviors},
JOURNAL = {Inf.~Comput.},
VOLUME = {210},
PAGES = {1-12},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {reactive systems, selfish agents, weighted automata},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540111001490},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Meer/12,
AUTHOR = {Meer, Klaus},
TITLE = {On Ladner's result for a class of real machines with restricted use of constants},
JOURNAL = {Inf.~Comput.},
VOLUME = {210},
PAGES = {13-20},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {complexity, real number model, diagonal problems, ladner's theorem},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540111001507},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Bienvenu-Day-Hoyrup-Mezhirov-Shen/12,
AUTHOR = {Bienvenu, Laurent and Day, Adam R. and Hoyrup, Mathieu and Mezhirov, Ilya and Shen, Alexander},
TITLE = {A constructive version of Birkhoff's ergodic theorem for Martin-L{\"o}f random points},
JOURNAL = {Inf.~Comput.},
VOLUME = {210},
PAGES = {21-30},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {algorithmic randomness, birkhoff's ergodic theorem, poincar{\'e} recurrence theorem, martin-l{\"o}f randomness},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540111001465},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Chechik-Emek-Patt-Shamir-Peleg/12,
AUTHOR = {Chechik, Shiri and Emek, Yuval and Patt-Shamir, Boaz and Peleg, David},
TITLE = {Sparse reliable graph backbones},
JOURNAL = {Inf.~Comput.},
VOLUME = {210},
PAGES = {31-39},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {network reliability, sparse subgraphs, tutte polynomial},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540111001477},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Rabinovich/12,
AUTHOR = {Rabinovich, Alexander},
TITLE = {Temporal logics over linear time domains are in PSPACE},
JOURNAL = {Inf.~Comput.},
VOLUME = {210},
PAGES = {40-67},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540111001672},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Aminof-Kupferman-Murano/12,
AUTHOR = {Aminof, Benjamin and Kupferman, Orna and Murano, Aniello},
TITLE = {Improved model checking of hierarchical systems},
JOURNAL = {Inf.~Comput.},
VOLUME = {210},
PAGES = {68-86},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {hierarchical systems, model checking, branching-time temporal logics, two-player games, parity games, abstraction-refinement},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540111001489},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Brazdil-Esparza-Kiefer-Luttenberger/12,
AUTHOR = {Br{\'a}zdil, Tom{\'a}{\v{s}} and Esparza, Javier and Kiefer, Stefan and Luttenberger, Michael},
TITLE = {Space-efficient scheduling of stochastically generated tasks},
JOURNAL = {Inf.~Comput.},
VOLUME = {210},
PAGES = {87-110},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {stochastic models, space-efficient scheduling, multithreaded programs, branching processes},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540111001453},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Dyer-Goldberg-Jalsenius-Richerby/12,
AUTHOR = {Dyer, Martin and Goldberg, Leslie Ann and Jalsenius, Markus and Richerby, David},
TITLE = {The complexity of approximating bounded-degree Boolean \#CSP},
JOURNAL = {Inf.~Comput.},
VOLUME = {220-221},
PAGES = {1-14},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {counting constraint satisfaction problem, csp, approximation algorithm, complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001290},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Bremer-Freydenberger/12,
AUTHOR = {Bremer, Joachim and Freydenberger, Dominik D.},
TITLE = {Inclusion problems for patterns with a bounded number of variables},
JOURNAL = {Inf.~Comput.},
VOLUME = {220-221},
PAGES = {15-43},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001423},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Droste-Meinecke/12,
AUTHOR = {Droste, Manfred and Meinecke, Ingmar},
TITLE = {Weighted automata and weighted MSO logics for average and long-time behaviors},
JOURNAL = {Inf.~Comput.},
VOLUME = {220-221},
PAGES = {44-59},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {weighted automata, weighted logic},
URL = {http://www.sciencedirect.com/science/article/pii/S089054011200140X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Case-Kotzing/12,
AUTHOR = {Case, John and K{\"o}tzing, Timo},
TITLE = {Learning secrets interactively. Dynamic modeling in inductive inference},
JOURNAL = {Inf.~Comput.},
VOLUME = {220-221},
PAGES = {60-73},
YEAR = {2012},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {inductive inference, interactive learning},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001411},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}