yusuke1997/dblp-id-title huggingface dataset:
EEMARQ: Efficient Lock-Free Range Queries with Memory Reclamation
Simple Gossipping with Balls and Bins
Participating Sets, Simulations, and the Consensus Hierarchy (Keynote Abstract)
Non-blocking k-ary Search Trees
HaTS: Hardware-Assisted Transaction Scheduler
Wait-Free Linked-Lists
The Step Complexity of Multidimensional Approximate Agreement
Asynchronous Exclusive Perpetual Grid Exploration without Sense of Direction
Navigating the Web 2.0 with Gossple
Glance: A Lightweight Querying Service for Wireless Sensor Networks
Write Markers for Probabilistic Quorum Systems
Wait-Free Concurrent Graph Objects with Dynamic Traversals
Design Patterns in Beeping Algorithms
Fork-Consistent Constructions from Registers
Power-Aware Real-Time Scheduling upon Dual CPU Type Multiprocessor Platforms
Distributed Partial Coloring via Gradual Rounding
Interactive Coding Resilient to an Unknown Number of Erasures
Using Nesting to Push the Limits of Transactional Data Structure Libraries
A State-Based Model of Sensor Protocols
Principles of Distributed Systems, 11th International Conference, OPODIS 2007, Guadeloupe, French West Indies, December 17-20, 2007. Proceedings
Self-Stabilizing Planar Quorums
SelfStabilizing Global Computations with rOperators
On Developing Optimistic Transactional Lazy Set
Procedings of the 5th International Conference on Principles of Distributed Systems. OPODIS 2001, Manzanillo, Mexico, December 10-12, 2001. Proceedings
Equivalence Classes and Conditional Hardness in Massively Parallel Computations
Crash Resilient and Pseudo-Stabilizing Atomic Registers
Error-free Multi-valued Broadcast and Byzantine Agreement with Optimal Communication Complexity
A Privacy-Preserving and Transparent Certification System for Digital Credentials
A New Causal Ordering Protocol for Overlapped Multicasts
Heterogeneous Server Placement in the Network Centric Computing Paradigm
(anti-Omega x ×Sigma z )-Based k -Set Agreement Algorithms
Mobile Byzantine Agreement on Arbitrary Network
Empire of Colonies: Self-stabilizing and Self-organizing Distributed Algorithms
Dynamic Atomic Snapshots
A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility
Correctness of Tendermint-Core Blockchains
Regret Freedom Isn't Free
Weak Synchrony Models and Failure Detectors for Message Passing ( k -)Set Agreement
Efficient Byzantine Reliable Broadcast in the Failure Case
Decoupled Interconnection of Distributed Memory Models
Byzantine-Tolerant Set-Constrained Delivery Broadcast
Modelling and Verifying Migration: A case study
Lock-Free and Practical Doubly Linked List-Based Deques Using Single-Word Compare-and-Swap
Levels of Sense of Direction in Distributed Systems
Distributed Computing, 2nd International Conference On Principles Of Distributed Systems. OPODIS 98, Amiens, France, December 16-18, 1998
Deaf, Dumb, and Chatting Asynchronous Robots
The Cost of Global Broadcast in Dynamic Radio Networks
On the Computational Power of Shared Objects
Provably Good Scheduling of Sporadic Tasks with Resource Sharing on a Two-Type Heterogeneous Multiprocessor Platform
Fast and Compact Distributed Verification and Self-stabilization of a DFS Tree
Exact Byzantine Consensus on Arbitrary Directed Graphs Under Local Broadcast Model
Scheduling Divisible Loads on a Chain of Processors
ASAP: A Camera Sensor Network for Situation Awareness
N-party BAR Transfer
Approximate Neighbor Counting in Radio Networks
Crash-Tolerant Exploration of Trees by Energy-Sharing Mobile Agents
Information Theoretic HotStuff
Optimal Broadcast in Shared Spectrum Radio Networks
An Unreliable Failure Detector for Unknown and Mobile Networks
Reliable Communication in Hybrid Authentication and Trust Models
DULL: A Fast Scalable Detectable Unrolled Lock-Based Linked List
Hop Chains: Secure Routing and the Establishment of Distinct Identities
Graph Augmentation via Metric Embedding
The Baskets Queue
Private Similarity Computation in Distributed Systems: From Cryptography to Differential Privacy
Incentive Compatibility of Ethereum's PoS Consensus Protocol
Distributing Bits and Atoms
Optimal Rendezvous L-Algorithms for Asynchronous Mobile Robots with External-Lights
LCD: Local Combining on Demand
Paxos Made Simple, Fast, and Byzantine
Echo-CGC: A Communication-Efficient Byzantine-Tolerant Distributed Machine Learning Algorithm in Single-Hop Radio Network
Distributed Approximation of Cellular Coverage
Sketching the Path to Efficiency: Lightweight Learned Cache Replacement
Space- and Time-Efficient Long-Lived Test-And-Set Objects
Explicit Space-Time Tradeoffs for Proof Labeling Schemes in Graphs with Small Separators
Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures
Make Every Word Count: Adaptive Byzantine Agreement with Fewer Words
Incremental Construction of k -Dominating Sets in Wireless Sensor Networks
Decentralized Runtime Enforcement of Message Sequences in Message-Based Systems
Distributed Distance-Bounded Network Design Through Distributed Convex Programming
Robust Random Number Generation for Peer-to-Peer Systems
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots
Two Abstractions for Implementing Atomic Objects in Dynamic Systems
Online Regenerator Placement
Shape Formation by Programmable Particles
Searching for a Black Hole in Tree Networks
MaxMin Fair Flow Control Sensitive to Priorities
Real-Time Framework for Distributed Embedded Systems
Interoperability and performances of an object distributed Application based on Corba
Self-stabilizing Byzantine Asynchronous Unison ,
State-Driven Testing of Distributed Systems
Peer to Peer Multidimensional Overlays: Approximating Complex Structures
Progress-Space Tradeoffs in Single-Writer Memory Implementations
A Test Case Derivation for Timed Systems
Deletion without Rebalancing in Non-Blocking Binary Search Trees
Principles of Distributed Systems, 13th International Conference, OPODIS 2009, Nîmes, France, December 15-18, 2009. Proceedings
Time and Space Optimal Counting in Population Protocols
Implementing Reliable Distributed Real-Time Systems with the Theta -Model
Improved Distributed Algorithms for Random Colorings
Schlegel Diagram and Optimizable Immediate Snapshot Protocol
Optimal Clock Synchronization Under Energy Constraints in Wireless Ad-Hoc Networks
FairLedger: A Fair Blockchain Protocol for Financial Institutions
Approximation of Distances and Shortest Paths in the Broadcast Congest Clique
An Efficient Universal Construction for Large Objects
An Adaptive Technique for Constructing Robust and High-Throughput Shared Objects
On the Cost of Concurrency in Transactional Memory
Performance Anomalies in Concurrent Data Structure Microbenchmarks
Geo-registers: An Abstraction for Spatial-Based Distributed Computing
On the Nature of Progress
Fair and Reliable Self-stabilizing Communication
Mobile agents: a suitable support for service provision in mobile computing environments
Reconfigurable Lattice Agreement and Applications
Tradeoffs between Cost and Information for Rendezvous and Treasure Hunt
A Skiplist-Based Concurrent Priority Queue with Minimal Memory Contention
Metrics for Timed Systems Testing
Relaxed Queues and Stacks from Read/Write Operations
Computing and Updating the Process Number in Trees
Quality-Aware Resource Management for Wireless Sensor Networks
Extending Transactional Memory with Atomic Deferral
Strong Equivalence Relations for Iterated Models
Distributed Algorithms as a Gateway To Deductive Learning (Invited Talk)
Orientation Does Not Help with 3-Coloring a Grid in Online-LOCAL
Analysing Security on Dependable Systems A Quantitative ADURAND-LOSEpproach on a Real Scenario
Node Sampling Using Random Centrifugal Walks
Evaluating a Data Removal Strategy for Grid Environments Using Colored Petri Nets
Robust Shared Objects for Non-Volatile Main Memory
A Novel Distributed Scheduling Algorithm for Resource Sharing Under Near-Heavy Load
A Supervision API for Distributed Object-Oriented Applications Management
Principles of Distributed Systems, 10th International Conference, OPODIS 2006, Bordeaux, France, December 12-15, 2006, Proceedings
Secretive Birds: Privacy in Population Protocols
Plane Formation by Synchronous Mobile Robots without Chirality
Partially Non-Preemptive Dual Priority Multiprocessor Scheduling
Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus
Mending Partial Solutions with Few Changes
Discrete Incremental Voting
Distributed Recoloring of Interval and Chordal Graphs
On the Round Complexity of Asynchronous Crusader Agreement
Issues of Global Mobile IP via Satellite Networks: Architecture, Protocol Implementation and Mobility Management
A Lock-Based STM Protocol That Satisfies Opacity and Progressiveness
Rational Behaviors in Committee-Based Blockchains
Secured Distributed Algorithms Without Hardness Assumptions
Broadcasting with Mobile Agents in Dynamic Networks
Byzantine Convergence in Robot Networks: The Price of Asynchrony
Tight Bounds on the Message Complexity of Distributed Tree Verification
Distributed Approximation of k-Service Assignment
Real-Time Issues in Mobile Wireless Networks
SCONE Confidential Computing Environment: Protecting Applications Against Powerful Adversaries (Invited Talk)
Where to Place Your TEE? In Search of a Censorship-Resilient Design for Rollup Sequencers
A Scheme Encouraging Mobile Nodes to Forward Packets via Multiple Wireless Links Aggregating System Between the Internet and Mobile Ad Hoc Networks
Transient Model for Jackson Networks and Its Approximation
Node Discovery in Networks
Stochastic Modeling of Dynamic Distributed Systems with Crash Recovery and Its Application to Atomic Registers
Principles of Distributed Systems, 12th International Conference, OPODIS 2008, Luxor, Egypt, December 15-18, 2008. Proceedings
Solving Tasks with Fewer Registers Than Processes
The Partitioned, Static-Priority Scheduling of Sporadic Real-Time Tasks with Constrained Deadlines on Multiprocessor Platforms
The 0-1-Exclusion Families of Tasks
Parallel Combining: Benefits of Explicit Synchronization
Task Computability in Unreliable Anonymous Networks
Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms
Reputation-Based Mechanisms for Evolutionary Master-Worker Computing
On Principles Of Distributed Systems, Proceedings of the 1997 International Conference, Chantilly, France, December 10-12, 1997
Chopin: Combining Distributed and Centralized Schedulers for Self-Adjusting Datacenter Networks
Safe and Eventually Safe: Comparing Self-stabilizing and Non-stabilizing Algorithms on a Common Ground
Approximation Bounds for Black Hole Search Problems
QuickLex: A Fast Algorithm for Consistent Global States Enumeration of Distributed Computations
Causality for the Masses: Offering Fresh Data, Low Latency, and High Throughput
Recoverable, Abortable, and Adaptive Mutual Exclusion with Sublogarithmic RMR Complexity
Toward Linearizability Testing for Multi-Word Persistent Synchronization Primitives
Random Circulating Word Information Management for Tree Construction and a Shortest Path Routing Tables Computation
End-point Identifiers in Secure Multi-homed Mobility
FixMe: A Self-organizing Isolated Anomaly Detection Architecture for Large Scale Distributed Systems
DART: Distributed Automated Regression Testing for Large-Scale Network Applications
Multiple Memory Consistency Models on a SVM Parallel Programming Environment
Multi-Threshold Asynchronous Reliable Broadcast and Consensus
Analysis of Bounds on Hybrid Vector Clocks
21st International Conference on Principles of Distributed Systems, OPODIS 2017, Lisbon, Portugal, December 18-20, 2017
Lattice Completion Algorithms for Distributed Computations
Fast Localized Delaunay Triangulation
Multiple Agents RendezVous in a Ring in Spite of a Black Hole
On Polynomial Time Local Decision
Non-Determinism in Byzantine Fault-Tolerant Replication
Parameterized Synthesis of Self-Stabilizing Protocols in Symmetric Rings
Static-Priority Scheduling of Sporadic Messages on a Wireless Channel
On Distributed Resource Handling: Dining, Drinking and Mobile Philosophers
Linear Rendezvous with Asymmetric Clocks
Maximally Resilient Replacement Paths for a Family of Product Graphs
A Framework for Architectural Specification of Distributed Object Systems
Eating Sandwiches: Modular and Lightweight Elimination of Transaction Reordering Attacks
Worm Versus Alert: Who Wins in a Battle for Control of a Large-Scale Network?
A Faster Counting Protocol for Anonymous Dynamic Networks
Optimal Snap-Stabilizing PIF in Un-Oriented Trees
A Disruption-Resistant MAC Layer for Multichannel Wireless Networks
RandSolomon: Optimally Resilient Random Number Generator with Deterministic Termination
Recoverable Computing (Invited Talk)
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming
Quantum Distributed Computing: Potential and Limitations (Invited Talk)
Bounds for Deterministic Reliable Geocast in Mobile Ad-Hoc Networks
Towards Very Large, Self-Managing Distributed Systems: Extended Abstract
Optimal Bounds on the Gain of Permitting Dynamic Allocation of Communication Channels in Distributed Processing
Does Clock Precision Influence ZigBee's Energy Consumptions?
A Lazy Concurrent List-Based Set Algorithm
Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks
Fast Rerouting Against Dynamic Failures: 2-Resilience via Ear-Decomposition and Planarity
Fault-Tolerant Aggregation: Flow-Updating Meets Mass-Distribution
Dynamic Probabilistic Reliable Broadcast
Response Time Bounds for G-EDF without Intra-Task Precedence Constraints
Distributed Universality
Locally Solvable Tasks and the Limitations of Valency Arguments
Verifying the Consistency of Remote Untrusted Services with Commutative Operations
A Fault Avoidance Strategy Improving the Reliability of the EGI Production Grid Infrastructure
Bounds on Worst-Case Responsiveness for Agreement Algorithms
Distributed Programming with Tasks
Attack-Resilient Multitree Data Distribution Topologies
Detecting Locally Stable Predicates Without Modifying Application Messages
A Lower-Bound Algorithm for Load Balancing in Real-Time Systems
Non-deterministic Population Protocols
k-Coteries for Tolerating Network 2-Partition
Sun Platform
Byzantine Consensus with Few Synchronous Links
ACE: Abstract Consensus Encapsulation for Liveness Boosting of State Machine Replication
The Quorum Deployment Problem
Randomized Byzantine Gathering in Rings
The Impact of Edge Deletions on the Number of Errors in Networks
Efficient Power Utilization in Multi-radio Wireless Ad Hoc Networks
The Synergy of Finite State Machines
Designing a Planetary-Scale IMAP Service with Conflict-free Replicated Data Types
How Local Constraints Influence Network Diameter and Applications to LCL Generalizations
Evacuating an Equilateral Triangle in the Face-to-Face Model
Really Big Data: Analytics on Graphs with Trillions of Edges (Keynote Abstract)
VirtuCast: Multicast and Aggregation with In-Network Processing - An Exact Single-Commodity Algorithm
Maximum Matching for Anonymous Trees with Constant Space per Process
Distributed Game-Theoretic Vertex Coloring
The Sparsest Additive Spanner via Multiple Weighted BFS Trees
A General Input-Dependent Colorless Computability Theorem and Applications to Core-Dependent Adversaries
Self-stabilizing Vertex Coloration and Arbitrary Graphs
A good balance between weight and distances for multipoint trees
α-Register
Tardiness Bounds for Global EDF with Deadlines Different from Periods
Accountable Distributed Computing (Invited Talk)
A Communication-Efficient Self-stabilizing Algorithm for Breadth-First Search Trees
On Reliability of the Extrema Propagation Technique in Random Environment
Fast and Scalable Queue-Based Resource Allocation Lock on Shared-Memory Multiprocessors
Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring
Non Trivial Computations in Anonymous Dynamic Networks
NB-FEB: A Universal Scalable Easy-to-Use Synchronization Primitive for Manycore Architectures
Group Renaming
Self-stabilizing Wireless Connected Overlays
19th International Conference on Principles of Distributed Systems, OPODIS 2015, Rennes, France, December 14-17, 2015
Nontrivial and Universal Helping for Wait-Free Queues and Stacks
On Local Fixing
Small-World Networks: From Theoretical Bounds to Practical Systems
Gathering of Mobile Robots with Defected Views
Enhanced Fault-Tolerance through Byzantine Failure Detection
Principles of Distributed Systems, 7th International Conference, OPODIS 2003 La Martinique, French West Indies, December 10-13, 2003 Revised Selected Papers
Fast Lean Erasure-Coded Atomic Memory Object
Proving SelfStabilizing Randomized Protocols
Complexity of Multi-Valued Register Simulations: A Retrospective (Keynote)
From an Intermittent Rotating Star to a Leader
Mobile Byzantine Agreement in a Trusted World
Weaker Assumptions for Asymmetric Trust
Comparison of Failures and Attacks on Random and Scale-Free Networks
Redundant Data Placement Strategies for Cluster Storage Environments
No Symmetric Broadcast Abstraction Characterizes k-Set-Agreement in Message-Passing Systems
Approximation Algorithms for the Set Cover Formation by Oblivious Mobile Robots
Timed Virtual Stationary Automata for Mobile Networks
The Relative Power of Composite Loop Agreement Tasks
On the Cost of Uniform Protocols Whose Memory Consumption Is Adaptive to Interval Contention
Byzantine Consensus in Abstract MAC Layer
Tutorial Summary: Paxos Explained from Scratch
SRF TCP: A TCP-Friendly and Fair Congestion Control Method for High-Speed Networks
Optimal Clock Synchronization Revisited: Upper and Lower Bounds in Real-Time Systems
Complex Models, Hierarchical Graph and Cooperative Agents
RMR-Efficient Detectable Objects for Persistent Memory and Their Applications
Transactional Scheduling for Read-Dominated Workloads
Space Bounds for Reliable Storage: Fundamental Limits of Coding (Keynote)
Stabilizing Consensus Is Impossible in Lossy Iterated Immediate Snapshot Models
Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps
The Next 700 BFT Protocols
A Formal Framework for Conformance Testing of Distributed Real-Time Systems
Constructing Mid-Points for Two-Party Asynchronous Protocols
Transformations for Write-All-with-Collision Model
On the Hierarchy of Distributed Majority Protocols
Toward a Theory of Input Acceptance for Transactional Memories
Fast Graphical Population Protocols
Optimal Resilience Asynchronous Approximate Agreement
Revising Distributed UNITY Programs Is NP-Complete
Heterogeneous Paxos
The Anonymous Consensus Hierarchy and Naming Problems
Revising UNITY Programs: Possibilities and Limitations
Near-Optimal Resilient Labeling Schemes
Robustness of the Rotor-router Mechanism
Optimizing Regenerator Cost in Traffic Grooming - (Extended Abstract)
Byzantine Lattice Agreement in Asynchronous Systems
Making Democracy Work: Fixing and Simplifying Egalitarian Paxos
Automatic Generation of CCS Specifications for Resource Sharing Problems
A Decentralized, Scalable, and Autonomous Grid Monitoring System
Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols Without Identifiers nor Random Numbers
Optimal-Length Labeling Schemes for Fast Deterministic Communication in Radio Networks
You Only Live Multiple Times: A Blackbox Solution for Reusing Crash-Stop Algorithms In Realistic Crash-Recovery Settings
Ensuring Average Recovery with Adversarial Scheduler
SelfStabilizing WaitFree Clock Synchronization with Bounded Space
Bounding the makespan of best pre-schedulings of task graphs with fixed communication delays and random execution times on a virtual distributed system
A Distributed Algorithm for Unstable Global Predicate Evaluation with Approximately Synchronized Clocks
Wait-Free Stabilizing Dining Using Regular Registers
Asymmetric Distributed Trust
A FaultTolerant Model for Replication in Distributed File Systems
Synchronized Phased Systems
Testing Mobile and Distributed Systems: Method and Experimentation
On the Complexity of Distributed Broadcasting and MDS Construction in Radio Networks
Acknowledged Broadcasting and Gossiping in Ad Hoc Radio Networks
Dynamic Reconfiguration: A Tutorial (Tutorial)
Erasure-Coded Byzantine Storage with Separate Metadata
How Lock-free Data Structures Perform in Dynamic Environments: Models and Analyses
The Complexity of Distributed Cooperation in the Presence of Failures
Enhancing the Performance of High Availability Lightweight Live Migration
Rendezvous of Mobile Agents When Tokens Fail Anytime
Computational Grids: New Challenges for Distributed Computing
On the Polling Problem for Social Networks
A Distributed Algorithm for Resource Clustering in Large Scale Platforms
Algorithms for Partial Gathering of Mobile Agents in Asynchronous Rings
A Generic Undo Support for State-Based CRDTs
Model Checking of Robot Gathering
Unifying Byzantine Consensus Algorithms with Weak Interactive Consistency
Principles of Distributed Systems, 16th International Conference, OPODIS 2012, Rome, Italy, December 18-20, 2012. Proceedings
Hybrid Fault-Tolerant Consensus in Asynchronous and Wireless Embedded Systems
Design of Self-Stabilizing Approximation Algorithms via a Primal-Dual Approach
Turning Adversaries into Friends: Simplified, Made Constructive, and Extended
Twins: BFT Systems Made Robust
Byzantine Agreement with Median Validity
Tight Bounds on Distributed Exploration of Temporal Graphs
Asynchronous to Synchronous transformations
Distributed Algorithms: A Challenging Playground for Model Checking (Invited Talk)
Fast and Space-Efficient Queues via Relaxation
Checkpointing in Parallel State-Machine Replication
A Design of Multi-Startegy Parallelization for an Entire Application of Document Categorization on Low-Cost Multiprocessor PCs
High Throughput Connectomics (Keynote Abstract)
Directional Versus Omnidirectional Antennas for Energy Consumption and k -Connectivity of Networks of Sensors
Nanopublications as FAIR Digital Object Implementations
FDOs and Service Brokering, the CLARIN Switchboard Use-Case
FDO-Based FAIR-by-Design Upgrade of an Interdisciplinary Research Infrastructure for Nanoscience
International FAIR Digital Objects Implementation Summit 2024, Berlin, Germany, March 20-21, 2024
Data Economy and FDOs
FAIR Digital Object Assessment and Acceleration Approaches at the World Data System
Meet the FDO Manager Reference Implementation of FDO Operations (Create, Retrieve, Update, Delete) Based on the Digital Object Interface Protocol (DOIP)
Turning Machine-Actionable DMPs Into FAIR Digital Objects
The African Open Science Platform Implementing the African Open Science Vision
Practical webby FDOs With RO-Crate and FAIR Signposting Experiences and Lessons Learned
FAIR Digital Objects in Autosubmit Workflows
FDOs and Materials Science and Engineering
Cooking with DOIs A Recipe for FAIR Digital Specimens Using FDOs
Implementing FAIR Semantic Mappings Leveraging on RO-Crate
FAIR Implementation Profiles for the Social Sciences and Their Use Cases
Combining FAIR Digital Object Implementation Concepts in a Real-Life Application
An FDO-Based Exchange Interface for Research Data A Conceptual Design of an FDO Based API
FAIR Digital Objects Summit Berlin Talks Units of Measurement in FAIR Digital Objects and the Fast-Changing Landscape of Data Infrastructures and the Work in the United States
Implementation of PIDs and Plans for FDOs in the RSpace Digital Research Platform
How to Design FDO Profiles and Kernel Attributes? An Investigation Along Processing, Grammars and Automata
FDO Manager: Minimum Viable FAIR Digital Object Implementation
FDO Implementation Summit 2024 Looking Back
Towards Machine-Actionable Scientific Knowledge as FAIR Digital Objects
A Lightweight Approach to FDOs via Bioschemas, RO-Crate and Signposting on GitHub Pages
A Primer for FDO Profile Creation Based on Early Experience
FDO Testbed
Manufacturing X - Solutions for the Manufacturing Industry Industrial Data Standards to Support Industrial Data Ecosystems
FDO as an Interoperability Framework for the Biodiversity Digital Twin Project
HTTP-Based Implementation Strategies for the FAIR Digital Object Framework Identifier Resolution