Tampere University of Technology

TUTCRIS Research Portal

Publications

  1. Published

    Simple O (m log n) time Markov chain lumping

    Valmari, A. & Franceschinis, G., 2010, In : Lecture Notes in Computer Science. 6015, p. 38-52

    Research output: Contribution to journalArticleScientificpeer-review

  2. Published

    Asymptotic Proportion of Hard Instances of the Halting Problem

    Valmari, A., 2014, In : Acta Cybernetica. 21, 3, p. 307-330 24 p.

    Research output: Contribution to journalArticleScientificpeer-review

  3. Published

    Simple bisimilarity minimization in O(m log n) time

    Valmari, A., 2011, In : Fundamenta Informaticae. 105, 3, p. 319-339

    Research output: Contribution to journalArticleScientificpeer-review

  4. Published

    Does the Shannon bound really apply to all data structures

    Valmari, A., 2013, In : Proceedings of the Estonian Academy of Sciences. 62, 1, p. 47-58 12 p.

    Research output: Contribution to journalArticleScientificpeer-review

  5. Published

    Opiskelijan myyttiset 1 600 tuntia

    Valmari, A., 2005, In : Tietojenkäsittelytiede. 24, p. 4-7

    Research output: Contribution to journalArticleScientificpeer-review

  6. Published

    Sizes of Up-To-n Halting Testers

    Valmari, A., 2012, Proceedings of the Second Russian Finnish Symposium on Discrete Mathematics 2012, RuFiDiM II, 25-28 September, Turku, Finland. TUCS Lecture Notes. Halava, V., Karhumäki, J. & Matiyasevich, Y. (eds.). Turku, Finland: TURKU CENTRE FOR COMPUTER SCIENCE, p. 176-183 (Russian Finnish Symposium on Discrete Mathematics; vol. 17).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  7. Published

    All Linear-Time Congruences for Familiar Operators

    Valmari, A., 2013, In : Logical Methods in Computer Science. 9, 4, p. 1-34 34 p., 11.

    Research output: Contribution to journalArticleScientificpeer-review

  8. Published

    All Linear-Time Congruences for Finite LTSs and Familiar Operators

    Valmari, A., 2012, Proceedings of the 12th International Conference on Application of Concurrency to System Design, ACSD 2012, 27-29 June 2012, Hamburg, Germany. Los Alamitos, CA: IEEE Computer Society, p. 12-21 12909180. (Application of Concurrency to System Design).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  9. Published

    Does the Shannon Bound Really Apply to Data Structures?

    Valmari, A., 2011, SPLST'11 12th Symposium on Programming Languages and Software Tools, Tallinn, Estonia, October 5-7, 2011. Penjam, J. (ed.). Tallinn: TUT Press, Institute of Cybernetics at Tallinn University of Technology, p. 174-184 (Symposium on Programming Languages and Software Tools SPLST).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  10. Published

    Old and New Algorithms for Minimal Coverability Sets

    Valmari, A. & Hansen, H., 2012, Application and Theory of Petri Nets. 33rd International Conference, PETRI NETS 2012, Hamburg, Germany, June 25-29, 2012. Proceedings. Lecture Notes in Computer Science. Berlin: Springer, p. 208-227 (International Conference on Application and Theory of Petri Nets and Concurrency; vol. 7347).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Download list To download, please limit the number of search results to 1,000 or less.