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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Coherent domains and improved lower bounds for the maximum size of Condorcet domains. - Alexander Karpov; Klas Markström; Søren Riis; Bei Zhou (Discret. Appl. Math., 2025)

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

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

An efficient heuristic search algorithm for discovering large Condorcet domains. - Bei Zhou; Søren Riis (4OR, 2025)