Parallel and distributed computing for Bayesian graphical models

  • 5 Conference article in proceedings
Filter
Conference article in proceedings

Search results

  • 2023

    Fast Dynamic Programming in Trees in the MPC Model

    Gupta, C., Latypov, R., Maus, Y., Pai, S., Särkkä, S., Studený, J., Suomela, J., Uitto, J. & Vahidi, H., 17 Jun 2023, SPAA 2023 - Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures. ACM, p. 443-453 11 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access
    File
    2 Citations (Scopus)
    35 Downloads (Pure)
  • 2022

    Dynamic Meta-Theorems for Distance and Matching

    Datta, S., Gupta, C., Jain, R., Mukherjee, A., Sharma, V. R. & Tewari, R., 1 Jul 2022, 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022. Bojanczyk, M., Merelli, E. & Woodruff, D. P. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-20 20 p. 118. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 229).

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access
    File
    32 Downloads (Pure)

  • Sparse Matrix Multiplication in the Low-Bandwidth Model

    Gupta, C., Hirvonen, J., Korhonen, J. H., Studený, J. & Suomela, J., 11 Jul 2022, SPAA 2022 - Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures. ACM, p. 435-444 10 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access
    File
    4 Citations (Scopus)
    81 Downloads (Pure)
  • 2021

    Reachability and Matching in Single Crossing Minor Free Graphs

    Datta, S., Gupta, C., Jain, R., Mukherjee, A., Sharma, V. & Tewari, R., 29 Nov 2021, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science: FSTTCS 2021, December 15–17, 2021, Virtual Conference. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-16 16 p. 16. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 213).

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access
    File
    26 Downloads (Pure)

  • Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs

    Gupta, C., Jain, R. & Tewari, R., 29 Nov 2021, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science: FSTTCS 2021, December 15–17, 2021, Virtual Conference. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-15 15 p. 23. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 213).

    Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

    Open Access
    File
    20 Downloads (Pure)