Søren Riis

	2009
19		Taoyang Wu, Peter J. Cameron, Søren Riis: On the guessing number of shift graphs. J. Discrete Algorithms 7(2): 220-226 (2009)
	2008
18		Søren Riis: On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity. LICS 2008: 272-283
	2007
17		Søren Riis: Graph Entropy, Network Coding and Guessing games CoRR abs/0711.4175: (2007)
16		Søren Riis: Information Flows, Graphs and their Guessing Numbers. Electr. J. Comb. 14(1): (2007)
15		Søren Riis: Reversible and Irreversible Information Networks. IEEE Transactions on Information Theory 53(11): 4339-4349 (2007)
	2006
14		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". GTIT-C 2006: 861-897
	2003
13		Stefan S. Dantchev, Søren Riis: On Relativisation and Complexity Gap. CSL 2003: 142-154
12		Juha 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)
	2001
11		Stefan S. Dantchev, Søren Riis: "Planar" Tautologies Hard for Resolution. FOCS 2001: 220-229
10		Stefan S. Dantchev, Søren Riis: Tree Resolution Proofs of the Weak Pigeon-Hole Principle. IEEE Conference on Computational Complexity 2001: 69-75
9		Søren Riis: A complexity gap for tree resolution. Computational Complexity 10(3): 179-209 (2001)
	2000
8		Carsten Butz, Ulrich Kohlenbach, Søren Riis, Glynn Winskel: Preface. Ann. Pure Appl. Logic 104(1-3): 1-2 (2000)
7		Klemens Hägele, Colm Ó'Dúnlaing, Søren Riis: The complexity of scheduling TV commercials. Electr. Notes Theor. Comput. Sci. 40: (2000)
6		Søren Riis, Meera Sitharam: Generating hard tautologies using predicate logic and the symmetric group. Logic Journal of the IGPL 8(6): (2000)
	1997
5		Søren Riis: Count(q) Does Not Imply Count(p). Ann. Pure Appl. Logic 90(1-3): 1-56 (1997)
4		Søren Riis: Count( qq) versus the pigeon-hole principle. Arch. Math. Log. 36(3): 157-188 (1997)
3		Søren Riis: Bootstrapping the primitive recursive functions by only 27 colors. Discrete Mathematics 169(1-3): 269-272 (1997)
2		Søren Riis, Meera Sitharam: Non-constant Degree Lower Bounds imply linear Degree Lower Bounds Electronic Colloquium on Computational Complexity (ECCC) 4(48): (1997)
	1996
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

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

Colors in the list of coauthors