Sciweavers

32545 search results - page 33 / 6509
» Data Structures and Algorithms
Sort
View
IIE
2007
56views more  IIE 2007»
13 years 9 months ago
Recursion Versus Iteration with the List as a Data Structure
Abstract. A reversible sequence of steps from the specification of the algorithm and the mathematical definition of the recurrent solution through the recursive procedure, the ta...
Izabella Foltynowicz
SPAA
2010
ACM
13 years 10 months ago
A universal construction for wait-free transaction friendly data structures
Given the sequential implementation of any data structure, we show how to obtain an efficient, wait-free implementation of that data structure shared by any fixed number of proces...
Phong Chuong, Faith Ellen, Vijaya Ramachandran
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
13 years 11 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...
ICDE
2009
IEEE
163views Database» more  ICDE 2009»
14 years 11 months ago
A Data Structure for Sponsored Search
Abstract-- Inverted files have been very successful for document retrieval, but sponsored search is different. Inverted files are designed to find documents that match the query (a...
Arnd Christian König, Kenneth Ward Church, Ma...
WDAG
2004
Springer
88views Algorithms» more  WDAG 2004»
14 years 3 months ago
Nonblocking Concurrent Data Structures with Condition Synchronization
We apply the classic theory of linearizability to operations that must wait for some other thread to establish a precondition. We model such an operation as a request and a follow-...
William N. Scherer III, Michael L. Scott