×

Found 12 Documents (Results 1–12)

A scalable approximation algorithm for weighted longest common subsequence. (English) Zbl 1512.68464

Sousa, Leonel (ed.) et al., Euro-Par 2021: parallel processing. 27th international conference on parallel and distributed computing, Lisbon, Portugal, September 1–3, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12820, 368-384 (2021).
MSC:  68W32 68W10 68W25
Full Text: DOI

Log diameter rounds algorithms for 2-vertex and 2-edge connectivity. (English) Zbl 07561507

Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 14, 16 p. (2019).
MSC:  68Nxx 68Qxx

Weighted matchings via unweighted augmentations. (English) Zbl 1542.68146

Nowak, Thomas (ed.), Proceedings of the 38th ACM symposium on principles of distributed computing, PODC ’19, Toronto, ON, Canada, July 29 – August 2, 2019. New York, NY: Association for Computing Machinery (ACM). 491-500 (2019).

The complexity of \((\Delta+1)\) coloring in congested clique, massively parallel computation, and centralized local computation. (English) Zbl 1530.68198

Nowak, Thomas (ed.), Proceedings of the 38th ACM symposium on principles of distributed computing, PODC ’19, Toronto, ON, Canada, July 29 – August 2, 2019. New York, NY: Association for Computing Machinery (ACM). 471-480 (2019).

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field

all top 3

Software