Sciweavers

109
Voted
STOC
1987
ACM
110views Algorithms» more  STOC 1987»
15 years 8 months ago
How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority
Oded Goldreich, Silvio Micali, Avi Wigderson
STOC
1987
ACM
104views Algorithms» more  STOC 1987»
15 years 8 months ago
The Boolean Formula Value Problem Is in ALOGTIME
The Boolean formula value problem is in alternating log time and, more generally, parenthesis context-free languages are in alternating log time. The evaluation of reverse Polish ...
Samuel R. Buss
STOC
1987
ACM
46views Algorithms» more  STOC 1987»
15 years 8 months ago
Size-Time Complexity of Boolean Networks for Prefix Computations
Gianfranco Bilardi, Franco P. Preparata
126
Voted
STOC
1987
ACM
82views Algorithms» more  STOC 1987»
15 years 8 months ago
Permutation Groups in NC
We show that the basic problems of permutation group manipulation admit e cient parallel solutions. Given a permutation group G by a list of generators, we nd a set of NC-e cient ...
László Babai, Eugene M. Luks, &Aacut...
OOPSLA
1989
Springer
15 years 8 months ago
PCLOS: A Critical Review
This paper uses the persistent object system PCLOS to survey some problems and bene ts of object persistence. The system is analyzed along several relevant dimensions. PCLOS provi...
Andreas Paepcke