@article{Ananth-Dukkipati/12a,
AUTHOR = {Ananth, Prabhanjan V. and Dukkipati, Ambedkar},
TITLE = {Complexity of Gr{\"o}bner basis detection and border basis detection},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {459},
PAGES = {1-15},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {border bases, zero-dimensional ideals, gr{\"o}bner basis detection, complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512007505},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Aubrun-Beal/12,
AUTHOR = {Aubrun, Nathalie and B{\'e}al, Marie-Pierre},
TITLE = {Tree-shifts of finite type},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {459},
PAGES = {16-25},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {shifts of finite type, tree automata, symbolic dynamics},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512007153},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Barbay-Fischer-Navarro/12,
AUTHOR = {Barbay, J{\'e}r{\'e}my and Fischer, Johannes and Navarro, Gonzalo},
TITLE = {LRM-trees: Compressed indices, adaptive sorting, and compressed permutations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {459},
PAGES = {26-41},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {compressed data structures, range minimum queries, adaptive sorting algorithms, data structures for permutations},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512007712},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bienkowski-Kutylowski/12,
AUTHOR = {Bienkowski, Marcin and Kuty{\l}owski, Jaros{\l}aw},
TITLE = {The $k$-resource problem in uniform metric spaces},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {459},
PAGES = {42-54},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {k -server problem, online algorithms, competitive analysis},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512006214},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bienvenu-Porter/12,
AUTHOR = {Bienvenu, Laurent and Porter, Christopher},
TITLE = {Strong reductions in effective randomness},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {459},
PAGES = {55-68},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {algorithmic randomness, demuth's theorem, computable analysis},
URL = {http://www.sciencedirect.com/science/article/pii/S030439751200641X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bouda-Pivoluska-Plesch/12,
AUTHOR = {Bouda, Jan and Pivoluska, Matej and Plesch, Martin},
TITLE = {Improving the Hadamard extractor},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {459},
PAGES = {69-76},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {weak randomness, randomness extractor, hadamard matrix},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512007384},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bourgeois-Della_Croce-Escoffier-Paschos/12,
AUTHOR = {Bourgeois, N. and Della Croce, F. and Escoffier, B. and Paschos, V.Th.},
TITLE = {Algorithms for dominating clique problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {459},
PAGES = {77-88},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {dominating clique, exponential time algorithms, exact and approximation algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512007116},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chang-Panda-Pradhan/12,
AUTHOR = {Chang, Gerard J. and Panda, B.S. and Pradhan, D.},
TITLE = {Complexity of distance paired-domination problem in graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {459},
PAGES = {89-99},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {distance k -dominating set, distance k -paired-dominating set, strongly chordal graph, undirected path graph, np-complete, approximation algorithm, apx-complete},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512007980},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cicalese-Jacobs-Laber-Valentim/12,
AUTHOR = {Cicalese, Ferdinando and Jacobs, Tobias and Laber, Eduardo and Valentim, Caio},
TITLE = {The binary identification problem for weighted trees},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {459},
PAGES = {100-112},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512006056},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cincotti/12,
AUTHOR = {Cincotti, Alessandro},
TITLE = {The lattice structure of $n$-player games},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {459},
PAGES = {113-119},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {lattice, n -player game},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512005865},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}