Skip to search formSkip to main contentSkip to account menu

Steinhaus–Johnson–Trotter algorithm

Known as: Johnson–Trotter algorithm, Steinhaus-Johnson-Trotter, Johnson–Trotter 
The Steinhaus–Johnson–Trotter algorithm or Johnson–Trotter algorithm, also called plain changes, is an algorithm named after Hugo Steinhaus, Selmer M… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We study two important implications of the constraint composite graph (CCG) associated with the weighted constraint satisfaction… 
2013
2013
The resolution of dynamics in out of equilibrium quantum spin systems lies at the heart of fundamental questions among Quantum… 
2011
2011
In Anglophone postcolonial fiction of the twentieth century, myth is used as a framing device that contains and interrogates… 
2010
2010
Our understanding of Mercury’s sodium exosphere has improved considerably in the last 5 years thanks to new observations… 
2006
2006
A loopless algorithm is a procedure for generating a list of values under two restrictions: the first element should be produced… 
2005
2005
J. JAW~CEK: J. olin. Invest. 37, 660, (1958). ~ ~ VEI~E:f, E. B., and M.¥ooT: Quart. &exp. Physiol. 28, 253 (1938).--2~v WAK~5… 
Review
2003
Review
2003
Scholars frequently acknowledge the force of political Islam in shaping the Muslim societies of Africa and Asia, but seldom… 
2003
2003
Two completely new algorithms for generating permutations, shift-cursor algorithm and level algorithm, and their efficient… 
1997
1997
Corneal, lenticular, and retinal damage have been observed following exposures to a laser emitting in the near-infrared…