Rate-limited secure function evaluation
- 期刊名称Theoretical Computer Science
- 作者Dagdelen, Özgür; Mohassel, Payman; Venturi, Daniele
- 印刷ISSN0304-3975
- 文件大小620.87KB
- 发表时间2016-10
- DOI10.1016/j.tcs.2016.09.020
Correcting gene tree by removal and modification: Tractability and approximabilityBeretta, Stefano; Castelli, Mauro; Dondi, Riccardo · Journal of Discrete Algorithms · 2015
Corrigendum to “Parameterized tractability of the maximum-duo preservation string mapping problem” [Theoret. Comput. Sci. 646 (2016) 16–25]Beretta, Stefano; Castelli, Mauro; Dondi, Riccardo · Theoretical Computer Science · 2016
P automata revisitedPăun, Gheorghe; Pérez-Jiménez, Mario J. · Theoretical Computer Science · 2012
Consistency of multidimensional combinatorial substitutionsJolivet, Timo; Kari, Jarkko · Theoretical Computer Science · 2012
Quantum counterfeit coin problemsIwama, Kazuo; Nishimura, Harumichi; Raymond, Rudy; Teruyama, Junichi · Theoretical Computer Science · 2012
Reversible iterative graph processesDourado, Mitre C.; Penso, Lucia Draque; Rautenbach, Dieter; Szwarcfiter, Jayme L. · Theoretical Computer Science · 2012
Lowness for bounded randomnessDowney, Rod; Ng, Keng Meng · Theoretical Computer Science · 2012
Lower bound for balanced setsNedev, Zhivko · Theoretical Computer Science · 2012
The lattice structure of -player gamesCincotti, Alessandro · Theoretical Computer Science · 2012
Chordal digraphsMeister, Daniel; Telle, Jan Arne · Theoretical Computer Science · 2012