Søren Riis - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 33 from 33

2024

The largest Condorcet domain on 8 alternativesCharles R. Leedham-Green, Klas Markström, Søren Riis. scw, 62(1):109-116, February 2024. [doi]

2019

Max-flow min-cut theorems on dispersion and entropy measures for communication networksSøren Riis, Maximilien Gadouleau. iandc, 267:49-73, 2019. [doi]

2017

Graph Guessing Games and Non-Shannon Information InequalitiesRahil Baber, Demetres Christofides, Anh N. Dang, Emil R. Vaughan, Søren Riis. TIT, 63(7):4257-4267, 2017. [doi]

2016

Guessing Games on Triangle-Free GraphsPeter J. Cameron, Anh N. Dang, Søren Riis. combinatorics, 23(1):1, 2016. [doi]

2015

Fixed Points of Boolean Networks, Guessing Graphs, and Coding TheoryMaximilien Gadouleau, Adrien Richard, Søren Riis. siamdm, 29(4):2312-2335, 2015. [doi]

Memoryless computation: New results, constructions, and extensionsMaximilien Gadouleau, Søren Riis. TCS, 562:129-145, 2015. [doi]

Ada Lovelace, a scientist in the archivesSøren Riis, Ursula Martin, Nick Woodhouse. BIRTHDAY 2015: 14 [doi]

2014

What makes a chess program original? Revisiting the Rybka caseSøren Riis. entcom, 5(3):189-204, 2014. [doi]

Toward a theory for the design of human technologiesJesper Simonsen, Morten Hertzum, Jørgen Lerche Nielsen, Søren Riis. ozchi 2014: 444-447 [doi]

2013

Multiple unicasts, graph guessing games, and non-Shannon inequalitiesRahil Baber, Demetres Christofides, Anh N. Dang, Søren Riis, Emil R. Vaughan. netcod 2013: 1-6 [doi]

Combinatorial representationsPeter J. Cameron, Maximilien Gadouleau, Søren Riis. JCT, 120(3):671-682, 2013. [doi]

2011

Graph-Theoretical Constructions for Graph Entropy and Network Coding Based CommunicationsMaximilien Gadouleau, Søren Riis. TIT, 57(10):6703-6717, 2011. [doi]

Max-flow min-cut theorem for Rényi entropy in communication networksMaximilien Gadouleau, Søren Riis. isit 2011: 603-607 [doi]

A dispersion theorem for communication networks based on term setsSøren Riis, Maximilien Gadouleau. isit 2011: 593-597 [doi]

2009

On the asymptotic Nullstellensatz and Polynomial Calculus proof complexitySøren Riis. eccc, 16:14, 2009. [doi]

2008

On the Asymptotic Nullstellensatz and Polynomial Calculus Proof ComplexitySøren Riis. lics 2008: 272-283 [doi]

2007

Reversible and Irreversible Information NetworksSøren Riis. TIT, 53(11):4339-4349, 2007. [doi]

Information Flows, Graphs and their Guessing NumbersSøren Riis. combinatorics, 14(1), 2007. [doi]

2006

Problems in Network Coding and Error Correcting Codes Appended by a Draft Version of S. Riis Utilising Public Information in Network Coding Søren Riis, Rudolf Ahlswede. gtitc 2006: 861-897 [doi]

2003

On Relativisation and Complexity GapStefan S. Dantchev, Søren Riis. csl 2003: 142-154 [doi]

Assessing text-to-phoneme mapping strategies in speaker independent isolated word recognitionJuha Häkkinen, Janne Suontausta, Søren Riis, Kåre Jean Jensen. speech, 41(2-3):455-467, 2003. [doi]

2002

On text-based language identification for multilingual speech recognition systemsJilei Tian, Juha Häkkinen, Søren Riis, Kåre Jean Jensen. interspeech 2002: 501-504 [doi]

2001

Planar Tautologies Hard for ResolutionStefan S. Dantchev, Søren Riis. focs 2001: 220-229

Tree Resolution Proofs of the Weak Pigeon-Hole PrincipleStefan S. Dantchev, Søren Riis. cocoon 2001: 69-75 [doi]

A complexity gap for tree resolutionSøren Riis. cc, 10(3):179-209, 2001. [doi]

2000

PrefaceCarsten Butz, Ulrich Kohlenbach, Søren Riis, Glynn Winskel. APAL, 104(1-3):1-2, 2000.

The complexity of scheduling TV commercialsKlemens Hägele, Colm Ó Dúnlaing, Søren Riis. ENTCS, 40:162-185, 2000. [doi]

Self-organizing letter code-book for text-to-phoneme neural network modelKåre Jean Jensen, Søren Riis. interspeech 2000: 318-321 [doi]

Generating hard tautologies using predicate logic and the symmetric groupSøren Riis, Meera Sitharam. igpl, 8(6):787-795, 2000. [doi]

1997

Count(q) Does Not Imply Count(p)Søren Riis. APAL, 90(1-3):1-56, 1997.

Non-constant Degree Lower Bounds imply linear Degree Lower BoundsSøren Riis. eccc, 4(48), 1997. [doi]

Count( ::::q::::q) versus the pigeon-hole principleSøren Riis. AML, 36(3):157-188, 1997. [doi]

1996

Static Dictionaries on AC:::0::: RAMs: Query Time Theta(sqrt(log n/log log n)) is Necessary and SufficientArne Andersson, Peter Bro Miltersen, Søren Riis, Mikkel Thorup. focs 1996: 441-450

Sign in or sign up to see more results.

runs on WebDSL