Søren Riis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

18EESøren Riis: On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity. LICS 2008: 272-283
17EESøren Riis: Graph Entropy, Network Coding and Guessing games CoRR abs/0711.4175: (2007)
16EESøren Riis: Information Flows, Graphs and their Guessing Numbers. Electr. J. Comb. 14(1): (2007)
15EESøren Riis: Reversible and Irreversible Information Networks. IEEE Transactions on Information Theory 53(11): 4339-4349 (2007)
14EESø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". GTIT-C 2006: 861-897
13EEStefan S. Dantchev, Søren Riis: On Relativisation and Complexity Gap. CSL 2003: 142-154
12EEJuha Häkkinen, Janne Suontausta, Søren Riis, Kåre Jean Jensen: Assessing text-to-phoneme mapping strategies in speaker independent isolated word recognition. Speech Communication 41(2-3): 455-467 (2003)
11 Stefan S. Dantchev, Søren Riis: "Planar" Tautologies Hard for Resolution. FOCS 2001: 220-229
10EEStefan S. Dantchev, Søren Riis: Tree Resolution Proofs of the Weak Pigeon-Hole Principle. IEEE Conference on Computational Complexity 2001: 69-75
9EESøren Riis: A complexity gap for tree resolution. Computational Complexity 10(3): 179-209 (2001)
8 Carsten Butz, Ulrich Kohlenbach, Søren Riis, Glynn Winskel: Preface. Ann. Pure Appl. Logic 104(1-3): 1-2 (2000)
7EEKlemens Hägele, Colm Ó'Dúnlaing, Søren Riis: The complexity of scheduling TV commercials. Electr. Notes Theor. Comput. Sci. 40: (2000)
6EESøren Riis, Meera Sitharam: Generating hard tautologies using predicate logic and the symmetric group. Logic Journal of the IGPL 8(6): (2000)
5 Søren Riis: Count(q) Does Not Imply Count(p). Ann. Pure Appl. Logic 90(1-3): 1-56 (1997)
4EESøren Riis: Count( qq) versus the pigeon-hole principle. Arch. Math. Log. 36(3): 157-188 (1997)
3EESøren Riis: Bootstrapping the primitive recursive functions by only 27 colors. Discrete Mathematics 169(1-3): 269-272 (1997)
2EESøren Riis, Meera Sitharam: Non-constant Degree Lower Bounds imply linear Degree Lower Bounds Electronic Colloquium on Computational Complexity (ECCC) 4(48): (1997)
1 Arne Andersson, Peter Bro Miltersen, Søren Riis, Mikkel Thorup: Static Dictionaries on AC0 RAMs: Query Time Theta(sqrt(log n/log log n)) is Necessary and Sufficient. FOCS 1996: 441-450

Coauthor Index

1Rudolf Ahlswede [14]
2Arne Andersson [1]
3Carsten Butz [8]
4Stefan S. Dantchev [10] [11] [13]
5Klemens Hägele [7]
6Juha Häkkinen [12]
7Kåre Jean Jensen [12]
8Ulrich Kohlenbach [8]
9Peter Bro Miltersen [1]
10Colm Ó'Dúnlaing [7]
11Meera Sitharam [2] [6]
12Janne Suontausta [12]
13Mikkel Thorup [1]
14Glynn Winskel [8]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)