Inversion (discrete mathematics): Difference between revisions

Revision as of 06:51, 9 October 2020

Revision as of 06:52, 9 October 2020

Line 179:

=== Presortedness measures ===

{{refbegin}}

* {{cite journal|ref=harv|journal=Lecture Notes in Computer Science|year=1984|volume=172|pages=324–336|doi=10.1007/3-540-13345-3_29|title=Measures of presortedness and optimal sorting algorithms|first=Heikki|last=Mannila|authorlink=Heikki Mannila}}

* {{cite journal|ref=harv|first1=Vladimir|last1=Estivill-Castro|first2=Derick|last2=Wood|author2-link=Derick Wood|title=A new measure of presortedness|journal=Information and Computation|volume=83|issue=1|pages=111–119|year=1989|doi=10.1016/0890-5401(89)90050-3|doi-access=free}}

* {{cite journal|reffirst1=harvVladimir|firstlast1=Steven S.Estivill-Castro|lastfirst2=SkienaDerick|yearlast2=1988Wood|author2-link=Derick Wood|title=EncroachingA lists as anew measure of presortedness|journal=BITInformation and Computation|volume=2883|issue=41|pages=755111–784119|year=1989|doi=10.10071016/bf019548970890-5401(89)90050-3|doi-access=free}}

* {{cite journal|first=Steven S.|last=Skiena|year=1988|title=Encroaching lists as a measure of presortedness|journal=BIT|volume=28|issue=4|pages=755–784|doi=10.1007/bf01954897}}

{{refend}}

[[Category:Permutations]]