default search action
Søren Riis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j20]Charles R. Leedham-Green, Klas Markström, Søren Riis
:
The largest Condorcet domain on 8 alternatives. Soc. Choice Welf. 62(1): 109-116 (2024) - [j19]Bei Zhou, Klas Markström
CDL: A fast and flexible library for the study of permutation sets with structural restrictions. SoftwareX 28: 101951 (2024) - [i17]Alexander Karpov, Klas Markström, Søren Riis, Bei Zhou:
Local Diversity of Condorcet Domains. CoRR abs/2401.11912 (2024) - [i16]Klas Markström, Søren Riis, Bei Zhou:
Arrow's single peaked domains, richness, and domains for plurality and the Borda count. CoRR abs/2401.12547 (2024) - 2023
- [i15]Bei Zhou, Søren Riis:
New Record-Breaking Condorcet Domains on 10 and 11 Alternatives. CoRR abs/2303.06524 (2023) - [i14]Dolica Akello-Egwell, Charles R. Leedham-Green, Alastair Litterick, Klas Markström, Søren Riis:
Condorcet Domains of Degree at most Seven. CoRR abs/2306.15993 (2023) - [i13]Alexander Karpov, Klas Markström, Søren Riis, Bei Zhou:
Set-alternating schemes: A new class of large Condorcet domains. CoRR abs/2308.02817 (2023) - [i12]Bei Zhou, Klas Markström, Søren Riis:
CDL: A fast and flexible library for the study of permutation sets with structural restrictions. CoRR abs/2309.06306 (2023) - [i11]Bei Zhou, Søren Riis:
Exploring Parity Challenges in Reinforcement Learning through Curriculum Learning with Noisy Labels. CoRR abs/2312.05379 (2023) - 2022
- [i10]Bei Zhou, Søren Riis:
Impartial Games: A Challenge for Reinforcement Learning. CoRR abs/2205.12787 (2022)
2010 – 2019
- 2019
- [j18]Søren Riis
Max-flow min-cut theorems on dispersion and entropy measures for communication networks. Inf. Comput. 267: 49-73 (2019) - 2017
- [j17]Rahil Baber, Demetres Christofides
Graph Guessing Games and Non-Shannon Information Inequalities. IEEE Trans. Inf. Theory 63(7): 4257-4267 (2017) - 2016
- [j16]Peter J. Cameron, Ntah Ahn Dang, Søren Riis:
Guessing Games on Triangle-Free Graphs. Electron. J. Comb. 23(1): 1 (2016) - 2015
- [j15]Maximilien Gadouleau, Adrien Richard, Søren Riis
Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory. SIAM J. Discret. Math. 29(4): 2312-2335 (2015) - [j14]Maximilien Gadouleau, Søren Riis
Memoryless computation: New results, constructions, and extensions. Theor. Comput. Sci. 562: 129-145 (2015) - [c15]Søren Riis
Ada Lovelace, a scientist in the archives. Ada Lovelace Symposium 2015: 14 - 2014
- [j13]Søren Riis
What makes a chess program original? Revisiting the Rybka case. Entertain. Comput. 5(3): 189-204 (2014) - [c14]Jesper Simonsen
Toward a theory for the design of human technologies. OZCHI 2014: 444-447 - [i9]Maximilien Gadouleau, Adrien Richard, Søren Riis:
Fixed points of Boolean networks, guessing graphs, and coding theory. CoRR abs/1409.6144 (2014) - [i8]Peter J. Cameron, Ntah Ahn Dang, Søren Riis:
Guessing Games on Triangle-free Graphs. CoRR abs/1410.2405 (2014) - [i7]Rahil Baber, Demetres Christofides, Ntah Ahn Dang, Søren Riis, Emil R. Vaughan:
Graph Guessing Games and non-Shannon Information Inequalities. CoRR abs/1410.8349 (2014) - 2013
- [j12]Peter J. Cameron
Combinatorial representations. J. Comb. Theory A 120(3): 671-682 (2013) - [c13]Rahil Baber, Demetres Christofides
Multiple unicasts, graph guessing games, and non-Shannon inequalities. NetCod 2013: 1-6 - 2011
- [j11]Maximilien Gadouleau, Søren Riis
Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications. IEEE Trans. Inf. Theory 57(10): 6703-6717 (2011) - [c12]Søren Riis
A dispersion theorem for communication networks based on term sets. ISIT 2011: 593-597 - [c11]Maximilien Gadouleau, Søren Riis
Max-flow min-cut theorem for Rényi entropy in communication networks. ISIT 2011: 603-607 - [i6]Maximilien Gadouleau, Søren Riis:
Computing without memory. CoRR abs/1111.6026 (2011) - 2010
- [i5]Maximilien Gadouleau, Søren Riis:
Graph-theoretical Constructions for Graph Entropy and Network Coding Based Communications. CoRR abs/1010.2619 (2010) - [i4]Maximilien Gadouleau, Søren Riis:
Max-Flow Min-Cut Theorems for Communication Networks Based on Equational Logic. CoRR abs/1012.5224 (2010)
2000 – 2009
- 2009
- [j10]Taoyang Wu
On the guessing number of shift graphs. J. Discrete Algorithms 7(2): 220-226 (2009) - [i3]Søren Riis:
On the asymptotic Nullstellensatz and Polynomial Calculus proof complexity. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [c10]Søren Riis
On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity. LICS 2008: 272-283 - 2007
- [j9]Søren Riis:
Information Flows, Graphs and their Guessing Numbers. Electron. J. Comb. 14(1) (2007) - [j8]Søren Riis
Reversible and Irreversible Information Networks. IEEE Trans. Inf. Theory 53(11): 4339-4349 (2007) - [i2]Søren Riis:
Graph Entropy, Network Coding and Guessing games. CoRR abs/0711.4175 (2007) - 2006
- [c9]Søren Riis
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
- [j7]Juha Häkkinen, Janne Suontausta, Søren Riis
Assessing text-to-phoneme mapping strategies in speaker independent isolated word recognition. Speech Commun. 41(2-3): 455-467 (2003) - [c8]Stefan S. Dantchev, Søren Riis
On Relativisation and Complexity Gap. CSL 2003: 142-154 - 2002
- [c7]Jilei Tian, Juha Häkkinen, Søren Riis, Kåre Jean Jensen:
On text-based language identification for multilingual speech recognition systems. INTERSPEECH 2002: 501-504 - 2001
- [j6]Søren Riis
A complexity gap for tree resolution. Comput. Complex. 10(3): 179-209 (2001) - [c6]Stefan S. Dantchev, Søren Riis
Tree Resolution Proofs of the Weak Pigeon-Hole Principle. CCC 2001: 69-75 - [c5]Stefan S. Dantchev, Søren Riis:
"Planar" Tautologies Hard for Resolution. FOCS 2001: 220-229 - 2000
- [j5]Carsten Butz, Ulrich Kohlenbach, Søren Riis, Glynn Winskel:
Preface. Ann. Pure Appl. Log. 104(1-3): 1-2 (2000) - [j4]Søren Riis, Meera Sitharam:
Generating hard tautologies using predicate logic and the symmetric group. Log. J. IGPL 8(6): 787-795 (2000) - [c4]Kåre Jean Jensen, Søren Riis:
Self-organizing letter code-book for text-to-phoneme neural network model. INTERSPEECH 2000: 318-321 - [c3]Klemens Hägele, Colm Ó'Dúnlaing, Søren Riis
The complexity of scheduling TV commercials. MFCSIT 2000: 162-185
1990 – 1999
- 1997
- [j3]Søren Riis
Count( qq) versus the pigeon-hole principle. Arch. Math. Log. 36(3): 157-188 (1997) - [j2]Søren Riis
Count(q) Does Not Imply Count(p). Ann. Pure Appl. Log. 90(1-3): 1-56 (1997) - [j1]Søren Riis
Bootstrapping the primitive recursive functions by only 27 colors. Discret. Math. 169(1-3): 269-272 (1997) - [i1]Søren Riis, Meera Sitharam:
Non-constant Degree Lower Bounds imply linear Degree Lower Bounds. Electron. Colloquium Comput. Complex. TR97 (1997) - 1996
- [c2]Paul Beame, Søren Riis:
More on the relative strength of counting principles. Proof Complexity and Feasible Arithmetics 1996: 13-35 - [c1]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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 19:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: