( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Star-Coloring of Graphs for Conflict-Free Access to Parallel Memory Systems.

, , и . IPDPS, IEEE Computer Society, (2004)

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.

Leonardo Finocchi

Frédéric Finocchi

Irene Drude

Entwicklung eines Twinribozyms zur spezifischen Reparatur einer Drei-Basendeletion innerhalb der onkogenen CTNNB1 mRNA. Uni Greifswald, (2009)

Irene Natter

Irene Hildenbrand

 

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

Local dependency dynamic programming in the presence of memory faults., , и . STACS, том 9 из LIPIcs, стр. 45-56. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)The Price of Resiliency: A Case Study on Sorting with Memory Faults., , и . ESA, том 4168 из Lecture Notes in Computer Science, стр. 768-779. Springer, (2006)Sorting and searching in the presence of memory faults (without redundancy)., и . STOC, стр. 101-110. ACM, (2004)Specifying Algorithm Visualizations: Interesting Events or State Mapping?, , и . Software Visualization, том 2269 из Lecture Notes in Computer Science, стр. 16-30. Springer, (2001)Reactive imperative programming with dataflow constraints., , и . OOPSLA, стр. 407-426. ACM, (2011)k-Calling context profiling., , , и . OOPSLA, стр. 867-878. ACM, (2012)Estimating the Empirical Cost Function of Routines with Dynamic Workloads., , , и . CGO, стр. 230. ACM, (2014)Smooth Animation of Algorithms in a Declarative Framework., и . VL, стр. 280-287. IEEE Computer Society, (1999)Informative Labeling Schemes for the Least Common Ancestor Problem., , и . ICTCS, стр. 66-70. (2009)Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors., , и . ESA, том 5193 из Lecture Notes in Computer Science, стр. 234-245. Springer, (2008)