Yijie Han  Home/Search
Context
Related
| umkc.edu/~hanyij/research/list.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: umkc.edu/~hanyij/research...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Linked list problems are fundamental problems in the design of parallel algorithms. We present design techniques for linked list algorithms and applications of these algorithms. (Update)
Similar documents based on text: More All
0.3: Parallel Algorithms for Computing Linked List Prefix - Han (1989) (Correct)
0.2: Parallel Derandomization Techniques - Yijie Han Department (Correct)
0.2: A Fast Derandomization Scheme and Its Applications - Yijie Han Department (1996) (Correct)
BibTeX entry: (Update)
@inproceedings{ han90parallel,
author = "Han",
title = "Parallel Algorithms for Linked List and Beyond",
booktitle = "{ISAAC}: 1st International Symposium on Algorithms and Computation (formerly {SIGAL} International Symposium on Algorithms), Organized by Special Interest Group on Algorithms ({SIGAL}) of the Information Processing Society of Japan ({IPSJ}) and the Technical Group on Theoretical Foundation of Computing of the Institute of Electronics, Information and Communication Engineers ({IEICE}))",
year = "1990",
url = "citeseer.ist.psu.edu/han90parallel.html" }
Citations (may not include all citations):134 Computational aspects of VLSI (context) - Ullman - 1984
122 Parallel tree contraction and its application (context) - Miller, Reif - 1985
57 Deterministic parallel list ranking (context) - Anderson, Miller
49 Approximate and exact parallel scheduling with applications .. (context) - Cole, Vishkin - 1986
47 Parallel symmetry-breaking in sparse graphs - Goldberg, Plotkin et al. - 1988
47 The complexity of parallel computation (context) - Wyllie - 1979
41 Efficient parallel algorithms for graph problems (context) - Kruskal, Rudolph et al. - 1986
38 merging and sorting on parallel models of computation (context) - Borodin, Hopcroft - 1986
38 Finding biconnected components and computing tree functions .. (context) - Tarjan, Vishkin
31 On parallel searching (context) - Snir - 1985
21 An optimal parallel algorithm for integer sorting (context) - Reif - 1985
16 Distributive graph algorithms --- global solutions from loca.. (context) - Linial - 1987
16 New simulations between CRCW PRAMs (context) - Chlebus, Diks et al.
12 Parallel algorithms for computing maximal independent sets i.. (context) - Jung, Mehlhorn - 1988
8 Designing fast and efficient parallel algorithms (context) - Han - 1987
[Article contains additional citations not shown here]
Documents on the same site (http://www.sice.umkc.edu/~hanyij/research/index.htm): More
Matching Partition a Linked List and Its Optimization - Han (1989) (Correct)
Time Lower Bounds for Sorting on Multi-Dimensional.. - Han, Igarashi (1990) (Correct)
An Optimal Linked List Prefix Algorithm on a Local Memory Computer - Han (1991) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC