A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

David A. Bader, Bernard M. E. Moret, Mi Yan. A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study. In Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Roberto Tamassia, editors, Algorithms and Data Structures, 7th International Workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001, Proceedings. Volume 2125 of Lecture Notes in Computer Science, pages 365-376, Springer, 2001. [doi]

This author has not been identified. Look up 'David A. Bader' in GoogleThis author has not been identified. Look up 'Bernard M. E. Moret' in GoogleThis author has not been identified. Look up 'Mi Yan' in Google

runs on WebDSL