Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/tcs/tcs424.bht:"
@article{DBLP:journals/tcs/BezhanishviliH12, author = {Nick Bezhanishvili and Ian M. Hodkinson}, title = {Sahlqvist theorem for modal fixed point logic}, journal = {Theor. Comput. Sci.}, volume = {424}, pages = {1--19}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.11.026}, doi = {10.1016/J.TCS.2011.11.026}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/BezhanishviliH12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Ehrhard12, author = {Thomas Ehrhard}, title = {The Scott model of linear logic is the extensional collapse of its relational model}, journal = {Theor. Comput. Sci.}, volume = {424}, pages = {20--45}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2011.11.027}, doi = {10.1016/J.TCS.2011.11.027}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Ehrhard12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GolasLEO12, author = {Ulrike Golas and Leen Lambers and Hartmut Ehrig and Fernando Orejas}, title = {Attributed graph transformation with inheritance: Efficient conflict detection and local confluence analysis using abstract critical pairs}, journal = {Theor. Comput. Sci.}, volume = {424}, pages = {46--68}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.01.032}, doi = {10.1016/J.TCS.2012.01.032}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/GolasLEO12.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.