Research menu
Jump to menu

Publications:  Dr Soren Riis

Riis S, Martin U, Woodhouse N (2015) . Ada Lovelace, a scientist in the archives. Ada Lovelace Symposium. 14-14.
Riis S (2014) . What makes a chess program original? Revisiting the Rybka case.Entertainment Computing vol. 5, (3) 189-204.
RIIS SM, Barber, R, Christofides, D et al. (2013) . Multiple unicasts, graph guessing games, and non-Shannon inequalities. Conference: 2013 International Symposium on Network Coding (NetCod) (Calgary) from: 07/06/2013 to: 09/06/2013, 1-6.
Williams H, McOwan P, Riis S (2012) . Making magic: applying artificial intelligence methods to design a psychophysically compelling illusion.PERCEPTION vol. 41, (12) 1526-1526.
Cameron PJ, Gadouleau M, Riis S (2011) . Combinatorial representations.Journal of Combinatorial Theory: Series A vol. 120, (3) 671-682.
RIIS SM, Gadouleau M (2011) . Network Coding Theorem for Dynamic Communication Networks. 2011 International Symposium on Network Coding (NetCod). Conference: Network Coding (NetCod), 2011 International Symposium (Beijing) from: 25/07/2011 to: 26/07/2011, 1-6.
Gadouleau M, Riis S (2011) . Computing without memory.CoRR vol. abs/1111.6026,
Gadouleau M, Riis S, IEEE (2011) . Max-Flow Min-Cut Theorem for Renyi Entropy in Communication Networks. 2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT). 603-607.
Gadouleau M, Riis S (2010) . Graph-theoretical Constructions for Graph Entropy and Network Coding Based Communications.CoRR vol. abs/1010.2619,
RIIS SM (2009) . On the asymptotic Nullstellensatz and Polynomial Calculus proof complexity.Electronic Colloquium on Computational Complexty report no. TR09-014,
Riis S (2008) . On the asymptotic Nullstellensatz and Polynomial calculus proof complexity. TWENTY-THIRD ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS. 272-283.
RIIS SM (2007) . "Graph Entropy, Network Coding and Guessing games".ArXiv (ArXiv),
Riis S (2007) . Reversible and irreversible information networks.IEEE T INFORM THEORY vol. 53, (11) 4339-4349.
Riis S (2007) . Information flows, graphs and their guessing numbers.ELECTRON J COMB vol. 14, (1) Article R44,
Riis S (2006) . Information flows, graphs and their guessing numbers. 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, Vols 1 and 2. 640-648.
Riis S, 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". General Theory of Information Transfer and Combinatorics. Editors: Ahlswede, R, Baumer, L, Cai, N, Aydinian, H et al., vol. 4123, 861-897.
RIIS SM (2004) . Linear versus non-linear Boolean functions in Network Flow. 38th Annual Conference on Information Sciences and Systems (CISS). Conference: 38th Annual Conference on Information Sciences and Systems (CISS)
Dantchev SS, Riis S (2003) . On Relativisation and Complexity Gap. CSL. Editors: Baaz, M, Makowsky, JA, vol. 2803, 142-154.
Dantchev S, Riis S (2003) . On relativisation and complexity gap for resolution-based proof systems. COMPUTER SCIENCE LOGIC, PROCEEDINGS. Editors: Baaz, M, Makowsky, JA, vol. 2803, 142-154.
Riis S, Sitharam M (2001) . Uniformly generated submodules of permutation modules - Over fields of characteristic 0.J PURE APPL ALGEBRA vol. 160, (2-3) 285-318.
Dantchev S, Riis S (2001) . "Planar" tautologies hard for Resolution. 42ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS. 220-229.
Riis S (2001) . A complexity gap for tree resolution.COMPUT COMPLEX vol. 10, (3) 179-209.
Dantchev S, Riis S (2000) . Tree resolution proofs of the weak Pigeon-Hole Principle. 16TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS. 69-75.
RIIS SM, Gadouleau M. A Dispersion Theorem for Communication Networks Based on Term Sets. Proceedings of the IEEE International Symposium on Information Theory. Conference: 2011 IEEE International Symposium on Information Theory from: 31/07/2011 to: 05/08/2011, 593-597.
RIIS SM. Classification of the asymptotic Proof Complexity of Polynomial Calculus.Graphs and Combinatorics
Gadouleau M, Richard A, Riis S. Fixed points of Boolean networks, guessing graphs, and coding theory.
Baber R, Christofides D, Dang AN et al.. Graph Guessing Games and non-Shannon Information Inequalities.
Gadouleau M, Riis S. Graph-theoretical Constructions for Graph Entropy and Network Coding Based Communications.
Cameron PJ, Dang AN, Riis S. Guessing Games on Triangle-free Graphs.
Riis S, Gadouleau M. Max-Flow Min-Cut Theorems for Multi-User Communication Networks.
Gadouleau M, Riis S. Memoryless computation: new results, constructions, and extensions.
Riis S. Network Communication with operators in Dedekind Finite and Stably Finite Rings.
Cameron P, Riis S, Wu T. The guessing number of shift graphs.Journal of Discrete Algorithms, vol. 2009, (7) 220-226.
Return to top