Results 1 
6 of
6
An Overview of Edison
 Electronic Notes in Theoretical Computer Science
, 2000
"... Edison is a library of functional data structures implemented in Haskell. It supports three main families of abstractions: sequences, collections (e.g., sets and priority queues), and associative collections (e.g., nite maps). This paper summarizes the design of Edison, with particular attention to ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
Edison is a library of functional data structures implemented in Haskell. It supports three main families of abstractions: sequences, collections (e.g., sets and priority queues), and associative collections (e.g., nite maps). This paper summarizes the design of Edison, with particular attention to how that design is inuenced by details of Haskell. 1 Introduction There is a growing recognition that a useful set of libraries is at least as important to the acceptance of a programming language as the design of the language itself. A library of fundamental data structures such as queues, sets, and nite maps is particularly important in this regard. However, highquality examples of such libraries, such as the STL [14] in C++ or the the collection classes [3] in Smalltalk, are rare. Edison is a library of ecient data structures suitable for implementation and use in functional programming languages. It is named after Thomas Alva Edison and for the mnemonic value of EDiSon (Ecient Data ...
Algorithms for the Certified Write All Problem
 SIAM Journal of Computing
, 1994
"... In this paper, we prove new upper bounds on the complexity of the Certified Write All Problem with respect to an adaptive adversary. Our strongest result is that for any ffl ? 0, there exists an O(p 1+ffl ) work algorithm for the p processor, p memory cell write all. We also give a randomize O(p ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this paper, we prove new upper bounds on the complexity of the Certified Write All Problem with respect to an adaptive adversary. Our strongest result is that for any ffl ? 0, there exists an O(p 1+ffl ) work algorithm for the p processor, p memory cell write all. We also give a randomize O(p 2 log p) work algorithm for a p processor p 2 memory cell write all. 1 Introduction A fundamental problem in asynchronous computation is to have p processors set n memory cells to a fixed value, and then signal the completion of the task. This problem is important in its own right as well as capturing the difficulty of other problems in asynchronous computation, such as the stepbystep simulation of a synchronous computation on an asynchronous machine. Formally, the input to the Certified Write All Problem is an array B[1: : n] and a variable c. The variables are all initialized to 0. The problem is to set all the variables to 1, with the restriction that c cannot be set to 1 until al...
General Terms Algorithms
"... Redblack trees and leftist heaps are classic data structures that are commonly taught in Data Structures (CS2) and/or Algorithms (CS7) courses. This paper describes alternatives to these two data structures that may offer pedagogical advantages for typical students. ..."
Abstract
 Add to MetaCart
Redblack trees and leftist heaps are classic data structures that are commonly taught in Data Structures (CS2) and/or Algorithms (CS7) courses. This paper describes alternatives to these two data structures that may offer pedagogical advantages for typical students.
Integrating GeoSpatial Data Into Olap Systems Using A SetBased QuadTree Representation
"... This paper presents a setbased data structure for the representation of quadtree based search structures as an integral dimension of data warehouses for OLAP. OLAP engines based on this setbased data representation use sets and vectors only and integrate easily with geospatial information. ..."
Abstract
 Add to MetaCart
This paper presents a setbased data structure for the representation of quadtree based search structures as an integral dimension of data warehouses for OLAP. OLAP engines based on this setbased data representation use sets and vectors only and integrate easily with geospatial information.
Interaction Nets as a Programming Language
"... This paper is an attempt to present interaction nets as a (graphical) programming language. So we rst describe the syntax and semantics of this new paradigm and then introduce a few simple sample programs to show some of its specic features. A real interpreter with a parser and a graphical layout ha ..."
Abstract
 Add to MetaCart
This paper is an attempt to present interaction nets as a (graphical) programming language. So we rst describe the syntax and semantics of this new paradigm and then introduce a few simple sample programs to show some of its specic features. A real interpreter with a parser and a graphical layout has been implemented and we shall give the data structures and algorithms that are used. Finally, we give a very simple translation into prolog that is helpful to approach the paradigm of interaction. 2 The interaction net paradigm In this section, we present the interaction net paradigm in a very practical way by introducing a simple system that implements addition on unary numbers. For a more detailed presentation see [Laf,90] and [Laf,95]. 2.1 Syntax The basic ingredient of an interaction system is a symbol with its arity. Our sample system has three symbols: 0, S and + of respective arities 0, 1 and 2