Catálogo de revistas impresas de la biblioteca

Se encontraron 18 resultados.

Artículo:: Complete Fairness in Secure Two-Party Computation
Autor:: S. Dov Gordon
Resumen:: In the setting of secure two-party computation, two mutually distrusting parties wish to compute some function of their inputs while preserving, to the extent possible, various security properties such as privacy, correctness, and more
Página:: 24
Publicación:: Journal of the ACM
Volúmen:: 58
Número:: 6
Periodo:: Diciembre 2011
ISSN:: 00045411
SrcID:: 00045411-2011-06.txt

Artículo:: Truthful and Near-Optimal Mechanism Design via Linear Programming
Autor:: Ron Lavi
Resumen:: We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any ?-approximation algorithm that also bounds the integrality gap of the LP relaxation
Página:: 25
Publicación:: Journal of the ACM
Volúmen:: 58
Número:: 6
Periodo:: Diciembre 2011
ISSN:: 00045411
SrcID:: 00045411-2011-06.txt

Artículo:: Compositional Shape Analysis by Means of Bi-Abduction
Autor:: Cristiano Calcagno
Resumen:: The accurate and efficient treatment of mutable data structures is one of the outstanding problem areas in automatic program verification and analysis. Shape analysis is a form of program analysis that attempts to infer descriptions
Página:: 26
Publicación:: Journal of the ACM
Volúmen:: 58
Número:: 6
Periodo:: Diciembre 2011
ISSN:: 00045411
SrcID:: 00045411-2011-06.txt

Artículo:: Randomized Shellsort: A Simple Data-Oblivious Sorting Algorithm
Autor:: Michael T. Goodrich
Resumen:: In this article, we describe a randomized Shellsort algorithm. This algorithm is a simple, randomized, data-oblivious version of the Shellsort algorithm that always runs in O(n log n) time and succeeds in sorting any given
Página:: 27
Publicación:: Journal of the ACM
Volúmen:: 58
Número:: 6
Periodo:: Diciembre 2011
ISSN:: 00045411
SrcID:: 00045411-2011-06.txt

Artículo:: New Constructive Aspects of the Lovász Local Lemma
Autor:: Bernhard Haeupler
Resumen:: The Lovász Local Lemma (LLL) is a powerful tool that gives sufficient conditions for avoiding all of a given set of “bad” events, with positive probability. A series of results have provided algorithms to efficiently construct structures
Página:: 28
Publicación:: Journal of the ACM
Volúmen:: 58
Número:: 6
Periodo:: Diciembre 2011
ISSN:: 00045411
SrcID:: 00045411-2011-06.txt

Revistas en papel