Søren Riis

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 12

Top Topics

Subgraph Isomorphism

Boolean Networks

Top Venues

IEEE Trans. Inf. Theory

Soc. Choice Welf.

Publications

Klas Markström, Søren Riis, Bei Zhou
Arrow's single peaked domains, richness, and domains for plurality and the Borda count. CoRR (2024)
Charles R. Leedham-Green, Klas Markström, Søren Riis
The largest Condorcet domain on 8 alternatives. Soc. Choice Welf. 62 (1) (2024)
Alexander Karpov, Klas Markström, Søren Riis, Bei Zhou
Local Diversity of Condorcet Domains. CoRR (2024)
Bei Zhou, Klas Markström, Søren Riis
CDL: A fast and flexible library for the study of permutation sets with structural restrictions. CoRR (2023)
Bei Zhou, Søren Riis
New Record-Breaking Condorcet Domains on 10 and 11 Alternatives. CoRR (2023)
Alexander Karpov, Klas Markström, Søren Riis, Bei Zhou
Set-alternating schemes: A new class of large Condorcet domains. CoRR (2023)
Bei Zhou, Søren Riis
Exploring Parity Challenges in Reinforcement Learning through Curriculum Learning with Noisy Labels. CoRR (2023)
Dolica Akello-Egwell, Charles R. Leedham-Green, Alastair Litterick, Klas Markström, Søren Riis
Condorcet Domains of Degree at most Seven. CoRR (2023)
Bei Zhou, Søren Riis
Impartial Games: A Challenge for Reinforcement Learning. CoRR (2022)
Søren Riis, Maximilien Gadouleau
Max-flow min-cut theorems on dispersion and entropy measures for communication networks. Inf. Comput. 267 (2019)
Rahil Baber, Demetres Christofides, Ntah Ahn Dang, Emil R. Vaughan, Søren Riis
Graph Guessing Games and Non-Shannon Information Inequalities. IEEE Trans. Inf. Theory 63 (7) (2017)
Peter J. Cameron, Ntah Ahn Dang, Søren Riis
Guessing Games on Triangle-Free Graphs. Electron. J. Comb. 23 (1) (2016)
Søren Riis, Ursula Martin, Nick Woodhouse
Ada Lovelace, a scientist in the archives. Ada Lovelace Symposium (2015)
Maximilien Gadouleau, Søren Riis
Memoryless computation: New results, constructions, and extensions. Theor. Comput. Sci. 562 (2015)
Maximilien Gadouleau, Adrien Richard, Søren Riis
Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory. SIAM J. Discret. Math. 29 (4) (2015)
Maximilien Gadouleau, Adrien Richard, Søren Riis
Fixed points of Boolean networks, guessing graphs, and coding theory. CoRR (2014)
Søren Riis
What makes a chess program original? Revisiting the Rybka case. Entertain. Comput. 5 (3) (2014)
Jesper Simonsen, Morten Hertzum, Jørgen Lerche Nielsen, Søren Riis
Toward a theory for the design of human technologies. OZCHI (2014)
Peter J. Cameron, Ntah Ahn Dang, Søren Riis
Guessing Games on Triangle-free Graphs. CoRR (2014)
Rahil Baber, Demetres Christofides, Ntah Ahn Dang, Søren Riis, Emil R. Vaughan
Graph Guessing Games and non-Shannon Information Inequalities. CoRR (2014)
Peter J. Cameron, Maximilien Gadouleau, Søren Riis
Combinatorial representations. J. Comb. Theory, Ser. A 120 (3) (2013)
Rahil Baber, Demetres Christofides, Ntah Ahn Dang, Søren Riis, Emil R. Vaughan
Multiple unicasts, graph guessing games, and non-Shannon inequalities. NetCod (2013)
Maximilien Gadouleau, Søren Riis
Computing without memory CoRR (2011)
Søren Riis, Maximilien Gadouleau
A dispersion theorem for communication networks based on term sets. ISIT (2011)
Maximilien Gadouleau, Søren Riis
Max-flow min-cut theorem for Rényi entropy in communication networks. ISIT (2011)
Maximilien Gadouleau, Søren Riis
Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications. IEEE Trans. Inf. Theory 57 (10) (2011)
Maximilien Gadouleau, Søren Riis
Max-Flow Min-Cut Theorems for Communication Networks Based on Equational Logic CoRR (2010)
Maximilien Gadouleau, Søren Riis
Graph-theoretical Constructions for Graph Entropy and Network Coding Based Communications CoRR (2010)
Taoyang Wu, Peter J. Cameron, Søren Riis
On the guessing number of shift graphs. J. Discrete Algorithms 7 (2) (2009)
Søren Riis
On the asymptotic Nullstellensatz and Polynomial Calculus proof complexity. Electron. Colloquium Comput. Complex. 16 (2009)
Søren Riis
On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity. LICS (2008)
Søren Riis
Graph Entropy, Network Coding and Guessing games CoRR (2007)
Søren Riis
Reversible and Irreversible Information Networks. IEEE Trans. Inf. Theory 53 (11) (2007)
Søren Riis
Information Flows, Graphs and their Guessing Numbers. Electron. J. Comb. 14 (1) (2007)
Søren Riis, Rudolf Ahlswede
Problems in Network Coding and Error Correcting Codes Appended by a Draft Version of S. Riis "Utilising Public Information in Network Coding". GTIT-C (2006)
Stefan S. Dantchev, Søren Riis
On Relativisation and Complexity Gap. CSL (2003)
Juha Häkkinen, Janne Suontausta, Søren Riis, Kåre Jean Jensen
Assessing text-to-phoneme mapping strategies in speaker independent isolated word recognition. Speech Commun. 41 (2-3) (2003)
Jilei Tian, Juha Häkkinen, Søren Riis, Kåre Jean Jensen
On text-based language identification for multilingual speech recognition systems. INTERSPEECH (2002)
Stefan S. Dantchev, Søren Riis
Tree Resolution Proofs of the Weak Pigeon-Hole Principle. Computational Complexity Conference (2001)
Stefan S. Dantchev, Søren Riis
"Planar" Tautologies Hard for Resolution. FOCS (2001)
Søren Riis
A complexity gap for tree resolution. Comput. Complex. 10 (3) (2001)
Klemens Hägele, Colm Ó'Dúnlaing, Søren Riis
The complexity of scheduling TV commercials. Electron. Notes Theor. Comput. Sci. 40 (2000)
Carsten Butz, Ulrich Kohlenbach, Søren Riis, Glynn Winskel
Preface. Ann. Pure Appl. Log. 104 (1-3) (2000)
Kåre Jean Jensen, Søren Riis
Self-organizing letter code-book for text-to-phoneme neural network model. INTERSPEECH (2000)
Søren Riis, Meera Sitharam
Generating hard tautologies using predicate logic and the symmetric group. Log. J. IGPL 8 (6) (2000)
Søren Riis, Meera Sitharam
Non-constant Degree Lower Bounds imply linear Degree Lower Bounds Electron. Colloquium Comput. Complex. 4 (48) (1997)
Søren Riis
Count(q) Does Not Imply Count(p). Ann. Pure Appl. Log. 90 (1-3) (1997)
Søren Riis
q) versus the pigeon-hole principle. Arch. Math. Log. 36 (3) (1997)
Søren Riis
Bootstrapping the primitive recursive functions by only 27 colors. Discret. Math. 169 (1-3) (1997)
Arne Andersson, Peter Bro Miltersen, Søren Riis, Mikkel Thorup
RAMs: Query Time Theta(sqrt(log n/log log n)) is Necessary and Sufficient. FOCS (1996)
Paul Beame, Søren Riis
More on the relative strength of counting principles. Proof Complexity and Feasible Arithmetics (1996)