Menu
 
Research menu
Jump to menu

Publications:  Dr Soren Riis

Baber R, Christofides D, Dang AN et al.(2016). Graph Guessing Games and Non-Shannon Information Inequalities. IEEE TRANSACTIONS ON INFORMATION THEORY vol. 63, (7) 4257-4267.
10.1109/TIT.2016.2628819
http://qmro.qmul.ac.uk/xmlui/handle/123456789/11052
Gadouleau M, Riis S(2015). Memoryless computation: New results, constructions, and extensions. THEORETICAL COMPUTER SCIENCE vol. 562, 129-145.
10.1016/j.tcs.2014.09.040
http://qmro.qmul.ac.uk/xmlui/handle/123456789/11879
Riis S, Martin U, Woodhouse N (2015). Ada Lovelace, a scientist in the archives. Ada Lovelace Symposium. 14-14.
10.1145/2867731.2867747
Gadouleau M, Richard A, Riis S(2015). FIXED POINTS OF BOOLEAN NETWORKS, GUESSING GRAPHS, AND CODING THEORY. SIAM JOURNAL ON DISCRETE MATHEMATICS vol. 29, (4) 2312-2335.
10.1137/140988358
http://qmro.qmul.ac.uk/xmlui/handle/123456789/25117
Riis S(2014). What makes a chess program original? Revisiting the Rybka case. Entertainment Computing vol. 5, (3) 189-204.
10.1016/j.entcom.2014.04.004
http://qmro.qmul.ac.uk/xmlui/handle/123456789/11880
Cameron PJ, Dang NA, Riis S(2014). Guessing Games on Triangle-free Graphs. CoRR vol. abs/1410.2405,
http://qmro.qmul.ac.uk/xmlui/handle/123456789/11893
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.
10.1109/NetCod.2013.6570823
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.
RIIS SM, Gadouleau M(2011). Graph theoretical constructions for Graph Entropy and Network Coding Based Communications. IEEE Transactions on Information Theory vol. 57, (10) 6703-6717.
10.1109/TIT.2011.2155618
http://qmro.qmul.ac.uk/xmlui/handle/123456789/22923
Cameron PJ, Gadouleau M, Riis S(2011). Combinatorial representations. Journal of Combinatorial Theory: Series A vol. 120, (3) 671-682.
10.1016/j.jcta.2012.12.002
http://qmro.qmul.ac.uk/xmlui/handle/123456789/3153
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.
10.1109/ISNETCOD.2011.5979085
Riis S, Gadouleau M, IEEE (2011). A Dispersion Theorem for Communication Networks Based on Term Sets. 2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT). 593-597.
10.1109/ISIT.2011.6034198
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,
Gadouleau M, Riis S(2010). Max-Flow Min-Cut Theorems for Communication Networks Based on Equational Logic. CoRR vol. abs/1012.5224,
http://qmro.qmul.ac.uk/xmlui/handle/123456789/3199
Wu T, Cameron P, Riis S(2009). On the guessing number of shift graphs. Journal of Discrete Algorithms vol. 7, (2) 220-226.
10.1016/j.jda.2008.09.009
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.
10.1109/LICS.2008.30
RIIS SM (2007). "Graph Entropy, Network Coding and Guessing games". ArXiv (ArXiv),
http://qmro.qmul.ac.uk/xmlui/handle/123456789/3110
Riis S(2007). Reversible and irreversible information networks. IEEE T INFORM THEORY vol. 53, (11) 4339-4349.
10.1109/TIT.2007.907345
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.
10.1016/S0022-4049(00)00069-4
Dantchev S, Riis S (2001). "Planar" tautologies hard for Resolution. 42ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS. 220-229.
10.1109/SFCS.2001.959896
Riis S(2001). A complexity gap for tree resolution. COMPUT COMPLEX vol. 10, (3) 179-209.
10.1007/s00037-001-8194-y
Dantchev S, Riis S (2000). Tree resolution proofs of the weak Pigeon-Hole Principle. 16TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS. 69-75.
10.1109/CCC.2001.933873
Return to top