Matches in SemOpenAlex for { <https://semopenalex.org/work/W3207141364> ?p ?o ?g. }
Showing items 1 to 57 of
57
with 100 items per page.
- W3207141364 abstract "A directed acyclic graph $G=(V,E)$ is said to be $(e,d)$-depth robust if for every subset $S subseteq V$ of $|S| leq e$ nodes the graph $G-S$ still contains a directed path of length $d$. If the graph is $(e,d)$-depth-robust for any $e,d$ such that $e+d leq (1-epsilon)|V|$ then the graph is said to be $epsilon$-extreme depth-robust. In the field of cryptography, (extremely) depth-robust graphs with low indegree have found numerous applications including the design of side-channel resistant Memory-Hard Functions, Proofs of Space and Replication, and in the design of Computationally Relaxed Locally Correctable Codes. In these applications, it is desirable to ensure the graphs are locally navigable, i.e., there is an efficient algorithm $mathsf{GetParents}$ running in time $mathrm{polylog} |V|$ which takes as input a node $v in V$ and returns the set of $v$'s parents. We give the first explicit construction of locally navigable $epsilon$-extreme depth-robust graphs with indegree $O(log |V|)$. Previous constructions of $epsilon$-extreme depth-robust graphs either had indegree $tilde{omega}(log^2 |V|)$ or were not explicit." @default.
- W3207141364 created "2021-10-25" @default.
- W3207141364 creator A5018245359 @default.
- W3207141364 creator A5028278191 @default.
- W3207141364 creator A5050841050 @default.
- W3207141364 creator A5085571523 @default.
- W3207141364 date "2021-10-08" @default.
- W3207141364 modified "2023-09-24" @default.
- W3207141364 title "On Explicit Constructions of Extremely Depth Robust Graphs." @default.
- W3207141364 cites W1530008367 @default.
- W3207141364 cites W2066775922 @default.
- W3207141364 cites W2106110343 @default.
- W3207141364 cites W2155690313 @default.
- W3207141364 cites W2484106744 @default.
- W3207141364 cites W2613194369 @default.
- W3207141364 cites W2616005523 @default.
- W3207141364 cites W2765893588 @default.
- W3207141364 cites W2794842518 @default.
- W3207141364 cites W2889291629 @default.
- W3207141364 cites W2963581626 @default.
- W3207141364 cites W2970612254 @default.
- W3207141364 hasPublicationYear "2021" @default.
- W3207141364 type Work @default.
- W3207141364 sameAs 3207141364 @default.
- W3207141364 citedByCount "0" @default.
- W3207141364 crossrefType "posted-content" @default.
- W3207141364 hasAuthorship W3207141364A5018245359 @default.
- W3207141364 hasAuthorship W3207141364A5028278191 @default.
- W3207141364 hasAuthorship W3207141364A5050841050 @default.
- W3207141364 hasAuthorship W3207141364A5085571523 @default.
- W3207141364 hasConcept C108710211 @default.
- W3207141364 hasConcept C114614502 @default.
- W3207141364 hasConcept C118615104 @default.
- W3207141364 hasConcept C121332964 @default.
- W3207141364 hasConcept C132525143 @default.
- W3207141364 hasConcept C2524010 @default.
- W3207141364 hasConcept C2779557605 @default.
- W3207141364 hasConcept C33923547 @default.
- W3207141364 hasConcept C62520636 @default.
- W3207141364 hasConcept C63553672 @default.
- W3207141364 hasConceptScore W3207141364C108710211 @default.
- W3207141364 hasConceptScore W3207141364C114614502 @default.
- W3207141364 hasConceptScore W3207141364C118615104 @default.
- W3207141364 hasConceptScore W3207141364C121332964 @default.
- W3207141364 hasConceptScore W3207141364C132525143 @default.
- W3207141364 hasConceptScore W3207141364C2524010 @default.
- W3207141364 hasConceptScore W3207141364C2779557605 @default.
- W3207141364 hasConceptScore W3207141364C33923547 @default.
- W3207141364 hasConceptScore W3207141364C62520636 @default.
- W3207141364 hasConceptScore W3207141364C63553672 @default.
- W3207141364 hasLocation W32071413641 @default.
- W3207141364 hasOpenAccess W3207141364 @default.
- W3207141364 hasPrimaryLocation W32071413641 @default.
- W3207141364 isParatext "false" @default.
- W3207141364 isRetracted "false" @default.
- W3207141364 magId "3207141364" @default.
- W3207141364 workType "article" @default.