Folding a Tree into a Map

09/25/2015
by   Victor Yodaiken, et al.
0

Analysis of the retrieval architecture of the highly influential UNIX file system (<cit.><cit.>) provides insight into design methods, constraints, and possible alternatives. The basic architecture can be understood in terms of function composition and recursion by anyone with some mathematical maturity. Expertise in operating system coding or in any specialized "formal method" is not required.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/04/2021

Complete solution over p^n of the equation X^p^k+1+X+a=0

The problem of solving explicitly the equation P_a(X):=X^q+1+X+a=0 over ...
research
07/22/2019

On the simulation of the Hawkes process via Lambert-W functions

Several methods have been developed for the simulation of the Hawkes pro...
research
12/29/2019

Solving X^q+1+X+a=0 over Finite Fields

Solving the equation P_a(X):=X^q+1+X+a=0 over finite field Q, where Q=p^...
research
09/19/2020

Low c-differential and c-boomerang uniformity of the swapped inverse function

Modifying the binary inverse function in a variety of ways, like swappin...
research
01/21/2020

Near-Additive Spanners and Near-Exact Hopsets, A Unified View

Given an unweighted undirected graph G = (V,E), and a pair of parameter...
research
01/17/2023

A Note on the Simplex-Tree Construction of the Vietoris-Rips Complex

We give an alternative presentation of the Simplex Tree construction of ...
research
09/03/2019

Starting CLuP with polytope relaxation

The Controlled Loosening-up (CLuP) mechanism that we recently introduced...

Please sign up or login with your details

Forgot password? Click here to reset