Publications 2021

  1. L. Aceto, A. Achilleos, A. Francalanza, A. Ingólfsdóttir, K. Lehtinen. An operational guide to monitorability with applications to regular properties.
    Softw. Syst. Model., v. 20, n. 2, pp. 335-361, 2021.
    doi:10.1007/s10270-020-00860-z
  2. L. Aceto, A. Achilleos, A. Francalanza, A. Ingólfsdóttir, K. Lehtinen. The best a monitor can do.
    In C. Baier, J. Goubault-Larrecq, eds., 29th EACSL Ann. Conf. on Computer Science Logic, CSL 2021 (Ljubljana, Jan. 2021), v. 183 of Leibniz Int. Proc. in Inform., pp. 7:1-7:23. Dagstuhl Publishing, 2021.
    doi:10.4230/lipics.csl.2021.7
  3. L. Aceto, E. Anastasiadi, V. Castiglioni, A. Ingólfsdóttir, B. Luttik. In search of lost time: axiomatising parallel composition in process algebras.
    In Proc. of 36th Ann. ACM/IEEE Symp. on Logic in Computer Science, LICS 2021 (Rome, June/July 2021), art. 9470526, 14 pp. IEEE, 2021.
    doi:10.1109/lics52264.2021.9470526
  4. L. Aceto, D. P. Attard, A. Francalanza, A. Ingólfsdóttir. On benchmarking for concurrent runtime verification.
    In E. Guerra, M. Stoelinga, eds., Fundamental Approaches to Software Engineering: 24th Int. Conf., FASE 2021 (Luxembourg City, Luxembourg, March/Apr. 2021), Proc., v. 12649 of Lect. Notes in Comput. Sci., pp. 3-23. Springer, 2021.
    doi:10.1007/978-3-030-71500-7_1
  5. L. Aceto, N. Bertrand, N. Yoshida. Interviews with the 2021 CONCUR test-of-time award recipients.
    Bull. EATCS, v. 135, 25 pp., 2021.
    article
  6. L. Aceto, I. Cassar, A. Francalanza, A. Ingólfsdóttir. Comparing controlled system synthesis and suppression enforcement.
    Int. J. Softw. Tools Technol. Transf., v. 23, n. 4, pp. 601-614, 2021.
    doi:10.1007/s10009-021-00624-0
  7. L. Aceto, I. Cassar, A. Francalanza, A. Ingólfsdóttir. On bidirectional runtime enforcement.
    In K. Peters, T. A. C. Willemse, eds., Formal Techniques for Distributed Objects, Components, and Systems 41st IFIP WG 6.1 Int. Conf., FORTE 2021 (Valletta, June 2021), Proc., v. 12719 of Lect. Notes in Comput. Sci., pp. 3-21. Springer, 2021.
    doi:10.1007/978-3-030-78089-0_1
  8. L. Aceto, V. Castiglioni, W. Fokkink, A. Ingólfsdóttir, B. Luttik. Are two binary operators necessary to finitely axiomatise parallel composition?
    In C. Baier, J. Goubault-Larrecq, eds., 29th EACSL Ann. Conf. on Computer Science Logic, CSL 2021 (Ljubljana, Jan. 2021), v. 183 of Leibniz Int. Proc. in Inform., pp. 8:1-8:17. Dagstuhl Publishing, 2021.
    doi:10.4230/lipics.csl.2021.8
  9. L. Aceto, A. Ingólfsdóttir. Introducing formal methods to first-year students in three intensive weeks.
    In J. F. Ferreira, A. Mendes, C. Menghi, eds., Formal Methods Teaching: 4th Int. Wksh. and Tutorial, FMTea 2021 (Beijing, Nov. 2021), Proc., v. 13122 of Lect. Notes in Comput. Sci., pp. 1-17. Springer, 2021.
    doi:10.1007/978-3-030-91550-6_1
  10. A. Achilleos, M. R. Pedersen. Axiomatizations and computability of weighted monadic second-order logic.
    In Proc. of 36th Ann. ACM/IEEE Symp. on Logic in Computer Science, LICS 2021 (Rome, June/July 2021), art. 9470615, 13 pp. IEEE, 2021.
    doi:10.1109/lics52264.2021.9470615
  11. N. Arkor, D. McDermott. Abstract clones for abstract syntax.
    In N. Kobayashi, ed., 6th Int. Conf. on Formal Structures for Computation and Deduction, FSCD 2021 (Buenos Aires, July 2021), v. 195 of Leibniz Int. Proc. in Inform., pp. 30:1-30:19. Dagstuhl Publishing, 2021.
    doi:10.4230/lipics.fscd.2021.30
  12. Í. M. Arnþórsson, S. Chaplick, J. S. Gylfason, M. M. Halldórsson, J. M. Reynisson, T. Tonoyan. Generalized disk graphs.
    In A. Lubiw, M. R. Salavatipour, eds., Algorithms and Data Structures: 17th Int. Symp., WADS 2021 (Halifax, NS, Aug. 2021), Proc., v. 12808 of Lect. Notes in Comput. Sci., pp. 115-128. Springer, 2021.
    10.1007/978-3-030-83508-8_9
  13. D. P. Attard, L. Aceto, A. Achilleos, A. Francalanza, A. Ingólfsdóttir, K. Lehtinen. Better late than never or: verifying asynchronous components at runtime.
    In K. Peters, T. A. C. Willemse, eds., Formal Techniques for Distributed Objects, Components, and Systems 41st IFIP WG 6.1 Int. Conf., FORTE 2021 (Valletta, June 2021), Proc., v. 12719 of Lect. Notes in Comput. Sci., pp. 207-225. Springer, 2021.
    doi:10.1007/978-3-030-78089-0_14
  14. C. Bean, É. Nadeau, H. Úlfarsson. Enumeration of permutation classes and weighted labelled independent sets.
    Discret. Math. Theor. Comput. Sci., v. 22, n. 2, art. 2, 38 pp., 2021.
    doi:10.46298/dmtcs.5995
  15. S. Chaplick, M. M. Halldórsson, M. Santos de Lima, T. Tonoyan. Query minimization under stochastic uncertainty.
    Theor. Comput. Sci., v. 895, pp. 75-95, 2021.
    doi:10.1016/j.tcs.2021.09.032
  16. K. M. J. De Bontridder, B. V. Halldórsson, M. M. Halldórsson, C. A. J. Hurkens, J. K. Lenstra, R. Ravi, L. Stougie. Local improvement algorithms for a path packing problem: a performance analysis based on linear programming.
    Oper. Res. Lett., v. 49, n. 1, pp. 62-68, 2021.
    doi:10.1016/j.orl.2020.11.005
  17. V. Castiglioni, M. Loreti, S. Tini. How adaptive and reliable is your program?
    In K. Peters, T. A. C. Willemse, eds., Formal Techniques for Distributed Objects, Components, and Systems 41st IFIP WG 6.1 Int. Conf., FORTE 2021 (Valletta, June 2021), Proc., v. 12719 of Lect. Notes in Comput. Sci., pp. 60-79. Springer, 2021.
    doi:10.1007/978-3-030-78089-0_4
  18. O. Dardha, V. Castiglioni, eds.,
    Proc. of Combined 28th International Workshop on Expressiveness in Concurrency and 18th Workshop on Structural Operational Semantics, EXPRESS/SOS 2021 (Paris, Aug. 2021), v. 339 of Electron. Proc. in Theor. Comput. Sci., 92 pp. Open Publishing Assoc., 2021.
    doi:10.4204/eptcs.339
  19. M. M. Halldórsson, G. Kortsarz, M. Cygan. Tight bounds on subexponential time approximation of set cover and related problems.
    In C. Kaklamanis, A. Levin, eds., Approximation and Online Algorithms: 18th Int. Wksh., WAOA 2020 (Pisa, Sept. 2020), Revised Selected Papers, v. 12806 of Lect. Notes in Comput. Sci., pp. 159-173. Springer, 2021.
    doi:10.1007/978-3-030-80879-2_11
  20. M. M. Halldórsson, G. Kortsarz, P. Mitra, T. Tonoyan. Network design under general wireless interference.
    Algorithmica, v. 83, n. 11, pp. 3469-3490, 2021.
    doi:10.1007/s00453-021-00866-z
  21. M. M. Halldórsson, F. Kuhn, Y. Maus, T. Tonoyan. Efficient randomized distributed coloring in CONGEST.
    In S. Khuller, V. Vassilevska Williams, eds., STOC '21: Proc. of 53rd Ann. ACM SIGACT Symp. on Theory of Computing (Rome, June 2021), pp. 1180-1193. ACM, 2021.
    doi:10.1145/3406325.3451089
  22. M. M. Halldórsson, A. Nolin. Superfast coloring in CONGEST via efficient color sampling.
    In T. Jurdzinski, S. Schmid, eds., Structural Information and Communication Complexity: 28th Int. Coll., SIROCCO 2021 (Wroclaw, June/July 2021), Proc., v. 12810 of Lect. Notes in Comput. Sci., pp. 68-83. Springer, 2021.
    doi:10.1007/978-3-030-79527-6_5,
  23. M. M. Halldórsson, M. Santos de Lima. Query-competitive sorting with uncertainty.
    Theor. Comput. Sci., v. 867, pp. 50-67, 2021.
    doi:10.1016/j.tcs.2021.03.021
  24. M. M. Halldórsson, T. Tonoyan. Computing inductive vertex orderings.
    Inf. Process. Lett., v. 172, art. 106159, 5 pp., 2021.
    doi:10.1016/j.ipl.2021.106159
  25. M. M. Halldórsson, T. Tonoyan. Effective wireless scheduling via hypergraph sketches.
    SIAM J. Comput., v. 50, n. 2, pp. 718-759, 2021.
    doi:10.1137/19m1275085
  26. M. M. Halldórsson, T. Tonoyan. Sparse backbone and optimal distributed SINR algorithms.
    ACM Trans. Algorithms, v. 17, n. 2, pp. 17:1-17:34, 2021.
    doi:10.1145/3452937
  27. H. Maarand, T. Uustalu. Operational semantics with semicommutations.
    J. Log. Algebr. Methods Program., v. 121, art. 100677, 27 pp., 2021.
    doi:10.1016/j.jlamp.2021.100677
  28. T. Uustalu, N. Veltri, N. Zeilberger. Deductive systems and coherence for skew prounital closed categories.
    In C. Sacerdoti Coen, A. Tiu, eds., Proc. of 15th Int. Wksh. on Logical Frameworks and Metalanguages: Theory and Practice, LFMTP 2020 (Paris, June 2020), v. 332 of Electron. Proc. in Theor. Comput. Sci., pp. 35-53. Open Publishing Assoc., 2021.
    doi:10.4204/eptcs.332.3
  29. T. Uustalu, N. Veltri, N. Zeilberger. Proof theory of partially normal skew monoidal categories.
    In D. I. Spivak, J. Vicary, eds., Proc. of 3rd Ann. Int. Applied Category Theory Conf., ACT 2020 (Cambridge, MA, July 2020), v. 333 of Electron. Proc. in Theor. Comput. Sci., pp. 230-246. Open Publishing Assoc., 2021.
    doi:10.4204/eptcs.333.16
  30. T. Uustalu, N. Veltri, N. Zeilberger. The sequent calculus of skew monoidal categories.
    In C. Casadio, P. J. Scott, eds., Joachim Lambek: The Interplay of Mathematics, Logic, and Linguistics, v. 20 of Outstanding Contributions to Logic, pp. 377-406. Springer, 2021.
    doi:10.1007/978-3-030-66545-6_11

Publications 2020

Publications 2019

Publications 2018

Publications 2017

Last update 27 June 2024