( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Connectivity of Bluetooth-Based Ad Hoc Networks.

, , , , и . Euro-Par, том 4641 из Lecture Notes in Computer Science, стр. 960-969. Springer, (2007)

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.

Andrea Witzenrath

Risikofaktoren für abdominelle Komplikationen nach kardiopulmonalem Bypass. Uni Erlangen-Nürnberg, (2009)

Andrea Rottach

Analysis of the cell cycle dependent dynamics of Dnmt1 and Np95 in living cells. Uni München, (2009)

Andrea Hruby

Die MAPKKK Bck1p des Zellwand-Integritätssignalwegs in der Bäckerhefe Saccharomyces cerevisiae. Uni Münster, (2009)

Michaela Andrea Fingas

Resultate nach radikaler Prostatektomie bei Patienten mit einem Prostatakarzinom Gleason 7-10. Uni Marburg, (2009)

Andrea Krause

 

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

Implementing Shared Memory on Mesh-Connected Computers and on the Fat-Tree., , и . Inf. Comput., 165 (2): 123-143 (2001)Topic 13: Theory and Algorithms for Parallel Computation., , , и . Euro-Par, том 3149 из Lecture Notes in Computer Science, стр. 803. Springer, (2004)Efficient Incremental Mining of Top-K Frequent Closed Itemsets., и . Discovery Science, том 4755 из Lecture Notes in Computer Science, стр. 275-280. Springer, (2007)Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation., , , и . SPAA, стр. 182-191. ACM, (2015)Mining Frequent Itemsets using Patricia Tries., и . FIMI, том 90 из CEUR Workshop Proceedings, CEUR-WS.org, (2003)Tight bounds on information dissemination in sparse mobile networks., , , и . PODC, стр. 355-362. ACM, (2011)Optimal Many-to-One Routing on the Mesh with Constant Queues., и . Euro-Par, том 2150 из Lecture Notes in Computer Science, стр. 645-650. Springer, (2001)Cache-oblivious simulation of parallel programs., , и . IPDPS, IEEE, (2006)Fast and Accurate Fair k-Center Clustering in Doubling Metrics., , и . WWW, стр. 756-767. ACM, (2024)On the Space and Access Complexity of Computation DAGs., , и . WG, том 1928 из Lecture Notes in Computer Science, стр. 47-58. Springer, (2000)