Sciweavers

5653 search results - page 448 / 1131
» Distributed Conceptual Structures
Sort
View
JDA
2006
106views more  JDA 2006»
15 years 6 months ago
An optimal algorithm to generate tilings
We produce an algorithm that is optimal with respect to both space and execution time to generate all the lozenge (or domino) tilings of a hole-free, general-shape domain given as...
Sébastien Desreux, Eric Rémila
PPOPP
2012
ACM
14 years 2 months ago
Wait-free linked-lists
The linked-list data structure is fundamental and ubiquitous. Lockfree versions of the linked-list are well known. However, the existence of a practical wait-free linked-list has ...
Shahar Timnat, Anastasia Braginsky, Alex Kogan, Er...
IPPS
2007
IEEE
16 years 1 months ago
Spinneret: A Log Random Substrate for P2P Networks
Until now, structured and unstructured networks have been considered in absentia of each other. We believe that next-generation P2P services will require both structured and unstr...
Jeff Rose, Cyrus P. Hall, Antonio Carzaniga
SPAA
2003
ACM
16 years 4 days ago
Nonblocking k-compare-single-swap
The current literature offers two extremes of nonblocking software synchronization support for concurrent data structure design: intricate designs of specific structures based o...
Victor Luchangco, Mark Moir, Nir Shavit
IPPS
1996
IEEE
15 years 11 months ago
Commutativity Analysis: A Technique for Automatically Parallelizing Pointer-Based Computations
This paper introduces an analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutati...
Martin C. Rinard, Pedro C. Diniz