11213 search results - page 96 / 2243 » Low-contention data structures |
126
click to vote
FPLE
1995
15 years 7 months ago
1995
In this paper, we make a proposal for a second year course on advanced programming, based on the functional paradigm. It assumes the existence of a first course on programming, al...
150
click to vote
DAGSTUHL
1996
15 years 5 months ago
1996
We survey results on self-organizing data structures for the search problem and concentrate on two very popular structures: the unsorted linear list, and the binary search tree. Fo...
102
click to vote
SODA
1994
ACM
15 years 5 months ago
1994
ACM
Abstract Yossi Matias Je rey Scott Vitter y Neal E. Young z In this paper we introduce the notion of approximate data structures, in which a small amount of error is tolerated in...
117
click to vote
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— Data aggregation protocols can reduce the cost of communication, thereby extending the lifetime of sensor networks. Prior work on data aggregation protocols has focused on tree...
125
Voted
ISCAPDCS
2003
15 years 5 months ago
2003
This paper discusses the use of “relative debugging” as a technique for locating errors in a program that has been ported or developed using evolutionary software engineering ...