Sciweavers

414 search results - page 2 / 83
» Functional Programming in Sublinear Space
Sort
View
POPL
2012
ACM
12 years 1 months ago
Higher-order functional reactive programming in bounded space
Functional reactive programming (FRP) is an elegant and successful approach to programming reactive systems declaratively. The high levels of abstraction and expressivity that mak...
Neelakantan R. Krishnaswami, Nick Benton, Jan Hoff...
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
13 years 7 months ago
Trade-Off Lower Bounds for Stack Machines
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
Matei David, Periklis A. Papakonstantinou
IM
2006
13 years 5 months ago
Estimating Entropy and Entropy Norm on Data Streams
We consider the problem of computing information theoretic functions such as entropy on a data stream, using sublinear space. Our first result deals with a measure we call the &quo...
Amit Chakrabarti, Khanh Do Ba, S. Muthukrishnan
ICALP
2010
Springer
13 years 10 months ago
New Data Structures for Subgraph Connectivity
Abstract. We study the “subgraph connectivity” problem for undirected graphs with sublinear vertex update time. In this problem, we can make vertices active or inactive in a gr...
Ran Duan
STOC
2004
ACM
122views Algorithms» more  STOC 2004»
14 years 6 months ago
Estimating the weight of metric minimum spanning trees in sublinear-time
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
Artur Czumaj, Christian Sohler