On the public citation graph
Tolerating correlated failures for generalized Cartesian distributions via bipartite matching
0 signed · 41 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/nav.3800020109openalex-snapshot
The Hungarian method for the assignment problem
inferredcites →https://doi.org/10.1007/3-540-45255-9_47openalex-snapshot
FT-MPI: Fault Tolerant MPI, Supporting Dynamic Applications in a Dynamic World
inferredcites →https://doi.org/10.1016/j.cpc.2010.04.018openalex-snapshot
NWChem: A comprehensive and scalable open-source solution for large scale molecular simulations
inferredcites →https://doi.org/10.1016/j.jpdc.2008.12.002openalex-snapshot
Algorithm-based fault tolerance applied to high performance computing
inferredcites →https://doi.org/10.1016/s0743-7315(03)00103-5openalex-snapshot
Generalized multipartitioning of multi-dimensional arrays for parallelizing line-sweep computations
inferredcites →https://doi.org/10.1088/1742-6596/46/1/067openalex-snapshot
Berkeley lab checkpoint/restart (BLCR) for Linux clusters
inferredcites →https://doi.org/10.1088/1742-6596/78/1/012022openalex-snapshot
Understanding failures in petascale computers
inferredcites →https://doi.org/10.1109/cluster10696.2005openalex-snapshot
2005 IEEE International Conference on Cluster Computing
inferredcites →https://doi.org/10.1109/clustr.2004.1392606openalex-snapshot
FTC-Charm++: an in-memory checkpoint-based fault tolerant runtime for Charm++ and MPI
inferredcites →https://doi.org/10.1109/clustr.2009.5289188openalex-snapshot
Scalable I/O forwarding framework for high-performance computing systems
inferredcites →https://doi.org/10.1109/ftcs.1994.315631openalex-snapshot
Faster checkpointing with N+1 parity
inferredcites →https://doi.org/10.1109/icpp.2009.20openalex-snapshot
CIFTS: A Coordinated Infrastructure for Fault-Tolerant Systems
inferredcites →https://doi.org/10.1109/pdp.2009.31openalex-snapshot
Proactive Fault Tolerance Using Preemptive Migration
inferredcites →https://doi.org/10.1109/pdp.2011.72openalex-snapshot
A Redundant Communication Approach to Scalable Fault Tolerance in PGAS Programming Models
inferredcites →https://doi.org/10.1109/tc.1984.1676475openalex-snapshot
Algorithm-Based Fault Tolerance for Matrix Operations
inferredcites →https://doi.org/10.1109/tpds.2008.58openalex-snapshot
Algorithm-Based Fault Tolerance for Fail-Stop Failures
inferredcites →https://doi.org/10.1137/0202019openalex-snapshot
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
inferredcites →https://doi.org/10.1137/1.9780898717754.ch8openalex-snapshot
8. Quadratic Assignment Problems: Algorithms
inferredcites →https://doi.org/10.1145/1362622openalex-snapshot
Proceedings of the 2007 ACM/IEEE conference on Supercomputing
inferredcites →https://doi.org/10.1145/195613.195663openalex-snapshot
Average-case analysis of algorithms for matchings and related problems
inferredcites →https://doi.org/10.1145/321941.321942openalex-snapshot
An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
inferredcites →https://doi.org/10.1145/568522.568525openalex-snapshot
A survey of rollback-recovery protocols in message-passing systems
inferredcites →https://doi.org/10.1177/1094342006064503openalex-snapshot
Advances, Applications and Performance of the Global Arrays Shared Memory Programming Toolkit
inferredcites →https://doi.org/10.2172/964079openalex-snapshot
Scalable I/O Systems via Node-Local Storage: Approaching 1 TB/sec File I/O
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
inferredcites →https://doi.org/10.25777/e1r5-yp32openalex-snapshot
Algorithms for Vertex-Weighted Matching in Graphs
inferredcites →https://doi.org/10.5555/1413370.1413414openalex-snapshot
Proactive process-level live migration in HPC environments
inferredcites →https://doi.org/10.5555/1898953.1899028openalex-snapshot
Algorithm-based checkpoint-free fault tolerance for parallel matrix computations on volatile resources
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-642-23397-5_34openalex-snapshot
Application-Specific Fault Tolerance via Data Access Characterization
inferred← citeshttps://doi.org/10.1007/s10766-012-0218-5openalex-snapshot
Multi-Fault Tolerance for Cartesian Data Distributions
inferred← citeshttps://doi.org/10.1109/hipc.2018.00031openalex-snapshot
Characterization of the Impact of Soft Errors on Iterative Methods
inferred← citeshttps://doi.org/10.1109/hipc.2019.00048openalex-snapshot
Ground-Truth Prediction to Accelerate Soft-Error Impact Analysis for Iterative Methods
inferred← citeshttps://doi.org/10.1109/hpcsim.2015.7237083openalex-snapshot
Identifying patterns towards Algorithm Based Fault Tolerance
inferred← citeshttps://doi.org/10.1109/icppw.2014.41openalex-snapshot
Checksumming Strategies for Data in Volatile Memories
inferred← citeshttps://doi.org/10.1109/ipdpsw.2015.14openalex-snapshot
A Resilient Framework for Iterative Linear Algebra Applications in X10
inferred← citeshttps://doi.org/10.1109/mc.2015.215openalex-snapshot
Codesign Lessons Learned from Implementing Graph Matching on Multithreaded Architectures
inferred← citeshttps://doi.org/10.2172/1163214openalex-snapshot
A Fault-Oblivious Extreme-Scale Execution Environment (FOX)
inferred← citeshttps://doi.org/10.5821/dissertation-2117-183235openalex-snapshot
An extensive study on iterative solver resilience : characterization, detection and prediction
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.