Condorcet domains on at most seven alternatives. - Akello-Egwel, Dolica; Leedham-Green, Charles R.; Litterick, Alastair; Markström, Klas; Riis, Søren (Math. Soc. Sci., 2025)

Humanity's Last Exam. - Phan, Long; Gatti, Alice; Han, Ziwen; Li, Nathaniel; Hu, Josephina; Zhang, Hugh; Shi, Sean; Choi, Michael; Agrawal, Anish; Chopra, Arnav; Khoja, Adam; Kim, Ryan; et al. (CoRR, 2025)

The largest Condorcet domain on 8 alternatives. - Leedham-Green, Charles R.; Markström, Klas; Riis, Søren (Soc. Choice Welf., 2024)

CDL: A fast and flexible library for the study of permutation sets with structural restrictions. - Zhou, Bei; Markström, Klas; Riis, Søren (SoftwareX, 2024)

Local Diversity of Condorcet Domains. - Karpov, Alexander; Markström, Klas; Riis, Søren; Zhou, Bei (CoRR, 2024)

Arrow's single peaked domains, richness, and domains for plurality and the Borda count. - Markström, Klas; Riis, Søren; Zhou, Bei (CoRR, 2024)

Mastering NIM and Impartial Games with Weak Neural Networks: An AlphaZero-inspired Multi-Frame Approach. - Riis, Søren (CoRR, 2024)

New Record-Breaking Condorcet Domains on 10 and 11 Alternatives. - Zhou, Bei; Riis, Søren (CoRR, 2023)

Condorcet Domains of Degree at most Seven. - Akello-Egwel, Dolica; Leedham-Green, Charles R.; Litterick, Alastair; Markström, Klas; Riis, Søren (CoRR, 2023)

Set-alternating schemes: A new class of large Condorcet domains. - Karpov, Alexander; Markström, Klas; Riis, Søren; Zhou, Bei (CoRR, 2023)

CDL: A fast and flexible library for the study of permutation sets with structural restrictions. - Zhou, Bei; Markström, Klas; Riis, Søren (CoRR, 2023)

Exploring Parity Challenges in Reinforcement Learning through Curriculum Learning with Noisy Labels. - Zhou, Bei; Riis, Søren (CoRR, 2023)

Impartial Games: A Challenge for Reinforcement Learning. - Zhou, Bei; Riis, Søren (CoRR, 2022)

Max-flow min-cut theorems on dispersion and entropy measures for communication networks. - Riis, Søren; Gadouleau, Maximilien (Inf. Comput., 2019)

Graph Guessing Games and Non-Shannon Information Inequalities. - Baber, Rahil; Christofides, Demetres; Dang, Ntah Ahn; Vaughan, Emil R.; Riis, Søren (IEEE Trans. Inf. Theory, 2017)

Guessing Games on Triangle-Free Graphs. - Cameron, Peter J.; Dang, Ntah Ahn; Riis, Søren (Electron. J. Comb., 2016)

Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory. - Gadouleau, Maximilien; Richard, Adrien; Riis, Søren (SIAM J. Discret. Math., 2015)

Memoryless computation: New results, constructions, and extensions. - Gadouleau, Maximilien; Riis, Søren (Theor. Comput. Sci., 2015)

Ada Lovelace, a scientist in the archives. - Riis, Søren; Martin, Ursula; Woodhouse, Nick (2015)

What makes a chess program original? Revisiting the Rybka case. - Riis, Søren (Entertain. Comput., 2014)

Toward a theory for the design of human technologies. - Simonsen, Jesper; Hertzum, Morten; Nielsen, Jørgen Lerche; Riis, Søren (2014)

Fixed points of Boolean networks, guessing graphs, and coding theory. - Gadouleau, Maximilien; Richard, Adrien; Riis, Søren (CoRR, 2014)

Guessing Games on Triangle-free Graphs. - Cameron, Peter J.; Dang, Ntah Ahn; Riis, Søren (CoRR, 2014)

Graph Guessing Games and non-Shannon Information Inequalities. - Baber, Rahil; Christofides, Demetres; Dang, Ntah Ahn; Riis, Søren; Vaughan, Emil R. (CoRR, 2014)

Combinatorial representations. - Cameron, Peter J.; Gadouleau, Maximilien; Riis, Søren (J. Comb. Theory A, 2013)

Multiple unicasts, graph guessing games, and non-Shannon inequalities. - Baber, Rahil; Christofides, Demetres; Dang, Ntah Ahn; Riis, Søren; Vaughan, Emil R. (2013)

Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications. - Gadouleau, Maximilien; Riis, Søren (IEEE Trans. Inf. Theory, 2011)

A dispersion theorem for communication networks based on term sets. - Riis, Søren; Gadouleau, Maximilien (2011)

Max-flow min-cut theorem for Rényi entropy in communication networks. - Gadouleau, Maximilien; Riis, Søren (2011)

Computing without memory - Gadouleau, Maximilien; Riis, Søren (CoRR, 2011)

Graph-theoretical Constructions for Graph Entropy and Network Coding Based Communications - Gadouleau, Maximilien; Riis, Søren (CoRR, 2010)

Max-Flow Min-Cut Theorems for Communication Networks Based on Equational Logic - Gadouleau, Maximilien; Riis, Søren (CoRR, 2010)

On the guessing number of shift graphs. - Wu, Taoyang; Cameron, Peter J.; Riis, Søren (J. Discrete Algorithms, 2009)

On the asymptotic Nullstellensatz and Polynomial Calculus proof complexity. - Riis, Søren (Electron. Colloquium Comput. Complex., 2009)

On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity. - Riis, Søren (2008)

Information Flows, Graphs and their Guessing Numbers. - Riis, Søren (Electron. J. Comb., 2007)

Reversible and Irreversible Information Networks. - Riis, Søren (IEEE Trans. Inf. Theory, 2007)

Graph Entropy, Network Coding and Guessing games - Riis, Søren (CoRR, 2007)

Problems in Network Coding and Error Correcting Codes Appended by a Draft Version of S. Riis "Utilising Public Information in Network Coding". - Riis, Søren; Ahlswede, Rudolf (2006)

Assessing text-to-phoneme mapping strategies in speaker independent isolated word recognition. - Häkkinen, Juha; Suontausta, Janne; Riis, Søren; Jensen, Kåre Jean (Speech Commun., 2003)

On Relativisation and Complexity Gap. - Dantchev, Stefan S.; Riis, Søren (2003)

On text-based language identification for multilingual speech recognition systems. - Tian, Jilei; Häkkinen, Juha; Riis, Søren; Jensen, Kåre Jean (2002)

A complexity gap for tree resolution. - Riis, Søren (Comput. Complex., 2001)

Tree Resolution Proofs of the Weak Pigeon-Hole Principle. - Dantchev, Stefan S.; Riis, Søren (2001)

"Planar" Tautologies Hard for Resolution. - Dantchev, Stefan S.; Riis, Søren (2001)

Preface. - Butz, Carsten; Kohlenbach, Ulrich; Riis, Søren; Winskel, Glynn (Ann. Pure Appl. Log., 2000)

Generating hard tautologies using predicate logic and the symmetric group. - Riis, Søren; Sitharam, Meera (Log. J. IGPL, 2000)

Self-organizing letter code-book for text-to-phoneme neural network model. - Jensen, Kåre Jean; Riis, Søren (2000)

The complexity of scheduling TV commercials. - Hägele, Klemens; Ó'Dúnlaing, Colm; Riis, Søren (2000)

Count( qq) versus the pigeon-hole principle. - Riis, Søren (Arch. Math. Log., 1997)

Count(q) Does Not Imply Count(p). - Riis, Søren (Ann. Pure Appl. Log., 1997)

Bootstrapping the primitive recursive functions by only 27 colors. - Riis, Søren (Discret. Math., 1997)

Non-constant Degree Lower Bounds imply linear Degree Lower Bounds - Riis, Søren; Sitharam, Meera (Electron. Colloquium Comput. Complex., 1997)

More on the relative strength of counting principles. - Beame, Paul; Riis, Søren (1996)

Static Dictionaries on AC0 RAMs: Query Time Theta(sqrt(log n/log log n)) is Necessary and Sufficient. - Andersson, Arne; Miltersen, Peter Bro; Riis, Søren; Thorup, Mikkel (1996)