Soren Riis
Title
Cited by
Cited by
Year
Linear versus non-linear boolean functions in network flow
S Riis
Proc. CISS'04, 2004
922004
Information flows, graphs and their guessing numbers
S Riis
2006 4th International Symposium on Modeling and Optimization in Mobile, Ad …, 2006
682006
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
661996
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
512011
Hidden neural networks: A framework for HMM/NN hybrids
SK Riis, A Krogh
1997 IEEE International Conference on Acoustics, Speech, and Signal …, 1997
481997
A complexity gap for tree resolution
S Riis
Computational Complexity 10 (3), 179-209, 2001
472001
Problems in network coding and error correcting codes
S Riis, R Ahlswede
39*2005
Problems in network coding and error correcting codes
S Riis, R Ahlswede
39*2005
Problems in network coding and error correcting codes
S Riis, R Ahlswede
39*2005
Independence in bounded arithmetic.
S Riis
University of Oxford, 1994
391994
More on the relative strength of counting principles
P Beame, S Riis
Proof complexity and feasible arithmetics 39, 13-35, 1998
371998
Reversible and irreversible information networks
S Riis
IEEE Transactions on Information Theory 53 (11), 4339-4349, 2007
342007
Graph entropy, network coding and guessing games
S Riis
arXiv preprint arXiv:0711.4175, 2007
312007
Prediction of beta sheets in proteins
A Krogh, SK Riis
Advances in Neural Information Processing Systems, 917-923, 1996
301996
Making infinite structures finite in models of second order bounded arithmetic
S Riis
Arithmetic, Proof Theory, and Computational Complexity 23, 289-319, 1993
301993
Tree resolution proofs of the weak pigeon-hole principle
S Dantchev, S Riis
Proceedings 16th Annual IEEE Conference on Computational Complexity, 69-75, 2001
242001
Count (ifq) does not imply Count (ifp)
S Riis
Annals of Pure and Applied Logic 90 (1-3), 1-56, 1997
231997
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
222015
" Planar" tautologies hard for resolution
S Dantchev, S Riis
Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 220-229, 2001
222001
On relativisation and complexity gap for resolution-based proof systems
S Dantchev, S Riis
International Workshop on Computer Science Logic, 142-154, 2003
212003
The system can't perform the operation now. Try again later.
Articles 1–20