( en | de | ru )

 

Disambiguation of "Rosenberg, Arnold L."

Author of the publication

copydeleteadd this publication to your clipboard
The reconfigurable ring of processors: fine-grained tree-structured computations.

, , and . SPDP, page 470-477. IEEE Computer Society, (1994)

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. You can also use the button next to the name to display some publications already assigned to the person.

Arnold L Welti

Sabine Rosenberg

Agathe Rosenberg

Manfred Rosenberg

Herta Rosenberg

 

Other publications of authors with the same name

50 Years of TOCS., and . Theory Comput. Syst., 60 (1): 1-2 (2017)Rapid Identification of Repeated Patterns in Strings, Trees and Arrays, , and . STOC, page 125-136. ACM, (1972)Corrigendum: Ällocating Storage for Extendible Arrays".. J. ACM, 22 (2): 308 (1975)Advances in IC-Scheduling Theory: Scheduling Expansive and Reductive Dags and Scheduling Dags via Duality., , and . IEEE Trans. Parallel Distributed Syst., 18 (11): 1607-1617 (2007)Better Parallel Architectures via Emulations.. Heinz Nixdorf Symposium, volume 678 of Lecture Notes in Computer Science, page 30-36. Springer, (1992)Multitape One-Way Nonwriting Automata., and . J. Comput. Syst. Sci., 2 (1): 88-101 (1968)Scheduling DAGs Opportunistically: The Dream and the Reality Circa 2016.. Euro-Par, volume 9833 of Lecture Notes in Computer Science, page 22-33. Springer, (2016)The Changing Challenges of Collaborative Algorithmics.. HiPC, volume 3769 of Lecture Notes in Computer Science, page 5. Springer, (2005)Fault-Tolerant Interconnection Networks: A Graph-Theoretic Approach.. WG, page 286-297. Universitätsverlag Rudolf Trauner, Linz, (1983)Generalized Addressing Schemes for Data Graphs.. Math. Syst. Theory, 8 (4): 353-367 (1975)