Tang, Peiyi - Department of Computer Science, University of Arkansas at Little Rock

• International Journal of Foundations of Computer Science c World Scientific Publishing Company
• Parallel Programming with Interacting Processes Peiyi Tang1
• On the Design of Heterogeneous Applications for Distributed Coordination Chia-Chu Chiang and Peiyi Tang
• Mining Frequent Itemsets with Partial Enumeration Department of Computer Science
• Interaction and Coordination for Distributed Grid Computing Department of Computer Science
• A Hybrid Approach to Mining Frequent Sequential Patterns Erich Allen Peterson
• Programming Data and Task Parallelism with Chapel Department of Computer Science
• Mining Relaxed Closed Subspace Clusters Erich A. Peterson
• Parallelizing Frequent Web Access Pattern Mining with Partial Enumeration for High Speedup
• Generating Efficient Tiled Code for Distributed Memory Machines Peiyi Tang y and Jingling Xue z
• Mining Frequent Web Access Patterns with Partial Enumeration
• Proceedings of the IASTED International Conference Parallel and Distributed Computing and Systems
• Domain and Data Partitioning for Parallel Mining of Frequent Closed Itemsets
• Mining Frequent Itemsets with Partial Enumeration Department of Computer Science
• Interaction and Coordination for Distributed Grid Computing Department Computer Science
• Minimizing Message Passing in Parallel Iterative Codes Department Computer Science
• Complete Inlining of Recursive Calls: Beyond TailRecursion Elimination
• Vectorization beyond Data Dependences \Lambda Peiyi Tang y
• Mining Probabilistic Frequent Closed Itemsets in Uncertain Databases #
• Exact Side Effects for Interprocedural Dependence Analysis \Lambda
• On the Design Heterogeneous Applications for Distributed Coordination ChiaChu Chiang and Peiyi Tang
• Parallelizing the Merge Sorting Network Algorithm on a MultiCore Computer Using Go and Cilk
• Interprocedural Induction Variable Analysis Department of Computer Science
• Reducing Data Communication Overhead for Doacross Loop Nests \Lambda
• International Journal of Foundations of Computer Science # World Scientific Publishing Company
• Formal Methods Generate Parallel Iterative Codes for PDEBased Applications
• Parallel Programming with Interacting Processes Peiyi Tang 1 and Yoichi Muraoka 2
• Parallelizing Frequent Itemset Mining with FPTrees Peiyi Tang Markus P. Turkia
• JOB SIZE FOR INTERNET PARALLEL COMPUTING Department of Mathematics and Computing
• Parallel and Distributed Computing and Systems November 3-6, 1999 in Cambridge Massachusetts, USA
• Domain and Data Partitioning for Parallel Mining of Frequent Closed Itemsets
• Mining Frequent Web Access Patterns with Partial Enumeration
• Parallelizing Frequent Itemset Mining with FP-Trees Peiyi Tang Markus P. Turkia
• Mining Frequent Sequential Patterns with First-Occurrence Erich A. Peterson
• Minimizing Message Passing in Parallel Iterative Codes Department of Computer Science
• Mining Web Access Patterns with First-Occurrence Linked WAP-Trees Peiyi Tang Markus P. Turkia Kyle A. Gallivan
• Interprocedural Induction Variable Analysis Department of Computer Science
• Extending Parallel Pseudo-Code Language Peril-L Department of Computer Science
• Formal Methods to Generate Parallel Iterative Codes for PDE-Based Applications
• Generating Efficient Tiled Code for Distributed Memory Machines and Jingling Xue
• Complete Inlining of Recursive Calls: Beyond Tail-Recursion Elimination
• Multi-Core Parallel Programming in Go Department of Computer Science
• Mining Probabilistic Frequent Closed Itemsets in Uncertain Department of Computer Science
• Parallelizing the Merge Sorting Network Algorithm on a Multi-Core Computer Using Go and Cilk