Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/tcs/tcs459.bht:"
@article{DBLP:journals/tcs/AnanthD12, author = {Prabhanjan Vijendra Ananth and Ambedkar Dukkipati}, title = {Complexity of Gr{\"{o}}bner basis detection and border basis detection}, journal = {Theor. Comput. Sci.}, volume = {459}, pages = {1--15}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.08.002}, doi = {10.1016/J.TCS.2012.08.002}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/AnanthD12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/AubrunB12, author = {Nathalie Aubrun and Marie{-}Pierre B{\'{e}}al}, title = {Tree-shifts of finite type}, journal = {Theor. Comput. Sci.}, volume = {459}, pages = {16--25}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.07.020}, doi = {10.1016/J.TCS.2012.07.020}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/AubrunB12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BarbayFN12, author = {J{\'{e}}r{\'{e}}my Barbay and Johannes Fischer and Gonzalo Navarro}, title = {LRM-Trees: Compressed indices, adaptive sorting, and compressed permutations}, journal = {Theor. Comput. Sci.}, volume = {459}, pages = {26--41}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.08.010}, doi = {10.1016/J.TCS.2012.08.010}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BarbayFN12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BienkowskiK12, author = {Marcin Bienkowski and Jaroslaw Kutylowski}, title = {The k-resource problem in uniform metric spaces}, journal = {Theor. Comput. Sci.}, volume = {459}, pages = {42--54}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.06.026}, doi = {10.1016/J.TCS.2012.06.026}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BienkowskiK12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BienvenuP12, author = {Laurent Bienvenu and Christopher P. Porter}, title = {Strong reductions in effective randomness}, journal = {Theor. Comput. Sci.}, volume = {459}, pages = {55--68}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.06.031}, doi = {10.1016/J.TCS.2012.06.031}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BienvenuP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BoudaPP12, author = {Jan Bouda and Matej Pivoluska and Martin Plesch}, title = {Improving the Hadamard extractor}, journal = {Theor. Comput. Sci.}, volume = {459}, pages = {69--76}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.07.030}, doi = {10.1016/J.TCS.2012.07.030}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BoudaPP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BourgeoisCEP12, author = {Nicolas Bourgeois and Federico Della Croce and Bruno Escoffier and Vangelis Th. Paschos}, title = {Algorithms for dominating clique problems}, journal = {Theor. Comput. Sci.}, volume = {459}, pages = {77--88}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.07.016}, doi = {10.1016/J.TCS.2012.07.016}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BourgeoisCEP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ChangPP12, author = {Gerard J. Chang and B. S. Panda and Dinabandhu Pradhan}, title = {Complexity of distance paired-domination problem in graphs}, journal = {Theor. Comput. Sci.}, volume = {459}, pages = {89--99}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.08.024}, doi = {10.1016/J.TCS.2012.08.024}, timestamp = {Wed, 09 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/ChangPP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CicaleseJLV12, author = {Ferdinando Cicalese and Tobias Jacobs and Eduardo Sany Laber and Caio Dias Valentim}, title = {The binary identification problem for weighted trees}, journal = {Theor. Comput. Sci.}, volume = {459}, pages = {100--112}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.06.023}, doi = {10.1016/J.TCS.2012.06.023}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CicaleseJLV12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Cincotti12, author = {Alessandro Cincotti}, title = {The lattice structure of n-player games}, journal = {Theor. Comput. Sci.}, volume = {459}, pages = {113--119}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.06.017}, doi = {10.1016/J.TCS.2012.06.017}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Cincotti12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.