Publications 2018

  1. L. Aceto. Report on ICE-TCS Theory Day 2018.
    Bull. EATCS, v. 126, 2 pp., 2018.
    article
  2. L. Aceto, A. Achilleos, A. Francalanza, A. Ingólfsdóttir. A framework for parameterized monitorability.
    In C. Baier, U. Dal Lago, eds., Foundations of Software Science and Computation Structures: 21st Int. Conf., FOSSACS 2018 (Thessaloniki, Apr. 2018), Proc., v. 10803 of Lect. Notes in Comput. Sci., pp. 203-220. Springer, 2018.
    doi:10.1007/978-3-319-89366-2_11
  3. L. Aceto, I. Cassar, A. Francalanza, A. Ingólfsdóttir. On runtime enforcement via suppressions.
    In S. Schewe, L. Zhang, eds., 29th Int. Conf. on Concurrency Theory, CONCUR 2018 (Beijing, Sept. 2018), v. 118 of Leibniz Int. Proc. in Inform., pp. 34:1-34:17. Dagstuhl Publishing, 2018.
    doi:10.4230/lipics.concur.2018.34
  4. A. Achilleos. The completeness problem for modal logic.
    In S. N. Artemov, A. Nerode, eds., Logical Foundations of Computer Science: Int. Symp., LFCS 2018 (Deerfield Beach, FL, Jan. 2018), Proc., v. 10703 of Lect. Notes in Comput. Sci., pp. 1-21. Springer, 2018.
    doi:10.1007/978-3-319-72056-2_1
  5. R. B. Boppana, M. M. Halldórsson, D. Rawitz. Brief announcement: Simple and local independent set approximation.
    In PODC '18: Proc. of 2018 ACM Symp. on Principles of Distributed Computing (Egham, July 2018), pp. 163-165. ACM, 2018.
    doi:10.1145/3212734.3212793
  6. R. B. Boppana, M. M. Halldórsson, D. Rawitz. Simple and local independent set approximation.
    In Z. Lotker, B. Patt-Shamir, eds., Structural Information and Communication Complexity: 25th Int. Coll., SIROCCO 2018 (Ma'ale HaHamisha, June 2018), Revised Selected Papers, v. 11085 of Lect. Notes in Comput. Sci., pp. 88-101. Springer, 2018.
    doi:10.1007/978-3-030-01325-7_12
  7. B. Fischer, T. Uustalu, eds.
    Theoretical Aspects of Computer Science -- ICTAC 2018: 15th Int. Coll. (Stellenbosch, Oct. 2018), Proc., v. 11187 of Lect. Notes in Comput. Sci., xvii+533 pp. Springer, 2018.
    doi:10.1007/978-3-030-02508-3
  8. M. M. Halldórsson, N. Kobayashi, B. Speckmann, guest eds.
    Inf. Comput., v. 261, part 2 (special issue for 42nd Int. Coll. on Automata, Languages and Programming, ICALP 2015, Kyoto, July 2015), pp. 159-486, 2018.
    volume
  9. M. M. Halldórsson, C. Konrad. Computing large independent sets in a single round.
    Distrib. Comput., v. 31, n. 1, pp. 69-82, 2018.
    doi:10.1007/s00446-017-0298-y
  10. M. M. Halldórsson, G. Kortsarz. Algorithms for chromatic sums, multicoloring, and scheduling dependent jobs.
    In T. F. Gonzalez, ed., Handbook of Approximation Algorithms and Metaheuristics, v. 1: Methodologies and Traditional Applications, 2nd ed., pp. 671-684. Chapman and Hall/CRC, 2018.
    doi:10.1201/9781351236423-38
  11. M. M. Halldórsson, G. Kortsarz, P. Mitra, T. Tonoyan. Spanning trees with edge conflicts and wireless connectivity.
    In I. Chatzigiannakis, C. Kaklamanis, D. Marx, D. Sannella, eds., 45th Int. Coll. on Automata, Languages, and Programming, ICALP 2018 (Prague, July 2018), v. 107 of Leibniz Int. Proc. in Inform., pp. 158:1-158:15. Dagstuhl Publishing, 2018.
    doi:10.4230/lipics.icalp.2018.158
  12. M. M. Halldórsson, S. Köhler, B. Patt-Shamir, D. Rawitz. Distributed backup placement in networks.
    Distrib. Comput., v. 31, n. 2, pp. 83-98, 2018.
    doi:10.1007/s00446-017-0299-x
  13. M. M. Halldórsson, N. Megow, C. Stein, eds.
    Scheduling (Dagstuhl Seminar 18101). Dagstuhl Reports, v. 8, n. 3, 20 pp., 2018.
    doi:10.4230/dagrep.8.3.1
  14. M. M. Halldórsson, T. Tonoyan. Leveraging indirect signaling for topology inference and fast broadcast.
    In PODC '18: Proc. of 2018 ACM Symp. on Principles of Distributed Computing (Egham, July 2018), pp. 85-93. ACM, 2018.
    doi:10.1145/3212734.3212766
  15. M. M. Halldórsson, T. Tonoyan. Wireless aggregation at nearly constant rate.
    In Proc. of 38th IEEE Int. Conf. on Distributed Computing Systems, ICDCS 2018 (Vienna, July 2018), pp. 753-763. IEEE, 2018.
    doi:10.1109/icdcs.2018.00078
  16. S. Katsumata, T. Sato, T. Uustalu. Codensity lifting of monads and its dual.
    Log. Methods Comput. Sci., v. 14, n. 4, art. 6, 31 pp., 2018.
    doi:10.23638/lmcs-14(4:6)2018
  17. C. Konrad, T. Tonoyan. Preemptively guessing the center.
    In J. Lee, G. Rinaldi, A. Mahjoub, eds., Combinatorial Optimization: 5th Int. Symp., ISCO 2018 (Marrakesh, Apr. 2018), Revised Selected Papers, v. 10856 of Lect. Notes in Comput. Sci., pp. 277-289. Springer, 2018.
    doi:10.1007/978-3-319-96151-4_24
  18. H. Maarand, T. Uustalu. Certified Foata normalization for generalized traces.
    In A. Dutle, C. Muñoz, A. Narkawicz, eds., NASA Formal Methods: 10th Int. Symp., NFM 2018 (Newport News, VA, Apr. 2018), Proc., v. 10811 of Lect. Notes in Comput. Sci., pp. 299-314. Springer, 2018.
    doi:10.1007/978-3-319-77935-5_21
  19. L. Pinto, T. Uustalu. A proof theoretic-study of bi-intuitionistic propositional sequent calculus.
    J. Log. Comput., v. 28, n. 1, pp. 165-202, 2018.
    doi:10.1093/logcom/exx044
  20. T. Uustalu, ed.
    21st Int. Conf. on Types for Proofs and Programs, TYPES 2015 (Tallinn, May 2015), v. 69 of Leibniz Int. Proc. in Inform., xii+250 pp. Dagstuhl Publishing, 2018.
    doi:10.4230/lipics.types.2015.0
  21. T. Uustalu, N. Veltri, N. Zeilberger. The sequent calculus of skew-monoidal categories.
    Electron. Notes Theor. Comput. Sci., v. 341, pp. 345-370, 2018.
    doi:10.1016/j.entcs.2018.11.017

Publications 2017

Last update 17 August 2024