Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/iandc/iandc294.bht:"
@article{DBLP:journals/iandc/BenerecettiMP23, author = {Massimo Benerecetti and Fabio Mogavero and Adriano Peron}, title = {Taming Strategy Logic: Non-Recurrent Fragments}, journal = {Inf. Comput.}, volume = {294}, pages = {105081}, year = {2023}, url = {https://doi.org/10.1016/j.ic.2023.105081}, doi = {10.1016/J.IC.2023.105081}, timestamp = {Wed, 01 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/BenerecettiMP23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/BozzelliMPS23, author = {Laura Bozzelli and Angelo Montanari and Adriano Peron and Pietro Sala}, title = {Pspace-completeness of the temporal logic of sub-intervals and suffixes}, journal = {Inf. Comput.}, volume = {294}, pages = {105083}, year = {2023}, url = {https://doi.org/10.1016/j.ic.2023.105083}, doi = {10.1016/J.IC.2023.105083}, timestamp = {Wed, 01 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/BozzelliMPS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/BruseL23, author = {Florian Bruse and Martin Lange}, title = {The tail-recursive fragment of timed recursive {CTL}}, journal = {Inf. Comput.}, volume = {294}, pages = {105084}, year = {2023}, url = {https://doi.org/10.1016/j.ic.2023.105084}, doi = {10.1016/J.IC.2023.105084}, timestamp = {Mon, 09 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iandc/BruseL23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/DanielTRS23, author = {Renu Mary Daniel and Anitha Thomas and Elijah Blessing Rajsingh and Salaja Silas}, title = {A strengthened eCK secure identity based authenticated key agreement protocol based on the standard {CDH} assumption}, journal = {Inf. Comput.}, volume = {294}, pages = {105067}, year = {2023}, url = {https://doi.org/10.1016/j.ic.2023.105067}, doi = {10.1016/J.IC.2023.105067}, timestamp = {Sat, 14 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iandc/DanielTRS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/DiazDominguezN23, author = {Diego D{\'{\i}}az{-}Dom{\'{\i}}nguez and Gonzalo Navarro}, title = {Efficient construction of the {BWT} for repetitive text using string compression}, journal = {Inf. Comput.}, volume = {294}, pages = {105088}, year = {2023}, url = {https://doi.org/10.1016/j.ic.2023.105088}, doi = {10.1016/J.IC.2023.105088}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/DiazDominguezN23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/DyresonA23, author = {Curtis E. Dyreson and M. A. Manazir Ahsan}, title = {Achieving sequenced {SQL} with log-segmented timestamps}, journal = {Inf. Comput.}, volume = {294}, pages = {105065}, year = {2023}, url = {https://doi.org/10.1016/j.ic.2023.105065}, doi = {10.1016/J.IC.2023.105065}, timestamp = {Sat, 14 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iandc/DyresonA23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/FengGW23, author = {Weiming Feng and Heng Guo and Jiaheng Wang}, title = {Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields}, journal = {Inf. Comput.}, volume = {294}, pages = {105066}, year = {2023}, url = {https://doi.org/10.1016/j.ic.2023.105066}, doi = {10.1016/J.IC.2023.105066}, timestamp = {Wed, 01 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/FengGW23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/FengL23, author = {Yuan Feng and Sanjiang Li}, title = {Abstract interpretation, Hoare logic, and incorrectness logic for quantum programs}, journal = {Inf. Comput.}, volume = {294}, pages = {105077}, year = {2023}, url = {https://doi.org/10.1016/j.ic.2023.105077}, doi = {10.1016/J.IC.2023.105077}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/FengL23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/GiancarloMRRS23, author = {Raffaele Giancarlo and Giovanni Manzini and Antonio Restivo and Giovanna Rosone and Marinella Sciortino}, title = {A new class of string transformations for compressed text indexing}, journal = {Inf. Comput.}, volume = {294}, pages = {105068}, year = {2023}, url = {https://doi.org/10.1016/j.ic.2023.105068}, doi = {10.1016/J.IC.2023.105068}, timestamp = {Wed, 01 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/GiancarloMRRS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/Glabbeek23, author = {Rob van Glabbeek}, title = {Modelling mutual exclusion in a process algebra with time-outs}, journal = {Inf. Comput.}, volume = {294}, pages = {105079}, year = {2023}, url = {https://doi.org/10.1016/j.ic.2023.105079}, doi = {10.1016/J.IC.2023.105079}, timestamp = {Wed, 01 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/Glabbeek23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/IbarraM23a, author = {Oscar H. Ibarra and Ian McQuillan}, title = {On the complexity of decision problems for some classes of machines and applications}, journal = {Inf. Comput.}, volume = {294}, pages = {105080}, year = {2023}, url = {https://doi.org/10.1016/j.ic.2023.105080}, doi = {10.1016/J.IC.2023.105080}, timestamp = {Sat, 14 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iandc/IbarraM23a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/JanssonMS23, author = {Jesper Jansson and Konstantinos Mampentzidis and T. P. Sandhya}, title = {Building a small and informative phylogenetic supertree}, journal = {Inf. Comput.}, volume = {294}, pages = {105082}, year = {2023}, url = {https://doi.org/10.1016/j.ic.2023.105082}, doi = {10.1016/J.IC.2023.105082}, timestamp = {Wed, 24 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iandc/JanssonMS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/LutzLM23, author = {Jack H. Lutz and Neil Lutz and Elvira Mayordomo}, title = {Extending the reach of the point-to-set principle}, journal = {Inf. Comput.}, volume = {294}, pages = {105078}, year = {2023}, url = {https://doi.org/10.1016/j.ic.2023.105078}, doi = {10.1016/J.IC.2023.105078}, timestamp = {Wed, 01 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/LutzLM23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/MalettiS23, author = {Andreas Maletti and Lena Katharina Schiffer}, title = {Combinatory categorial grammars as generators of weighted forests}, journal = {Inf. Comput.}, volume = {294}, pages = {105075}, year = {2023}, url = {https://doi.org/10.1016/j.ic.2023.105075}, doi = {10.1016/J.IC.2023.105075}, timestamp = {Sun, 22 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iandc/MalettiS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/PengX23, author = {Junqiang Peng and Mingyu Xiao}, title = {Further improvements for {SAT} in terms of formula length}, journal = {Inf. Comput.}, volume = {294}, pages = {105085}, year = {2023}, url = {https://doi.org/10.1016/j.ic.2023.105085}, doi = {10.1016/J.IC.2023.105085}, timestamp = {Mon, 08 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/PengX23.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.