( en | de | ru )

 

Disambiguation of "Sawada, Joe"

Author of the publication

copydeleteadd this publication to your clipboard
On prefix normal words and prefix normal forms.

, , , , and . Theor. Comput. Sci., (2017)

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.

Tobias Sawada

Joe Lugalla

Joe Berghold

Johanna Joe

Joe Essien

 

Other publications of authors with the same name

An Efficient Algorithm for Generating Necklaces with Fixed Density., and . SODA, page 752-758. ACM/SIAM, (1999)Generating rooted and free plane trees.. ACM Trans. Algorithms, 2 (1): 1-13 (2006)Inside the Binary Reflected Gray Code: Flip-Swap Languages in 2-Gray Code Order., , and . WORDS, volume 12847 of Lecture Notes in Computer Science, page 172-184. Springer, (2021)A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph., , and . COCOON, volume 13025 of Lecture Notes in Computer Science, page 49-60. Springer, (2021)A Loopless Gray Code for Minimal Signed-Binary Representations., and . ESA, volume 3669 of Lecture Notes in Computer Science, page 438-447. Springer, (2005)A Note on k-Colorability of P5-Free Graphs., , , , and . MFCS, volume 5162 of Lecture Notes in Computer Science, page 387-394. Springer, (2008)Generating a Gray code for prefix normal words in amortized polylogarithmic time per word., , , , and . CoRR, (2020)A Simple Gray Code to List All Minimal Signed Binary Representations.. SIAM J. Discret. Math., 21 (1): 16-25 (2007)Solving the Sigma-Tau Problem., and . ACM Trans. Algorithms, 16 (1): 11:1-11:17 (2020)A fast algorithm to generate unlabeled necklaces., and . SODA, page 256-262. ACM/SIAM, (2000)