Search the dblp DataBase

Publications of Author

1. Stefan S. Dantchev, Søren Riis
   Tree Resolution Proofs of the Weak Pigeon-Hole Principle. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2001, pp:69-75 [Conf]
   
2. Stefan S. Dantchev, Søren Riis
   On Relativisation and Complexity Gap. [Citation Graph (0, 0)][DBLP]
   CSL, 2003, pp:142-154 [Conf]
   
3. Arne Andersson, Peter Bro Miltersen, Søren Riis, Mikkel Thorup
   Static Dictionaries on AC⁰ RAMs: Query Time Theta(sqrt(log n/log log n)) is Necessary and Sufficient. [Citation Graph (0, 0)][DBLP]
   FOCS, 1996, pp:441-450 [Conf]
   
4. Stefan S. Dantchev, Søren Riis
   "Planar" Tautologies Hard for Resolution. [Citation Graph (0, 0)][DBLP]
   FOCS, 2001, pp:220-229 [Conf]
   
5. Søren Riis, Rudolf Ahlswede
   Problems in Network Coding and Error Correcting Codes Appended by a Draft Version of S. Riis "Utilising Public Information in Network Coding". [Citation Graph (0, 0)][DBLP]
   GTIT-C, 2006, pp:861-897 [Conf]
   
6. Carsten Butz, Ulrich Kohlenbach, Søren Riis, Glynn Winskel
   Preface. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2000, v:104, n:1-3, pp:1-2 [Journal]
   
7. Søren Riis
   Count(q) Does Not Imply Count(p). [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 1997, v:90, n:1-3, pp:1-56 [Journal]
   
8. Søren Riis
   A complexity gap for tree resolution. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 2001, v:10, n:3, pp:179-209 [Journal]
   
9. Klemens Hägele, Colm Ó'Dúnlaing, Søren Riis
   The complexity of scheduling TV commercials. [Citation Graph (0, 0)][DBLP]
   Electr. Notes Theor. Comput. Sci., 2000, v:40, n:, pp:- [Journal]
   
10. Søren Riis, Meera Sitharam
    Generating hard tautologies using predicate logic and the symmetric group. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 2000, v:8, n:6, pp:- [Journal]
    
11. Juha Häkkinen, Janne Suontausta, Søren Riis, Kåre Jean Jensen
    Assessing text-to-phoneme mapping strategies in speaker independent isolated word recognition. [Citation Graph (0, 0)][DBLP]
    Speech Communication, 2003, v:41, n:2-3, pp:455-467 [Journal]
    
12. Søren Riis
    Bootstrapping the primitive recursive functions by only 27 colors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:169, n:1-3, pp:269-272 [Journal]
    
13. 
    On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity. [Citation Graph (, )][DBLP]
    
    
14. 
    Count( qq) versus the pigeon-hole principle. [Citation Graph (, )][DBLP]
    
    
15. 
    Information Flows, Graphs and their Guessing Numbers. [Citation Graph (, )][DBLP]
    
    
16. 
    Graph Entropy, Network Coding and Guessing games [Citation Graph (, )][DBLP]