Soren Riis
Cited by
Cited by
Information flows, graphs and their guessing numbers
S Riis
2006 4th International Symposium on Modeling and Optimization in Mobile, Ad …, 2006
Graph-theoretical constructions for graph entropy and network coding based communications
M Gadouleau, S Riis
IEEE Transactions on Information Theory 57 (10), 6703-6717, 2011
Static dictionaries on AC/sup 0/RAMs: query time/spl theta/(/spl radic/log n/log log n) is necessary and sufficient
A Andersson, PB Miltersen, S Riis, M Thorup
Proceedings of 37th Conference on Foundations of Computer Science, 441-450, 1996
A complexity gap for tree resolution
S Riis
Computational Complexity 10 (3), 179-209, 2001
Problems in network coding and error correcting codes appended by a draft version of S. Riis “Utilising public information in network coding”
S Riis, R Ahlswede
General Theory of Information Transfer and Combinatorics, 861-897, 2006
Hidden neural networks: A framework for HMM/NN hybrids
SK Riis, A Krogh
1997 IEEE International Conference on Acoustics, Speech, and Signal …, 1997
More on the relative strength of counting principles.
P Beame, S Riis
Proof complexity and feasible arithmetics 39, 13-35, 1996
Independence in bounded arithmetic.
S Riis
University of Oxford, 1994
Reversible and irreversible information networks
S Riis
IEEE Transactions on Information Theory 53 (11), 4339-4349, 2007
Making infinite structures finite in models of second order bounded arithmetic
S Riis
Arithmetic, proof theory and computorial complexity, 289-319, 1993
Graph entropy, network coding and guessing games
S Riis
arXiv preprint arXiv:0711.4175, 2007
" Planar" tautologies hard for resolution
S Dantchev, S Riis
Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 220-229, 2001
Prediction of beta sheets in proteins
A Krogh, S Riis
Advances in Neural Information Processing Systems 8, 1995
Fixed points of Boolean networks, guessing graphs, and coding theory
M Gadouleau, A Richard, S Riis
SIAM Journal on Discrete Mathematics 29 (4), 2312-2335, 2015
Tree resolution proofs of the weak pigeon-hole principle
S Dantchev, S Riis
Proceedings 16th Annual IEEE Conference on Computational Complexity, 69-75, 2001
On relativisation and complexity gap for resolution-based proof systems
S Dantchev, S Riis
International Workshop on Computer Science Logic, 142-154, 2003
Count (ifq) does not imply Count (ifp)
S Riis
Annals of Pure and Applied Logic 90 (1-3), 1-56, 1997
Memoryless computation: new results, constructions, and extensions
M Gadouleau, S Riis
Theoretical Computer Science 562, 129-145, 2015
How do we allocate our resources when listening and memorizing speech in noise? A pupillometry study
H Bönitz, T Lunner, M Finke, L Fiedler, B Lyxell, SK Riis, E Ng, AL Valdes, ...
Ear and Hearing 42 (4), 846-859, 2021
Multiple unicasts, graph guessing games, and non-Shannon inequalities
R Baber, D Christofides, AN Dang, S Riis, ER Vaughan
2013 International Symposium on Network Coding (Netcod), 1-6, 2013
The system can't perform the operation now. Try again later.
Articles 1–20