The foundations of modern cryptography
O Goldreich, O Goldreich - Modern Cryptography, Probabilistic Proofs and …, 1999 - Springer
In our opinion, the Foundations of Cryptography are the paradigms, approaches and
techniques used to conceptualize, define and provide solutions to natural cryptographic …
techniques used to conceptualize, define and provide solutions to natural cryptographic …
Scheduling threads for low space requirement and good locality
GJ Narlikar - Proceedings of the eleventh annual ACM symposium …, 1999 - dl.acm.org
The running time and memory requirement of a parallel program with dynamic, lightweight
threads depends heavily on the underlying thread scheduler. In this paper, we present a …
threads depends heavily on the underlying thread scheduler. In this paper, we present a …
Space-efficient scheduling of nested parallelism
GJ Narlikar, GE Blelloch - ACM Transactions on Programming …, 1999 - dl.acm.org
Many of today's high-level parallel languages support dynamic, fine-grained parallelism.
These languages allow the user to expose all the parallelism in the program, which is …
These languages allow the user to expose all the parallelism in the program, which is …
[PDF][PDF] Complexity Classes.
Complexity Classes Page 1 DIMACS Technical Report 98-23 May 1998 Complexity Classes by
Eric Allender1;2 Dept. of Computer Science Rutgers University New Brunswick, New Jersey …
Eric Allender1;2 Dept. of Computer Science Rutgers University New Brunswick, New Jersey …
Sparse hard sets for P: resolution of a conjecture of Hartmanis
JY Cai, D Sivakumar - Journal of Computer and System Sciences, 1999 - Elsevier
Building on a recent breakthrough by Ogihara, we resolve a conjecture made by Hartmanis
in 1978 regarding the (non) existence of sparse sets complete for P under logspace many …
in 1978 regarding the (non) existence of sparse sets complete for P under logspace many …
Parallel matrix computations using a reconfigurable pipelined optical bus
We present fast and cost-efficient parallel algorithms for a number of important and
fundamental matrix computation problems on linear arrays with reconfigurable pipelined …
fundamental matrix computation problems on linear arrays with reconfigurable pipelined …
[PDF][PDF] Design techniques and analysis
MH Alsuwaiyel - Algorithms, 1999 - academia.edu
The field of computer algorithms has flourished since the early 1960's when the first users of
electronic computers started to pay attention to the performance of programs. The limited …
electronic computers started to pay attention to the performance of programs. The limited …
[图书][B] Space-efficient scheduling for parallel, multithreaded computations
GJ Narlikar - 1999 - search.proquest.com
The goal of high-level parallel programming models or languages is to facilitate the writing
of well-structured, simple and portable code. However, the performance of a program written …
of well-structured, simple and portable code. However, the performance of a program written …
A measure for the lexicographically first maximal independent set problem and its limits
R Uehara - International Journal of Foundations of Computer …, 1999 - World Scientific
We introduce a structural parameter of a graph, the longest directed path length (LDPL), and
express the boundary of the difficulty of the problems along this parameter. The parallel …
express the boundary of the difficulty of the problems along this parameter. The parallel …
On covering and rank problems for boolean matrices and their applications
C Damm, KH Kim, F Roush - International Computing and Combinatorics …, 1999 - Springer
We consider combinatorial properties of Boolean matrices and their application to two-party
communication complexity. Let A be a binary nxn matrix and let K be a field. Rectangles are …
communication complexity. Let A be a binary nxn matrix and let K be a field. Rectangles are …