Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study
 
conference paper

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

Bader, D. A.
•
Moret, B. M. E.  
•
Yan, M.
2001
Algorithms and Data Structures. WADS 2001
7th International Workshop, WADS 2001
  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

bmy_wads.pdf

Access type

openaccess

Size

226.43 KB

Format

Adobe PDF

Checksum (MD5)

e43d555236358679639a60ef3231d3e1

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés