( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Mapping Divide-and-Conquer Algorithms to Parallel Architectures.

, , , , , и . ICPP (3), стр. 128-135. Pennsylvania State University Press, (1990)0-271-00728-1.

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Aulis Telle

Monika Telle

Walter Telle

Jan-Arne Gewert

Jan-Arne Sohns

 

Другие публикации лиц с тем же именем

Generalized H-Coloring of Graphs., и . ISAAC, том 1969 из Lecture Notes in Computer Science, стр. 456-466. Springer, (2000)Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width., , , и . IPEC, том 115 из LIPIcs, стр. 6:1-6:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Maximum matching width: New characterizations and a fast algorithm for dominating set., , и . Discret. Appl. Math., (2018)Tree-decompositions of small pathwidth.. Electron. Notes Discret. Math., (2001)The teaching size: computable teachers and learners for universal languages., , и . Mach. Learn., 108 (8-9): 1653-1675 (2019)Typical Sequences Revisited - Computing Width Parameters of Graphs., , и . STACS, том 154 из LIPIcs, стр. 57:1-57:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Typical Sequences Revisited - Algorithms for Linear Orderings of Series Parallel Digraphs., , и . CoRR, (2019)Interval Completion Is Fixed Parameter Tractable., , , и . SIAM J. Comput., 38 (5): 2007-2020 (2009)On a Combinatorial Problem Arising in Machine Teaching., , , и . CoRR, (2024)Classes of intersection digraphs with good algorithmic properties., , и . CoRR, (2021)