| Publication | Date of Publication | Type |
|---|
The largest Condorcet domain on 8 alternatives
Social Choice and Welfare | 2024-05-17 | Paper |
| Condorcet Domains of Degree at most Seven | 2023-06-28 | Paper |
| The Largest Condorcet Domains on 8 Alternatives | 2023-03-27 | Paper |
Max-flow min-cut theorems on dispersion and entropy measures for communication networks
Information and Computation | 2019-05-29 | Paper |
Graph Guessing Games and Non-Shannon Information Inequalities
IEEE Transactions on Information Theory | 2017-09-21 | Paper |
Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Guessing games on triangle-free graphs
The Electronic Journal of Combinatorics | 2016-05-03 | Paper |
Guessing games on triangle-free graphs
The Electronic Journal of Combinatorics | 2016-05-03 | Paper |
Fixed points of Boolean networks, guessing graphs, and coding theory
SIAM Journal on Discrete Mathematics | 2015-12-04 | Paper |
Fixed points of Boolean networks, guessing graphs, and coding theory
SIAM Journal on Discrete Mathematics | 2015-12-04 | Paper |
| Network Communication with operators in Dedekind Finite and Stably Finite Rings | 2015-07-05 | Paper |
Memoryless computation: new results, constructions, and extensions
Theoretical Computer Science | 2014-12-02 | Paper |
The complexity of scheduling TV commercials
Electronic Notes in Theoretical Computer Science | 2013-06-06 | Paper |
Combinatorial representations
Journal of Combinatorial Theory. Series A | 2013-03-06 | Paper |
| Max-Flow Min-Cut Theorems for Multi-User Communication Networks | 2010-12-23 | Paper |
On the guessing number of shift graphs
Journal of Discrete Algorithms | 2009-06-24 | Paper |
Problems in Network Coding and Error Correcting Codes Appended by a Draft Version of S. Riis “Utilising Public Information in Network Coding”
Lecture Notes in Computer Science | 2009-01-22 | Paper |
Reversible and Irreversible Information Networks
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Information flows, graphs and their guessing numbers
The Electronic Journal of Combinatorics | 2007-07-16 | Paper |
Information flows, graphs and their guessing numbers
The Electronic Journal of Combinatorics | 2007-07-16 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2007-06-21 | Paper |
A complexity gap for tree resolution
Computational Complexity | 2002-06-17 | Paper |
Generating hard tautologies using predicate logic and the symmetric group
Logic Journal of the IGPL | 2001-09-03 | Paper |
Uniformly generated submodules of permutation modules over fields of characteristic 0.
Journal of Pure and Applied Algebra | 2001-01-01 | Paper |
\(\text{Count}(q)\) does not imply \(\text{Count}(p)\)
Annals of Pure and Applied Logic | 1998-06-28 | Paper |
Count\((q)\) versus the pigeon-hole principle
Archive for Mathematical Logic | 1998-04-01 | Paper |
| scientific article; zbMATH DE number 1114015 (Why is no real title available?) | 1998-02-08 | Paper |
Bootstrapping the primitive recursive functions by only 27 colors
Discrete Mathematics | 1997-06-16 | Paper |
| scientific article; zbMATH DE number 440485 (Why is no real title available?) | 1994-08-28 | Paper |
