( en | de | ru )

 

Disambiguation of "Jurdzinski, Tomasz"

Author of the publication

copydeleteadd this publication to your clipboard
Some Results On Random Unsatisfiable K-Sat Instances And Approximation Algorithms Applied To Random Structures.

, and . Comb. Probab. Comput., 12 (3): 245-267 (2003)

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.

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

 

Other publications of authors with the same name

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