@article{Coja-Oghlan-Goerdt-Lanka-Schadlich/04,
AUTHOR = {Coja-Oghlan, Amin and Goerdt, Andreas and Lanka, Andr{\'e} and Sch{\"a}dlich, Frank},
TITLE = {Techniques from combinatorial approximation algorithms yield efficient algorithms for random $2k$-SAT},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {329},
NUMBER = {1-3},
PAGES = {1-45},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {probabilistic analysis, random $k$-SAT, random MAX 2-SAT, hypergraph discrepancy},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.07.017},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Drmota/04,
AUTHOR = {Drmota, Michael},
TITLE = {On Robson's convergence and boundedness conjectures concerning the height of binary search trees},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {329},
NUMBER = {1-3},
PAGES = {47-70},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {binary search tree, height distribution, average case analysis, generating functions},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.08.003},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Chockler-Kupferman/04,
AUTHOR = {Chockler, Hana and Kupferman, Orna},
TITLE = {$\omega$-regular languages are testable with a constant number of queries},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {329},
NUMBER = {1-3},
PAGES = {71-92},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {property testing, $\omega$-regular languages, algorithms, complexity},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.08.004},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Jonsson-Krokhin/04,
AUTHOR = {Jonsson, Peter and Krokhin, Andrei},
TITLE = {Recognizing frozen variables in constraint satisfaction problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {329},
NUMBER = {1-3},
PAGES = {93-113},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {constraint satisfaction, frozen variable, computational complexity, polymorphism},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.08.006},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Hornung-Vagvolgyi/04,
AUTHOR = {Hornung, Tam{\'a}s and V{\'a}gv{\"o}lgyi, S{\'a}ndor},
TITLE = {Storage-to-tree transducers with look-head},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {329},
NUMBER = {1-3},
PAGES = {115-158},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {tree grammar, storage type, transducer, look-ahead},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.08.007},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Blanchet-Sadri/04,
AUTHOR = {Blanchet-Sadri, F.},
TITLE = {Codes, orderings, and partial words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {329},
NUMBER = {1-3},
PAGES = {177-202},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {word, partial word, partial ordering, code, antichain, domino},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.08.011},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Bostan-Schost/04,
AUTHOR = {Bostan, Alin and Schost, {\'E}ric},
TITLE = {On the complexities of multipoint evaluation and interpolation},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {329},
NUMBER = {1-3},
PAGES = {223-235},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {polynomial evaluation, interpolation, complexity},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.09.002},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Kontorovich/04,
AUTHOR = {Kontorovich, Leonid},
TITLE = {Uniquely decodable $n$-gram embeddings},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {329},
NUMBER = {1-3},
PAGES = {271-284},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {$n$-gram, embedding, finite state automaton, finite transducer, string},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.10.010},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Brueggemann-Kern/04,
AUTHOR = {Brueggemann, Tobias and Kern, Walter},
TITLE = {An improved deterministic local search algorithm for 3-Sat},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {329},
NUMBER = {1-3},
PAGES = {303-313},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {exact algorithm, local search; 3-SAT},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.08.002},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Dalmau-Jonsson/04,
AUTHOR = {Dalmau, V{\'{\i}}ctor and Jonsson, Peter},
TITLE = {The complexity of counting homomorphisms seen from the other side},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {329},
NUMBER = {1-3},
PAGES = {315-323},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computational complexity, counting, homomorphism, relational structure},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.08.008},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Allauzen-Mohri/04,
AUTHOR = {Allauzen, Cyril and Mohri, Mehryar},
TITLE = {An optimal pre-determinization algorithm for weighted transducers},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {328},
NUMBER = {1-2},
PAGES = {3-18},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {finite automata, finite-state transducers, weighted finite-state transducers, determinization, twins property},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.07.003},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Fu-Bultan-Su/04,
AUTHOR = {Fu, Xiang and Bultan, Tevfik and Su, Jianwen},
TITLE = {Conversation protocols: A formalism for specification and verification of reactive electronic services},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {328},
NUMBER = {1-2},
PAGES = {19-37},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {e-service, asynchronous communication, communicating finite state automata, conversation protocol, realizability, composition, verification},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.07.004},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Guingne-Nicart-Kempe/04,
AUTHOR = {Guingne, Franck and Nicart, Florent and Kempe, Andr{\'e}},
TITLE = {Acyclic networks maximizing the printing complexity},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {328},
NUMBER = {1-2},
PAGES = {39-51},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {complexity, automata, transducers, worst-case},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.07.006},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Kuske-Meinecke/04,
AUTHOR = {Kuske, Dietrich and Meinecke, Ingmar},
TITLE = {Branching automata with costs --- A way of reflecting parallelism in costs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {328},
NUMBER = {1-2},
PAGES = {53-75},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {concurrency, weighted automata, sp-posets, formal power series, bisemiring},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.07.005},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Lombardy-Regis-Gianas-Sakarovitch/04,
AUTHOR = {Lombardy, Sylvain and R{\'e}gis-Gianas, Yann and Sakarovitch, Jacques},
TITLE = {Introducing {\sc Vaucanson}},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {328},
NUMBER = {1-2},
PAGES = {77-96},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {automata implementation, automata with multiplicity, generic programming},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.07.007},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Alvarez-Manilla-Jung-Keimel/04,
AUTHOR = {Alvarez-Manilla, Mauricio and Jung, Achim and Keimel, Klaus},
TITLE = {The probabilistic powerdomain for stably compact spaces},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {328},
NUMBER = {3},
PAGES = {221-244},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {probabilistic powerdomain, stably compact space, valuation},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.06.021},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Huang-Cheung-Mak/04,
AUTHOR = {Huang, Hejiao and Cheung, To-yat and Mak, Wai Ming},
TITLE = {Structure and behavior preservation by Petri-net-based refinements in system design},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {328},
NUMBER = {3},
PAGES = {245-269},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {design, petri net, preservation, property, refinement, specification, verification},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.07.016},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Baillot/04a,
AUTHOR = {Baillot, Patrick},
TITLE = {Type inference for light affine logic via constraints on words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {328},
NUMBER = {3},
PAGES = {289-323},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {implicit computational complexity, linear logic, light affine logic, lambda-calculus, type inference, polynomial time complexity, constraints},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.08.014},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Hahnle-Murray-Rosenthal/04,
AUTHOR = {H{\"a}hnle, Reiner and Murray, Neil V. and Rosenthal, Erik},
TITLE = {Linearity and regularity with negation normal form},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {328},
NUMBER = {3},
PAGES = {325-354},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {automated theorem proving, negation normal form, resolution, linear resolution, non-clausal resolution, tableaux, regular tableaux, excess literal technique},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.09.001},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Foy/04,
AUTHOR = {Foy, John},
TITLE = {A dynamical system which must be stable whose stability cannot be proved},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {328},
NUMBER = {3},
PAGES = {355-361},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {dynamical systems, piecewise affine systems, hybrid systems, stability, correctness},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.05.001},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Bartels-Sokolova-de_Vink/04,
AUTHOR = {Bartels, Falk and Sokolova, Ana and de Vink, Erik},
TITLE = {A hierarchy of probabilistic system types},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {327},
NUMBER = {1-2},
PAGES = {3-22},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {probabilistic transition systems, probabilistic bisimulation, coalgebra, bisimulation, cocongruence, preservation and reflection of bisimulation},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.07.019},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Chen-Pucella/04,
AUTHOR = {Chen, Hubie and Pucella, Riccardo},
TITLE = {A coalgebraic approach to Kleene algebra with tests},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {327},
NUMBER = {1-2},
PAGES = {23-44},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {kleene algebra with tests, coinduction, automata, bisimulation},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.07.020},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Crstea/04,
AUTHOR = {C{\^{\i}}rstea, Corina},
TITLE = {A compositional approach to defining logics for coalgebras},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {327},
NUMBER = {1-2},
PAGES = {45-69},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.07.021},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Hughes-Jacobs/04,
AUTHOR = {Hughes, Jesse and Jacobs, Bart},
TITLE = {Simulations in coalgebra},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {327},
NUMBER = {1-2},
PAGES = {71-108},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {coalgebra, simulation, relation lifting},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.07.022},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Kupke-Kurz-Venema/04,
AUTHOR = {Kupke, Clemens and Kurz, Alexander and Venema, Yde},
TITLE = {Stone coalgebras},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {327},
NUMBER = {1-2},
PAGES = {109-134},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {coalgebra, stone spaces, vietoris topology, modal logic, descriptive general frames, kripke polynomial functors},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.07.023},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Lenisa-Power-Watanabe/04,
AUTHOR = {Lenisa, Marina and Power, John and Watanabe, Hiroshi},
TITLE = {Category theory for operational semantics},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {327},
NUMBER = {1-2},
PAGES = {135-154},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {abstract operational semantics, gsos-rule, distributive law, initial/final semantics},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.07.024},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Ananichev-Volkov/04,
AUTHOR = {Ananichev, D.S. and Volkov, M.V.},
TITLE = {Synchronizing monotonic automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {327},
NUMBER = {3},
PAGES = {225-239},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {synchronizing automata, order preserving transformation, monotonic automata, rank of a word, interval rank of a word},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.068},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Champarnaud-Coulon/04,
AUTHOR = {Champarnaud, J.-M. and Coulon, F.},
TITLE = {NFA reduction algorithms by means of regular inequalities},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {327},
NUMBER = {3},
PAGES = {241-253},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {automata, nfa, simulation, reduction, preorder, nondeterministic},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.02.048},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
NOTE = {see Erratum in: Theoretical Computer Science, Vol. 347, 2005, No. 1-2, 437-440},
}
@article{DAlessandro-Varricchio/04,
AUTHOR = {D'Alessandro, Flavio and Varricchio, Stefano},
TITLE = {Well quasi-orders and context-free grammars},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {327},
NUMBER = {3},
PAGES = {255-268},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {well quasi-orders, context-free grammars, unavoidable sets of words},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.069},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Hofbauer-Waldmann/04,
AUTHOR = {Hofbauer, Dieter and Waldmann, Johannes},
TITLE = {Deleting string rewriting systems preserve regularity},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {327},
NUMBER = {3},
PAGES = {301-317},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {string rewriting systems, regular languages, context-free languages, preserving regularity},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.04.009},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Holzer-Konig/04a,
AUTHOR = {Holzer, Markus and K{\"o}nig, Barbara},
TITLE = {On deterministic finite automata and syntactic monoid size},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {327},
NUMBER = {3},
PAGES = {319-347},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {automata theory, deterministic finite automata, syntactic monoids},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.04.010},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Klimann-Lombardy-Mairesse-Prieur/04,
AUTHOR = {Klimann, Ines and Lombardy, Sylvain and Mairesse, Jean and Prieur, Christophe},
TITLE = {Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {327},
NUMBER = {3},
PAGES = {349-373},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {max-plus semiring, automaton with multiplicities, finite ambiguity, unambiguity, sequentiality},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.02.049},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Malcher/04,
AUTHOR = {Malcher, Andreas},
TITLE = {Minimizing finite automata is computationally hard},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {327},
NUMBER = {3},
PAGES = {375-390},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.070},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Hemaspaandra-Thakur/04,
AUTHOR = {Hemaspaandra, Lane A. and Thakur, Mayur},
TITLE = {Lower bounds and the hardness of counting properties},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {326},
NUMBER = {1-3},
PAGES = {1-28},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {counting properties, lower bounds, rice's theorem, circuits, $UP$, $NP$, relativization, language properties},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.004},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Chauve-Fertin/04,
AUTHOR = {Chauve, Cedric and Fertin, Guillaume},
TITLE = {On maximal instances for the original syntenic distance},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {326},
NUMBER = {1-3},
PAGES = {29-43},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computational biology, syntenic distance, gossiping},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.05.006},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Eisenbrand-Grandoni/04,
AUTHOR = {Eisenbrand, Friedrich and Grandoni, Fabrizio},
TITLE = {On the complexity of fixed parameter clique and dominating set},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {326},
NUMBER = {1-3},
PAGES = {57-67},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {parameterized algorithms, clique, dominating set, diamonds detection},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.05.009},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Fill-Kapur/04,
AUTHOR = {Fill, James Allen and Kapur, Nevin},
TITLE = {Limiting distributions for additive functionals on Catalan trees},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {326},
NUMBER = {1-3},
PAGES = {69-102},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {catalan trees, additive functionals, limiting distributions, divide and conquer, shape functional, hadamard product of functions, singularity analysis, airy distribution, generalized polylogarithm, method of moments, central limit theorem  primary},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.05.010},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Ganjali-Hajiaghayi/04,
AUTHOR = {Ganjali, Yashar and Hajiaghayi, MohammadTaghi},
TITLE = {Characterization of networks supporting multi-dimensional linear interval routing schemes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {326},
NUMBER = {1-3},
PAGES = {103-116},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {mechanism design, connected facility location, cost sharing mechanisms, approximation algorithms},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.06.013},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Bockenhauer-Bongartz-Hromkovic-Klasing-Proietti-Seibert-Unger/04,
AUTHOR = {B{\"o}ckenhauer, Hans-Joachim and Bongartz, Dirk and Hromkovi{\v{c}}, Juraj and Klasing, Ralf and Proietti, Guido and Seibert, Sebastian and Unger, Walter},
TITLE = {On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {326},
NUMBER = {1-3},
PAGES = {137-153},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {approximation algorithm, inapproximability, minimum-cost biconnected spanning subgraph, graph augmentation},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.06.019},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Gonzalez-Serena/04a,
AUTHOR = {Gonzalez, Teofilo F. and Serena, David},
TITLE = {Complexity of pairwise shortest path routing in the grid},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {326},
NUMBER = {1-3},
PAGES = {155-185},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {grid networks, fault-tolerance, node disjoint shortest paths, edge disjoint shortest paths, $NP$-completeness},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.06.027},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Janson-Lonardi-Szpankowski/04a,
AUTHOR = {Janson, Svante and Lonardi, Stefano and Szpankowski, Wojciech},
TITLE = {On average sequence complexity},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {326},
NUMBER = {1-3},
PAGES = {213-227},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {complexity index, sequence/subword complexity, suffix tree},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.06.023},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Duval-Kolpakov-Kucherov-Lecroq-Lefebvre/04,
AUTHOR = {Duval, Jean-Pierre and Kolpakov, Roman and Kucherov, Gregory and Lecroq, Thierry and Lefebvre, Arnaud},
TITLE = {Linear-time computation of local periods},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {326},
NUMBER = {1-3},
PAGES = {229-240},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {word, period, local period, algorithm, complexity, string matching},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.06.024},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Edson-Zamboni/04,
AUTHOR = {Edson, Marcia and Zamboni, Luca Q.},
TITLE = {On representations of positive integers in the Fibonacci base},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {326},
NUMBER = {1-3},
PAGES = {241-260},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {numeration systems, fibonacci numbers, generalized euclidean algorithm},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.06.025},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Fiala-Fishkin-Fomin/04,
AUTHOR = {Fiala, Ji{\v{r}}{\'{\i}} and Fishkin, Aleksei V. and Fomin, Fedor},
TITLE = {On distance constrained labeling of disk graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {326},
NUMBER = {1-3},
PAGES = {261-292},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {disk graph, labeling, online, approximation},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.06.026},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Jelenkovic-Radovanovic/04,
AUTHOR = {Jelenkovi{\'c}, Predrag R. and Radovanovi{\'c}, Ana},
TITLE = {Least-recently-used caching with dependent requests},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {326},
NUMBER = {1-3},
PAGES = {293-327},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {least-recently-used caching, move-to-front, zipf's law, heavy-tailed distributions, long-range dependence, semi-markov processes, average-case analysis},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.07.029},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Kiwi-Russell/04,
AUTHOR = {Kiwi, Marcos and Russell, Alexander},
TITLE = {The Chilean highway problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {326},
NUMBER = {1-3},
PAGES = {329-342},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {algorithms, packet routing, stability, scheduling protocols, server latency},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.07.030},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Dessmark-Pelc/04,
AUTHOR = {Dessmark, Anders and Pelc, Andrzej},
TITLE = {Optimal graph exploration without good maps},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {326},
NUMBER = {1-3},
PAGES = {343-362},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {algorithm, exploration, graph, map, robot, traversal},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.07.031},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Bernholt-Fischer/04,
AUTHOR = {Bernholt, Thorsten and Fischer, Paul},
TITLE = {The complexity of computing the MCD-estimator},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {326},
NUMBER = {1-3},
PAGES = {383-398},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computational statistics, efficient algorithms, $NP$-completeness, combinatorial geometry},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.08.005},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Li-Huang-Sun-Huang/04,
AUTHOR = {Li, Minming and Huang, Shawn L. and Sun, Xiaoming and Huang, Xiao},
TITLE = {Performance evaluation for energy efficient topologic control in ad hoc wireless networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {326},
NUMBER = {1-3},
PAGES = {399-408},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {min power symmetric connectivity, ad hoc wireless network, approximation algorithms},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.06.017},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Gibbons-Sant/04,
AUTHOR = {Gibbons, Alan and Sant, Paul},
TITLE = {Rotation sequences and edge-colouring of binary tree pairs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {326},
NUMBER = {1-3},
PAGES = {409-418},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph coloring, four-colour problem, binary-tree, rotation},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.06.018},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Cheng/04a,
AUTHOR = {Cheng, Qi},
TITLE = {On the ultimate complexity of factorials},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {326},
NUMBER = {1-3},
PAGES = {419-429},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computational and structural complexity},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.06.020},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Leonardi-Schafer/04,
AUTHOR = {Leonardi, Stefano and Sch{\"a}fer, Guido},
TITLE = {Cross-monotonic cost sharing methods for connected facility location games},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {326},
NUMBER = {1-3},
PAGES = {431-442},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {mechanism design, connected facility location, cost sharing mechanisms, approximation algorithms},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.07.033},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Eveillard-Ropers-de_Jong-Branlant-Bockmayr/04,
AUTHOR = {Eveillard, Damien and Ropers, Delphine and de Jong, Hidde and Branlant, Christiane and Bockmayr, Alexander},
TITLE = {A multi-scale constraint programming model of alternative splicing regulation},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {325},
NUMBER = {1},
PAGES = {3-24},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computational biology, constraint programming, modeling, hybrid system, alternative splicing},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.062},
PUBLISHER = {Elsevier B.V.},
}
@article{Chabrier-Rivier-Chiaverini-Danos-Fages-Schachter/04,
AUTHOR = {Chabrier-Rivier, Nathalie and Chiaverini, Marc and Danos, Vincent and Fages, Fran{\c{c}}ois and Sch{\"a}chter, Vincent},
TITLE = {Modeling and querying biomolecular interaction networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {325},
NUMBER = {1},
PAGES = {25-44},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.063},
PUBLISHER = {Elsevier B.V.},
}
@article{Antoniotti-Piazza-Policriti-Simeoni-Mishra/04,
AUTHOR = {Antoniotti, M. and Piazza, C. and Policriti, A. and Simeoni, M. and Mishra, B.},
TITLE = {Taming the complexity of biochemical models through bisimulation and collapsing: Theory and practice},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {325},
NUMBER = {1},
PAGES = {45-67},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {biochemical models, hybrid automata, bisimulation, collapsing},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.064},
PUBLISHER = {Elsevier B.V.},
}
@article{Danos-Laneve/04,
AUTHOR = {Danos, Vincent and Laneve, Cosimo},
TITLE = {Formal molecular biology},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {325},
NUMBER = {1},
PAGES = {69-110},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.065},
PUBLISHER = {Elsevier B.V.},
}
@article{Curti-Degano-Priami-Baldari/04,
AUTHOR = {Curti, M. and Degano, P. and Priami, C. and Baldari, C.T.},
TITLE = {Modelling biochemical pathways through enhanced $\pi$-calculus},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {325},
NUMBER = {1},
PAGES = {111-140},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {concurrency, causality, reduction semantics, systems biology},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.066},
PUBLISHER = {Elsevier B.V.},
}
@article{Barbe-von_Haeseler/04,
AUTHOR = {Barb{\'e}, A. and von Haeseler, F.},
TITLE = {The Pascal matroid as a home for generating sets of cellular automata configurations defined by quasigroups},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {325},
NUMBER = {2},
PAGES = {171-214},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {cellular automata, quasigroups, matroids, pascal's triangle, combinatorial geometry, local matching rules},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.06.006},
PUBLISHER = {Elsevier B.V.},
}
@article{Boykett/04,
AUTHOR = {Boykett, Tim},
TITLE = {Efficient exhaustive listings of reversible one dimensional cellular automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {325},
NUMBER = {2},
PAGES = {215-247},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.06.007},
PUBLISHER = {Elsevier B.V.},
}
@article{Cattaneo-Dennunzio-Margara/04,
AUTHOR = {Cattaneo, Gianpiero and Dennunzio, Alberto and Margara, Luciano},
TITLE = {Solution of some conjectures about topological properties of linear cellular automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {325},
NUMBER = {2},
PAGES = {249-271},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {cellular automata, discrete time dynamical systems, chaos theory},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.06.008},
PUBLISHER = {Elsevier B.V.},
}
@article{Czeizler/04,
AUTHOR = {Czeizler, Eugen},
TITLE = {On the size of the inverse neighborhoods for one-dimensional reversible cellular automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {325},
NUMBER = {2},
PAGES = {273-284},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {magnetic resonance imaging, segmentation, fuzzy connectedness, lung perfusion and ventilation},
URL = {http://dx.doi.org/10.1016/j.compmedimag.2003.06.001},
PUBLISHER = {Elsevier B.V.},
}
@article{Chen-Gao-Lin-Niewiadomski-Wang-Wu/04,
AUTHOR = {Chen, Zhi-Zhong and Gao, Yong and Lin, Guohui and Niewiadomski, Robert and Wang, Yang and Wu, Junfeng},
TITLE = {A space-efficient algorithm for sequence alignment with inversions and reversals},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {325},
NUMBER = {3},
PAGES = {361-372},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {sequence alignment, inversion, reversal, dynamic programming},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.02.040},
PUBLISHER = {Elsevier B.V.},
}
@article{Kutz/04,
AUTHOR = {Kutz, Martin},
TITLE = {The complexity of Boolean matrix root computation},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {325},
NUMBER = {3},
PAGES = {373-390},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {boolean matrix, root, directed graph, graph power, binary relation, computational complexity, graph isomorphism, subdivision},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.02.041},
PUBLISHER = {Elsevier B.V.},
}
@article{Chin-Deng-Fang-Zhu/04,
AUTHOR = {Chin, Francis Y.L. and Deng, Xiaotie and Fang, Qizhi and Zhu, Shanfeng},
TITLE = {Approximate and dynamic rank aggregation},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {325},
NUMBER = {3},
PAGES = {409-424},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {rank aggregation, Kendall-$\tau$ distance, coherence; weighted ECC},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.02.043},
PUBLISHER = {Elsevier B.V.},
}
@article{Asano-Katoh-Tamaki-Tokuyama/04a,
AUTHOR = {Asano, Tetsuo and Katoh, Naoki and Tamaki, Hisao and Tokuyama, Takeshi},
TITLE = {The structure and number of global roundings of a graph},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {325},
NUMBER = {3},
PAGES = {425-437},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {combinatorics, rounding, discrepancy, graph, hypergraph},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.02.044},
PUBLISHER = {Elsevier B.V.},
}
@article{Hallorsson-Iwama-Miyazaki-Yanagisawa/04,
AUTHOR = {Hall{\'o}rsson, Magn{\'u}s M. and Iwama, Kazuo and Miyazaki, Shuichi and Yanagisawa, Hiroki},
TITLE = {Randomized approximation of the stable marriage problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {325},
NUMBER = {3},
PAGES = {439-465},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {stable marriage problem, ties, incomplete lists, approximation algorithms},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.02.045},
PUBLISHER = {Elsevier B.V.},
}
@article{Chin-Fung/04,
AUTHOR = {Chin, Francis Y.L. and Fung, Stanley P.Y.},
TITLE = {Improved competitive algorithms for online scheduling with partial job values},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {325},
NUMBER = {3},
PAGES = {467-478},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {online algorithms, scheduling, partial job values, resource augmentation},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.02.046},
PUBLISHER = {Elsevier B.V.},
}
@article{Kim-Chwa/04,
AUTHOR = {Kim, Jae-Hoon and Chwa, Kyung-Yong},
TITLE = {Scheduling broadcasts with deadlines},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {325},
NUMBER = {3},
PAGES = {479-488},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {broadcast scheduling, on-line algorithms},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.02.047},
PUBLISHER = {Elsevier B.V.},
}
@article{Esik-Kuich/04a,
AUTHOR = {{\'E}sik, Zolt{\'a}n and Kuich, Werner},
TITLE = {Inductive $^*$-semirings},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {324},
NUMBER = {1},
PAGES = {3-33},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {semiring, least fixed point, equational logic, power series},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.050},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Harju-Karhumaki/04,
AUTHOR = {Harju, Tero and Karhum{\"a}ki, Juhani},
TITLE = {Many aspects of defect theorems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {324},
NUMBER = {1},
PAGES = {35-54},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {free monoid, defect theorem, word equations, independent equations, codes, tilings},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.051},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Blum-Kumar-Rudra-Wu/04,
AUTHOR = {Blum, Avrim and Kumar, Vijay and Rudra, Atri and Wu, Felix},
TITLE = {Online learning in online auctions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {324},
NUMBER = {2-3},
PAGES = {137-146},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {online algorithms, learning theory, auctions},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.05.012},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Augustine-Seiden/04,
AUTHOR = {Augustine, John E. and Seiden, Steven},
TITLE = {Linear time approximation schemes for vehicle scheduling problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {324},
NUMBER = {2-3},
PAGES = {147-160},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {vehicle scheduling, polynomial time approximation scheme, dynamic programming, approximation algorithm},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.05.013},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Kesselman-Mansour/04,
AUTHOR = {Kesselman, Alexander and Mansour, Yishay},
TITLE = {Harmonic buffer management policy for shared memory switches},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {324},
NUMBER = {2-3},
PAGES = {161-182},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {competitive analysis, shared memory switches, non-preemptive policies, buffer management},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.05.014},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Feder-Motwani-Panigrahy-Seiden-van_Stee-Zhu/04,
AUTHOR = {Feder, Tom{\'a}s and Motwani, Rajeev and Panigrahy, Rina and Seiden, Steve and van Stee, Rob and Zhu, An},
TITLE = {Combining request scheduling with web caching},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {324},
NUMBER = {2-3},
PAGES = {201-218},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {paging, web caching, request reordering},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.05.016},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Fleischer-Glazek-Seiden/04,
AUTHOR = {Fleischer, Rudolf and G{\l}azek, W{\l}odzimierz and Seiden, Steve},
TITLE = {New results for online page replication},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {324},
NUMBER = {2-3},
PAGES = {219-251},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {competitive analysis, caching, continuous page replication, ring networks},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.05.017},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Lempel-Moran/04,
AUTHOR = {Lempel, Ronny and Moran, Shlomo},
TITLE = {Competitive caching of query results in search engines},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {324},
NUMBER = {2-3},
PAGES = {253-271},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.05.018},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Bose-Morin/04b,
AUTHOR = {Bose, Prosenjit and Morin, Pat},
TITLE = {Competitive online routing in geometric graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {324},
NUMBER = {2-3},
PAGES = {273-288},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {online routing, competitive routing, geometric graph, minimum weight triangulation, delaunay triangulation, greedy triangulation, spanner, spanning ratio, planar graph, good polygon},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.05.019},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Chrobak-Sgall/04a,
AUTHOR = {Chrobak, Marek and Sgall, Ji{\v{r}}{\'{\i}}},
TITLE = {The weighted 2-server problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {324},
NUMBER = {2-3},
PAGES = {289-312},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {online algorithms, $k$-server problem},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.05.020},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Awerbuch-Azar-Bartal/04,
AUTHOR = {Awerbuch, Baruch and Azar, Yossi and Bartal, Yair},
TITLE = {On-line generalized Steiner problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {324},
NUMBER = {2-3},
PAGES = {313-324},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {online, competitive, steiner tree, steiner forest},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.05.021},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Becchetti-Leonardi-Marchetti-Spaccamela-Pruhs/04,
AUTHOR = {Becchetti, Luca and Leonardi, Stefano and Marchetti-Spaccamela, Alberto and Pruhs, Kirk},
TITLE = {Semi-clairvoyant scheduling},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {324},
NUMBER = {2-3},
PAGES = {325-335},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {scheduling, average flow time, semi-clairvoyance, simultaneous competitiveness},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.05.023},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Bartal-Koutsoupias/04,
AUTHOR = {Bartal, Yair and Koutsoupias, Elias},
TITLE = {On the competitive ratio of the work function algorithm for the $k$-server problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {324},
NUMBER = {2-3},
PAGES = {337-345},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {online algorithms, the $k$-server problem, work function},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.06.001},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Koutsoupias-Taylor/04,
AUTHOR = {Koutsoupias, Elias and Taylor, David Scot},
TITLE = {The CNN problem and other $k$-server variants},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {324},
NUMBER = {2-3},
PAGES = {347-359},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {online algorithms, cnn problem, k-server problem},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.06.002},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Chen-Ding/04,
AUTHOR = {Chen, Peter and Ding, Guoli},
TITLE = {The best expert versus the smartest algorithm},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {324},
NUMBER = {2-3},
PAGES = {361-380},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {online algorithm, online prediction, expert advice},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.06.003},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Jeffrey-Rathke/04,
AUTHOR = {Jeffrey, Alan and Rathke, Julian},
TITLE = {A theory of bisimulation for a fragment of concurrent ML with local names},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {323},
NUMBER = {1-3},
PAGES = {1-48},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {concurrency, higher-order functions, bisimulation, local names},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.005},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Cerrito-Kesner/04,
AUTHOR = {Cerrito, Serenella and Kesner, Delia},
TITLE = {Pattern matching as cut elimination},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {323},
NUMBER = {1-3},
PAGES = {71-127},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.032},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Baldan-Busi-Corradini-Pinna/04,
AUTHOR = {Baldan, P. and Busi, N. and Corradini, A. and Pinna, G.M.},
TITLE = {Domain and event structure semantics for Petri nets with read and inhibitor arcs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {323},
NUMBER = {1-3},
PAGES = {129-189},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {petri nets, read and inhibitor arcs, true concurrency, unfolding, categorical semantics, event structures, domains},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.04.001},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Hierons-Harman/04,
AUTHOR = {Hierons, R.M. and Harman, M.},
TITLE = {Testing conformance of a deterministic implementation against a non-deterministic stream X-machine},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {323},
NUMBER = {1-3},
PAGES = {191-233},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {stream X-machines, testing, non-determinism, conformance, deterministic implementation},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.04.002},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Dehlinger-Dufourd/04,
AUTHOR = {Dehlinger, Christophe and Dufourd, Jean-Fran{\c{c}}ois},
TITLE = {Formalizing generalized maps in Coq},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {323},
NUMBER = {1-3},
PAGES = {351-397},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Coq, calculus of inductive constructions, geometry modelling, generalized maps, surfaces, specification, proof},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.05.003},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Dehlinger-Dufourd/04a,
AUTHOR = {Dehlinger, Christophe and Dufourd, Jean-Fran{\c{c}}ois},
TITLE = {Formalizing the trading theorem in Coq},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {323},
NUMBER = {1-3},
PAGES = {399-442},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Coq,calculus of inductive constructions, geometry modelling, generalized maps, surfaces, specification, proof},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.05.002},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Adamowicz-Kolodziejczyk/04,
AUTHOR = {Adamowicz, Zofia and Ko{\l}odziejczyk, Leszek Aleksander},
TITLE = {Well-behaved principles alternative to bounded induction},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {322},
NUMBER = {1},
PAGES = {5-16},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {bounded arithmetic, bounded induction, evaluations, skolem},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.022},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Beltiukov/04,
AUTHOR = {Beltiukov, Anatoly Petrivich},
TITLE = {A strong induction scheme that leads to polynomially computable realizations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {322},
NUMBER = {1},
PAGES = {17-39},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computational complexity, polynomial time computability, intuitionistic theories, induction scheme},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.023},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Chateau/04,
AUTHOR = {Chateau, A.},
TITLE = {On the complexity of decision using destinies in $H$-bounded structures},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {322},
NUMBER = {1},
PAGES = {41-67},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.024},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Finkel/04a,
AUTHOR = {Finkel, Olivier},
TITLE = {Closure properties of locally finite $\omega$-languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {322},
NUMBER = {1},
PAGES = {69-84},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {formal languages, logical definability, infinite words, locally finite languages, closure properties},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.025},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Becher-Grigorieff/04,
AUTHOR = {Becher, Ver{\'o}nica and Grigorieff, Serge},
TITLE = {Recursion and topology on $2^{\le \omega}$ for possibly infinite computations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {322},
NUMBER = {1},
PAGES = {85-136},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.026},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Hachachi/04,
AUTHOR = {Hacha{\"{\i}}chi, Yassine},
TITLE = {Arithmetical definability and computational complexity},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {322},
NUMBER = {1},
PAGES = {137-146},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {descriptive complexity, bounded arithmetic, logic and complexity},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.027},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Formisano-Omodeo-Policriti/04,
AUTHOR = {Formisano, Andrea and Omodeo, Eugenio G. and Policriti, Alberto},
TITLE = {Three-variable statements of set-pairing},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {322},
NUMBER = {1},
PAGES = {147-173},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {set theory, calculus of binary relations, pairing, automated reasoning, aggregates},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.028},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Aracena-Demongeot-Goles/04,
AUTHOR = {Aracena, Julio and Demongeot, Jacques and Goles, Eric},
TITLE = {On limit cycles of monotone functions with symmetric connection graph},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {322},
NUMBER = {2},
PAGES = {237-244},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {monotone function, discrete network, graph},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.010},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Baou-Balinski/04,
AUTHOR = {Ba{\"{\i}}ou, Mourad and Balinski, Michel},
TITLE = {Student admissions and faculty recruitment},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {322},
NUMBER = {2},
PAGES = {245-265},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {stable assignment, college admissions, stable marriage, stable matching, two-sided market, many-to-one matching, mechanism design},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.011},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Gajardo-Goles/04,
AUTHOR = {Gajardo, A. and Goles, E.},
TITLE = {Dynamics of a class of ants on a one-dimensional lattice},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {322},
NUMBER = {2},
PAGES = {267-283},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {langton's ant, lattice gas, discrete dynamical systems, small turing machines},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.012},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Goles/04,
AUTHOR = {Goles, Eric},
TITLE = {Folding and tiling},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {322},
NUMBER = {2},
PAGES = {285-296},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.013},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Delorme-Mazoyer/04,
AUTHOR = {Delorme, M. and Mazoyer, J.},
TITLE = {Real-time recognition of languages on an two-dimensional Archimedean thread},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {322},
NUMBER = {2},
PAGES = {335-354},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {cellular automata, language recognition, complexity, real time},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.016},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Durr-Rapaport-Theyssier/04,
AUTHOR = {D{\"u}rr, Christoph and Rapaport, Ivan and Theyssier, Guillaume},
TITLE = {Cellular automata and communication complexity},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {322},
NUMBER = {2},
PAGES = {355-368},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {cellular automata, communication complexity},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.017},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Goles-Latapy-Magnien-Morvan-Phan/04,
AUTHOR = {Goles, {\'E}ric and Latapy, Matthieu and Magnien, Cl{\'e}mence and Morvan, Michel and Phan, Ha Duong},
TITLE = {Sandpile models and lattices: A comprehensive survey},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {322},
NUMBER = {2},
PAGES = {383-407},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {sandpile models, chip firing games, lattices, integer partitions, discrete dynamical models},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.019},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Abadi-Fournet/04,
AUTHOR = {Abadi, Mart{\'{\i}}n and Fournet, C{\'e}dric},
TITLE = {Private authentication},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {322},
NUMBER = {3},
PAGES = {427-476},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://dx.doi.org/10.1016/j.tcs.2003.12.023},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Busi-Zavattaro/04,
AUTHOR = {Busi, Nadia and Zavattaro, Gianluigi},
TITLE = {On the expressive power of movement and restriction in pure mobile ambients},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {322},
NUMBER = {3},
PAGES = {477-515},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://dx.doi.org/10.1016/j.tcs.2003.10.040},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Caires-Cardelli/04,
AUTHOR = {Caires, Lu{\'{\i}}s and Cardelli, Luca},
TITLE = {A spatial logic for concurrency --- II},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {322},
NUMBER = {3},
PAGES = {517-565},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {spatial logics, distributed systems, proof systems, specification, verification},
URL = {http://dx.doi.org/10.1016/j.tcs.2003.10.041},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Chothia-Duggan/04,
AUTHOR = {Chothia, Tom and Duggan, Dominic},
TITLE = {Abstractions for fault-tolerant global computing},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {322},
NUMBER = {3},
PAGES = {567-613},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {fault-tolerance, transactions, process-calculli, global computing},
URL = {http://dx.doi.org/10.1016/j.tcs.2003.09.014},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Hennessy-Merro-Rathke/04,
AUTHOR = {Hennessy, Matthew and Merro, Massimo and Rathke, Julian},
TITLE = {Towards a behavioural theory of access and mobility control in distributed systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {322},
NUMBER = {3},
PAGES = {615-669},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {distributed picalculus, access control, capability types, mobility control, contextual equivalence, bisimulations},
URL = {http://dx.doi.org/10.1016/j.tcs.2003.12.024},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Bender-Farach-Colton/04,
AUTHOR = {Bender, Michael A. and Farach-Colton, M. Mart{\'i}n},
TITLE = {The level ancestor problem simplified},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {321},
NUMBER = {1},
PAGES = {5-12},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {data structures, rooted trees, level ancestor problem},
URL = {http://dx.doi.org/10.1016/j.tcs.2003.05.002},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Bornstein-Vempala/04,
AUTHOR = {Bornstein, Claudson F. and Vempala, Santosh},
TITLE = {Flow metrics},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {321},
NUMBER = {1},
PAGES = {13-24},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://dx.doi.org/10.1016/j.tcs.2003.05.003},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Bronnimann-Iacono-Katajainen-Morin-Morrison-Toussaint/04,
AUTHOR = {Br{\"o}nnimann, Herv{\'e} and Iacono, John and Katajainen, Jyrki and Morin, Pat and Morrison, Jason and Toussaint, Godfried},
TITLE = {Space-efficient planar convex hull algorithm},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {321},
NUMBER = {1},
PAGES = {25-40},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computational geometry, convex hulls, in-place, in situ},
URL = {http://dx.doi.org/10.1016/j.tcs.2003.05.004},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Carmo-Donadelli-Kohayakawa-Laber/04,
AUTHOR = {Carmo, R. and Donadelli, J. and Kohayakawa, Y. and Laber, E.},
TITLE = {Searching in random partially ordered sets},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {321},
NUMBER = {1},
PAGES = {41-57},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {searching, search trees, random partial orders},
URL = {http://dx.doi.org/10.1016/j.tcs.2003.06.001},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Garefalakis/04,
AUTHOR = {Garefalakis, Theodoulos},
TITLE = {The generalized Weil pairing and the discrete logarithm problem on elliptic curves},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {321},
NUMBER = {1},
PAGES = {59-72},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://dx.doi.org/10.1016/j.tcs.2003.06.002},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Hevia-Kiwi/04,
AUTHOR = {Hevia, Alejandro and Kiwi, Marcos},
TITLE = {Electronic jury voting protocols},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {321},
NUMBER = {1},
PAGES = {73-94},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {membership testing, mix-networks, majority voting, election scheme},
URL = {http://dx.doi.org/10.1016/j.tcs.2003.06.003},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Li/04f,
AUTHOR = {Li, Keqin},
TITLE = {Analysis of randomized load distribution for reproduction trees in linear arrays and rings},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {321},
NUMBER = {2-3},
PAGES = {195-214},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.033},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Holdsworth/04,
AUTHOR = {Holdsworth, Jason J.},
TITLE = {Graph traversal and graph transformation},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {321},
NUMBER = {2-3},
PAGES = {215-231},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.034},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Cavaliere-Leupold/04,
AUTHOR = {Cavaliere, Matteo and Leupold, Peter},
TITLE = {Evolution and observation --- A non-standard way to generate formal languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {321},
NUMBER = {2-3},
PAGES = {233-248},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {formal languages, evolution, observation},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.036},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Downey-Griffiths-Reid/04,
AUTHOR = {Downey, Rodney G. and Griffiths, Evan J. and Reid, Stephanie},
TITLE = {On Kurtz randomness},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {321},
NUMBER = {2-3},
PAGES = {249-270},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {kolmogorov complexity, lowness, randomness, kurtz randomness},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.055},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Klazar/04,
AUTHOR = {Klazar, Martin},
TITLE = {On the least exponential growth admitting uncountably many closed permutation classes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {321},
NUMBER = {2-3},
PAGES = {271-281},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {permutation avoidance, wqo, exponential growth},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.056},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Bouyer-Dufourd-Fleury-Petit/04,
AUTHOR = {Bouyer, Patricia and Dufourd, Catherine and Fleury, Emmanuel and Petit, Antoine},
TITLE = {Updatable timed automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {321},
NUMBER = {2-3},
PAGES = {291-345},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.04.003},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Esteban-Galesi-Messner/04,
AUTHOR = {Esteban, Juan Luis and Galesi, Nicola and Messner, Jochen},
TITLE = {On the complexity of resolution with bounded conjunctions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {321},
NUMBER = {2-3},
PAGES = {347-370},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {resolution, complexity of proofs},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.04.004},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Chi-Kwon/04,
AUTHOR = {Chi, Dong Pyo and Kwon, DoYong},
TITLE = {Sturmian words, $\beta$-shifts, and transcendence},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {321},
NUMBER = {2-3},
PAGES = {395-404},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {sturmian word, $\beta$-shift, self-sturmian number},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.035},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Albert-Golynski-Hamel-Lopez-Ortiz-Rao-Safari/04,
AUTHOR = {Albert, Michael H. and Golynski, Alexander and Hamel, Ang{\`e}le M. and L{\'o}pez-Ortiz, Alejandro and Rao, S. Srinivasa and Safari, Mohammad Ali},
TITLE = {Longest increasing subsequences in sliding windows},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {321},
NUMBER = {2-3},
PAGES = {405-414},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {longest increasing subsequence, sliding window, robinson-schensted-knuth},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.057},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Arulanandham-Calude-Dinneen/04,
AUTHOR = {Arulanandham, Joshua J. and Calude, Cristian S. and Dinneen, Michael J.},
TITLE = {A fast natural algorithm for searching},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {320},
NUMBER = {1},
PAGES = {3-13},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Searching, Natural algorithms, Data structures},
URL = {DOI:10.1016/j.tcs.2004.03.040},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Biham-Brassard-Kenigsberg-Mor/04,
AUTHOR = {Biham, Eli and Brassard, Gilles and Kenigsberg, Dan and Mor, Tal},
TITLE = {Quantum computing without entanglement},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {320},
NUMBER = {1},
PAGES = {15-33},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Quantum computation Entanglement Pseudo-pure states},
URL = {DOI:10.1016/j.tcs.2004.03.041},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Condon-Davy-Rastegari-Zhao-Tarrant/04,
AUTHOR = {Condon, Anne and Davy, Beth and Rastegari, Baharak and Zhao, Shelly and Tarrant, Finbarr},
TITLE = {Classifying RNA pseudoknotted structures},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {320},
NUMBER = {1},
PAGES = {35-50},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {RNA secondary structure, Pseudoknots, Classification of structures},
URL = {DOI:10.1016/j.tcs.2004.03.042},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Daley-Kari-McQuillan/04,
AUTHOR = {Daley, Mark and Kari, Lila and McQuillan, Ian},
TITLE = {Families of languages defined by ciliate bio-operations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {320},
NUMBER = {1},
PAGES = {51-69},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Theoretical DNA computing, Bio-operations, Closure properties, Decision questions},
URL = {DOI:10.1016/j.tcs.2004.03.043},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Diligenti-Gori-Maggini/04,
AUTHOR = {Diligenti, Michelangelo and Gori, Marco and Maggini, Marco},
TITLE = {Neural computation, social networks, and topological spectra},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {320},
NUMBER = {1},
PAGES = {71-87},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Neural computation, Social networks, Topological spectra, PageRank},
URL = {DOI:10.1016/j.tcs.2004.03.044},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Ibarra/04,
AUTHOR = {Ibarra, Oscar H.},
TITLE = {On the computational complexity of membrane systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {320},
NUMBER = {1},
PAGES = {89-109},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Membrane computing, Catalytic system, Communicating P system, Symport/antiport system, Space bounded, Time bounded, Reachability, Acceptor, Generator, Semilinear},
URL = {DOI:10.1016/j.tcs.2004.03.045},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Bezrukov-Elsasser-Monien-Preis-Tillich/04,
AUTHOR = {Bezrukov, S. and Els{\"a}sser, R. and Monien, B. and Preis, R. and Tillich, J.-P.},
TITLE = {New spectral lower bounds on the bisection width of graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {320},
NUMBER = {2-3},
PAGES = {155-174},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Graph bisection, Laplacian of graphs, Eigenvalues of graphs},
URL = {DOI:10.1016/j.tcs.2004.03.059},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Elston-Ostheimer/04,
AUTHOR = {Elston, Gillian Z. and Ostheimer, Gretchen},
TITLE = {On groups whose word problem is solved by a counter automaton},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {320},
NUMBER = {2-3},
PAGES = {175-185},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Word problem, Counter automaton, Context free language},
URL = {DOI:10.1016/j.tcs.2003.09.007},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Choffrut-Haddad/04,
AUTHOR = {Choffrut, Ch. and Haddad, Y.},
TITLE = {String-matching with OBDDs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {320},
NUMBER = {2-3},
PAGES = {187-198},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Ordered binary decision diagrams, Finite automata, String-matching problem},
URL = {DOI:10.1016/j.tcs.2003.11.023},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Berthiaume-Bittner-Perkovic-Settle-Simon/04,
AUTHOR = {Berthiaume, Andr{\'e} and Bittner, Todd and Perkovi{\'c}, Ljubomir and Settle, Amber and Simon, Janos},
TITLE = {Bounding the firing synchronization problem on a ring},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {320},
NUMBER = {2-3},
PAGES = {213-228},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Cellular automata, Firing squad synchronization problem, Finite automata},
URL = {DOI:10.1016/j.tcs.2004.01.036},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Blundo-DArco-Daza-Padro/04,
AUTHOR = {Blundo, Carlo and D'Arco, Paolo and Daza, Vanessa and Padr{\'o}, Carles},
TITLE = {Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {320},
NUMBER = {2-3},
PAGES = {269-291},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Key distribution, Protocols, Distributed systems},
URL = {DOI:10.1016/j.tcs.2004.02.030},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Domaratzki/04b,
AUTHOR = {Domaratzki, Michael},
TITLE = {Deletion along trajectories},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {320},
NUMBER = {2-3},
PAGES = {293-313},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Deletion along trajectories, Shuffle on trajectories, Language equations, Regular languages},
URL = {DOI:10.1016/j.tcs.2004.02.031},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Healy-Kuusik/04,
AUTHOR = {Healy, Patrick and Kuusik, Ago},
TITLE = {Algorithms for multi-level graph planarity testing and layout},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {320},
NUMBER = {2-3},
PAGES = {331-344},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Level graphs, Level planarity testing, Level graph layout},
URL = {DOI:10.1016/j.tcs.2004.02.033},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Cocco-Monasson/04,
AUTHOR = {Cocco, Simona and Monasson, R{\'e}mi},
TITLE = {Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {320},
NUMBER = {2-3},
PAGES = {345-372},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Satisfiability, Analysis of algorithms, Backtrack},
URL = {DOI:10.1016/j.tcs.2004.02.034},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Dahllof-Jonsson-Beigel/04,
AUTHOR = {Dahll{\"o}f, Vilhelm and Jonsson, Peter and Beigel, Richard},
TITLE = {Algorithms for four variants of the exact satisfiability problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {320},
NUMBER = {2-3},
PAGES = {373-394},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Satisfiability, $SAT$, Exact satisfiability, $XSAT$, 3-Satisfiability, Exact 3-satisfiability, $X3SAT$, Counting, Counting problem, Counting models, Algorithm, Exact solution, Exponential-time algorithm, Computational complexity},
URL = {DOI:10.1016/j.tcs.2004.02.035},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Beal-Bergeron-Corteel-Raffinot/04,
AUTHOR = {B{\'e}al, Marie-Pierre and Bergeron, Anne and Corteel, Sylvie and Raffinot, Mathieu},
TITLE = {An algorithmic view of gene teams},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {320},
NUMBER = {2-3},
PAGES = {395-418},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Comparative genomics, Algorithmics, Gene team, Hopcroft's framework},
URL = {DOI:10.1016/j.tcs.2004.02.036},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Ben-Hur-Roitershtein-Siegelmann/04,
AUTHOR = {Ben-Hur, Asa and Roitershtein, Alexander and Siegelmann, Hava T.},
TITLE = {On probabilistic analog automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {320},
NUMBER = {2-3},
PAGES = {449-464},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Probabilistic automata, Probabilistic computation, Noisy computational systems, Regular languages, Definite languages, Markov operators},
URL = {DOI:10.1016/j.tcs.2004.03.003},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Hunziker-Machiavelo-Park/04,
AUTHOR = {Hunziker, Markus and Machiavelo, Ant{\'o}nio and Park, Jihun},
TITLE = {Chebyshev polynomials over finite fields and reversibility of $\sigma$-automata on square grids},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {320},
NUMBER = {2-3},
PAGES = {465-483},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Additive cellular automata, Chebyshev polynomials, Finite fields},
URL = {DOI:10.1016/j.tcs.2004.03.031},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Kang-Sohn-Cheng/04,
AUTHOR = {Kang, Liying and Sohn, Moo Young and Cheng, T.C.E.},
TITLE = {Paired-domination in inflated graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {320},
NUMBER = {2-3},
PAGES = {485-494},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Domination, Inflated graphs, Perfect matching},
URL = {DOI:10.1016/j.tcs.2004.02.028},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Hitchcock/04a,
AUTHOR = {Hitchcock, John M.},
TITLE = {The size of $SPP$},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {320},
NUMBER = {2-3},
PAGES = {495-503},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Resource-bounded measure, $SPP$, Weak completeness},
URL = {DOI:10.1016/j.tcs.2004.02.029},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Korn-Pak/04,
AUTHOR = {Korn, Michael and Pak, Igor},
TITLE = {Tilings of rectangles with $T$-tetrominoes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {319},
NUMBER = {1-3},
PAGES = {3-27},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Tilings, Height functions, Local move connectivity, Tutte polynomial, Sampling},
URL = {DOI:10.1016/j.tcs.2004.02.023},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Kuo/04,
AUTHOR = {Kuo, Eric H.},
TITLE = {Applications of graphical condensation for enumerating matchings and tilings},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {319},
NUMBER = {1-3},
PAGES = {29-57},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Tilings, Perfect matchings, Plane partitions, Generating functions},
URL = {DOI:10.1016/j.tcs.2004.02.022},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Bodini-Remila/04,
AUTHOR = {Bodini, Olivier and R{\'e}mila, Eric},
TITLE = {Tilings with trichromatic colored-edges triangles},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {319},
NUMBER = {1-3},
PAGES = {59-70},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Tiling, Local flip},
URL = {DOI:10.1016/j.tcs.2004.02.021},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Destainville-Mosseri-Bailly/04,
AUTHOR = {Destainville, N. and Mosseri, R. and Bailly, F.},
TITLE = {A formula for the number of tilings of an octagon by rhombi},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {319},
NUMBER = {1-3},
PAGES = {71-81},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Exact enumeration, Rhombus tilings, Random tilings, Centro-symmetric octagon, Gessel-Viennot method},
URL = {DOI:10.1016/j.tcs.2004.02.025},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Desreux-Matamala-Rapaport-Remila/04,
AUTHOR = {Desreux, S{\'e}bastien and Matamala, Martin and Rapaport, Ivan and R{\'e}mila, Eric},
TITLE = {Domino tilings and related models: Space of configurations of domains with holes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {319},
NUMBER = {1-3},
PAGES = {83-101},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Tiling, Height function, Lattice},
URL = {DOI:10.1016/j.tcs.2004.02.020},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Delvenne-Blondel/04,
AUTHOR = {Delvenne, Jean-Charles and Blondel, Vincent D.},
TITLE = {Quasi-periodic configurations and undecidable dynamics for tilings, infinite words and Turing machines},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {319},
NUMBER = {1-3},
PAGES = {127-143},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Tiling, Turing machine, Dynamical systems, Undecidability, Quasi-periodicity},
URL = {DOI:10.1016/j.tcs.2004.02.018},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Arnoux-Berthe-Siegel/04,
AUTHOR = {Arnoux, Pierre and Berth{\'e}, Val{\'e}rie and Siegel, Anne},
TITLE = {Two-dimensional iterated morphisms and discrete planes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {319},
NUMBER = {1-3},
PAGES = {145-176},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Discrete plane, Multidimensional combinatorics on words, Iterated morphism, $Z^2$-action, Tiling},
URL = {DOI:10.1016/j.tcs.2004.02.017},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Berthe-Tijdeman/04,
AUTHOR = {Berth{\'e}, Val{\'e}rie and Tijdeman, Robert},
TITLE = {Lattices and multi-dimensional words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {319},
NUMBER = {1-3},
PAGES = {177-202},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Multi-dimensional combinatorics on words, Tilings, Lattices, Discrete planes, Multi-dimensional Sturmian sequences},
URL = {DOI:10.1016/j.tcs.2004.02.016},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Brimkov-Barneva/04,
AUTHOR = {Brimkov, Valentin E. and Barneva, Reneta P.},
TITLE = {Connectivity of discrete planes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {319},
NUMBER = {1-3},
PAGES = {203-227},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Discrete plane, Discrete line, Connectivity of discrete object, Connectivity number},
URL = {DOI:10.1016/j.tcs.2004.02.015},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Harriss-Lamb/04,
AUTHOR = {Harriss, E.O. and Lamb, J.S.W.},
TITLE = {Canonical substitutions tilings of Ammann-Beenker type},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {319},
NUMBER = {1-3},
PAGES = {241-279},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Quasicrystals, Substitution rules, Tilings},
URL = {DOI:10.1016/j.tcs.2004.02.014},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Elkharrat-Frougny-Gazeau-Verger-Gaugry/04,
AUTHOR = {Elkharrat, Avi and Frougny, Christiane and Gazeau, Jean-Pierre and Verger-Gaugry, Jean-Louis},
TITLE = {Symmetry groups for beta-lattices},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {319},
NUMBER = {1-3},
PAGES = {281-305},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Beta-lattices, Pisot numbers, Quasicrystals, Tilings, Plane groups},
URL = {DOI:10.1016/j.tcs.2004.02.013},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Grabner-Heuberger-Prodinger/04,
AUTHOR = {Grabner, Peter J. and Heuberger, Clemens and Prodinger, Helmut},
TITLE = {Distribution results for low-weight binary representations for pairs of integers},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {319},
NUMBER = {1-3},
PAGES = {307-331},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Elliptic curve cryptography, Joint sparse form, Signed digit expansions, Fractals},
URL = {DOI:10.1016/j.tcs.2004.02.012},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Feretic/04,
AUTHOR = {Fereti{\'c}, Svjetlan},
TITLE = {A $q$-enumeration of convex polyominoes by the festoon approach},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {319},
NUMBER = {1-3},
PAGES = {333-356},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Closed lattice path, Factorization, Enclosed region, Convex polyomino, $q$-Enumeration},
URL = {DOI:10.1016/j.tcs.2004.02.011},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Furedi-Kang/04,
AUTHOR = {F{\"u}redi, Zolt{\'a}n and Kang, Jeong-Hyun},
TITLE = {Distance graph on $Z^n$ with $l_1$ norm},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {319},
NUMBER = {1-3},
PAGES = {357-366},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Unit-distance graph, Coloring metric spaces, Integer grid},
URL = {DOI:10.1016/j.tcs.2004.02.010},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Humphreys-Niederhausen/04,
AUTHOR = {Humphreys, Katherine and Niederhausen, Heinrich},
TITLE = {Counting lattice paths taking steps in infinitely many directions under special access restrictions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {319},
NUMBER = {1-3},
PAGES = {385-409},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Lattice path counting, Infinite step set, Umbral Calculus, Sheffer sequence, Privileged access},
URL = {DOI:10.1016/j.tcs.2004.02.008},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Daniel-Gravier-Moncel/04,
AUTHOR = {Daniel, Marc and Gravier, Sylvain and Moncel, Julien},
TITLE = {Identifying codes in some subgraphs of the square lattice},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {319},
NUMBER = {1-3},
PAGES = {411-421},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Graph theory, Identifying codes, Fasciagraphs},
URL = {DOI:10.1016/j.tcs.2004.02.007},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Aguilo-Arteaga-Diego/04,
AUTHOR = {Aguil{\'o}, F. and Arteaga, D. and Diego, I.},
TITLE = {A symbolical algorithm on additive basis and double-loop networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {319},
NUMBER = {1-3},
PAGES = {423-439},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Diameter, Double-loop network, L-shaped tile, Smith normal form, Additive basis},
URL = {DOI:10.1016/j.tcs.2004.02.006},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Currie/04,
AUTHOR = {Currie, James D.},
TITLE = {The number of binary words avoiding Abelian fourth powers grows exponentially},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {319},
NUMBER = {1-3},
PAGES = {441-446},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Combinatorics on words, Abelian repetitions, Entropy},
URL = {DOI:10.1016/j.tcs.2004.02.005},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Frosini-Simi/04,
AUTHOR = {Frosini, A. and Simi, G.},
TITLE = {The $NP$-completeness of a tomographical problem on bicolored domino tilings},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {319},
NUMBER = {1-3},
PAGES = {447-454},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Domino tilings, Discrete tomography, Reconstruction algorithm, Domino tilings, Computational complexity},
URL = {DOI:10.1016/j.tcs.2004.02.004},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Barbanchon/04,
AUTHOR = {Barbanchon, R{\'e}gis},
TITLE = {On unique graph 3-colorability and parsimonious reductions in the plane},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {319},
NUMBER = {1-3},
PAGES = {455-482},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Computational complexity, Planar combinatorial problems, 3-Colorability, Unique solution problems, Parsimonious equivalence to $SAT$},
URL = {DOI:10.1016/j.tcs.2004.02.003},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Aehlig-Berger-Hofmann-Schwichtenberg/04,
AUTHOR = {Aehlig, Klaus and Berger, Ulrich and Hofmann, Martin and Schwichtenberg, Helmut},
TITLE = {An arithmetic for non-size-increasing polynomial-time computation},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {318},
NUMBER = {1-2},
PAGES = {3-27},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Logic, Arithmetic, Implicit computational complexity, Non-size-increasing polynomial time computation, Realizability, Higher types, Lambda calculus},
URL = {DOI:10.1016/j.tcs.2003.10.023},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Baillot/04,
AUTHOR = {Baillot, Patrick},
TITLE = {Stratified coherence spaces: A denotational semantics for light linear logic},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {318},
NUMBER = {1-2},
PAGES = {29-55},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {DOI:10.1016/j.tcs.2003.10.015},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Bellantoni-Oitavem/04,
AUTHOR = {Bellantoni, S. and Oitavem, I.},
TITLE = {Separating $NC$ along the $\delta$ axis},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {318},
NUMBER = {1-2},
PAGES = {57-78},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {DOI:10.1016/j.tcs.2003.10.021},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Benzinger/04,
AUTHOR = {Benzinger, Ralph},
TITLE = {Automated higher-order complexity analysis},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {318},
NUMBER = {1-2},
PAGES = {79-103},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Computational complexity analysis, Functional programs, Higher-order complexity, Program synthesis, Feasible mathematics},
URL = {DOI:10.1016/j.tcs.2003.10.022},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Danner-Pollett/04,
AUTHOR = {Danner, N. and Pollett, C.},
TITLE = {Minimization and $NP$ multifunctions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {318},
NUMBER = {1-2},
PAGES = {105-119},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Implicit computational complexity, Non-deterministic partial multifunctions, Safe recursion, Minimization},
URL = {DOI:10.1016/j.tcs.2003.10.020},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Hofmann-Scott/04,
AUTHOR = {Hofmann, M. and Scott, P.J.},
TITLE = {Realizability models for BLL-like languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {318},
NUMBER = {1-2},
PAGES = {121-137},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Linear logic, Complexity lambda calculus, Finite model theory},
URL = {DOI:10.1016/j.tcs.2003.10.019},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Kristiansen-Niggl/04,
AUTHOR = {Kristiansen, L. and Niggl, K.-H.},
TITLE = {On the computational complexity of imperative programming languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {318},
NUMBER = {1-2},
PAGES = {139-161},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Implicit computational complexity, Imperative programming languages, Subrecursion theory, Grzegorczyk hierarchy, Polynomial-time computability},
URL = {DOI:10.1016/j.tcs.2003.10.016},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Lafont/04,
AUTHOR = {Lafont, Yves},
TITLE = {Soft linear logic and polynomial time},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {318},
NUMBER = {1-2},
PAGES = {163-180},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Linear logic, Second order lambda-calculus, Polynomial time},
URL = {DOI:10.1016/j.tcs.2003.10.018},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Leivant/04,
AUTHOR = {Leivant, Daniel},
TITLE = {Intrinsic reasoning about functional programs II: Unipolar induction and primitive-recursion},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {318},
NUMBER = {1-2},
PAGES = {181-196},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {DOI:10.1016/j.tcs.2003.11.002},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Majster-Cederbaum-Salger/04,
AUTHOR = {Majster-Cederbaum, Mila and Salger, Frank},
TITLE = {Towards the hierarchical verification of reactive systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {318},
NUMBER = {3},
PAGES = {243-296},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Reactive systems, Verification, Syntactic action refinement, Modal Mu-calculus},
URL = {DOI:10.1016/j.tcs.2003.08.009},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Alur-la_Torre-Pappas/04,
AUTHOR = {Alur, Rajeev and la Torre, Salvatore and Pappas, George J.},
TITLE = {Optimal paths in weighted timed automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {318},
NUMBER = {3},
PAGES = {297-322},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Hybrid systems, Model checking, Optimal reachability, Timed automata},
URL = {DOI:10.1016/j.tcs.2003.10.038},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Desharnais-Gupta-Jagadeesan-Panangaden/04,
AUTHOR = {Desharnais, Jos{\'e}e and Gupta, Vineet and Jagadeesan, Radha and Panangaden, Prakash},
TITLE = {Metrics for labelled Markov processes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {318},
NUMBER = {3},
PAGES = {323-354},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Labelled Markov processes, Metric, Process Algebra},
URL = {DOI:10.1016/j.tcs.2003.09.013},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Karner/04,
AUTHOR = {Karner, Georg},
TITLE = {Continuous monoids and semirings},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {318},
NUMBER = {3},
PAGES = {355-372},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Distributive $\Sigma$-algebras, Distributive multioperator monoids, Complete semirings, Continuous semirings, Complete partial orders, Scott topology},
URL = {DOI:10.1016/j.tcs.2004.01.020},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Broda-Damas-Finger-Silva_e_Silva/04,
AUTHOR = {Broda, Sabine and Damas, Lu{\'{\i}}s and Finger, Marcelo and Silva e Silva, Paulo},
TITLE = {The decidability of a fragment of BB'IW-logic},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {318},
NUMBER = {3},
PAGES = {373-408},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {DOI:10.1016/j.tcs.2004.02.002},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Dal_Lago-Martini/04,
AUTHOR = {Dal Lago, Ugo and Martini, Simone},
TITLE = {Phase semantics and decidability of elementary affine logic},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {318},
NUMBER = {3},
PAGES = {409-433},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Linear logic, Light linear logic, Soft linear logic, Optimal reduction},
URL = {DOI:10.1016/j.tcs.2004.02.037},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Banerjee-Bujosa/04,
AUTHOR = {Banerjee, R.N. and Bujosa, A.},
TITLE = {A geometric interpretation of $LD$-resolution},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {318},
NUMBER = {3},
PAGES = {435-470},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Syntactic unification, SLD-resolution, Affine linear varieties, Free-modules, Semi-group ring, Dynamical systems},
URL = {DOI:10.1016/j.tcs.2004.03.007},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Burgin-Klinger/04,
AUTHOR = {Burgin, Mark and Klinger, Allen},
TITLE = {Three aspects of super-recursive algorithms and hypercomputation or finding black swans},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {317},
NUMBER = {1-3},
PAGES = {1-11},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {DOI:10.1016/j.tcs.2003.12.001},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Kugel/04,
AUTHOR = {Kugel, Peter},
TITLE = {Toward a theory of intelligence},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {317},
NUMBER = {1-3},
PAGES = {13-30},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Intelligence, Artificial intelligence, Hypercomputers, Super-recursive algorithms},
URL = {DOI:10.1016/j.tcs.2003.12.002},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Burgin/04,
AUTHOR = {Burgin, Mark},
TITLE = {Algorithmic complexity of recursive and inductive algorithms},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {317},
NUMBER = {1-3},
PAGES = {31-60},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Efficiency, Complexity, Dual complexity measure, Kolmogorov complexity, Recursive algorithm, Turing machine, Super-recursive algorithm, Inductive Turing machine},
URL = {DOI:10.1016/j.tcs.2003.12.003},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Burgin-Klinger/04a,
AUTHOR = {Burgin, Mark and Klinger, Allen},
TITLE = {Experience, generations, and limits in machine learning},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {317},
NUMBER = {1-3},
PAGES = {71-91},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Machine learning, Computation in the limit, Learning in the limit, Turing machine, Inductive Turing machine},
URL = {DOI:10.1016/j.tcs.2003.12.005},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Kieu/04,
AUTHOR = {Kieu, Tien D.},
TITLE = {Hypercomputation with quantum adiabatic processes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {317},
NUMBER = {1-3},
PAGES = {93-104},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Hypercomputation, Hilbert's tenth problem, Turing halting problem, Quantum adiabatic computation},
URL = {DOI:10.1016/j.tcs.2003.12.006},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{MacLennan/04,
AUTHOR = {MacLennan, Bruce J.},
TITLE = {Natural computation and non-Turing models of computation},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {317},
NUMBER = {1-3},
PAGES = {115-145},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Analog computation, Computation on reals, Continuous computation, Natural computation, Turing machine},
URL = {DOI:10.1016/j.tcs.2003.12.008},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Campagnolo/04,
AUTHOR = {Campagnolo, Manuel Lameiras},
TITLE = {Continuous-time computation with restricted integration capabilities},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {317},
NUMBER = {1-3},
PAGES = {147-165},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Continuous-time computation, Recursion theory, Computational complexity, Exponential space hierarchy, Differential equations, Numerical integration},
URL = {DOI:10.1016/j.tcs.2003.12.009},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Bringsjord-Arkoudas/04,
AUTHOR = {Bringsjord, Selmer and Arkoudas, Konstantine},
TITLE = {The modal argument for hypercomputing minds},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {317},
NUMBER = {1-3},
PAGES = {167-190},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Computationalism, Hypercomputation, Incompleteness theorems},
URL = {DOI:10.1016/j.tcs.2003.12.010},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Cleland/04,
AUTHOR = {Cleland, Carol E.},
TITLE = {The concept of computability},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {317},
NUMBER = {1-3},
PAGES = {209-225},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Entscheidungsproblem, Hilbert, Turing machine, Computable},
URL = {DOI:10.1016/j.tcs.2003.12.012},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Kelly/04,
AUTHOR = {Kelly, Kevin T.},
TITLE = {Uncomputability: The problem of induction internalized},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {317},
NUMBER = {1-3},
PAGES = {227-249},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Hyper-computation, Learning in the limit, Computing in the limit},
URL = {DOI:10.1016/j.tcs.2003.12.013},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Copeland/04,
AUTHOR = {Copeland, B. Jack},
TITLE = {Hypercomputation: Philosophical issues},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {317},
NUMBER = {1-3},
PAGES = {251-267},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Turing, Church, Super-Turing, Oracle, Mind},
URL = {DOI:10.1016/j.tcs.2003.12.014},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Adamek-Milius-Velebil/04,
AUTHOR = {Ad{\'a}mek, Ji{\v{r}}{\'{\i}} and Milius, Stefan and Velebil, Ji{\v{r}}{\'{\i}}},
TITLE = {On coalgebra based on classes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {316},
NUMBER = {1-3},
PAGES = {3-23},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Category of classes, Set-based endofunctor, Terminal coalgebra, Iterative monad},
URL = {DOI:10.1016/j.tcs.2003.12.022},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Alessi-Dezani-Ciancaglini-Lusin/04,
AUTHOR = {Alessi, Fabio and Dezani-Ciancaglini, Mariangiola and Lusin, Stefania},
TITLE = {Intersection types and domain operators},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {316},
NUMBER = {1-3},
PAGES = {25-47},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Lambda calculus, Intersection types, Models of lambda calculus, Lambda theories, Fixed point operators},
URL = {DOI:10.1016/j.tcs.2004.01.022},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Dezani-Ciancaglini-Ghilezan-Likavec/04,
AUTHOR = {Dezani-Ciancaglini, Mariangiola and Ghilezan, Silvia and Likavec, Silvia},
TITLE = {Behavioural inverse limit $\lambda$-models},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {316},
NUMBER = {1-3},
PAGES = {49-74},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Lambda calculus, Intersection types, Models of lambda calculus, Stone dualities, Reducibility method},
URL = {DOI:10.1016/j.tcs.2004.01.023},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Lawson/04,
AUTHOR = {Lawson, Jimmie D.},
TITLE = {Idempotent analysis and continuous semilattices},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {316},
NUMBER = {1-3},
PAGES = {75-87},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {DOI:10.1016/j.tcs.2004.01.024},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Lawson-Xu/04,
AUTHOR = {Lawson, Jimmie D. and Xu, Luoshan},
TITLE = {Posets having continuous intervals},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {316},
NUMBER = {1-3},
PAGES = {89-103},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Continuous domain, Function space, L-domain, Core compact space, Scott topology},
URL = {DOI:10.1016/j.tcs.2004.01.025},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Lawvere/04,
AUTHOR = {Lawvere, F. William},
TITLE = {Left and right adjoint operations on spaces and data types},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {316},
NUMBER = {1-3},
PAGES = {105-111},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {DOI:10.1016/j.tcs.2004.01.026},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Berardi-Berline/04,
AUTHOR = {Berardi, S. and Berline, C.},
TITLE = {Building continuous webbed models for system $F$},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {315},
NUMBER = {1},
PAGES = {3-34},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Lambda-calculus, Models for polymorphism, Webbed models, Continuous semantics},
URL = {DOI:10.1016/j.tcs.2003.11.011},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Bauer-Birkedal-Scott/04,
AUTHOR = {Bauer, Andrej and Birkedal, Lars and Scott, Dana S.},
TITLE = {Equilogical spaces},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {315},
NUMBER = {1},
PAGES = {35-59},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Domain theory, Topology, Logic, Type theory, Realizability},
URL = {DOI:10.1016/j.tcs.2003.11.012},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Calcagno/04,
AUTHOR = {Calcagno, Cristiano},
TITLE = {Two-level languages for program optimization},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {315},
NUMBER = {1},
PAGES = {61-81},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Partial evaluation, Program generation, Semantics},
URL = {DOI:10.1016/j.tcs.2003.11.013},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Konecny/04,
AUTHOR = {Kone{\v{c}}n{\'y}},
TITLE = {Real functions incrementally computable by finite automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {315},
NUMBER = {1},
PAGES = {109-133},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Real number computation, Finite automaton, M"obius transformation, Sub-self-similarity},
URL = {DOI:10.1016/j.tcs.2003.11.015},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Furedi-Kurshan/04,
AUTHOR = {F{\"u}redi, Z. and Kurshan, R.P.},
TITLE = {Minimal length test vectors for multiple-fault detection},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {315},
NUMBER = {1},
PAGES = {191-208},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Chinese Postman, Testing, Fault detection},
URL = {DOI:10.1016/j.tcs.2003.11.018},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Lowe/04,
AUTHOR = {Lowe, Gavin},
TITLE = {Semantic models for information flow},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {315},
NUMBER = {1},
PAGES = {209-256},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {DOI:10.1016/j.tcs.2003.11.019},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Bai-Chan/04,
AUTHOR = {Bai, Zheng-Jian and Chan, Raymond H.},
TITLE = {Inverse eigenproblem for centrosymmetric and centroskew matrices and their approximation},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {315},
NUMBER = {2-3},
PAGES = {309-318},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Eigenproblem, Centrosymmetric matrix, Centroskew matrix},
URL = {DOI:10.1016/j.tcs.2004.01.017},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Bini-Gemignani/04,
AUTHOR = {Bini, D.A. and Gemignani, L.},
TITLE = {Bernstein-Bezoutian matrices},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {315},
NUMBER = {2-3},
PAGES = {319-333},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Bezoutian matrices, Bernstein polynomial basis, Displacement structure, Fast algorithms},
URL = {DOI:10.1016/j.tcs.2004.01.016},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Bompadre-Matera-Wachenchauzer-Waissbein/04,
AUTHOR = {Bompadre, A. and Matera, G. and Wachenchauzer, R. and Waissbein, A.},
TITLE = {Polynomial equation solving by lifting procedures for ramified fibers},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {315},
NUMBER = {2-3},
PAGES = {335-369},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Efficient polynomial equation solving, Ramified fibers of dominant mappings, Puiseux expansions of space curves, Newton, Hensel lifting},
URL = {DOI:10.1016/j.tcs.2004.01.015},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Burago-Grigoriev-Slissenko/04,
AUTHOR = {Burago, D. and Grigoriev, D. and Slissenko, A.},
TITLE = {Approximating shortest path for the skew lines problem in time doubly logarithmic in $1/\epsilon$},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {315},
NUMBER = {2-3},
PAGES = {371-404},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Shortest path, Skew lines problem},
URL = {http://dx.doi.org/10.1016/j.tcs.2004.01.014},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Croot-Li-Zhu/04,
AUTHOR = {Croot, Ernie and Li, Ren-Cang and Zhu, Hui June},
TITLE = {The abc conjecture and correctly rounded reciprocal square roots},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {315},
NUMBER = {2-3},
PAGES = {405-417},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Correct rounding, Reciprocal square root, The abc conjecture, Floating point number, Algebraic number},
URL = {DOI:10.1016/j.tcs.2004.01.013},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Heinig-Rost/04,
AUTHOR = {Heinig, Georg and Rost, Karla},
TITLE = {Split algorithms for skewsymmetric Toeplitz matrices with arbitrary rank profile},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {315},
NUMBER = {2-3},
PAGES = {453-468},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Toeplitz matrix, Skewsymmetric matrix, Split algorithm, Levinson algorithm, Schur algorithm, WZ-factorization},
URL = {DOI:10.1016/j.tcs.2004.01.003},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Kaporin/04,
AUTHOR = {Kaporin, Igor},
TITLE = {The aggregation and cancellation techniques as a practical tool for faster matrix multiplication},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {315},
NUMBER = {2-3},
PAGES = {469-510},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Fast matrix multiplication, Strassen algorithm, Winograd algorithm, Pan's aggregation/cancellation method, Numerical stability, Computational complexity},
URL = {DOI:10.1016/j.tcs.2004.01.004},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Lin-Ching-Ng/04,
AUTHOR = {Lin, Fu-Rong and Ching, Wai-Ki and Ng, Michael K.},
TITLE = {Fast inversion of triangular Toeplitz matrices},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {315},
NUMBER = {2-3},
PAGES = {511-523},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Triangular Toeplitz matrix, Interpolation, Fast Fourier transform, Fast cosine transform},
URL = {DOI:10.1016/j.tcs.2004.01.005},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Malajovich-Rojas/04,
AUTHOR = {Malajovich, Gregorio and Rojas, Maurice},
TITLE = {High probability analysis of the condition number of sparse polynomial systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {315},
NUMBER = {2-3},
PAGES = {525-555},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Mixed volume, Condition number, Polynomial systems, Sparse, Random},
URL = {DOI:10.1016/j.tcs.2004.01.006},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Feder-Madelaine-Stewart/04,
AUTHOR = {Feder, Tom{\'a}s and Madelaine, Florent and Stewart, Iain A.},
TITLE = {Dichotomies for classes of homomorphism problems involving unary functions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {314},
NUMBER = {1-2},
PAGES = {1-43},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {DOI:10.1016/j.tcs.2003.12.015},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Deppe/04,
AUTHOR = {Deppe, Christian},
TITLE = {Strategies for the Renyi-Ulam game with fixed number of lies},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {314},
NUMBER = {1-2},
PAGES = {45-55},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Searching with lies, Renyi-Ulam-Game},
URL = {DOI:10.1016/j.tcs.2003.10.036},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Duchi-Fedou-Rinaldi/04,
AUTHOR = {Duchi, Enrica and Fedou, Jean-Marc and Rinaldi, Simone},
TITLE = {From object grammars to ECO systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {314},
NUMBER = {1-2},
PAGES = {57-95},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {DOI:10.1016/j.tcs.2003.10.037},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Amir-Butman-Crochemore-Landau-Schaps/04,
AUTHOR = {Amir, Amihood and Butman, Ayelet and Crochemore, Maxime and Landau, Gad M. and Schaps, Mary},
TITLE = {Two-dimensional pattern matching with rotations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {314},
NUMBER = {1-2},
PAGES = {173-187},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Design and analysis of algorithms, Two-dimensional pattern matching, Rotation},
URL = {DOI:10.1016/j.tcs.2003.10.039},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Blanchet-Sadri-Chriscoe/04,
AUTHOR = {Blanchet-Sadri, F. and Chriscoe, Ajay},
TITLE = {Local periods and binary partial words: An algorithm},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {314},
NUMBER = {1-2},
PAGES = {189-216},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Words, Partial words, Periods, Local periods},
URL = {DOI:10.1016/j.tcs.2003.11.025},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Angiulli-Ianni-Palopoli/04,
AUTHOR = {Angiulli, Fabrizio and Ianni, Giovambattista and Palopoli, Luigi},
TITLE = {On the complexity of inducing categorical and quantitative association rules},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {314},
NUMBER = {1-2},
PAGES = {217-249},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Computational complexity, Data mining},
URL = {DOI:10.1016/j.tcs.2003.12.017},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Burckel-Morillon/04,
AUTHOR = {Burckel, Serge and Morillon, Marianne},
TITLE = {Sequential computation of linear Boolean mappings},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {314},
NUMBER = {1-2},
PAGES = {287-292},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Linear algebra, Boolean functions, Matrices},
URL = {DOI:10.1016/j.tcs.2003.11.027},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Gu-Hu-Jia-Zhang/04,
AUTHOR = {Gu, Jun and Hu, Xiao-Dong and Jia, Xiaohua and Zhang, Mu-Hong},
TITLE = {Routing algorithm for multicast under multi-tree model in optical networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {314},
NUMBER = {1-2},
PAGES = {293-301},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Multicast, Optical networks, Routing, Wavelength assignment, Multi-tree model},
URL = {DOI:10.1016/j.tcs.2003.12.019},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Dimitri/04,
AUTHOR = {Dimitri, Nicola},
TITLE = {Efficiency and equilibrium in the electronic mail game; The general case},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {314},
NUMBER = {3},
PAGES = {335-349},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Coordinated actions, Games, Knowledge},
URL = {DOI:10.1016/j.tcs.2003.12.016},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{De_Bonis-De_Santis/04,
AUTHOR = {De Bonis, Annalisa and De Santis, Alfredo},
TITLE = {Randomness in secret sharing and visual cryptography schemes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {314},
NUMBER = {3},
PAGES = {351-374},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Cryptography, Secret sharing, Randomness, Visual cryptography},
URL = {DOI:10.1016/j.tcs.2003.12.018},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Chang-Guo-Hwang-Lin/04,
AUTHOR = {Chang, F.H. and Guo, J.Y. and Hwang, F.K. and Lin, C.K.},
TITLE = {Wide-sense nonblocking for symmetric or asymmetric 3-stage Clos networks under various routing strategies},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {314},
NUMBER = {3},
PAGES = {375-386},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Wide-sense nonblocking, WSNB, MI, STU, P, CD, CS},
URL = {DOI:10.1016/j.tcs.2003.12.021},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Fulop-Gazdag-Vogler/04,
AUTHOR = {F{\"u}l{\"o}p, Zolt{\'a}n and Gazdag, Zsolt and Vogler, Heiko},
TITLE = {Hierarchies of tree series transformations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {314},
NUMBER = {3},
PAGES = {387-429},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Tree automata, Tree transducers, Tree series transducers},
URL = {DOI:10.1016/j.tcs.2004.01.001},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Bordihn/04,
AUTHOR = {Bordihn, Henning},
TITLE = {Context-freeness of the power of context-free languages is undecidable},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {314},
NUMBER = {3},
PAGES = {445-449},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Context-free languages, Algorithmic undecidability, Power of languages},
URL = {DOI:10.1016/j.tcs.2003.08.005},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Domaratzki-Okhotin/04,
AUTHOR = {Domaratzki, Michael and Okhotin, Alexander},
TITLE = {Representing recursively enumerable languages by iterated deletion},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {314},
NUMBER = {3},
PAGES = {451-457},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Iterated sequential deletion, Recursively enumerable languages, Linear context-free languages},
URL = {DOI:10.1016/j.tcs.2004.01.002},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Elmasry/04c,
AUTHOR = {Elmasry, Amr},
TITLE = {On the sequential access theorem and deque conjecture for splay trees},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {314},
NUMBER = {3},
PAGES = {459-466},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Algorithms, Data structures, Splay trees, Amortized analysis, Combinatorial problems},
URL = {DOI:10.1016/j.tcs.2004.01.019},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Bergeron-Hamel/04,
AUTHOR = {Bergeron, Anne and Hamel, Sylvie},
TITLE = {From cascade decompositions to bit-vector algorithms},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {313},
NUMBER = {1},
PAGES = {3-16},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Bit-vector algorithms, Cascade decompositions, Counter-free automata},
URL = {DOI:10.1016/j.tcs.2003.10.010},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Boigelot-Latour/04,
AUTHOR = {Boigelot, Bernard and Latour, Louis},
TITLE = {Counting the solutions of Presburger equations without enumerating them},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {313},
NUMBER = {1},
PAGES = {17-29},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Presburger arithmetic, Automata, Counting, Symbolic representation systems},
URL = {DOI:10.1016/j.tcs.2003.10.002},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Champarnaud-Duchamp/04,
AUTHOR = {Champarnaud, Jean-Marc and Duchamp, G{\'e}rard},
TITLE = {Derivatives of rational expressions and related theorems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {313},
NUMBER = {1},
PAGES = {31-44},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Series, Rational expressions, Automata, Congruences},
URL = {DOI:10.1016/j.tcs.2003.10.005},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Daciuk-van_Noord/04,
AUTHOR = {Daciuk, Jan and van Noord, Gertjan},
TITLE = {Finite automata for compact representation of Tuple dictionaries},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {313},
NUMBER = {1},
PAGES = {45-56},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Finite automata, Language models, Perfect hashing, Tuple dictionaries},
URL = {DOI:10.1016/j.tcs.2003.10.003},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Dang-Bultan-Ibarra-Kemmerer/04,
AUTHOR = {Dang, Zhe and Bultan, Tevfik and Ibarra, Oscar H. and Kemmerer, Richard A.},
TITLE = {Past pushdown timed automata and safety verification},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {313},
NUMBER = {1},
PAGES = {57-71},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Timed automata, Automated verification, Temporal logic, Past formulas, Presburger arithmetic},
URL = {DOI:10.1016/j.tcs.2003.10.004},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Farre-Galvez/04,
AUTHOR = {Farr{\'e}, Jacques and G{\'a}lvez, J. Fortes},
TITLE = {Bounded-connect noncanonical discriminating-reverse parsers},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {313},
NUMBER = {1},
PAGES = {73-91},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Discriminating-reverse, Noncanonical, Two stacks, Conflict resolution, Unbounded lookahead, Item graph},
URL = {DOI:10.1016/j.tcs.2003.10.006},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Friburger-Maurel/04,
AUTHOR = {Friburger, N. and Maurel, D.},
TITLE = {Finite-state transducer cascades to extract named entities in texts},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {313},
NUMBER = {1},
PAGES = {93-104},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Finite-State Transducer, Finite-State Cascade, Named entity, Proper names, Pattern matching, MUC},
URL = {DOI:10.1016/j.tcs.2003.10.007},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Gaal/04,
AUTHOR = {Ga{\'a}l, Tam{\'a}s},
TITLE = {Deciding sequentiability of finite-state transducers by finite-state pattern-matching},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {313},
NUMBER = {1},
PAGES = {105-117},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Finite-state transducer, Letter transducer, Sequential, Sequentiality, Sequentiability, Sequentialization, $\epsilon$-closure, $\epsilon$-ambiguity},
URL = {DOI:10.1016/j.tcs.2003.10.008},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Geniet-Dubernard/04,
AUTHOR = {Geniet, Dominique and Dubernard, Jean-Philippe},
TITLE = {Scheduling hard sporadic tasks with regular languages and generating functions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {313},
NUMBER = {1},
PAGES = {119-132},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Hard real-time systems, Finite automata, Generating functions, Operational validation},
URL = {DOI:10.1016/j.tcs.2003.10.009},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Katritzke-Merzenich-Thomas/04,
AUTHOR = {Katritzke, F. and Merzenich, W. and Thomas, M.},
TITLE = {Enhancements of partitioning techniques for image compression using weighted finite automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {313},
NUMBER = {1},
PAGES = {133-144},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Image compression, Weighted finite automata, Partitioning techniques},
URL = {DOI:10.1016/j.tcs.2003.10.011},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Kempe/04,
AUTHOR = {Kempe, Andr{\'e}},
TITLE = {Extraction and recoding of input-$\varepsilon$-cycles},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {313},
NUMBER = {1},
PAGES = {145-158},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Finite state transducer, Decomposition, Non-determinism, Epsilon cycle},
URL = {DOI:10.1016/j.tcs.2003.10.012},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Angluin/04,
AUTHOR = {Angluin, Dana},
TITLE = {Queries revisited},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {313},
NUMBER = {2},
PAGES = {175-194},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Learning with queries, Query complexity, Learning dimension},
URL = {DOI:10.1016/j.tcs.2003.11.004},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Kalnishkan-Vovk-Vyugin/04,
AUTHOR = {Kalnishkan, Yuri and Vovk, Volodya and Vyugin, Michael V.},
TITLE = {Loss functions, complexities, and the Legendre transformation},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {313},
NUMBER = {2},
PAGES = {195-207},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {On-line prediction, Predictive complexity, Generalized entropy},
URL = {DOI:10.1016/j.tcs.2003.11.005},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Jain-Stephan/04,
AUTHOR = {Jain, Sanjay and Stephan, Frank},
TITLE = {Learning how to separate},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {313},
NUMBER = {2},
PAGES = {209-228},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {DOI:10.1016/j.tcs.2003.11.006},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Denis-Lemay-Terlutte/04,
AUTHOR = {Denis, Fran{\c{c}}ois and Lemay, Aur{\'e}lien and Terlutte, Alain},
TITLE = {Learning regular languages using RFSAs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {313},
NUMBER = {2},
PAGES = {267-294},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Grammatical inference, Machine learning, Regular languages, Finite state automata},
URL = {DOI:10.1016/j.tcs.2003.11.008},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Althofer/04,
AUTHOR = {Alth{\"o}fer, Ingo},
TITLE = {Improved game play by multiple computer hints},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {313},
NUMBER = {3},
PAGES = {315-324},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Multiple-choice system, 3-Hirn, Chess, Clobber, Combinatorial Game Theory, Zillions of Games},
URL = {DOI:10.1016/j.tcs.2003.08.012},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Demaine-Demaine-Fleischer/04,
AUTHOR = {Demaine, Erik D. and Demaine, Martin L. and Fleischer, Rudolf},
TITLE = {Solitaire Clobber},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {313},
NUMBER = {3},
PAGES = {325-338},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Combinatorial games, Annihilation games, Board games, $NP$-completeness},
URL = {DOI:10.1016/j.tcs.2003.02.001},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Doerr/04c,
AUTHOR = {Doerr, Benjamin},
TITLE = {European tenure games},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {313},
NUMBER = {3},
PAGES = {339-351},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Balancing games, Discrepancy},
URL = {DOI:10.1016/j.tcs.2002.10.001},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Dumitriu-Spencer/04,
AUTHOR = {Dumitriu, Ioana and Spencer, Joel},
TITLE = {A halfliar's game},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {313},
NUMBER = {3},
PAGES = {353-369},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Combinatorial game theory, Two-person games, Liar games},
URL = {DOI:10.1016/j.tcs.2002.09.001},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Erdos-Faigle-Hochstattler-Kern/04,
AUTHOR = {Erd{\"o}s, Peter L. and Faigle, Ulrich and Hochst{\"a}ttler, Winfried and Kern, Walter},
TITLE = {Note on the game chromatic index of trees},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {313},
NUMBER = {3},
PAGES = {371-376},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Game theory, Chromatic index},
URL = {DOI:10.1016/j.tcs.2002.10.002},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Fekete-Fleischer-Fraenkel-Schmitt/04,
AUTHOR = {Fekete, S{\'a}ndor P. and Fleischer, Rudolf and Fraenkel, Aviezri and Schmitt, Matthias},
TITLE = {Traveling Salesmen in the presence of competition},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {313},
NUMBER = {3},
PAGES = {377-392},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Combinatorial games, Complexity, $PSPACE$-completeness, Strategy stealing, Traveling salesman problem (TSP), Competing salesmen problem (CSP)},
URL = {DOI:10.1016/j.tcs.2002.12.001},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Fraenkel/04,
AUTHOR = {Fraenkel, Aviezri S.},
TITLE = {Complexity, appeal and challenges of combinatorial games},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {313},
NUMBER = {3},
PAGES = {393-415},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Complexity of combinatorial games, PlayGames, MathGames},
URL = {DOI:10.1016/j.tcs.2002.11.001},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Grossman/04,
AUTHOR = {Grossman, J.P.},
TITLE = {Periodicity in one-dimensional peg duotaire},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {313},
NUMBER = {3},
PAGES = {417-425},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Combinatorial game theory, Grundy values, Peg solitaire},
URL = {DOI:10.1016/j.tcs.2002.11.003},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Harary-Slany-Verbitsky/04,
AUTHOR = {Harary, F. and Slany, W. and Verbitsky, O.},
TITLE = {On the lengths of symmetry breaking-preserving games on graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {313},
NUMBER = {3},
PAGES = {427-446},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Symmetry breaking-preserving game, Ehrenfeucht-Fra{\"i}ss{\'e} game},
URL = {DOI:10.1016/j.tcs.2002.10.003},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Holzer-Schwoon/04,
AUTHOR = {Holzer, Markus and Schwoon, Stefan},
TITLE = {Assembling molecules in ATOMIX is hard},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {313},
NUMBER = {3},
PAGES = {447-462},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Finite automata, Intersection emptiness, Block sliding puzzle, $PSPACE$-completeness},
URL = {DOI:10.1016/j.tcs.2002.11.002},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Howse-Nowakowski/04,
AUTHOR = {Howse, S. and Nowakowski, R.J.},
TITLE = {Periodicity and arithmetic-periodicity in hexadecimal games},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {313},
NUMBER = {3},
PAGES = {463-472},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Combinatorial game, Hexadecimal, Impartial game, Periodicity, Regularities, Taking-and-breaking},
URL = {DOI:10.1016/j.tcs.2003.08.013},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Kral-Majerech-Sgall-Tichy-Woeginger/04,
AUTHOR = {Kr{\'a}l', Daniel and Majerech, Vladan and Sgall, Ji{\v{r}}{\'{\i}} and Tich{\'y}, Tom{\'a}{\v{s}} and Woeginger, Gerhard},
TITLE = {It is tough to be a plumber},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {313},
NUMBER = {3},
PAGES = {473-484},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Combinatorial game theory, $NP$-completeness},
URL = {DOI:10.1016/j.tcs.2002.12.002},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Lorenz-Monien/04,
AUTHOR = {Lorenz, U. and Monien, B.},
TITLE = {Error analysis in minimax trees},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {313},
NUMBER = {3},
PAGES = {485-498},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {Game tree, Error propagation},
URL = {DOI:10.1016/j.tcs.2002.10.004},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Grossman/04a,
AUTHOR = {Grossman, J.P.},
TITLE = {Appendix A: Report on the First International Clobber Tournament},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {313},
NUMBER = {3},
PAGES = {533-537},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {DOI:10.1016/j.tcs.2003.04.001},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Demaine-Fleischer-Fraenkel-Nowakowski/04,
AUTHOR = {Demaine, Erik D. and Fleischer, Rudolf and Fraenkel, Aviezri S. and Nowakowski, Richard J.},
TITLE = {Appendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {313},
NUMBER = {3},
PAGES = {539-543},
YEAR = {2004},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {DOI:10.1016/j.tcs.2003.09.012},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Charikar-Chen-Farach-Colton/04,
AUTHOR = {Charikar, Moses and Chen, Kevin and Farach-Colton, Martin},
TITLE = {Finding frequent items in data streams},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {312},
NUMBER = {1},
PAGES = {3-15},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {Frequent items, Streaming algorithm, Approximation},
URL = {DOI:10.1016/S0304-3975(03)00400-6},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Engebretsen-Holmerin-Russell/04,
AUTHOR = {Engebretsen, Lars and Holmerin, Jonas and Russell, Alexander},
TITLE = {Inapproximability results for equations over finite groups},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {312},
NUMBER = {1},
PAGES = {17-45},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {Optimization, Approximation, Groups, Finite groups, Probabilistically checkable proofs, NP-hardness},
URL = {DOI:10.1016/S0304-3975(03)00401-8},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Freund-Martin-Vide-Paun/04,
AUTHOR = {Freund, Rudolf and Mart{\'i}n-Vide, Carlos and P{\v{a}}un, Gheorghe},
TITLE = {From regulated rewriting to computing with membranes: Collapsing hierarchies},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {312},
NUMBER = {2-3},
PAGES = {143-188},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {Regulated rewriting, Membrane computing, Register machine, Matrix grammar, Programmed grammar, Graph-controlled grammar, P system, Recursively enumerable language, Non-terminal complexity},
URL = {DOI:10.1016/j.tcs.2003.08.006},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Hashiguchi-Sakakibara-Jimbo/04,
AUTHOR = {Hashiguchi, Kosaburo and Sakakibara, Naoto and Jimbo, Shuji},
TITLE = {Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {312},
NUMBER = {2-3},
PAGES = {251-266},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {Regular language, Free binoid, Regular binoid expression, Regular (monoid) expression},
URL = {DOI:10.1016/j.tcs.2003.09.005},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Karuno-Nagamochi/04,
AUTHOR = {Karuno, Yoshiyuki and Nagamochi, Hiroshi},
TITLE = {An approximability result of the multi-vehicle scheduling problem on a path with release and handling times},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {312},
NUMBER = {2-3},
PAGES = {267-280},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {Discrete optimization, Vehicle scheduling, Polynomial time approximation scheme, Dynamic programming},
URL = {DOI:10.1016/j.tcs.2003.09.010},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Frisco/04,
AUTHOR = {Frisco, Pierluigi},
TITLE = {The conformon-P system: A molecular and cell biology-inspired computability model},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {312},
NUMBER = {2-3},
PAGES = {295-319},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {DNA computing, Conformon, P system},
URL = {DOI:10.1016/j.tcs.2003.09.008},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Alber-Gramm-Guo-Niedermeier/04,
AUTHOR = {Alber, Jochen and Gramm, Jens and Guo, Jiong and Niedermeier, Rolf},
TITLE = {Computing the similarity of two sequences with nested arc annotations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {312},
NUMBER = {2-3},
PAGES = {337-358},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {Arc-annotated sequences, RNA secondary structure, Search tree, NP-completeness, Fixed-parameter tractability, Longest common subsequence},
URL = {DOI:10.1016/j.tcs.2003.10.026},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Ibarra-Dang/04,
AUTHOR = {Ibarra, Oscar H. and Dang, Zhe},
TITLE = {On two-way FA with monotonic counters and quadratic Diophantine equations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {312},
NUMBER = {2-3},
PAGES = {359-378},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {Two-way finite automaton, Monotonic counter, Reachability problem, Quadratic Diophantine equation, Presburger relation, Semilinear set, Decidability},
URL = {DOI:10.1016/j.tcs.2003.10.027},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Ibarra-Dang-Egecioglu/04,
AUTHOR = {Ibarra, Oscar H. and Dang, Zhe and Egecioglu, Omer},
TITLE = {Catalytic $P$ systems, semilinear sets, and vector addition systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {312},
NUMBER = {2-3},
PAGES = {379-399},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {Membrane computing, Catalytic system, Semilinear set, Vector addition system, Reachability problem},
URL = {http://dx.doi.org/10.1016/j.tcs.2003.10.028},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Habib-Nourine-Raynaud-Thierry/04,
AUTHOR = {Habib, M. and Nourine, L. and Raynaud, O. and Thierry, E.},
TITLE = {Computational aspects of the 2-dimension of partially ordered sets},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {312},
NUMBER = {2-3},
PAGES = {401-431},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {Partially ordered sets, Trees, Boolean lattices, Embeddings, Bit-vector encodings, 2-dimension, Approximation algorithms},
URL = {DOI:10.1016/j.tcs.2003.10.029},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Gomez-Pin/04,
AUTHOR = {G{\'o}mez, Antonio Cano and Pin, Jean-{\'E}ric},
TITLE = {Shuffle on positive varieties of languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {312},
NUMBER = {2-3},
PAGES = {433-461},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {Finite Automata, Languages, Ordered semigroups, Varieties shuffle},
URL = {DOI:10.1016/j.tcs.2003.10.034},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Doerr/04b,
AUTHOR = {Doerr, Benjamin},
TITLE = {Typical rounding problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {312},
NUMBER = {2-3},
PAGES = {463-477},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {Rounding, Discrepancy, Games},
URL = {DOI:10.1016/j.tcs.2003.10.035},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Kfoury-Wells/04,
AUTHOR = {Kfoury, A.J. and Wells, J.B.},
TITLE = {Principality and type inference for intersection types using expansion variables},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {311},
NUMBER = {1-3},
PAGES = {1-70},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
URL = {DOI:10.1016/j.tcs.2003.10.032},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Hermida-Mateus/04,
AUTHOR = {Hermida, Claudio and Mateus, P.},
TITLE = {Paracategories II: Adjunctions, fibrations and examples from probabilistic automata theory},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {311},
NUMBER = {1-3},
PAGES = {71-103},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {Paracategories, Partial multicategories, Probabilistic automata},
URL = {DOI:10.1016/S0304-3975(03)00317-7},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Joachimski/04,
AUTHOR = {Joachimski, Felix},
TITLE = {Confluence of the coinductive $\lambda$-calculus},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {311},
NUMBER = {1-3},
PAGES = {105-119},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
URL = {DOI:10.1016/S0304-3975(03)00324-4},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Igarashi-Kobayashi/04,
AUTHOR = {Igarashi, Atsushi and Kobayashi, Naoki},
TITLE = {A generic type system for the $\pi$-calculus},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {311},
NUMBER = {1-3},
PAGES = {121-163},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
URL = {DOI:10.1016/S0304-3975(03)00325-6},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Jiao-Cheung-Lu/04,
AUTHOR = {Jiao, Li and Cheung, To-Yat and Lu, Weiming},
TITLE = {On liveness and boundedness of asymmetric choice nets},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {311},
NUMBER = {1-3},
PAGES = {165-197},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {Analysis, Asymmetric choice nets, Characterization, Liveness and boundedness, Well-formedness, Theory of Petri nets},
URL = {DOI:10.1016/S0304-3975(03)00359-1},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Akama/04,
AUTHOR = {Akama, Yohji},
TITLE = {Limiting partial combinatory algebras},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {311},
NUMBER = {1-3},
PAGES = {199-220},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {Realizability interpretation, Partial equivalence relation, Limiting recursive, $\lambda\mu$-calculus},
URL = {DOI:10.1016/S0304-3975(03)00360-8},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Dovier-Piazza-Policriti/04,
AUTHOR = {Dovier, Agostino and Piazza, Carla and Policriti, Alberto},
TITLE = {An efficient algorithm for computing bisimulation equivalence},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {311},
NUMBER = {1-3},
PAGES = {221-256},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {Bisimulation, Non-well-founded sets, Rank-based methods, Verification, OBDDs},
URL = {DOI:10.1016/S0304-3975(03)00361-X},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Adamek-Porst/04,
AUTHOR = {Ad{\'a}mek, J. and Porst, H.-E.},
TITLE = {On tree coalgebras and coalgebra presentations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {311},
NUMBER = {1-3},
PAGES = {257-283},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {Coalgebras, $\Sigma$-labelled trees, $\lambda$-presentable objects and categories, Accessible and bounded functors},
URL = {DOI:10.1016/S0304-3975(03)00378-5},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Doberkat-Omodeo/04,
AUTHOR = {Doberkat, Ernst-Erich and Omodeo, Eugenio G.},
TITLE = {ER modelling from first relational principles},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {311},
NUMBER = {1-3},
PAGES = {285-323},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {Entity-Relationship models (static and dynamic view), Relation algebra, Relational foundations of data modelling},
URL = {DOI:10.1016/j.tcs.2003.09.001},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Bailey-Dong-Ramamohanarao/04,
AUTHOR = {Bailey, James and Dong, Guozhu and Ramamohanarao, Kotagiri},
TITLE = {On the decidability of the termination problem of active database systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {311},
NUMBER = {1-3},
PAGES = {389-437},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
URL = {DOI:10.1016/j.tcs.2003.09.003},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Diaconescu/04a,
AUTHOR = {Diaconescu, R{\v{a}}zvan},
TITLE = {Interpolation in Grothendieck institutions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {311},
NUMBER = {1-3},
PAGES = {439-461},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {Craig interpolation, Grothendieck institutions, Algebraic specification},
URL = {DOI:10.1016/j.tcs.2003.10.030},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Alpuente-Falaschi-Moreno-Vidal/04,
AUTHOR = {Alpuente, Mar{\'{\i}}a and Falaschi, Moreno and Moreno, Gin{\'e}s and Vidal, Germ{\'a}n},
TITLE = {Rules + strategies for transforming lazy functional logic programs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {311},
NUMBER = {1-3},
PAGES = {479-525},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {Program transformation, Functional logic programming, Strategies},
URL = {DOI:10.1016/j.tcs.2003.10.033},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Finkelstein-Freyd-Lipton/04,
AUTHOR = {Finkelstein, Stacy E. and Freyd, Peter and Lipton, James},
TITLE = {Erratum to ''A new framework for declarative programming''},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {311},
NUMBER = {1-3},
PAGES = {527-527},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
URL = {http://dx.doi.org/10.1016/j.tcs.2003.09.011},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
NOTE = {Originally in Theor.~Comput.~Sci., Vol. 300, 2003, No. 1-3, 91-160},
}
@article{Dai-Lathrop-Lutz-Mayordomo/04,
AUTHOR = {Dai, Jack J. and Lathrop, James I. and Lutz, Jack H. and Mayordomo, Elvira},
TITLE = {Finite-state dimension},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {310},
NUMBER = {1-3},
PAGES = {1-33},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {Bounded-depth circuit, Finite-state compressor, Finite-state dimension, Finite-state gambler, Gale, Hausdorff dimension, Information-lossless compressor, Martingale, Normal sequence},
URL = {DOI:10.1016/S0304-3975(03)00244-5},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Chemillier/04,
AUTHOR = {Chemillier, Marc},
TITLE = {Synchronization of musical words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {310},
NUMBER = {1-3},
PAGES = {35-60},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {Periodic infinite words, Rational transductions, Literal shuffle, Rational order relations, Music formalization},
URL = {DOI:10.1016/S0304-3975(03)00309-8},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Choquet-Geniet-Grolleau/04,
AUTHOR = {Choquet-Geniet, Annie and Grolleau, Emmanuel},
TITLE = {Minimal schedulability interval for real-time systems of periodic tasks with offsets},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {310},
NUMBER = {1-3},
PAGES = {117-134},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {Real-time systems, Schedulability analysis, Idle task, Acyclic idle slots, Processor request diagram, Schedulability interval, Blocking chains},
URL = {DOI:10.1016/S0304-3975(03)00362-1},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Angel-Bampis-Gourves/04,
AUTHOR = {Angel, Eric and Bampis, Evripidis and Gourv{\`e}s, Laurent},
TITLE = {Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {310},
NUMBER = {1-3},
PAGES = {135-146},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {Local search, Multicriteria TSP, Approximation algorithms},
URL = {DOI:10.1016/S0304-3975(03)00376-1},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Leung-Podolskiy/04,
AUTHOR = {Leung, Hing and Podolskiy, Viktor},
TITLE = {The limitedness problem on distance automata: Hashiguchi's method revisited},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {310},
NUMBER = {1-3},
PAGES = {147-158},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
URL = {DOI:10.1016/S0304-3975(03)00377-3},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Lavi-Nisan/04,
AUTHOR = {Lavi, Ron and Nisan, Noam},
TITLE = {Competitive analysis of incentive compatible on-line auctions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {310},
NUMBER = {1-3},
PAGES = {159-180},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
URL = {DOI:10.1016/S0304-3975(03)00391-8},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Jenkinson-Zamboni/04,
AUTHOR = {Jenkinson, Oliver and Zamboni, Luca Q.},
TITLE = {Characterisations of balanced words via orderings},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {310},
NUMBER = {1-3},
PAGES = {247-271},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {Balanced, Sturmian, Lexicographic order},
URL = {DOI:10.1016/S0304-3975(03)00397-9},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Chuan/04,
AUTHOR = {Chuan, Wai-Fong},
TITLE = {Moments of conjugacy classes of binary words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {310},
NUMBER = {1-3},
PAGES = {273-285},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {$\alpha$-Word, Moment, Characteristic word},
URL = {DOI:10.1016/S0304-3975(03)00398-0},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Biedl-Brejova-Demaine-Hamel-Lopez-Ortiz-Vinar/04,
AUTHOR = {Biedl, Therese and Brejov{\v{a}}, Bro{\v{n}}a and Demaine, Erik D. and Hamel, Ang{\`e}le M. and L{\'o}pez-Ortiz, Alejandro and Vina{\v{r}}, Tom{\'a}{\v{s}}},
TITLE = {Finding hidden independent sets in interval graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {310},
NUMBER = {1-3},
PAGES = {287-307},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {Games, Interval graphs, Independent set, Adaptive algorithms, Gene finding, Battleship},
URL = {DOI:10.1016/S0304-3975(03)00422-5},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Groult-Leonard-Mouchard/04,
AUTHOR = {Groult, Richard and L{\'e}onard, Martine and Mouchard, Laurent},
TITLE = {Speeding up the detection of evolutive tandem repeats},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {310},
NUMBER = {1-3},
PAGES = {309-328},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {Evolutive tandem repeats, Hamming distance, DNA sequences},
URL = {DOI:10.1016/S0304-3975(03)00423-7},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Brandstadt-Dragan-Le-Le/04,
AUTHOR = {Brandst{\"a}dt, Andreas and Dragan, Feodor F. and Le, Ho{\`a}ng-Oanh and Le, Van Bang},
TITLE = {Tree spanners on chordal graphs: Complexity and algorithms},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {310},
NUMBER = {1-3},
PAGES = {329-354},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {Tree spanners, Spanners, Chordal graphs, Distance, Spanning trees, NP-completeness, Efficient graph algorithms},
URL = {DOI:10.1016/S0304-3975(03)00424-9},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Bjorklund-Sandberg-Vorobyov/04a,
AUTHOR = {Bj{\"o}rklund, Henrik and Sandberg, Sven and Vorobyov, Sergei},
TITLE = {Memoryless determinacy of parity and mean payoff games: A simple proof},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {310},
NUMBER = {1-3},
PAGES = {365-378},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
URL = {DOI:10.1016/S0304-3975(03)00427-4},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Kunc/04a,
AUTHOR = {Kunc, Michal},
TITLE = {Undecidability of the trace coding problem and some decidable cases},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {310},
NUMBER = {1-3},
PAGES = {393-456},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {Partial commutativity, Trace monoid, Coding, Concurrency},
URL = {DOI:10.1016/j.tcs.2003.08.004},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Ahn-Cheng-Cheong-Golin-van_Oostrum/04,
AUTHOR = {Ahn, Hee-Kap and Cheng, Siu-Wing and Cheong, Otfried and Golin, Mordecai and van Oostrum, Ren{\'e}},
TITLE = {Competitive facility location: The Voronoi game},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {310},
NUMBER = {1-3},
PAGES = {457-467},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {Facility location, Game theory},
URL = {DOI:10.1016/j.tcs.2003.09.004},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Cervelle-Durand/04,
AUTHOR = {Cervelle, Julien and Durand, Bruno},
TITLE = {Tilings: Recursivity and regularity},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {310},
NUMBER = {1-3},
PAGES = {469-477},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {Tilings, Recursivity, Quasiperiodicity},
URL = {DOI:10.1016/S0304-3975(03)00242-1},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Dukes-Ling/04,
AUTHOR = {Dukes, P. and Ling, Alan C.H.},
TITLE = {A combinatorial error bound for $t$-point-based sampling},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {310},
NUMBER = {1-3},
PAGES = {479-488},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
URL = {DOI:10.1016/S0304-3975(03)00280-9},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Chalopin-Leung/04,
AUTHOR = {Chalopin, J{\'e}r{\'e}mie and Leung, Hing},
TITLE = {On factorization forests of finite height},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {310},
NUMBER = {1-3},
PAGES = {489-499},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {Semigroup morphism, Ramseyan factorization forest},
URL = {DOI:10.1016/S0304-3975(03)00344-X},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Alekhnovich/04,
AUTHOR = {Alekhnovich, Michael},
TITLE = {Mutilated chessboard problem is exponentially hard for resolution},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {310},
NUMBER = {1-3},
PAGES = {513-525},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {Propositional proof complexity, Resolution, Lower bounds},
URL = {DOI:10.1016/S0304-3975(03)00395-5},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}
@article{Lopez-Ortiz-Schuierer/04,
AUTHOR = {L{\'o}pez-Ortiz, Alejandro and Schuierer, Sven},
TITLE = {On-line parallel heuristics, processor scheduling and robot searching under the competitive framework},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {310},
NUMBER = {1-3},
PAGES = {527-537},
YEAR = {2004},
EDITOR = {Ausiello, G. and Mislove, M.W. and Sannella, D.},
KEYWORDS = {On-line searching, Competitive ratio, Scheduling Heuristic scheduling, Contract algorithms},
URL = {DOI:10.1016/j.tcs.2003.08.001},
PUBLISHER = {Elsevier Science Publishers B.V.},
ADDRESS = {Amsterdam-London-New York-Oxford-Paris-Shannon-Tokyo},
}