• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Self-Adjusting Computation (2005)

Cached

  • Download as a PDF
  •  
  • Download as a PS

Download Links

  • [ttic.uchicago.edu]
  • [ttic.uchicago.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [reports-archive.adm.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Umut A. Acar
Venue:In ACM SIGPLAN Workshop on ML
Citations:24 - 11 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@TECHREPORT{Acar05self-adjustingcomputation,
    author = {Umut A. Acar},
    title = {Self-Adjusting Computation},
    institution = {In ACM SIGPLAN Workshop on ML},
    year = {2005}
}

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

From the algorithmic perspective, we describe novel data structures for tracking the dependences ina computation and a change-propagation algorithm for adjusting computations to changes. We show that the overhead of our dependence tracking techniques is O(1). To determine the effectiveness of changepropagation, we present an analysis technique, called trace stability, and apply it to a number of applications.

Citations

334 Self-adjusting binary search trees - SLEATOR, E - 1985
279 Skip lists – a probabilistic alternative to balanced trees - Pugh - 1990
265 A data structure for dynamic trees - Sleator, Tarjan - 1983
198 An Efficient Algorithm for Determining the Convex Hull of a Finite Planar - Graham - 1972
143 R.: A Judgmental Reconstruction of Modal Logic - Pfenning, Davies
141 Leeuwen. Maintenance of configurations in the plane - Overmars, van - 1981
126 Randomized search trees - Aragon, Seidel - 1989
122 The Design of Dynamic Data Structures - Overmars - 1983
58 Incremental computation via function caching - Pugh, Teitelbaum - 1989
55 Structural cut elimination - Pfenning - 1995
50 Generating language-based environments - Reps - 1984
50 lists: a probabilistic alternative to balanced trees - Skip - 1990
42 Dynamic planar convex hull - Brodal, Jacob - 2002
41 Randomized multidimensional search trees: Further results in dynamic sampling - Mulmuley - 1991
39 Caching function calls using precise dependencies - Heydon, Levin, et al. - 2000
38 Systematic Derivation of Incremental Programs - Liu, Teitelbaum - 1995
37 Incremental evaluation for attribute grammars with unrestricted movement between tree modifications - Reps - 1986
35 Dynamizing static algorithms with applications to dynamic trees and history independence - Acar, Blelloch, et al. - 2004
33 A categorized bibliography on incremental computation - Ramalingam, Reps - 1993
31 Natural deduction for intuitionistic non-commutative linear logic - Polakow, Pfenning - 1999
27 INC: A Language for Incremental Computations - Yellin, Strom
26 Dynamic data driven applications systems: A new paradigm for application simulations and measurements - Darema - 2004
25 Optimal-time incremental semantic analysis for syntax-directed editors - Reps - 1982
22 Dynamic maintenance of geometric structure made easy - Schwarzkopf - 1991
19 Self-adjusting top trees - Tarjan, Werneck - 2005
19 New classes and applications of hash functions - Wegman, Carter - 1979
17 Randomized search trees”; Algorithmica - Seidel, Aragon - 1996
16 Monads for incremental computing - Carlsson - 2002
11 Dynamic trees as search trees via euler tours, applied to the network simplex algorithm - Tarjan - 1997
10 Dynamization of order decomposable set problems - Overmars - 1981
10 Using cached functions and constructors for incremental attribute evaluation - Pennings, Swierstra, et al. - 1992
10 An example of hierarchical design and proof - Spitzen, Levitt, et al. - 1978
9 Generating Incremental Attribute Evaluators - Pennings - 1994
9 Incremental compilation via partial evaluation - Sundaresh, Hudak - 1991
8 Implementation of dynamic trees with in-subtree operations - Radzik - 1998
1 Adaptive functional programming, in:Proceedings of the 29th Annual - Acar, Blelloch, et al. - 2003
1 et al. / Electronic Notes in Theoretical Computer Science 148 (2006) 127–154 A The Implementation Thecodebelowassumestheexistenceofthe following structures or functors: MemoTable - Acar
1 Recursive monadic bindings, in:ICFP ’00 - Erkök, Launchbury
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University