On the public citation graph

Random Slicing

0 signed · 48 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11535218_2openalex-snapshot

Finding Collisions in the Full SHA-1

inferredcites →https://doi.org/10.1007/3-540-49543-6_13openalex-snapshot

“Balls into Bins” — A Simple and Tight Analysis

inferredcites →https://doi.org/10.1007/978-3-540-72540-4_1openalex-snapshot

Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities

inferredcites →https://doi.org/10.1007/978-3-540-77974-2openalex-snapshot

Computational Geometry

inferredcites →https://doi.org/10.1007/978-3-540-88871-0_64openalex-snapshot

Distributing Orthogonal Redundancy on Adaptive Disk Arrays

inferredcites →https://doi.org/10.1007/978-3-540-92221-6_38openalex-snapshot

Redundant Data Placement Strategies for Cluster Storage Environments

inferredcites →https://doi.org/10.1007/978-3-642-03356-8_4openalex-snapshot

Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate

inferredcites →https://doi.org/10.1007/bf01235718openalex-snapshot

On inversive maximal period polynomials over finite fields

inferredcites →https://doi.org/10.1109/71.963420openalex-snapshot

The power of two choices in randomized load balancing

inferredcites →https://doi.org/10.1109/csac.2003.1254318openalex-snapshot

Practical random number generation in software

inferredcites →https://doi.org/10.1109/icdcs.2007.103openalex-snapshot

Dynamic and Redundant Data Placement

inferredcites →https://doi.org/10.1109/ipdps.2003.1213151openalex-snapshot

A fast algorithm for online placement and reorganization of replicated data

inferredcites →https://doi.org/10.1109/ipdps.2004.1303042openalex-snapshot

Replication under scalable hashing:a family of algorithms for scalable decentralized data distribution

inferredcites →https://doi.org/10.1109/pdp.2012.58openalex-snapshot

On the Influence of PRNGs on Data Distribution

inferredcites →https://doi.org/10.1109/snapi.2008.14openalex-snapshot

Data Structure Consistency Using Atomic Operations in Storage Devices

inferredcites →https://doi.org/10.1109/tnet.2002.808407openalex-snapshot

Chord: a scalable peer-to-peer lookup protocol for internet applications

inferredcites →https://doi.org/10.1137/s0097539795288490openalex-snapshot

Balanced Allocations

inferredcites →https://doi.org/10.1145/1060289openalex-snapshot

Proceedings of the 5th symposium on Operating systems design and implementation - OSDI '02

inferredcites →https://doi.org/10.1145/1073970.1074008openalex-snapshot

Weighted distributed hash tables

inferredcites →https://doi.org/10.1145/1188455.1188582openalex-snapshot

Grid resource management---CRUSH

inferredcites →https://doi.org/10.1145/1323293.1294281openalex-snapshot

Dynamo

inferredcites →https://doi.org/10.1145/191995.192033openalex-snapshot

EVENODD: an optimal scheme for tolerating double disk failures in RAID architectures

inferredcites →https://doi.org/10.1145/258533.258660openalex-snapshot

Consistent hashing and random trees

inferredcites →https://doi.org/10.1145/341800.341815openalex-snapshot

Efficient, distributed data placement strategies for storage area networks (extended abstract)

inferredcites →https://doi.org/10.1145/383059.383071openalex-snapshot

Chord

inferredcites →https://doi.org/10.1145/50202.50214openalex-snapshot

A case for redundant arrays of inexpensive disks (RAID)

inferredcites →https://doi.org/10.1145/564870.564878openalex-snapshot

Compact, adaptive placement schemes for non-uniform requirements

inferredcites →https://doi.org/10.1145/971701.50214openalex-snapshot

A case for redundant arrays of inexpensive disks (RAID)

inferredcites →https://doi.org/10.1214/aoap/1177005878openalex-snapshot

A New Class of Random Number Generators

inferredcites →https://doi.org/10.1515/9780691206844openalex-snapshot

Pseudorandomness and Cryptographic Applications

inferredcites →https://doi.org/10.17487/rfc3174openalex-snapshot

US Secure Hash Algorithm 1 (SHA1)

inferredcites →https://doi.org/10.2307/j.ctvs32rpnopenalex-snapshot

Pseudorandomness and Cryptographic Applications

inferredcites →https://doi.org/10.5555/1298455.1298485openalex-snapshot

Ceph: a scalable, high-performance distributed file system

inferredcites →https://doi.org/10.5555/1960475.1960486openalex-snapshot

FastScale: accelerate RAID scaling by minimizing data migration

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/s00607-019-00714-7openalex-snapshot

Efficient techniques of parallel recovery for erasure-coding-based distributed file systems

inferred← citeshttps://doi.org/10.1007/s10586-024-04325-6openalex-snapshot

Reliability through an optimal SDS controller’s placement in a SDDC and smart city

inferred← citeshttps://doi.org/10.1016/j.future.2025.107815openalex-snapshot

A comparative study of ad-hoc file systems for extreme scale computing

inferred← citeshttps://doi.org/10.1109/icccn.2016.7568521openalex-snapshot

ESet: Placing Data Towards Efficient Recovery for Large-Scale Erasure-Coded Storage Systems

inferred← citeshttps://doi.org/10.1109/ipdps53621.2022.00064openalex-snapshot

RLRP: High-Efficient Data Placement with Reinforcement Learning for Modern Distributed Storage Systems

inferred← citeshttps://doi.org/10.1109/ispa-bdcloud-socialcom-sustaincom52081.2021.00095openalex-snapshot

Hashing Based Data Distribution in Heterogeneous Storage

inferred← citeshttps://doi.org/10.1109/padsw.2018.8644992openalex-snapshot

An Efficient Segment Grouping Approach for Active Disk-Based Storage Systems

inferred← citeshttps://doi.org/10.1109/sose.2018.00020openalex-snapshot

A Data Distribution Service for Cloud and Containerized Storage Based on Information Dispersal

inferred← citeshttps://doi.org/10.1145/3342858openalex-snapshot

Determining Data Distribution for Large Disk Enclosures with 3-D Data Templates

inferred← citeshttps://doi.org/10.3389/fenvs.2026.1734506openalex-snapshot

Technological innovation for environmental monitoring of strategic ecosystems: implications for sustainability

inferred← citeshttps://doi.org/10.3390/app11083298openalex-snapshot

Erasure-Coding-Based Storage and Recovery for Distributed Exascale Storage Systems

inferred← citeshttps://doi.org/10.3390/s22187016openalex-snapshot

On the Efficient Delivery and Storage of IoT Data in Edge–Fog–Cloud Environments

inferred← citeshttps://doi.org/10.48550/arxiv.1707.00904openalex-snapshot

Sequential Checking: Reallocation-Free Data-Distribution Algorithm for Scale-out Storage

inferred← citeshttps://doi.org/10.5821/dissertation-2117-95472openalex-snapshot

Scalability in extensible and heterogeneous storage systems

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.