Results 1  10
of
12,687
Purely Functional RandomAccess Lists
 In Functional Programming Languages and Computer Architecture
, 1995
"... We present a new data structure, called a randomaccess list, that supports array lookup and update operations in O(log n) time, while simultaneously providing O(1) time list operations (cons, head, tail). A closer analysis of the array operations improves the bound to O(minfi; log ng) in the wor ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
We present a new data structure, called a randomaccess list, that supports array lookup and update operations in O(log n) time, while simultaneously providing O(1) time list operations (cons, head, tail). A closer analysis of the array operations improves the bound to O(minfi; log ng
Amortized Efficiency of List Update and Paging Rules
, 1985
"... In this article we study the amortized efficiency of the “movetofront” and similar rules for dynamically maintaining a linear list. Under the assumption that accessing the ith element from the front of the list takes 0(i) time, we show that movetofront is within a constant factor of optimum amo ..."
Abstract

Cited by 824 (8 self)
 Add to MetaCart
among a wide class of list maintenance rules. Other natural heuristics, such as the transpose and frequency count rules, da not share this property. We generalize our results to show that movetofront is within a constant factor of optimum as long as the access cost is a convex function. We also study
An applicative randomaccess stack
 Information Processing Letters
, 1983
"... Kqwords: Applicative programming, linked list, number system. randomaccess stack 1. Introduction 2. The skewbinary number system Applicative (functional) programming has long been advocated on theoretical grounds as the formal properties of such programs are simple and elegant. Recently, there has ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
Kqwords: Applicative programming, linked list, number system. randomaccess stack 1. Introduction 2. The skewbinary number system Applicative (functional) programming has long been advocated on theoretical grounds as the formal properties of such programs are simple and elegant. Recently
The ratedistortion function for source coding with side information at the decoder
 IEEE Trans. Inform. Theory
, 1976
"... AbstractLet {(X,, Y,J}r = 1 be a sequence of independent drawings of a pair of dependent random variables X, Y. Let us say that X takes values in the finite set 6. It is desired to encode the sequence {X,} in blocks of length n into a binary stream*of rate R, which can in turn be decoded as a seque ..."
Abstract

Cited by 1060 (1 self)
 Add to MetaCart
the infimum is with respect to all auxiliary random variables Z (which take values in a finite set 3) that satisfy: i) Y,Z conditiofally independent given X; ii) there exists a functionf: “Y x E +.%, such that E[D(X,f(Y,Z))] 5 d. Let Rx, y(d) be the ratedistortion function which results when the encoder
Random Oracles are Practical: A Paradigm for Designing Efficient Protocols
, 1995
"... We argue that the random oracle model  where all parties have access to a public random oracle  provides a bridge between cryptographic theory and cryptographic practice. In the paradigm we suggest, a practical protocol P is produced by first devising and proving correct a protocol P R for the ..."
Abstract

Cited by 1646 (70 self)
 Add to MetaCart
for the random oracle model, and then replacing oracle accesses by the computation of an "appropriately chosen" function h. This paradigm yields protocols much more efficient than standard ones while retaining many of the advantages of provable security. We illustrate these gains for problems including
Comprehending Monads
 Mathematical Structures in Computer Science
, 1992
"... Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970's to concisely express certain programs involving lists. This paper shows how list comprehensions may be generalised t ..."
Abstract

Cited by 521 (18 self)
 Add to MetaCart
Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970's to concisely express certain programs involving lists. This paper shows how list comprehensions may be generalised
The Askeyscheme of hypergeometric orthogonal polynomials and its qanalogue
, 1998
"... We list the socalled Askeyscheme of hypergeometric orthogonal polynomials and we give a qanalogue of this scheme containing basic hypergeometric orthogonal polynomials. In chapter 1 we give the definition, the orthogonality relation, the three term recurrence relation, the second order differenti ..."
Abstract

Cited by 578 (6 self)
 Add to MetaCart
differential or difference equation, the forward and backward shift operator, the Rodriguestype formula and generating functions of all classes of orthogonal polynomials in this scheme. In chapter 2 we give the limit relations between different classes of orthogonal polynomials listed in the Askey
A theory of memory retrieval
 PSYCHOL. REV
, 1978
"... A theory of memory retrieval is developed and is shown to apply over a range of experimental paradigms. Access to memory traces is viewed in terms of a resonance metaphor. The probe item evokes the search set on the basis of probememory item relatedness, just as a ringing tuning fork evokes sympath ..."
Abstract

Cited by 769 (83 self)
 Add to MetaCart
A theory of memory retrieval is developed and is shown to apply over a range of experimental paradigms. Access to memory traces is viewed in terms of a resonance metaphor. The probe item evokes the search set on the basis of probememory item relatedness, just as a ringing tuning fork evokes
BiNGO: a Cytoscape plugin to assess overrepresentation of gene ontology categories in biological networks
 Bioinformatics
, 2005
"... Summary: The Biological Networks Gene Ontology tool (BiNGO) is an opensource Java tool to determine which Gene Ontology (GO) terms are significantly overrepresented in a set of genes. BiNGO can be used either on a list of genes, pasted as text, or interactively on subgraphs of biological networks v ..."
Abstract

Cited by 535 (4 self)
 Add to MetaCart
Summary: The Biological Networks Gene Ontology tool (BiNGO) is an opensource Java tool to determine which Gene Ontology (GO) terms are significantly overrepresented in a set of genes. BiNGO can be used either on a list of genes, pasted as text, or interactively on subgraphs of biological networks
The protection of information in computer systems
"... This tutorial paper explores the mechanics of protecting computerstored information from unauthorized use or modification. It concentrates on those architectural structureswhether hardware or softwarethat are necessary to support information protection. The paper develops in three main sectio ..."
Abstract

Cited by 824 (2 self)
 Add to MetaCart
sections. Section I describes desired functions, design principles, and examples of elementary protection and authentication mechanisms. Any reader familiar with computers should find the first section to be reasonably accessible. Section II requires some familiarity with descriptorbased computer
Results 1  10
of
12,687