Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/acta/acta47.bht:"
@article{DBLP:journals/acta/AcetoFIM10, author = {Luca Aceto and Wan J. Fokkink and Anna Ing{\'{o}}lfsd{\'{o}}ttir and Mohammad Reza Mousavi}, title = {Lifting non-finite axiomatizability results to extensions of process algebras}, journal = {Acta Informatica}, volume = {47}, number = {3}, pages = {147--177}, year = {2010}, url = {https://doi.org/10.1007/s00236-010-0114-7}, doi = {10.1007/S00236-010-0114-7}, timestamp = {Sat, 11 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/acta/AcetoFIM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acta/BerghammerW10, author = {Rudolf Berghammer and Michael Winter}, title = {Embedding mappings and splittings with applications}, journal = {Acta Informatica}, volume = {47}, number = {2}, pages = {77--110}, year = {2010}, url = {https://doi.org/10.1007/s00236-009-0109-4}, doi = {10.1007/S00236-009-0109-4}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/acta/BerghammerW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acta/BoyarEKL10, author = {Joan Boyar and Martin R. Ehmsen and Jens S. Kohrt and Kim S. Larsen}, title = {A theoretical comparison of {LRU} and {LRU-K}}, journal = {Acta Informatica}, volume = {47}, number = {7-8}, pages = {359--374}, year = {2010}, url = {https://doi.org/10.1007/s00236-010-0123-6}, doi = {10.1007/S00236-010-0123-6}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/acta/BoyarEKL10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acta/Cheng-ChiCheng-Chihng10, author = {Cheng{-}Chi Huang}, title = {A note on pure codes}, journal = {Acta Informatica}, volume = {47}, number = {5-6}, pages = {347--357}, year = {2010}, url = {https://doi.org/10.1007/s00236-010-0122-7}, doi = {10.1007/S00236-010-0122-7}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/acta/Cheng-ChiCheng-Chihng10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acta/DaxKL10, author = {Christian Dax and Felix Klaedtke and Martin Lange}, title = {On regular temporal logics with past}, journal = {Acta Informatica}, volume = {47}, number = {4}, pages = {251--277}, year = {2010}, url = {https://doi.org/10.1007/s00236-010-0118-3}, doi = {10.1007/S00236-010-0118-3}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/acta/DaxKL10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acta/Do10, author = {Tien Van Do}, title = {{M/M/1} retrial queue with working vacations}, journal = {Acta Informatica}, volume = {47}, number = {1}, pages = {67--75}, year = {2010}, url = {https://doi.org/10.1007/s00236-009-0110-y}, doi = {10.1007/S00236-009-0110-Y}, timestamp = {Wed, 18 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/acta/Do10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acta/DolevT10, author = {Shlomi Dolev and Nir Tzachar}, title = {Randomization adaptive self-stabilization}, journal = {Acta Informatica}, volume = {47}, number = {5-6}, pages = {313--323}, year = {2010}, url = {https://doi.org/10.1007/s00236-010-0119-2}, doi = {10.1007/S00236-010-0119-2}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/acta/DolevT10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acta/Epstein10, author = {Leah Epstein}, title = {Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy}, journal = {Acta Informatica}, volume = {47}, number = {7-8}, pages = {375--389}, year = {2010}, url = {https://doi.org/10.1007/s00236-010-0124-5}, doi = {10.1007/S00236-010-0124-5}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/acta/Epstein10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acta/FanH10, author = {Chen{-}Ming Fan and Cheng{-}Chih Huang}, title = {A note on prefix primitive words}, journal = {Acta Informatica}, volume = {47}, number = {7-8}, pages = {413--423}, year = {2010}, url = {https://doi.org/10.1007/s00236-010-0126-3}, doi = {10.1007/S00236-010-0126-3}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/acta/FanH10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acta/FanHSC10, author = {Chen{-}Ming Fan and Cheng{-}Chih Huang and Huei{-}Jan Shyr and Kuo{-}Hsiang Chen}, title = {A note on autodense related languages}, journal = {Acta Informatica}, volume = {47}, number = {4}, pages = {209--219}, year = {2010}, url = {https://doi.org/10.1007/s00236-010-0116-5}, doi = {10.1007/S00236-010-0116-5}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/acta/FanHSC10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acta/HabermehlIV10, author = {Peter Habermehl and Radu Iosif and Tom{\'{a}}s Vojnar}, title = {Automata-based verification of programs with tree updates}, journal = {Acta Informatica}, volume = {47}, number = {1}, pages = {1--31}, year = {2010}, url = {https://doi.org/10.1007/s00236-009-0108-5}, doi = {10.1007/S00236-009-0108-5}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/acta/HabermehlIV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acta/HochbaumL10, author = {Dorit S. Hochbaum and Asaf Levin}, title = {How to allocate review tasks for robust ranking}, journal = {Acta Informatica}, volume = {47}, number = {5-6}, pages = {325--345}, year = {2010}, url = {https://doi.org/10.1007/s00236-010-0120-9}, doi = {10.1007/S00236-010-0120-9}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/acta/HochbaumL10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acta/JaghooriSMKM10, author = {Mohammad Mahdi Jaghoori and Marjan Sirjani and Mohammad Reza Mousavi and Ehsan Khamespanah and Ali Movaghar}, title = {Symmetry and partial order reduction techniques in model checking Rebeca}, journal = {Acta Informatica}, volume = {47}, number = {1}, pages = {33--66}, year = {2010}, url = {https://doi.org/10.1007/s00236-009-0111-x}, doi = {10.1007/S00236-009-0111-X}, timestamp = {Wed, 12 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/acta/JaghooriSMKM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acta/KimY10, author = {Ik{-}Soon Kim and Kwangkeun Yi}, title = {{LR} error repair using the A* algorithm}, journal = {Acta Informatica}, volume = {47}, number = {3}, pages = {179--207}, year = {2010}, url = {https://doi.org/10.1007/s00236-010-0115-6}, doi = {10.1007/S00236-010-0115-6}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/acta/KimY10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acta/KutribMO10, author = {Martin Kutrib and Hartmut Messerschmidt and Friedrich Otto}, title = {On stateless deterministic restarting automata}, journal = {Acta Informatica}, volume = {47}, number = {7-8}, pages = {391--412}, year = {2010}, url = {https://doi.org/10.1007/s00236-010-0125-4}, doi = {10.1007/S00236-010-0125-4}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/acta/KutribMO10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acta/LanotteMT10, author = {Ruggero Lanotte and Andrea Maggiolo{-}Schettini and Angelo Troina}, title = {Reachability results for timed automata with unbounded data structures}, journal = {Acta Informatica}, volume = {47}, number = {5-6}, pages = {279--311}, year = {2010}, url = {https://doi.org/10.1007/s00236-010-0121-8}, doi = {10.1007/S00236-010-0121-8}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/acta/LanotteMT10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acta/LoosMM10, author = {Remco Loos and Florin Manea and Victor Mitrana}, title = {Small universal accepting hybrid networks of evolutionary processors}, journal = {Acta Informatica}, volume = {47}, number = {2}, pages = {133--146}, year = {2010}, url = {https://doi.org/10.1007/s00236-009-0113-8}, doi = {10.1007/S00236-009-0113-8}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/acta/LoosMM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acta/Merro10, author = {Massimo Merro}, title = {On the observational theory of the CPS-calculus}, journal = {Acta Informatica}, volume = {47}, number = {2}, pages = {111--132}, year = {2010}, url = {https://doi.org/10.1007/s00236-009-0112-9}, doi = {10.1007/S00236-009-0112-9}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/acta/Merro10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acta/YingF10, author = {Mingsheng Ying and Yuan Feng}, title = {Quantum loop programs}, journal = {Acta Informatica}, volume = {47}, number = {4}, pages = {221--250}, year = {2010}, url = {https://doi.org/10.1007/s00236-010-0117-4}, doi = {10.1007/S00236-010-0117-4}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/acta/YingF10.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.