新規登録 | ログイン | FAQ

[?]

CiteULike is a free online bibliography manager. Register and you can start organising your references online.

Recent | Unread | Search | Authors | Tags | Export

PersiFS: a versioned file system with an efficient representation

by: Dan RK Ports, Austin T Clements, Erik D Demaine

(2005), pp. 1-2.

View FullText article

ACM, DOI

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

mstone

Find related articles with these CiteULike tags

data-structures, persistent-b-trees, version-control, versioned-filesystems

BibTeX record

RIS record

mstone's tags

All tags in mstone's library

Filter:

2-categories 2-groups abstract-interpretation abstract-syntax access-control adjoints algebra algebraic-coding algebraic-graph-theory algorithms alice-ml analysis analytic-continuation anonymity arrows art art-history artificial-intelligence assembler auctions authentication authorization axiomatic-semantics bayesian-filters bidirectional-programming bioinformatics biology bloom-filter book-design categorical-logic category-theory change chemical-abstract-machine clean-hands coalgebra code-generation cohomology coinserters collaboration combinatorics comics comonads compilers computads computation computational-genetics concurrency concurrent-logic-programming configuration-management consensus constraint-satisfaction continuations continuous-query coproducts co-recursion covert-channels croquet cryptography databases dataflow data-structures declarative defunctionalization delay-tolerant-networking denotational-semantics dependent-types derivation-schemes design-patterns diagrams diff-algorithms distributed-computing distributed-hash-tables dsl duality dynamical-systems effects entropy euler-characteristic exceptions expression-problem file-system-apis first-order-logic fixed-points foundations free-monads fuctional-programming functional-pearls functional-programming galois-theory garbage-collection generic-programming ghc graphic-design graphics graph-theory group-theory hardness-amplification hashing haskell higher-category-theory higher-dimensional-algebra higher-rank-types hygiene ideas idempotent-calculus impredicativity information-theory inlining ipv6 java kalman-filters key-length lambda-calculus language-comparisons lexical-analysis linear-algebra linear-logic linguistics localization logic management markov-chain-monte-carlo markov-logic mathematical-history memory mercurial metaocaml meta-programming metric-spaces minitransactions ml modal-logic modules monadic-meta-language monads monoidal-categories monoids natural-language-processing n-categories networking neuroscience nix notions-of-computation numerical-analysis operads operating-systems operational-semantics opetopes optimization overlay-network parsing partial-evaluation particle-filters peer-to-peer persistent-b-trees pi-calculus pickling plan9 planning preferences probability process-calculi programming-languages program-transformation protocols pychology quantum-computing quantum-programming-languages quantum-software queries race-conditions recursion register-machines regular-expressions relational-algebra relation-algebras release-engineering replicated-sparse-memories replication research-methods rewriting-rules rewriting-systems scheduling security selinux semantic-analysis semantics semirings side-channels smalltalk software-engineering squeak stack-languages staged-programming statistics stream-computation string-diagrams survey-design synchronization syntax system-f taylor-series template-haskell tex thomas-eakins tocttou topology topos-theory tor total-functional-programming transactional-memory translation tufte type-annotation typed-intermediate-languages type-functions type-inference type-theory typography version-control versioned-filesystems virtual-machines voronoi-tesselation web-frameworks wiki xanadu