( en | de | ru )

 

Disambiguation of "Opatrny, Jaroslav"

Author of the publication

copydeleteadd this publication to your clipboard
Exploration of High-Dimensional Grids by Finite State Machines.

, , , and . CoRR, (2019)

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.

Jaroslav Mach

Jaroslav Suchomel

Jaroslav Chlup

Jaroslav Pleva

Jaroslav Vaclavsky

 

Other publications of authors with the same name

Time-Energy Tradeoffs for Evacuation by Two Robots in the Wireless Model., , , , , , , , and . SIROCCO, volume 11639 of Lecture Notes in Computer Science, page 185-199. Springer, (2019)Efficient Algorithms for Connected Dominating Sets in Ad Hoc Networks., , , and . WCNC, page 1-6. IEEE, (2010)Compact Routing on Chordal Rings., and . SIROCCO, page 125-137. Carleton Scientific, (1997)Embeddings of Hypercubes and Grids into de Bruijn Graphs., , and . ICPP (3), page 28-37. CRC Press, (1992)Embedding Complete Binary Trees Into Star and Pancake Graphs., , , and . Theory Comput. Syst., 31 (3): 279-305 (1998)Broadcasting and Spanning Trees in de Bruijn and Kautz Networks., , and . Discret. Appl. Math., (1992)Forwarding Indices of k-Connected Graphs., , , and . Discret. Appl. Math., (1992)Strong Connectivity in Sensor Networks with given Number of Directional Antennae of Bounded Angle., , , , , and . Discret. Math. Algorithms Appl., (2012)Route discovery with constant memory in oriented planar geometric networks., , , , , and . Networks, 48 (1): 7-15 (2006)A local algorithm for dominating sets of quasi-unit disk graphs., and . C3S2E, page 223-231. ACM, (2009)