Difference between revisions of "Søren Riis"

From Chessprogramming wiki
Jump to: navigation, search
Line 13: Line 13:
 
==2000 ...==  
 
==2000 ...==  
 
* [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/h/H=auml=gele:Klemens.html Klemens Hägele], [http://www.maths.tcd.ie/~odunlain/ Colm Ó. Dúnlaing], [[Søren Riis]] ('''2001'''). ''The complexity of scheduling TV commercials''. Electronic Notes in [https://en.wikipedia.org/wiki/Theoretical_Computer_Science_%28journal%29 Theoretical Computer Science], Volume 40, [http://euclid.ucc.ie/pages/staff/seda/htdocs/main.html MFCSIT2000], [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.6939 CiteSeerX]
 
* [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/h/H=auml=gele:Klemens.html Klemens Hägele], [http://www.maths.tcd.ie/~odunlain/ Colm Ó. Dúnlaing], [[Søren Riis]] ('''2001'''). ''The complexity of scheduling TV commercials''. Electronic Notes in [https://en.wikipedia.org/wiki/Theoretical_Computer_Science_%28journal%29 Theoretical Computer Science], Volume 40, [http://euclid.ucc.ie/pages/staff/seda/htdocs/main.html MFCSIT2000], [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.6939 CiteSeerX]
 +
* [[Søren Riis]], [[Mathematician#PAhlswede|Rudolf Ahlswede]] ('''2006'''). ''[https://link.springer.com/chapter/10.1007/11889342_56 Problems in Network Coding and Error Correcting Codes Appended by a Draft Version of S. Riis "Utilising Public Information in Network Coding"]''. [https://dblp.uni-trier.de/db/conf/gtitc/gtitc2006.html GTIT-C 2006]
 
* [[Søren Riis]] ('''2007'''). ''Graph Entropy, Network Coding and Guessing games''. [https://arxiv.org/abs/0711.4175 arXiv:0711.4175]
 
* [[Søren Riis]] ('''2007'''). ''Graph Entropy, Network Coding and Guessing games''. [https://arxiv.org/abs/0711.4175 arXiv:0711.4175]
 +
* [[Søren Riis]] ('''2007'''). ''[http://www.combinatorics.org/ojs/index.php/eljc/article/view/v14i1r44 Information Flows, Graphs and their Guessing Numbers]''.  [https://en.wikipedia.org/wiki/Electronic_Journal_of_Combinatorics Electronic Journal of Combinatorics], Vol. 14, No. 1
 
==2010 ...==
 
==2010 ...==
* [https://scholar.google.com/citations?user=tOHXfZgAAAAJ&hl=en Maximilien Gadouleau], [[Søren Riis]] ('''2011'''). ''Memoryless computation: New results, constructions, and extensions''. [https://arxiv.org/abs/1111.6026 arXiv:1111.6026]
+
* [[Mathematician#PJCameron|Peter J. Cameron]], [[Mathematician#MGadouleau|Maximilien Gadouleau]], [[Søren Riis]] ('''2011'''). ''Combinatorial representations''. [https://arxiv.org/abs/1109.1216 arXiv:1109.1216]
 +
* [[Mathematician#MGadouleau|Maximilien Gadouleau]], [[Søren Riis]] ('''2011'''). ''Memoryless computation: New results, constructions, and extensions''. [https://arxiv.org/abs/1111.6026 arXiv:1111.6026]
 
* [[Søren Riis]] ('''2012'''). ''A Gross Miscarriage of Justice in Computer Chess''. [https://en.chessbase.com/news/2011/riis01.pdf pdf] hosted by [[ChessBase]]
 
* [[Søren Riis]] ('''2012'''). ''A Gross Miscarriage of Justice in Computer Chess''. [https://en.chessbase.com/news/2011/riis01.pdf pdf] hosted by [[ChessBase]]
 
* [[Søren Riis]] ('''2014'''). ''[https://www.sciencedirect.com/science/article/pii/S1875952114000159 What makes a chess program original? Revisiting the Rybka case]''. Entertainment Computing, Vol. 5, No. 3, pp. 189–204
 
* [[Søren Riis]] ('''2014'''). ''[https://www.sciencedirect.com/science/article/pii/S1875952114000159 What makes a chess program original? Revisiting the Rybka case]''. Entertainment Computing, Vol. 5, No. 3, pp. 189–204
* [https://scholar.google.com/citations?user=tOHXfZgAAAAJ&hl=en Maximilien Gadouleau], [[Søren Riis]] ('''2015'''). ''[https://www.sciencedirect.com/science/article/pii/S0304397514007300 Memoryless computation: New results, constructions, and extensions]''. [https://en.wikipedia.org/wiki/Theoretical_Computer_Science_(journal) Theoretical Computer Science], Vol. 562
+
* [[Søren Riis]] ('''2015'''). ''Network Communication with operators in Dedekind Finite and Stably Finite Rings''. [https://arxiv.org/abs/1507.01249 arXiv:1507.01249]
* [[Søren Riis]], [[Mathematician#UMartin|Ursula Martin]], [https://dblp.uni-trier.de/pers/hd/w/Woodhouse:Nick Nick Woodhouse] ('''2015'''). ''[https://dl.acm.org/citation.cfm?doid=2867731.2867747 Ada Lovelace, a scientist in the archives]''. Ada Lovelace Symposium 2015 <ref>[https://en.wikipedia.org/wiki/Ada_Lovelace Ada Lovelace from Wikipedia]</ref>
+
* [[Mathematician#MGadouleau|Maximilien Gadouleau]], [[Søren Riis]] ('''2015'''). ''[https://www.sciencedirect.com/science/article/pii/S0304397514007300 Memoryless computation: New results, constructions, and extensions]''. [https://en.wikipedia.org/wiki/Theoretical_Computer_Science_(journal) Theoretical Computer Science], Vol. 562
 +
* [[Søren Riis]], [[Mathematician#UMartin|Ursula Martin]], [https://dblp.uni-trier.de/pers/hd/w/Woodhouse:Nick Nick Woodhouse] ('''2015'''). ''[https://dl.acm.org/citation.cfm?doid=2867731.2867747 Ada Lovelace, a scientist in the archives]''. [https://www.cs.ox.ac.uk/news/981-full.html Ada Lovelace Symposium 2015] <ref>[https://en.wikipedia.org/wiki/Ada_Lovelace Ada Lovelace from Wikipedia]</ref>
 +
* [[Mathematician#PJCameron|Peter J. Cameron]], [https://dblp.uni-trier.de/pers/hd/d/Dang:Ntah_Ahn Ntah Ahn Dang], [[Søren Riis]] ('''2016'''). ''[https://www.semanticscholar.org/paper/Guessing-Games-on-Triangle-free-Graphs-Cameron-Dang/5e06992c99375d37eb8044a6d85fe62408c9eb2e Guessing Games on Triangle-Free Graphs]''. [https://en.wikipedia.org/wiki/Electronic_Journal_of_Combinatorics Electronic Journal of Combinatorics], Vol. 23, No, 1, [http://www.combinatorics.org/ojs/index.php/eljc/article/viewFile/v23i1p48/pdf pdf]
  
 
=Forum Posts=
 
=Forum Posts=

Revision as of 21:50, 17 December 2018

Home * People * Søren Riis

Søren Riis [1]

Søren Møller Riis,
a Danish mathematician at School of Electronic Engineering and Computer Science at Queen Mary, University of London, with a Ph.D. from University of Oxford. His research interests include mathematical logic, bounded arithmetic, computational complexity theory, representation theory and algebra, network coding, information theory, and theoretical aspects of computer chess. He used to play competitive chess in the 80s (Elo 2300) and has been briefly involved with chess programming [2]. He is moderator of the Rybka Forum [3], and critic of the ICGA decision concerning Rybka and Vasik Rajlich in 2011 [4] [5], as manifested January 2012 in a ChessBase article with an immediate rebuttal followed by the ICGA [6].

Selected Publications

[7] [8]

1993 ...

2000 ...

2010 ...

Forum Posts

External Links

References

Up one level