Lecture 6: List contraction, tree contraction, and symmetry breaking 1 Work-efficient list prefix
ad or tail, and then picking any head-labeled element which is not followed immediately by a head-labeled element. (In this scheme, the last element of the list is always chosen if it is a head.) The victims form an independent set (that is, a subset of the graph in which no two nodes are adjacent),...
Main Author: | |
---|---|
Other Authors: | |
Format: | Text |
Language: | English |
Subjects: | |
Online Access: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.5126 |
id |
ftciteseerx:oai:CiteSeerX.psu:10.1.1.56.5126 |
---|---|
record_format |
openpolar |
spelling |
ftciteseerx:oai:CiteSeerX.psu:10.1.1.56.5126 2023-05-15T18:32:40+02:00 Lecture 6: List contraction, tree contraction, and symmetry breaking 1 Work-efficient list prefix In The The Pennsylvania State University CiteSeerX Archives application/postscript http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.5126 en eng http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.5126 Metadata may be used without restrictions as long as the oai identifier remains attached to it. ftp://theory.lcs.mit.edu/pub/classes/6.892/lecture-notes/lecture-6.ps.gz text ftciteseerx 2016-01-08T11:58:42Z ad or tail, and then picking any head-labeled element which is not followed immediately by a head-labeled element. (In this scheme, the last element of the list is always chosen if it is a head.) The victims form an independent set (that is, a subset of the graph in which no two nodes are adjacent), since if an element is a victim, its successor is a tail and its predecessor is followed by a head (the victim itself) and so neither neighbor can also be a victim. 2. Splice out victims. The victims are then spliced out of the list by jumping the pointers of their predecessors over them. As each victim i is removed from the list, its value a i is pushed into its successor by setting the successor's value to be a i\Omega a i+1 . (Independence of victims guarantees that the successor is not al Text The Pointers Unknown |
institution |
Open Polar |
collection |
Unknown |
op_collection_id |
ftciteseerx |
language |
English |
description |
ad or tail, and then picking any head-labeled element which is not followed immediately by a head-labeled element. (In this scheme, the last element of the list is always chosen if it is a head.) The victims form an independent set (that is, a subset of the graph in which no two nodes are adjacent), since if an element is a victim, its successor is a tail and its predecessor is followed by a head (the victim itself) and so neither neighbor can also be a victim. 2. Splice out victims. The victims are then spliced out of the list by jumping the pointers of their predecessors over them. As each victim i is removed from the list, its value a i is pushed into its successor by setting the successor's value to be a i\Omega a i+1 . (Independence of victims guarantees that the successor is not al |
author2 |
The Pennsylvania State University CiteSeerX Archives |
format |
Text |
author |
In The |
spellingShingle |
In The Lecture 6: List contraction, tree contraction, and symmetry breaking 1 Work-efficient list prefix |
author_facet |
In The |
author_sort |
In The |
title |
Lecture 6: List contraction, tree contraction, and symmetry breaking 1 Work-efficient list prefix |
title_short |
Lecture 6: List contraction, tree contraction, and symmetry breaking 1 Work-efficient list prefix |
title_full |
Lecture 6: List contraction, tree contraction, and symmetry breaking 1 Work-efficient list prefix |
title_fullStr |
Lecture 6: List contraction, tree contraction, and symmetry breaking 1 Work-efficient list prefix |
title_full_unstemmed |
Lecture 6: List contraction, tree contraction, and symmetry breaking 1 Work-efficient list prefix |
title_sort |
lecture 6: list contraction, tree contraction, and symmetry breaking 1 work-efficient list prefix |
url |
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.5126 |
genre |
The Pointers |
genre_facet |
The Pointers |
op_source |
ftp://theory.lcs.mit.edu/pub/classes/6.892/lecture-notes/lecture-6.ps.gz |
op_relation |
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.5126 |
op_rights |
Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
_version_ |
1766216862899634176 |