Soren Riis
Tytuł
Cytowane przez
Cytowane przez
Rok
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
651996
Information flows, graphs and their guessing numbers
S Riis
the electronic journal of combinatorics, R44-R44, 2007
632007
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
552011
A complexity gap for tree resolution
S Riis
Computational Complexity 10 (3), 179-209, 2001
502001
Hidden neural networks: A framework for HMM/NN hybrids
SK Riis, A Krogh
1997 IEEE International Conference on Acoustics, Speech, and Signal …, 1997
471997
Independence in bounded arithmetic.
S Riis
University of Oxford, 1994
411994
More on the relative strength of counting principles
P Beame, S Riis
Proof complexity and feasible arithmetics 39, 13-35, 1998
401998
Reversible and irreversible information networks
S Riis
IEEE Transactions on Information Theory 53 (11), 4339-4349, 2007
352007
Graph entropy, network coding and guessing games
S Riis
arXiv preprint arXiv:0711.4175, 2007
322007
Prediction of beta sheets in proteins
A Krogh, SK Riis
SCAN-9512053, 1995
301995
Making infinite structures finite in models of second order bounded arithmetic
S Riis
Arithmetic, proof theory, and computational complexity 23, 289-319, 1993
291993
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
262006
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
262006
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
262006
Tree resolution proofs of the weak pigeon-hole principle
S Dantchev, S Riis
Proceedings 16th Annual IEEE Conference on Computational Complexity, 69-75, 2001
262001
" Planar" tautologies hard for resolution
S Dantchev, S Riis
Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 220-229, 2001
252001
Utilising public information in network coding
S Riis
General Theory of Information Transfer and Combinatorics 4123, 866-897, 2006
242006
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
232015
On relativisation and complexity gap for resolution-based proof systems
S Dantchev, S Riis
International Workshop on Computer Science Logic, 142-154, 2003
222003
Count (ifq) does not imply Count (ifp)
S Riis
Annals of Pure and Applied Logic 90 (1-3), 1-56, 1997
221997
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20