On the public citation graph

Distributed Transactional Memory for General Networks

0 signed · 80 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.1006/jagm.1996.0826openalex-snapshot
The Distributedk-Server Problem—A Competitive Distributed Translator fork-Server Algorithms
inferredcites →https://doi.org/10.1006/jpdc.1996.0041openalex-snapshot
A Log (N) Distributed Mutual Exclusion Algorithm Based on Path Reversal
inferredcites →https://doi.org/10.1007/3-540-45414-4_15openalex-snapshot
Self Stabilizing Distributed Queuing
inferredcites →https://doi.org/10.1007/978-3-540-92990-1_3openalex-snapshot
Steal-on-Abort: Improving Transactional Memory Performance through Dynamic Transaction Reordering
inferredcites →https://doi.org/10.1007/978-3-642-10877-8_6openalex-snapshot
Brief Announcement: Relay: A Cache-Coherence Protocol for Distributed Transactional Memory
inferredcites →https://doi.org/10.1007/978-3-642-15369-3_14openalex-snapshot
Improved Lower Bounds for the Universal and a priori TSP
inferredcites →https://doi.org/10.1007/978-3-642-16023-3_33openalex-snapshot
A Provably Starvation-Free Distributed Directory Protocol
inferredcites →https://doi.org/10.1007/bf01294260openalex-snapshot
On the power of randomization in on-line algorithms
inferredcites →https://doi.org/10.1007/bfb0056478openalex-snapshot
The arrow distributed directory protocol
inferredcites →https://doi.org/10.1007/s00224-003-1085-7openalex-snapshot
Approximation Algorithms for Data Management in Networks
inferredcites →https://doi.org/10.1007/s00224-006-1251-9openalex-snapshot
Dynamic Analysis of the Arrow Distributed Protocol
inferredcites →https://doi.org/10.1007/s002240000118openalex-snapshot
Accessing Nearby Copies of Replicated Objects in a Distributed Environment
inferredcites →https://doi.org/10.1007/s00446-007-0037-xopenalex-snapshot
Distributed transactional memory for metric-space networks
inferredcites →https://doi.org/10.1007/s00446-012-0159-7openalex-snapshot
Window-based greedy contention management for transactional memory: theory and practice
inferredcites →https://doi.org/10.1007/s004460050028openalex-snapshot
Software transactional memory
inferredcites →https://doi.org/10.1007/s00453-011-9532-3openalex-snapshot
A Competitive Analysis for Balanced Transactional Memory Workloads
inferredcites →https://doi.org/10.1007/s00453-013-9803-2openalex-snapshot
An Analysis Framework for Distributed Hierarchical Directories
inferredcites →https://doi.org/10.1016/0304-3975(94)90158-9openalex-snapshot
Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling
inferredcites →https://doi.org/10.1016/j.jcss.2004.04.011openalex-snapshot
A tight bound on approximating arbitrary metrics by tree metrics
inferredcites →https://doi.org/10.1109/12.88464openalex-snapshot
Stabilizing communication protocols
inferredcites →https://doi.org/10.1109/fscs.1990.89571openalex-snapshot
Sparse partitions
inferredcites →https://doi.org/10.1109/hpca.2007.346204openalex-snapshot
LogTM-SE: Decoupling Hardware Transactional Memory from Caches
inferredcites →https://doi.org/10.1109/icpp.2008.59openalex-snapshot
DiSTM: A Software Transactional Memory Framework for Clusters
inferredcites →https://doi.org/10.1109/ipdps.2010.5470393openalex-snapshot
Dynamic analysis of the relay cache-coherence protocol for distributed transactional memory
inferredcites →https://doi.org/10.1109/mm.2004.91openalex-snapshot
Transactional coherence and consistency: simplifying parallel hardware and software
inferredcites →https://doi.org/10.1109/prdc.2009.55openalex-snapshot
D2STM: Dependable Distributed Software Transactional Memory
inferredcites →https://doi.org/10.1109/sfcs.1991.185378openalex-snapshot
Self-stabilization by local checking and correction
inferredcites →https://doi.org/10.1109/sfcs.1992.267757openalex-snapshot
Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling
inferredcites →https://doi.org/10.1109/sfcs.1996.548477openalex-snapshot
Probabilistic approximation of metric spaces and its algorithmic applications
inferredcites →https://doi.org/10.1109/sfcs.1997.646117openalex-snapshot
Exploiting locality for data management in systems of limited bandwidth
inferredcites →https://doi.org/10.1109/tpds.2006.94openalex-snapshot
Self-stabilizing distributed queuing
inferredcites →https://doi.org/10.1109/tse.1984.5010293openalex-snapshot
Site Initialization, Recovery, and Backup in a Distributed Database System
inferredcites →https://doi.org/10.1137/0215074openalex-snapshot
A Simple Parallel Algorithm for the Maximal Independent Set Problem
inferredcites →https://doi.org/10.1145/1007352.1007399openalex-snapshot
Bypassing the embedding
inferredcites →https://doi.org/10.1145/1007912.1007962openalex-snapshot
Dynamic analysis of the arrow distributed protocol
inferredcites →https://doi.org/10.1145/1060590.1060649openalex-snapshot
Universal approximations for TSP, Steiner tree, and set cover
inferredcites →https://doi.org/10.1145/1073814.1073861openalex-snapshot
Advanced contention management for dynamic software transactional memory
inferredcites →https://doi.org/10.1145/1073814.1073863openalex-snapshot
Toward a theory of transactional contention managers
inferredcites →https://doi.org/10.1145/1109557.1109628openalex-snapshot
Improved lower and upper bounds for universal TSP in planar metrics
inferredcites →https://doi.org/10.1145/1109557.1109665openalex-snapshot
Oblivious network design
inferredcites →https://doi.org/10.1145/1122971.1123002openalex-snapshot
Exploiting distributed version concurrency in a transactional memory cluster
inferredcites →https://doi.org/10.1145/115992.116013openalex-snapshot
Concurrent online tracking of mobile users
inferredcites →https://doi.org/10.1145/115994.116013openalex-snapshot
Concurrent online tracking of mobile users
inferredcites →https://doi.org/10.1145/1345206.1345242openalex-snapshot
Software transactional memory for large scale clusters
inferredcites →https://doi.org/10.1145/165123.165164openalex-snapshot
Transactional memory
inferredcites →https://doi.org/10.1145/173682.165164openalex-snapshot
Transactional memory
inferredcites →https://doi.org/10.1145/258492.258523openalex-snapshot
Accessing nearby copies of replicated objects in a distributed environment
inferredcites →https://doi.org/10.1145/361179.361202openalex-snapshot
Self-stabilizing systems in spite of distributed control
inferredcites →https://doi.org/10.1145/378580.378670openalex-snapshot
A data tracking scheme for general networks
inferredcites →https://doi.org/10.1145/383962.384001openalex-snapshot
Competitive concurrent distributed queuing
inferredcites →https://doi.org/10.1145/509907.510013openalex-snapshot
Finding nearest neighbors in growth-restricted metrics
inferredcites →https://doi.org/10.1145/58564.59295openalex-snapshot
A tree-based algorithm for distributed mutual exclusion
inferredcites →https://doi.org/10.1145/780542.780608openalex-snapshot
A tight bound on approximating arbitrary metrics by tree metrics
inferredcites →https://doi.org/10.1145/872035.872048openalex-snapshot
Software transactional memory for dynamic-sized data structures
inferredcites →https://doi.org/10.1184/r1/6609899openalex-snapshot
Steiner points in tree metrics don't (really) help
inferredcites →https://doi.org/10.5555/1109557.1109628openalex-snapshot
Improved lower and upper bounds for universal TSP in planar metrics
inferredcites →https://doi.org/10.5555/1109557.1109665openalex-snapshot
Oblivious network design
inferredcites →https://doi.org/10.5555/338219.338589openalex-snapshot
Caching in networks (extended abstract)
inferredcites →https://doi.org/10.5555/338219.338638openalex-snapshot
Improved Steiner tree approximation in graphs

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-319-14720-8_16openalex-snapshot
Transaction Execution Models in Partially Replicated Transactional Memory: The Case for Data-Flow and Control-Flow
inferred← citeshttps://doi.org/10.1007/978-3-319-14720-8_17openalex-snapshot
Directory Protocols for Distributed Transactional Memory
inferred← citeshttps://doi.org/10.1007/978-3-642-32820-6_41openalex-snapshot
Towards Load Balanced Distributed Transactional Memory
inferred← citeshttps://doi.org/10.1007/978-3-642-33651-5_35openalex-snapshot
Brief Announcement: An Analysis Framework for Distributed Hierarchical Directories
inferred← citeshttps://doi.org/10.1007/978-3-642-35668-1_26openalex-snapshot
An Analysis Framework for Distributed Hierarchical Directories
inferred← citeshttps://doi.org/10.1007/978-3-642-45346-5_19openalex-snapshot
Optimal Nearest Neighbor Queries in Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-981-10-6427-2_22openalex-snapshot
A Distributed Transactional Memory Protocol for Dynamic Networks
inferred← citeshttps://doi.org/10.1007/s00446-014-0214-7openalex-snapshot
Distributed transactional memory for general networks
inferred← citeshttps://doi.org/10.1007/s00453-013-9803-2openalex-snapshot
An Analysis Framework for Distributed Hierarchical Directories
inferred← citeshttps://doi.org/10.1007/s10586-019-02973-7openalex-snapshot
Gossip based fault tolerant protocol in distributed transactional memory using quorum based replication system
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.05.006openalex-snapshot
Optimal nearest neighbor queries in sensor networks
inferred← citeshttps://doi.org/10.1109/dasc-picom-datacom-cyberscitec.2016.74openalex-snapshot
Hierarchical Transactional Memory Protocol for Distributed Mixed-Criticality Embedded Systems
inferred← citeshttps://doi.org/10.1109/ipdpsw.2014.85openalex-snapshot
Near-Optimal Location Tracking Using Sensor Networks
inferred← citeshttps://doi.org/10.1142/s012962641550005xopenalex-snapshot
Distributed Queuing in Dynamic Networks
inferred← citeshttps://doi.org/10.1145/2636805.2636823openalex-snapshot
Distributed computing column 54 transactional memory: models and algorithms
inferred← citeshttps://doi.org/10.1145/2636805.2636824openalex-snapshot
Transactional memory
inferred← citeshttps://doi.org/10.1145/3323165.3323181openalex-snapshot
The Arvy Distributed Directory Protocol
inferred← citeshttps://doi.org/10.1145/3624309.3624316openalex-snapshot
Obstruction-Free Distributed Transactional Memory
inferred← citeshttps://doi.org/10.15803/ijnc.5.1_122openalex-snapshot
Near-Optimal Location Tracking Using Sensor Networks
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.1909openalex-snapshot
Scheduling in Transactional Memory Systems: Models, Algorithms, and Evaluations
inferred← citeshttps://doi.org/10.4204/eptcs.132.1openalex-snapshot
Distributed Queuing in Dynamic Networks
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.