Søren Riis

Soc. Choice Welf., February, 2024

Arrow's single peaked domains, richness, and domains for plurality and the Borda count.

[BibT_eX]

[DOI]

CoRR, 2024

Local Diversity of Condorcet Domains.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Exploring Parity Challenges in Reinforcement Learning through Curriculum Learning with Noisy Labels.

[BibT_eX]

[DOI]

CoRR, 2023

CDL: A fast and flexible library for the study of permutation sets with structural restrictions.

[BibT_eX]

[DOI]

CoRR, 2023

Set-alternating schemes: A new class of large Condorcet domains.

[BibT_eX]

[DOI]

CoRR, 2023

Condorcet Domains of Degree at most Seven.

[BibT_eX]

[DOI]

Dolica Akello-Egwell

Charles R. Leedham-Green

Alastair Litterick

CoRR, 2023

New Record-Breaking Condorcet Domains on 10 and 11 Alternatives.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Impartial Games: A Challenge for Reinforcement Learning.

[BibT_eX]

[DOI]

CoRR, 2022

2019

Max-flow min-cut theorems on dispersion and entropy measures for communication networks.

[BibT_eX]

[DOI]

Inf. Comput., 2019

2017

Graph Guessing Games and Non-Shannon Information Inequalities.

[BibT_eX]

[DOI]

Rahil Baber

Demetres Christofides

Ntah Ahn Dang

Emil R. Vaughan

IEEE Trans. Inf. Theory, 2017

2016

Guessing Games on Triangle-Free Graphs.

[BibT_eX]

[DOI]

Peter J. Cameron

Ntah Ahn Dang

Electron. J. Comb., 2016

2015

Memoryless computation: New results, constructions, and extensions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory.

[BibT_eX]

[DOI]

Adrien Richard

SIAM J. Discret. Math., 2015

Ada Lovelace, a scientist in the archives.

[BibT_eX]

[DOI]

Ursula Martin

Nick Woodhouse

Proceedings of the Ada Lovelace Symposium 2015, 2015

2014

What makes a chess program original? Revisiting the Rybka case.

[BibT_eX]

[DOI]

Entertain. Comput., 2014

Toward a theory for the design of human technologies.

[BibT_eX]

[DOI]

Jesper Simonsen

Morten Hertzum

Jørgen Lerche Nielsen

Proceedings of the 26th Australian Computer-Human Interaction Conference on Designing Futures, 2014

2013

Combinatorial representations.

[BibT_eX]

[DOI]

Peter J. Cameron

J. Comb. Theory A, 2013

Multiple unicasts, graph guessing games, and non-Shannon inequalities.

[BibT_eX]

[DOI]

Rahil Baber

Demetres Christofides

Ntah Ahn Dang

Emil R. Vaughan

Proceedings of the International Symposium on Network Coding, 2013

2011

Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Computing without memory

[BibT_eX]

[DOI]

CoRR, 2011

A dispersion theorem for communication networks based on term sets.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Max-flow min-cut theorem for Rényi entropy in communication networks.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010

Max-Flow Min-Cut Theorems for Communication Networks Based on Equational Logic

[BibT_eX]

[DOI]

CoRR, 2010

2009

On the guessing number of shift graphs.

[BibT_eX]

[DOI]

Taoyang Wu

Peter J. Cameron

J. Discrete Algorithms, 2009

On the asymptotic Nullstellensatz and Polynomial Calculus proof complexity.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2009

2007

Reversible and Irreversible Information Networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

Graph Entropy, Network Coding and Guessing games

[BibT_eX]

[DOI]

CoRR, 2007

Information Flows, Graphs and their Guessing Numbers.

[BibT_eX]

[DOI]

Electron. J. Comb., 2007

2006

Problems in Network Coding and Error Correcting Codes Appended by a Draft Version of S. Riis "Utilising Public Information in Network Coding".

[BibT_eX]

[DOI]

Rudolf Ahlswede

Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

2003

Assessing text-to-phoneme mapping strategies in speaker independent isolated word recognition.

[BibT_eX]

[DOI]

Speech Commun., 2003

On Relativisation and Complexity Gap.

[BibT_eX]

[DOI]

Stefan S. Dantchev

Proceedings of the Computer Science Logic, 17th International Workshop, 2003

2002

On text-based language identification for multilingual speech recognition systems.

[BibT_eX]

[DOI]

Proceedings of the 7th International Conference on Spoken Language Processing, ICSLP2002, 2002

2001

A complexity gap for tree resolution.

[BibT_eX]

[DOI]

Comput. Complex., 2001

"Planar" Tautologies Hard for Resolution.

[BibT_eX]

[DOI]

Stefan S. Dantchev

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

Tree Resolution Proofs of the Weak Pigeon-Hole Principle.

[BibT_eX]

[DOI]

Stefan S. Dantchev

Proceedings of the 16th Annual IEEE Conference on Computational Complexity, 2001

2000

Generating hard tautologies using predicate logic and the symmetric group.

[BibT_eX]

[DOI]

Meera Sitharam

Log. J. IGPL, 2000

The complexity of scheduling TV commercials.

[BibT_eX]

[DOI]

Klemens Hägele

Colm Ó'Dúnlaing

Proceedings of the First Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, 2000

Preface.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2000

Self-organizing letter code-book for text-to-phoneme neural network model.

[BibT_eX]

[DOI]

Kåre Jean Jensen

Proceedings of the Sixth International Conference on Spoken Language Processing, 2000

1997

Non-constant Degree Lower Bounds imply linear Degree Lower Bounds

[BibT_eX]

[DOI]

Meera Sitharam

Electron. Colloquium Comput. Complex., 1997

Bootstrapping the primitive recursive functions by only 27 colors.

[BibT_eX]

[DOI]

Discret. Math., 1997

Count(q) Does Not Imply Count(p).

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1997

Count( <i>q</i>q) versus the pigeon-hole principle.

[BibT_eX]

[DOI]

Arch. Math. Log., 1997

1996

Static Dictionaries on AC<sup>0</sup> RAMs: Query Time Theta(sqrt(log n/log log n)) is Necessary and Sufficient.

[BibT_eX]

[DOI]

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

More on the relative strength of counting principles.

[BibT_eX]

[DOI]

Paul Beame