BibSLEIGH — tournament stem

Used together with:

Stem tournament$ (all stems)

ICML-2015-RajkumarGL0 #probability #ranking #set: Ranking from Stochastic Pairwise Preferences: Recovering Condorcet Winners and Tournament Solution Sets at the Top (AR, SG, LHL, SA), pp. 665–673.
STOC-2008-ChenGP #combinator: Pricing combinatorial markets for tournaments (YC, SG, DMP), pp. 305–314.
SAT-2004-ZhangLS #satisfiability: A SAT Based Scheduler for Tournament Schedules (HZ, DL, HS), pp. 191–196.
ITiCSE-2003-KolasF #game studies #motivation #using: Increasing assignment motivation using a game Al tournament (ØK, IF), p. 269.
SAC-2001-HuangH #approach #clustering: Finding a hamiltonian paths in tournaments on clusters — a provably communication-efficient approach (CHH, XH), pp. 549–553.
SAC-2000-LimT00a: Tournament Selection for Browsing Temporal Signals (ISL, DT), pp. 570–573.
ICLP-1999-Henz #constraints: Constraint-based Round Robin Tournament Planning (MH), pp. 545–557.
ICDAR-1993-TokahashiG #linear #recognition #verification: Recognition enhancement by linear tournament verification (HT, TDG), pp. 585–588.
ICALP-1983-LescanneS #case study #data type #on the: On the Study Data Structures: Binary Tournaments with Repeated Keys (PL, JMS), pp. 466–477.