The following pages link to Søren Riis (Q195146):
Displaying 22 items.
- Guessing games on triangle-free graphs (Q278884) (← links)
- Memoryless computation: new results, constructions, and extensions (Q476853) (← links)
- On the guessing number of shift graphs (Q1026230) (← links)
- Bootstrapping the primitive recursive functions by only 27 colors (Q1357751) (← links)
- Count\((q)\) versus the pigeon-hole principle (Q1360313) (← links)
- \(\text{Count}(q)\) does not imply \(\text{Count}(p)\) (Q1377601) (← links)
- A complexity gap for tree resolution (Q1601038) (← links)
- Combinatorial representations (Q1940378) (← links)
- Information flows, graphs and their guessing numbers (Q2372888) (← links)
- Max-flow min-cut theorems on dispersion and entropy measures for communication networks (Q2417851) (← links)
- (Q3140642) (← links)
- Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory (Q3455244) (← links)
- Reversible and Irreversible Information Networks (Q3548899) (← links)
- (Q4375784) (← links)
- Generating hard tautologies using predicate logic and the symmetric group (Q4521285) (← links)
- The complexity of scheduling TV commercials (Q4923372) (← links)
- Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications (Q5272296) (← links)
- Computer Science Logic (Q5292633) (← links)
- Graph Guessing Games and Non-Shannon Information Inequalities (Q5358568) (← links)
- Problems in Network Coding and Error Correcting Codes Appended by a Draft Version of S. Riis “Utilising Public Information in Network Coding” (Q5504233) (← links)
- Uniformly generated submodules of permutation modules over fields of characteristic 0. (Q5939910) (← links)
- The largest Condorcet domain on 8 alternatives (Q6541012) (← links)
