Content deleted Content added
No edit summary |
→Source bibliography: missing year; MOS:LISTGAP; ref=harv now redundant |
||
Line 99:
=== Source bibliography ===
{{refbegin
* {{cite book
| last = Aigner | first = Martin
| title = A course in enumeration
| chapter = Word Representation
| publisher = Springer | ___location = Berlin, New York | year = 2007 | isbn = 3642072534}}
▲* {{cite journal |ref = harv
| first1 = Wilhelm | last1 = Barth
| first2 = Petra | last2 = Mutzel |author2-link = Petra Mutzel
| title = Simple and Efficient Bilayer Cross Counting
| journal = [[Journal of Graph Algorithms and Applications]] | volume = 8 | issue = 2 | pages = 179–194 | year = 2004 | doi = 10.7155/jgaa.00088| doi-access = free }}
| last = Bóna | first = Miklós | author-link = Miklós Bóna
| title = Combinatorics of permutations
| chapter = 2.2 Inversions in Permutations of Multisets
| publisher = CRC Press | ___location = Boca Raton, FL | year = 2012 | isbn = 1439850518 }}
| last = Comtet | first = Louis
| title = Advanced combinatorics; the art of finite and infinite expansions
Line 125 ⟶ 122:
| chapter = 6.4 Inversions of a permutation of [n]
| publisher = D. Reidel Pub. Co | ___location = Dordrecht,Boston | year = 1974 | isbn = 9027704414 }}
| first1=Thomas H. |last1=Cormen |authorlink1=Thomas H. Cormen
| last2=Leiserson |first2=Charles E. |authorlink2=Charles E. Leiserson
Line 137 ⟶ 133:
| edition = 2nd
}}
| last = Gratzer | first = George | authorlink = George Grätzer
| title = Lattice theory. special topics and applications
| chapter = 7-2 Basic objects
| publisher = Birkhäuser | ___location = Cham, Switzerland | year = 2016 | isbn = 331944235X }}
▲* {{cite book| ref = harv
|last1=Kleinberg|first1=Jon
|last2=Tardos|first2=Éva
|title=Algorithm Design
|year=2005
|isbn=0-321-29535-8 }}
| last1 = Knuth | first1 = Donald
| title = [[The art of computer programming]]
| chapter = 5.1.1 Inversions
| publisher = Addison-Wesley Pub. Co | year = 1973 | isbn = 0201896850}}
▲* {{cite book |ref=harv
|title=Sorting: a distribution theory
|chapter=Sorting Nonrandom Data
Line 163 ⟶ 156:
|first=Hosam Mahmoud |last=Mahmoud
|publisher=Wiley-IEEE |year=2000 |isbn=978-0-471-32710-3}}
▲* {{cite book |ref=harv
|title=Computational discrete mathematics: combinatorics and graph theory with Mathematica
|chapter=Permutations and combinations
Line 170 ⟶ 162:
|first2=Steven S.|last2=Skiena
|publisher=Cambridge University Press |year=2003 |isbn=978-0-521-80686-2}}
▲* {{cite book |ref=harv
|title=Algorithms and Complexity
|volume=1
| |||