( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On Range and Edge Capacity in the Congested Clique.

, и . SOFSEM, том 10706 из Lecture Notes in Computer Science, стр. 305-318. Springer, (2018)

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.

Gerald Jurdzinski

Tomasz Kupka

Ascheablagerungsprobleme bei der Mitverbrennung von alternativen Brennstoffen in Steinkohlekraftwerken. TU Clausthal-Zellerfeld, (2009)

Tomasz Wocjan

Dynamics of DNA in nucleosomes and plasmids studied by Brownian dynamics. Uni Heidelberg, (2009)

Tomasz Mistrzyk

Tomasz Zyss

 

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

Weak Communication in Radio Networks., , и . Euro-Par, том 2400 из Lecture Notes in Computer Science, стр. 965-972. Springer, (2002)Energy-Efficient Size Approximation of Radio Networks with No Collision Detection., , и . COCOON, том 2387 из Lecture Notes in Computer Science, стр. 279-289. Springer, (2002)Monotone Deterministic RL-Automata Don't Need Auxiliary Symbols., , , и . Developments in Language Theory, том 3572 из Lecture Notes in Computer Science, стр. 284-295. Springer, (2005)On Left-Monotone Deterministic Restarting Automata., , , и . Developments in Language Theory, том 3340 из Lecture Notes in Computer Science, стр. 249-260. Springer, (2004)Stable Memoryless Queuing under Contention., , и . DISC, том 146 из LIPIcs, стр. 17:1-17:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Distributed Randomized Broadcasting in Wireless Networks under the SINR Model., и . Encyclopedia of Algorithms, (2016)Growing Grammars and Length-Reducing Automata.. NCMA, том 263 из books@ocg.at, стр. 9-10. Austrian Computer Society, (2010)Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars., , , и . Fundam. Informaticae, 64 (1-4): 217-228 (2005)The Boolean Closure of Growing Context-Sensitive Languages.. Fundam. Informaticae, 89 (2-3): 289-305 (2008)Growing Grammars and Length-reducing Automata.. Fundam. Informaticae, 112 (2-3): 193-217 (2011)