Corpus ID: 211082714

Uniform Linked Lists Contraction

@article{Han2020UniformLL,
  title={Uniform Linked Lists Contraction},
  author={Yijie Han},
  journal={ArXiv},
  year={2020},
  volume={abs/2002.05034}
}
  • Yijie Han
  • Published in ArXiv 2020
  • Computer Science, Mathematics
  • We present a parallel algorithm (EREW PRAM algorithm) for linked lists contraction. We show that when we contract a linked list from size $n$ to size $n/c$ for a suitable constant $c$ we can pack the linked list into an array of size $n/d$ for a constant $1 < d\leq c$ in the time of 3 coloring the list. Thus for a set of linked lists with a total of $n$ elements and the longest list has $l$ elements our algorithm contracts them in $O(n\log i/p+(\log^{(i)}n+\log i )\log \log l+ \log l)$ time… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Topics from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 11 REFERENCES

    Deterministic parallel list

    • R. J. Anderson, G. L. Miller
    • ranking. Algorithmica,
    • 1991
    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    The complexity of parallel computation

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Parallel Algorithms for Shared-Memory Machines

    VIEW 1 EXCERPT

    Matching partition a linked list and its optimization

    VIEW 1 EXCERPT

    Parallel Algorithms for Computing Linked List Prefix

    • Yijie Han
    • Computer Science, Mathematics
    • J. Parallel Distributed Comput.
    • 1989
    VIEW 1 EXCERPT

    Approximate and exact parallel scheduling with applications to list, tree and graph problems

    VIEW 1 EXCERPT