Søren Riis - RankMe

60 papers A* 3A 3B 3Misc 1Journal 45Unranked 5

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Impartial Games: A Challenge for Reinforcement Learning. Mach. Learn. Bei Zhou, Søren Riis
2026	J	`jnl`	Improved lower bounds for the maximum size of Condorcet domains. CoRR Alexander Karpov, Klas Markström, Søren Riis, Bei Zhou
2026	J	`jnl`	Term Coding and Dispersion: A Perfect-vs-Rate Complexity Dichotomy for Information Flow. CoRR Søren Riis
2026	J	`jnl`	Term Coding: An Entropic Framework for Extremal Combinatorics and the Guessing-Number Sandwich Theorem. CoRR Søren Riis
2025	J	`jnl`	An efficient heuristic search algorithm for discovering large Condorcet domains. 4OR Bei Zhou, Søren Riis
2025	J	`jnl`	Coherent domains and improved lower bounds for the maximum size of Condorcet domains. Discret. Appl. Math. Alexander Karpov, Klas Markström, Søren Riis, Bei Zhou
2025	J	`jnl`	Condorcet domains on at most seven alternatives. Math. Soc. Sci. Dolica Akello-Egwel, Charles R. Leedham-Green, Alastair Litterick, Klas Markström, Søren Riis
2024	J	`jnl`	Arrow's single peaked domains, richness, and domains for plurality and the Borda count. CoRR Klas Markström, Søren Riis, Bei Zhou
2024	J	`jnl`	CDL: A fast and flexible library for the study of permutation sets with structural restrictions. SoftwareX Bei Zhou, Klas Markström, Søren Riis
2024	J	`jnl`	Local Diversity of Condorcet Domains. CoRR Alexander Karpov, Klas Markström, Søren Riis, Bei Zhou
2024	J	`jnl`	Mastering NIM and Impartial Games with Weak Neural Networks: An AlphaZero-inspired Multi-Frame Approach. CoRR Søren Riis
2024	J	`jnl`	The largest Condorcet domain on 8 alternatives. Soc. Choice Welf. Charles R. Leedham-Green, Klas Markström, Søren Riis
2023	J	`jnl`	CDL: A fast and flexible library for the study of permutation sets with structural restrictions. CoRR Bei Zhou, Klas Markström, Søren Riis
2023	J	`jnl`	Condorcet Domains of Degree at most Seven. CoRR Dolica Akello-Egwel, Charles R. Leedham-Green, Alastair Litterick, Klas Markström, Søren Riis
2023	J	`jnl`	Exploring Parity Challenges in Reinforcement Learning through Curriculum Learning with Noisy Labels. CoRR Bei Zhou, Søren Riis
2023	J	`jnl`	New Record-Breaking Condorcet Domains on 10 and 11 Alternatives. CoRR Bei Zhou, Søren Riis
2023	J	`jnl`	Set-alternating schemes: A new class of large Condorcet domains. CoRR Alexander Karpov, Klas Markström, Søren Riis, Bei Zhou
2022	J	`jnl`	Impartial Games: A Challenge for Reinforcement Learning. CoRR Bei Zhou, Søren Riis
2019	J	`jnl`	Max-flow min-cut theorems on dispersion and entropy measures for communication networks. Inf. Comput. Søren Riis, Maximilien Gadouleau
2017	J	`jnl`	Graph Guessing Games and Non-Shannon Information Inequalities. IEEE Trans. Inf. Theory Rahil Baber, Demetres Christofides, Ntah Ahn Dang, Emil R. Vaughan, Søren Riis
2016	J	`jnl`	Guessing Games on Triangle-Free Graphs. Electron. J. Comb. Peter J. Cameron, Ntah Ahn Dang, Søren Riis
2015	—	`conf`	Ada Lovelace, a scientist in the archives. Ada Lovelace Symposium Søren Riis, Ursula Martin, Nick Woodhouse
2015	J	`jnl`	Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory. SIAM J. Discret. Math. Maximilien Gadouleau, Adrien Richard, Søren Riis
2015	J	`jnl`	Memoryless computation: New results, constructions, and extensions. Theor. Comput. Sci. Maximilien Gadouleau, Søren Riis
2014	J	`jnl`	Fixed points of Boolean networks, guessing graphs, and coding theory. CoRR Maximilien Gadouleau, Adrien Richard, Søren Riis
2014	J	`jnl`	Graph Guessing Games and non-Shannon Information Inequalities. CoRR Rahil Baber, Demetres Christofides, Ntah Ahn Dang, Søren Riis, Emil R. Vaughan
2014	J	`jnl`	Guessing Games on Triangle-free Graphs. CoRR Peter J. Cameron, Ntah Ahn Dang, Søren Riis
2014	Misc	`conf`	Toward a theory for the design of human technologies. OZCHI Jesper Simonsen, Morten Hertzum, Jørgen Lerche Nielsen, Søren Riis
2014	J	`jnl`	What makes a chess program original? Revisiting the Rybka case. Entertain. Comput. Søren Riis
2013	J	`jnl`	Combinatorial representations. J. Comb. Theory A Peter J. Cameron, Maximilien Gadouleau, Søren Riis
2013	—	`conf`	Multiple unicasts, graph guessing games, and non-Shannon inequalities. NetCod Rahil Baber, Demetres Christofides, Ntah Ahn Dang, Søren Riis, Emil R. Vaughan
2011	B	`conf`	A dispersion theorem for communication networks based on term sets. ISIT Søren Riis, Maximilien Gadouleau
2011	J	`jnl`	Computing without memory CoRR Maximilien Gadouleau, Søren Riis
2011	J	`jnl`	Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications. IEEE Trans. Inf. Theory Maximilien Gadouleau, Søren Riis
2011	B	`conf`	Max-flow min-cut theorem for Rényi entropy in communication networks. ISIT Maximilien Gadouleau, Søren Riis
2010	J	`jnl`	Graph-theoretical Constructions for Graph Entropy and Network Coding Based Communications CoRR Maximilien Gadouleau, Søren Riis
2010	J	`jnl`	Max-Flow Min-Cut Theorems for Communication Networks Based on Equational Logic CoRR Maximilien Gadouleau, Søren Riis
2009	J	`jnl`	On the asymptotic Nullstellensatz and Polynomial Calculus proof complexity. Electron. Colloquium Comput. Complex. Søren Riis
2009	J	`jnl`	On the guessing number of shift graphs. J. Discrete Algorithms Taoyang Wu, Peter J. Cameron, Søren Riis
2008	A*	`conf`	On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity. LICS Søren Riis
2007	J	`jnl`	Graph Entropy, Network Coding and Guessing games CoRR Søren Riis
2007	J	`jnl`	Information Flows, Graphs and their Guessing Numbers. Electron. J. Comb. Søren Riis
2007	J	`jnl`	Reversible and Irreversible Information Networks. IEEE Trans. Inf. Theory Søren Riis
2006	—	`conf`	Problems in Network Coding and Error Correcting Codes Appended by a Draft Version of S. Riis "Utilising Public Information in Network Coding". GTIT-C Søren Riis, Rudolf Ahlswede
2003	J	`jnl`	Assessing text-to-phoneme mapping strategies in speaker independent isolated word recognition. Speech Commun. Juha Häkkinen, Janne Suontausta, Søren Riis, Kåre Jean Jensen
2003	B	`conf`	On Relativisation and Complexity Gap. CSL Stefan S. Dantchev, Søren Riis
2002	A	`conf`	On text-based language identification for multilingual speech recognition systems. INTERSPEECH Jilei Tian, Juha Häkkinen, Søren Riis, Kåre Jean Jensen
2001	A*	`conf`	"Planar" Tautologies Hard for Resolution. FOCS Stefan S. Dantchev, Søren Riis
2001	J	`jnl`	A complexity gap for tree resolution. Comput. Complex. Søren Riis
2001	A	`conf`	Tree Resolution Proofs of the Weak Pigeon-Hole Principle. CCC Stefan S. Dantchev, Søren Riis
2000	J	`jnl`	Generating hard tautologies using predicate logic and the symmetric group. Log. J. IGPL Søren Riis, Meera Sitharam
2000	J	`jnl`	Preface. Ann. Pure Appl. Log. Carsten Butz, Ulrich Kohlenbach, Søren Riis, Glynn Winskel
2000	A	`conf`	Self-organizing letter code-book for text-to-phoneme neural network model. INTERSPEECH Kåre Jean Jensen, Søren Riis
2000	—	`conf`	The complexity of scheduling TV commercials. MFCSIT Klemens Hägele, Colm Ó'Dúnlaing, Søren Riis
1997	J	`jnl`	Bootstrapping the primitive recursive functions by only 27 colors. Discret. Math. Søren Riis
1997	J	`jnl`	Count( Arch. Math. Log. Søren Riis
1997	J	`jnl`	Count(q) Does Not Imply Count(p). Ann. Pure Appl. Log. Søren Riis
1997	J	`jnl`	Non-constant Degree Lower Bounds imply linear Degree Lower Bounds Electron. Colloquium Comput. Complex. Søren Riis, Meera Sitharam
1996	—	`conf`	More on the relative strength of counting principles. Proof Complexity and Feasible Arithmetics Paul Beame, Søren Riis
1996	A*	`conf`	Static Dictionaries on AC FOCS Arne Andersson, Peter Bro Miltersen, Søren Riis, Mikkel Thorup