Dr Soren Riis
Reader
School of Electronic Engineering and Computer Science
Queen Mary University of London
Queen Mary University of London
Research
Mathematical Logic, Complexity Theory, Proof Complexity, Algebraic Proof Complexity, Information Theory, Network Coding
Publications
Publications of specific relevance to the Centre for Fundamental Computer Science2025
Akello-Egwel D, Leedham-Green C, Litterick A, Markström K and Riis S (2025). Condorcet domains on at most seven alternatives. Mathematical Social Sciences, Elsevier vol. 133, 23-33. 01-01-2025
2024
Zhou B, Markström K and Riis S (2024). CDL: A fast and flexible library for the study of permutation sets with structural restrictions. SoftwareX, Elsevier vol. 28 01-12-2024
Markström K, Riis S and Zhou B (2024). Arrow's single peaked domains, richness, and domains for plurality and the Borda count. CoRR vol. abs/2401.12547 01-01-2024
Karpov A, Markström K, Riis S and Zhou B (2024). Local Diversity of Condorcet Domains. CoRR vol. abs/2401.11912 01-01-2024
2023
Leedham-Green C, Markström K and Riis S (2023). The largest Condorcet domain on 8 alternatives. Social Choice and Welfare, Springer Nature vol. 62 (1), 109-116. 05-09-2023
Zhou B and Riis S (2023). New Record-Breaking Condorcet Domains on 10 and 11 Alternatives. CoRR vol. abs/2303.06524 01-01-2023
Karpov A, Markström K, Riis S and Zhou B (2023). Set-alternating schemes: A new class of large Condorcet domains. CoRR vol. abs/2308.02817 01-01-2023
Akello-Egwell D, Leedham-Green CR, Litterick A, Markström K and Riis S (2023). Condorcet Domains of Degree at most Seven. CoRR vol. abs/2306.15993 01-01-2023
Zhou B and Riis S (2023). Exploring Parity Challenges in Reinforcement Learning through Curriculum Learning with Noisy Labels. CoRR vol. abs/2312.05379 01-01-2023
2022
Zhou B and Riis S (2022). Impartial Games: A Challenge for Reinforcement Learning. CoRR vol. abs/2205.12787 01-01-2022
2019
RIIS S and Gadouleau M (2019). Max-Flow Min-Cut Theorems on Dispersion and Entropy Measures for Communication Networks. Information and Computation, Elsevier 19-03-2019
2017
Baber R, Christofides D, Dang AN, Vaughan ER and Riis S (2017). Graph Guessing Games and Non-Shannon Information Inequalities. IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers (IEEE) vol. 63 (7), 4257-4267. 01-07-2017
2016
Cameron PJ, Dang NA and Riis S (2016). Guessing Games on Triangle-Free Graphs. Electron. J. Comb. vol. 23, 1-1. 01-01-2016
2015
Riis S (2015). Network Communication with operators in Dedekind Finite and Stably Finite Rings. arXiv 05-07-2015
Riis S, Martin U and Woodhouse N (2015). Ada Lovelace, a scientist in the archives. Ada Lovelace Symposium 2015- Celebrating 200 Years of a Computer Visionary on - Ada Lovelace Symposium '15. 01-01-2015
2014
Baber R, Christofides D, Dang AN, Riis S and Vaughan E (2014). Graph Guessing Games and non-Shannon Information Inequalities. 30-10-2014
Gadouleau M, Richard A and Riis S (2014). Fixed points of Boolean networks, guessing graphs, and coding theory. 22-09-2014
Riis S (2014). What makes a chess program original? Revisiting the Rybka case. Entertainment Computing, Elsevier vol. 5 (3), 189-204. 01-08-2014
Baber R, Christofides D, Dang NA, Riis S and Vaughan ER (2014). Graph Guessing Games and non-Shannon Information Inequalities. CoRR vol. abs/1410.8349 01-01-2014
2013
RIIS SM, Barber R , Christofides D , Dang A N and Vaughan E R (2013). Multiple unicasts, graph guessing games, and non-Shannon inequalities. 2013 International Symposium on Network Coding (NetCod) Calgary 7 Jun 2013 - 9 Jun 2013. 01-01-2013
2012
Williams H, McOwan P and Riis S (2012). Making magic: applying artificial intelligence methods to design a psychophysically compelling illusion. PERCEPTION vol. 41 (12), 1526-1526. 01-01-2012
2011
Gadouleau M and Riis S (2011). Memoryless computation: new results, constructions, and extensions. 25-11-2011
Cameron PJ, Gadouleau M and Riis S (2011). Combinatorial representations. Journal of Combinatorial Theory: Series A vol. 120 (3), 671-682. 06-09-2011
Riis S and Gadouleau M (2011). A Dispersion Theorem for Communication Networks Based on Term Sets. 2011 IEEE International Symposium on Information Theory Proceedings. 01-07-2011
RIIS SM and Gadouleau M (2011). Network Coding Theorem for Dynamic Communication Networks. Network Coding (NetCod), 2011 International Symposium Beijing 25 Jul 2011 - 26 Jul 2011. 01-07-2011
Gadouleau M and Riis S (2011). Max-Flow Min-Cut Theorem for Renyi Entropy in Communication Networks. 01-01-2011
2010
Riis S and Gadouleau M (2010). Max-Flow Min-Cut Theorems for Multi-User Communication Networks. 23-12-2010
Gadouleau M and Riis S (2010). Graph-theoretical Constructions for Graph Entropy and Network Coding
Based Communications. 13-10-2010
Gadouleau M and Riis S (2010). Graph-theoretical Constructions for Graph Entropy and Network Coding Based Communications. CoRR vol. abs/1010.2619 01-01-2010
2009
Wu T, Cameron P and Riis S (2009). On the guessing number of shift graphs. Journal of Discrete Algorithms, Elsevier vol. 7 (2), 220-226. 01-06-2009
RIIS SM (2009). On the asymptotic Nullstellensatz and Polynomial Calculus proof complexity. On the asymptotic Nullstellensatz and Polynomial Calculus proof complexity 01-02-2009
2008
Riis S (2008). On the asymptotic Nullstellensatz and Polynomial calculus proof complexity. 01-01-2008
2007
Riis S (2007). Reversible and irreversible information networks. IEEE T INFORM THEORY vol. 53 (11), 4339-4349. 01-11-2007
Riis S (2007). Information flows, graphs and their guessing numbers. ELECTRON J COMB vol. 14 (1) 07-06-2007
2006
Riis S and Ahlswede R (2006). Problems in network coding and error correcting codes appended by a draft version of S Riis utilising public information in network coding., Editors: Ahlswede R, Baumer L, Cai N, Aydinian H, Blinovsky V, Deppe C and Mashurian H. 01-01-2006
2004
RIIS SM (2004). Linear versus non-linear Boolean functions in Network Flow. 38th Annual Conference on Information Sciences and Systems (CISS). 01-03-2004
2003
Dantchev SS and Riis S (2003). On Relativisation and Complexity Gap., Editors: Baaz M and Makowsky JA. 01-01-2003
Dantchev S and Riis S (2003). On relativisation and complexity gap for resolution-based proof systems., Editors: Baaz M and Makowsky JA. 01-01-2003
2001
Riis S and Sitharam M (2001). Uniformly generated submodules of permutation modules - Over fields of characteristic 0. J PURE APPL ALGEBRA vol. 160 (2-3), 285-318. 25-06-2001
Hägele K, Dúnlaing CÓ and Riis S (2001). The complexity of scheduling TV commercials. Electronic Notes in Theoretical Computer Science, Elsevier vol. 40, 162-185. 01-03-2001
Riis S (2001). A complexity gap for tree resolution. COMPUT COMPLEX vol. 10 (3), 179-209. 01-01-2001
2000
Dantchev S and Riis S (2000). A Tough Nut for Tree Resolution. BRICS Report Series, Det Kgl. Bibliotek/Royal Danish Library vol. 7 (10) 10-01-2000
Jensen KJ and Riis S (2000). Self-organizing letter code-book for text-to-phoneme neural network model. 01-01-2000
1999
Riis S (1999). A Complexity Gap for Tree-Resolution. BRICS Report Series, Det Kgl. Bibliotek/Royal Danish Library vol. 6 (29) 29-01-1999
1998
Riis S and Sitharam M (1998). Uniformly Generated Submodules of Permutation Modules. BRICS Report Series, Det Kgl. Bibliotek/Royal Danish Library vol. 5 (20) 20-01-1998
Riis S and Sitharam M (1998). Generating Hard Tautologies Using Predicate Logic and the Symmetric Group. BRICS Report Series, Det Kgl. Bibliotek/Royal Danish Library vol. 5 (19) 19-01-1998
1997
Riis S (1997). Count(ifq) does not imply Count(ifp). Annals of Pure and Applied Logic, Elsevier vol. 90 (1-3), 1-56. 01-12-1997
Andersson A, Miltersen PB, Riis S and Thorup M (1997). Dictionaries on AC^0 RAMs: Query Time Theta(√log n/log log n) is Necessary and Sufficient. BRICS Report Series, Det Kgl. Bibliotek/Royal Danish Library vol. 4 (14) 04-06-1997
Riis S (1997). Bootstrapping the primitive recursive functions by only 27 colors. Discrete Mathematics, Elsevier vol. 169 (1-3), 269-272. 01-05-1997
Riis S (1997). Count($$q$$) versus the pigeon-hole principle. Archive for Mathematical Logic, Springer Nature vol. 36 (3), 157-188. 01-04-1997
1996
Andersson A, Miltersen PB, Riis S and Thorup M (1996). Static dictionaries on AC0 RAMs: Query time Θ(√log n/log log n) is necessary and sufficient. 01-12-1996
1994
Riis S (1994). Count(q) versus the Pigeon-Hole Principle. BRICS Report Series, Det Kgl. Bibliotek/Royal Danish Library vol. 1 (26) 03-08-1994
Riis S (1994). Bootstrapping the Primitive Recursive Functions by 47 Colors. BRICS Report Series, Det Kgl. Bibliotek/Royal Danish Library vol. 1 (25) 03-08-1994
Riis S (1994). A Fractal which violates the Axiom of Determinacy. BRICS Report Series, Det Kgl. Bibliotek/Royal Danish Library vol. 1 (24) 03-08-1994
Riis S (1994). Finitisation in Bounded Arithmetic. BRICS Report Series, Det Kgl. Bibliotek/Royal Danish Library vol. 1 (23) 03-08-1994
Riis S (1994). Count(q) does not imply Count(p). BRICS Report Series, Det Kgl. Bibliotek/Royal Danish Library vol. 1 (21) 03-07-1994