Found 292 results
Author Title [ Type(Desc)] Year
Filters: First Letter Of Title is P  [Clear All Filters]
Technical Report
Keshav, S. (1991).  The Packet Pair Flow Control Protocol.
Luby, M., & Wigderson A. (1995).  Pairwise Independence and Derandomization.
Karpinski, M., Dahlhaus E., & Lingas A. (1989).  A Parallel Algorithm for Maximum Matching in Planar Graphs.
Hambrusch, S. E., & Luby M. (1989).  Parallel Asynchronous Connected Components in a Mesh.
Stemann, V. (1996).  Parallel Balanced Allocation.
Karp, R. M. (1991).  Parallel Combinatorial Computing.
Leoncini, M. (1994).  On the Parallel Complexity of Gaussian Elimination with Pivoting.
Leoncini, M., Manzini G., & Margara L. (1997).  Parallel Complexity of Numerically Accurate Linear System Solvers.
Asanović, K., Bodik R., Demmel J., Keaveny T., Keutzer K., Kubiatowicz J. D., et al. (2008).  The Parallel Computing Laboratory at UC Berkeley: A Research Agenda Based on the Berkeley View.
Färber, P. (1997).  Parallel Computing on MultiSpert.
Karp, R. M., & Zhang Y. (1989).  On Parallel Evaluation of Game Trees.
Hambrusch, S. E., & TeWinkel L. (1989).  Parallel Heuristics for the Steiner Tree Problem in Images without Sorting or Routing.
Lim, C-C. (1993).  A Parallel Object-Oriented System for Realizing Reusable and Efficient Data Abstractions.
Fleiner, C. (1997).  Parallel Optimizations: Advanced Constructs and Compiler Optimizations for a Parallel, Object Oriented, Shared Memory Language Running on a Distributed System.
Ladkin, P., & Maddux R. D. (1989).  Parallel Path-Consistency Algorithms for Constraint Satisfaction.
Pinotti, M. Cristina, & Pucci G. (1991).  Parallel Priority Queues.
Beame, P., & Luby M. (1989).  Parallel Search for Maximal Independence Given Minimal Dependence.
Adler, M., Byers J. W., & Karp R. M. (1995).  Parallel Sorting With Limited Bandwidth.
Oei, C., Friedland G., & Janin A. (2009).  Parallel Training of a Multi-Layer Perceptron on a GPU.
Kemke, C. (1994).  Parsing Neural Networks Combining Symbolic and Connectionist Approaches.
Naor, M., Ostrovsky R., Venkatesan R., & Yung M. (1992).  Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions.