default search action
Search dblp for Publications
export results for "toc:db/journals/iandc/iandc174.bht:"
@article{DBLP:journals/iandc/AbadiFG02, author = {Mart{\'{\i}}n Abadi and C{\'{e}}dric Fournet and Georges Gonthier}, title = {Secure Implementation of Channel Abstractions}, journal = {Inf. Comput.}, volume = {174}, number = {1}, pages = {37--83}, year = {2002}, url = {https://doi.org/10.1006/inco.2002.3086}, doi = {10.1006/INCO.2002.3086}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/AbadiFG02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/AlonKKMS02, author = {Noga Alon and Haim Kaplan and Michael Krivelevich and Dahlia Malkhi and Julien P. Stern}, title = {Scalable Secure Storage When Half the System Is Faulty}, journal = {Inf. Comput.}, volume = {174}, number = {2}, pages = {203--213}, year = {2002}, url = {https://doi.org/10.1006/inco.2002.3148}, doi = {10.1006/INCO.2002.3148}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/AlonKKMS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/ApostolicoA02, author = {Alberto Apostolico and Mikhail J. Atallah}, title = {Compact Recognizers of Episode Sequences}, journal = {Inf. Comput.}, volume = {174}, number = {2}, pages = {180--192}, year = {2002}, url = {https://doi.org/10.1006/inco.2002.3143}, doi = {10.1006/INCO.2002.3143}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/ApostolicoA02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/BlassGB02, author = {Andreas Blass and Yuri Gurevich and Jan Van den Bussche}, title = {Abstract State Machines and Computationally Complete Query Languages}, journal = {Inf. Comput.}, volume = {174}, number = {1}, pages = {20--36}, year = {2002}, url = {https://doi.org/10.1006/inco.2001.3067}, doi = {10.1006/INCO.2001.3067}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/BlassGB02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/CaseOSS02, author = {John Case and Matthias Ott and Arun Sharma and Frank Stephan}, title = {Learning to Win Process-Control Games Watching Game-Masters}, journal = {Inf. Comput.}, volume = {174}, number = {1}, pages = {1--19}, year = {2002}, url = {https://doi.org/10.1006/inco.2000.2946}, doi = {10.1006/INCO.2000.2946}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/CaseOSS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/DemriS02, author = {St{\'{e}}phane Demri and Philippe Schnoebelen}, title = {The Complexity of Propositional Linear Temporal Logics in Simple Cases}, journal = {Inf. Comput.}, volume = {174}, number = {1}, pages = {84--103}, year = {2002}, url = {https://doi.org/10.1006/inco.2001.3094}, doi = {10.1006/INCO.2001.3094}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/DemriS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/DurandM02, author = {Arnaud Durand and Malika More}, title = {Nonerasing, Counting, and Majority over the Linear Time Hierarchy}, journal = {Inf. Comput.}, volume = {174}, number = {2}, pages = {132--142}, year = {2002}, url = {https://doi.org/10.1006/inco.2001.3084}, doi = {10.1006/INCO.2001.3084}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/DurandM02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/GivanMWK02, author = {Robert Givan and David A. McAllester and Carl Witty and Dexter Kozen}, title = {Tarskian Set Constraints}, journal = {Inf. Comput.}, volume = {174}, number = {2}, pages = {105--131}, year = {2002}, url = {https://doi.org/10.1006/inco.2001.2973}, doi = {10.1006/INCO.2001.2973}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/GivanMWK02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/Seiden02, author = {Steven S. Seiden}, title = {A General Decomposition Theorem for the k-Server Problem}, journal = {Inf. Comput.}, volume = {174}, number = {2}, pages = {193--202}, year = {2002}, url = {https://doi.org/10.1006/inco.2002.3144}, doi = {10.1006/INCO.2002.3144}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/Seiden02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/YoshidaH02, author = {Nobuko Yoshida and Matthew Hennessy}, title = {Assigning Types to Processes}, journal = {Inf. Comput.}, volume = {174}, number = {2}, pages = {143--179}, year = {2002}, url = {https://doi.org/10.1006/inco.2002.3113}, doi = {10.1006/INCO.2002.3113}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/YoshidaH02.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.