Publications 2020

  1. L. Aceto: Interviews with the 2020 CONCUR test-of-time award recipients.
    Bull. EATCS, v. 131, 19 pp., 2020.
    article
  2. L. Aceto, A. Achilleos, A. Francalanza, A. Ingólfsdóttir: The complexity of identifying characteristic formulae.
    J. Log. Algebr. Methods Program., v. 112, art. 100529, 20 pp., 2020.
    doi:10.1016/j.jlamp.2020.100529
  3. L. Aceto, A. Achilleos, A. Francalanza, A. Ingólfsdóttir, S. Ö. Kjartansson.
    Determinizing monitors for HML with recursion. J. Log. Algebr. Methods Program., v. 111, art. 100515, 38 pp., 2020.
    doi:10.1016/j.jlamp.2019.100515
  4. L. Aceto, E. Anastasiadi, V. Castiglioni, A. Ingólfsdóttir, B. Luttik, M. R. Pedersen.
    On the axiomatisability of priority III: priority strikes again. Theor. Comput. Sci., v. 837, pp. 223-246, 2020.
    doi:10.1016/j.tcs.2020.07.044
  5. L. Aceto, J. C. M. Baeten, P. Bouyer-Decitre, H. Hermanns, A. Silva: CONCUR test-of-time award 2020 announcement.
    In I. Konnov, L. Kovács, eds., 31st Int. Conf. on Concurrency Theory, CONCUR 2020 (Vienna, Sept. 2020), v. 171 of Leibniz Int. Proc. in Inform., pp. 5:1-5:3. Dagstuhl Publishing, 2020.
    doi:10.4230/lipics.concur.2020.5
  6. L. Aceto, V. Castiglioni, A. Ingólfsdóttir, B. Luttik, M. R. Pedersen. On the axiomatisability of parallel composition: a journey in the spectrum.
    In I. Konnov, L. Kovács, eds., 31st Int. Conf. on Concurrency Theory, CONCUR 2020 (Vienna, Sept. 2020), v. 171 of Leibniz Int. Proc. in Inform., pp. 18:1-18:22. Dagstuhl Publishing, 2020.
    doi:10.4230/lipics.concur.2020.18
  7. A. Achilleos. Modal logics with hard diamond-free fragments.
    J. Log. Comput., v. 30, n. 1, pp. 3-25, 2020.
    doi:10.1093/logcom/exaa001
  8. C. Bean, M. Tannock, H. Úlfarsson. Pattern avoiding permutations and independent sets in graphs.
    J. Comb., v. 11, n. 4, pp. 705-732, 2020.
    doi:10.4310/joc.2020.v11.n4.a7
  9. R. B. Boppana, M. M. Halldórsson, D. Rawitz. Simple and local independent set approximation.
    Theor. Comput. Sci., v. 846, pp. 27-37, 2020.
    doi:10.1016/j.tcs.2020.09.018
  10. V. Castiglioni, K. Chatzikokolakis, C. Palamidessi. A logical characterization of differential privacy.
    Sci. Comput. Program., v. 188, art. 102388, 29 pp., 2020.
    doi:10.1016/j.scico.2019.102388
  11. V. Castiglioni, M. Loreti, S. Tini. The metric linear-time branching-time spectrum on nondeterministic probabilistic processes.
    Theor. Comput. Sci., v. 813, pp. 20-69, 2020.
    doi:10.1016/j.tcs.2019.09.019
  12. V. Castiglioni, S. Tini. Probabilistic divide & congruence: branching bisimilarity.
    Theor. Comput. Sci., v. 802, pp. 147-196, 2020.
    doi:10.1016/j.tcs.2019.09.037
  13. V. Castiglioni, S. Tini. Raiders of the lost equivalence: probabilistic branching bisimilarity.
    Inf. Process. Lett., v. 159-160, art. 105947, 10 pp., 2020.
    doi:10.1016/j.ipl.2020.105947
  14. S. Chaplick, M. M. Halldórsson, M. Santos de Lima, T. Tonoyan. Query minimization under stochastic uncertainty.
    In Y. Kohayakawa, F. K. Miyazawa, eds., LATIN 2020: Theoretical Informatics: 14th Latin American Symp. (São Paulo, Jan. 2021), Proc., v. 12118 of Lect. Notes in Comput. Sci., pp. 181-193. Springer, 2020.
    doi:10.1007/978-3-030-61792-9_15
  15. P. Fraigniaud, M. M. Halldórsson, A. Nolin. Distributed testing of distance-k colorings.
    In A. W. Richa, C. Scheideler, eds., Structural Information and Communication Complexity: 27th Int. Coll., SIROCCO 2020 (Paderborn, June/July 2020), Proc., v. 12156 of Lect. Notes in Comput. Sci., pp. 275-290. Springer, 2020.
    doi:10.1007/978-3-030-54921-3_16
  16. R. Gandhi, M. M. Halldórsson, C. Konrad, G. Kortsarz, H. Oh. Radio aggregation scheduling.
    Theor. Comput. Sci., v. 840, pp., 143-153, 2020.
    doi:10.1016/j.tcs.2020.07.032
  17. M. M. Halldórsson, S. Holzer, E. A. Markatou, N. A. Lynch. Leader election in SINR model with arbitrary power control.
    Theor. Comput. Sci., v. 811, pp. 21-28, 2020.
    doi:10.1016/j.tcs.2019.01.024
  18. M. M. Halldórsson, C. Konrad. Improved distributed algorithms for coloring interval graphs with application to multicoloring trees.
    Theor. Comput. Sci., v. 811, pp. 29-41, 2020.
    doi:10.1016/j.tcs.2018.11.028
  19. M. M. Halldórsson, C. Konrad, T. Tonoyan. Limitations of current wireless link scheduling algorithms.
    Theor. Comput. Sci., v. 840, pp. 154-165, 2020.
    doi:10.1016/j.tcs.2020.07.033
  20. M. M. Halldórsson, F. Kuhn, Y. Maus. Distance-2 coloring in the CONGEST model.
    In Y. Emek, C. Cachin, eds., PODC '20: ACM Symp. on Principles of Distributed Computing (Salerno, Aug. 2020), 233-242. ACM, 2020.
    doi:10.1145/3382734.3405706
  21. M. M. Halldórsson, F. Kuhn, Y. Maus, A. Nolin. Coloring fast without learning your neighbors' colors.
    In H. Attiya, ed., 34th Int. Symp. on Distributed Computing, DISC 2020 (Freiburg, Oct. 2020), v. 179 of Leibniz Int. Proc. in Inform., pp. 39:1-39:17. Dagstuhl Publishing, 2020.
    doi:10.4230/lipics.disc.2020.39
  22. S. Katsumata, E. Rivas, T. Uustalu. Interaction laws of monads and comonads.
    In H. Hermanns, L. Zhang, N. Kobayashi, eds., Proc. of 35th Ann. ACM/IEEE Symp. on Logic in Computer Science, LICS 2020 (Saarbrücken, July 2020), ACM Int. Conf. Proc. Series, pp. 604-618. ACM, 2020.
    doi:10.1145/3373718.3394808
  23. D. McDermott, M. Piróg, T. Uustalu. Degrading lists.
    In M. Gabbrielli, A. Abel, J. Cheney, eds., Proc. of 22nd Int. Symp. on Principles and Practice of Declarative Languages, PPDP 2020 (Bologna, Sept. 2020), ACM Int. Conf. Proc. Series, art. 6, 14 pp. ACM, 2020.
    doi:10.1145/3414080.3414084
  24. M. Santos de Lima, M. C. San Felice, O. Lee. Group parking permit problems.
    Discr. Appl. Math, v. 281, pp. 172-194, 2020.
    doi:10.1016/j.dam.2019.05.013
  25. J. P. Smith, H. Úlfarsson. The poset of mesh patterns.
    Discr. Math., v. 343, n. 6, art. 111848, 11 pp., 2020.
    doi:10.1016/j.disc.2020.111848
  26. T. Uustalu, N. Veltri, N. Zeilberger. Eilenberg-Kelly reloaded.
    Electron. Notes Theor. Comput. Sci., v. 352, pp. 233-256, 2020.
    doi:10.1016/j.entcs.2020.09.012
  27. T. Uustalu, N. Voorneveld. Algebraic and coalgebraic perspectives on interaction laws.
    In B. C. d. S. Oliveira, ed., Programming Languages and Systems: 18th Asian Symp., APLAS 2020 (Fukuoka, Nov./Dec. 2020), Proc., v. 12470 of Lect. Notes in Comput. Sci., pp. 186-205. Springer, 2020.
    doi:10.1007/978-3-030-64437-6_10

Publications 2019

Publications 2018

Publications 2017

Last update 30 June 2024