| Secret sharing on large girth graphs. | 0 | 0.34 | 2017 |
| Using multiobjective optimization to map the entropy region | 3 | 0.41 | 2016 |
| Erdős-Pyber theorem for hypergraphs and secret sharing. | 3 | 0.57 | 2015 |
| Entropy region and convolution. | 1 | 0.35 | 2013 |
| Gruppen secret sharing, or, how to share several secrets if you must? | 0 | 0.34 | 2013 |
| Using multiobjective optimization to map the entropy region of four random variables. | 4 | 0.53 | 2013 |
| Optimal Information Rate of Secret Sharing Schemes on Trees | 3 | 0.40 | 2013 |
| Infinite Secret Sharing - Examples | 0 | 0.34 | 2012 |
| On-line secret sharing | 1 | 0.36 | 2012 |
| Complexity of universal access structures | 0 | 0.34 | 2012 |
| Probabilistic Infinite Secret Sharing. | 0 | 0.34 | 2012 |
| How to share secrets simultaneously. | 0 | 0.34 | 2011 |
| On the impossibility of graph secret sharing. | 0 | 0.34 | 2009 |
| Secret sharing on trees: problem solved. | 5 | 0.45 | 2009 |
| An impossibility result on graph secret sharing | 7 | 0.52 | 2009 |
| On an infinite family of graphs with information ratio 2 - 1/k | 4 | 0.41 | 2009 |
| Secret sharing on the infinite ladder. | 0 | 0.34 | 2007 |
| Secret sharing on infinite graphs. | 1 | 0.37 | 2007 |
| The perimeter of rounded convex planar sets | 0 | 0.34 | 2007 |
| Secret sharing on the d-dimensional cube | 1 | 0.36 | 2005 |
| Secret sharing schemes on graphs. | 8 | 0.71 | 2005 |
| The Size of a Share Must Be Large | 108 | 3.94 | 1994 |
| Stability of weak second-order semantics | 0 | 0.34 | 1988 |
| Strong Semantical Characterization for Nondeterministic Programs | 1 | 0.41 | 1987 |
| Program Correctness on Finite Fields | 0 | 0.34 | 1986 |
| A completeness theorem for dynamic logic. | 4 | 0.82 | 1985 |
| Iterated grammars | 0 | 0.34 | 1981 |
| On the completeness of proving partial correctness | 9 | 1.19 | 1981 |
