On the public citation graph
An Optimal Synchronizer for the Hypercube
0 signed · 316 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/net.3230150404openalex-snapshot
Reducing complexities of the distributed max‐flow and breadth‐first‐search algorithms by means of network synchronization
inferredcites →https://doi.org/10.1016/0010-4485(85)90134-4openalex-snapshot
Computational aspects of VLSI
inferredcites →https://doi.org/10.1109/tc.1977.1674863openalex-snapshot
The Indirect Binary n-Cube Microprocessor Array
inferredcites →https://doi.org/10.1145/357195.357200openalex-snapshot
A Distributed Algorithm for Minimum-Weight Spanning Trees
inferredcites →https://doi.org/10.1145/4221.4227openalex-snapshot
Complexity of network synchronization
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(199908)34:1<11::aid-net2>3.0.co;2-xopenalex-snapshot
On the memory overhead of distributed snapshots
inferred← citeshttps://doi.org/10.1002/cpe.4330040504openalex-snapshot
Echidna, an estelle compiler to prototype protocols on distributed computers
inferred← citeshttps://doi.org/10.1002/jgt.21791openalex-snapshot
Chasing a Fast Robber on Planar Graphs and Random Graphs
inferred← citeshttps://doi.org/10.1002/net.3230240406openalex-snapshot
Spanners in graphs of bounded degree
inferred← citeshttps://doi.org/10.1002/rsa.20130openalex-snapshot
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
inferred← citeshttps://doi.org/10.1007/11561071_48openalex-snapshot
Small Stretch Spanners on Dynamic Graphs
inferred← citeshttps://doi.org/10.1007/11602613_109openalex-snapshot
Combinatorial Network Abstraction by Trees and Distances
inferred← citeshttps://doi.org/10.1007/11780823_9openalex-snapshot
Fast Deterministic Distributed Algorithms for Sparse Spanners
inferred← citeshttps://doi.org/10.1007/11841036_10openalex-snapshot
Dynamic Algorithms for Graph Spanners
inferred← citeshttps://doi.org/10.1007/3-540-45471-3_22openalex-snapshot
Approximation Algorithms for Edge-Dilation k-Center Problems
inferred← citeshttps://doi.org/10.1007/3-540-45535-3_8openalex-snapshot
Approximating k-Spanner Problems for k > 2
inferred← citeshttps://doi.org/10.1007/3-540-46541-3_31openalex-snapshot
The Hardness of Approximating Spanner Problems
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_75openalex-snapshot
Generating sparse spanners for weighted graphs
inferred← citeshttps://doi.org/10.1007/3-540-54099-7_8openalex-snapshot
On the average performance of synchronized programs in distributed networks
inferred← citeshttps://doi.org/10.1007/3-540-56188-9_8openalex-snapshot
Tentative and definite distributed computations: An optimistic approach to network synchronization
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_65openalex-snapshot
Graph spanners and connectivity
inferred← citeshttps://doi.org/10.1007/3-540-57273-2_43openalex-snapshot
On bufferless routing of variable-length messages in leveled networks
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_10openalex-snapshot
Algorithms for Spanners in Weighted Graphs
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_417openalex-snapshot
Synchronizers, Spanners
inferred← citeshttps://doi.org/10.1007/978-1-4419-6045-0_13openalex-snapshot
A Survey on Streaming Algorithms for Massive Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_10openalex-snapshot
Simple Algorithms for Spanners in Weighted Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_417openalex-snapshot
Synchronizers, Spanners
inferred← citeshttps://doi.org/10.1007/978-3-030-34992-9_9openalex-snapshot
Brief Announcement: Distributed Computing in the Asynchronous LOCAL Model
inferred← citeshttps://doi.org/10.1007/978-3-030-80879-2_7openalex-snapshot
Lasserre Integrality Gaps for Graph Spanners and Related Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-96731-4_30openalex-snapshot
Minimum t-Spanners on Subcubic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-20624-5_34openalex-snapshot
Tree 3-Spanners on Generalized Prisms of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-63021-7_17openalex-snapshot
Minimizing Distances Between Vertices and Edges Through Tree t-Spanners
inferred← citeshttps://doi.org/10.1007/978-3-319-26690-9_39openalex-snapshot
Genetic Algorithms for the Tree T-Spanner Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-48314-6_6openalex-snapshot
Message Lower Bounds via Efficient Network Synchronization
inferred← citeshttps://doi.org/10.1007/978-3-319-58747-9_6openalex-snapshot
Can We Locally Compute Sparse Connected Subgraphs?
inferred← citeshttps://doi.org/10.1007/978-3-540-27796-5_12openalex-snapshot
Sparse Additive Spanners for Bounded Tree-Length Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_62openalex-snapshot
Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining Sparse Spanners
inferred← citeshttps://doi.org/10.1007/978-3-540-75142-7_16openalex-snapshot
Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_54openalex-snapshot
Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_23openalex-snapshot
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-92248-3_11openalex-snapshot
Additive Spanners for Circle Graphs and Polygonal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-04355-0_20openalex-snapshot
Local Computation of Nearly Additive Spanners
inferred← citeshttps://doi.org/10.1007/978-3-642-05118-0_3openalex-snapshot
As Good as It Gets: Competitive Fault Tolerance in Network Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-14162-1_22openalex-snapshot
Sparse Reliable Graph Backbones
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_40openalex-snapshot
Additive Spanners in Nearly Quadratic Time
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_34openalex-snapshot
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_5openalex-snapshot
Balancing Degree, Diameter and Weight in Euclidean Spanners
inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_8openalex-snapshot
f-Sensitivity Distance Oracles and Routing Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-16367-8_10openalex-snapshot
Transitive-Closure Spanners: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-642-16926-7_25openalex-snapshot
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_1openalex-snapshot
Improved Approximation for the Directed Spanner Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_10-2openalex-snapshot
Simple Algorithms for Spanners in Weighted Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_417-2openalex-snapshot
Synchronizers, Spanners
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_25openalex-snapshot
Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner
inferred← citeshttps://doi.org/10.1007/978-3-642-33090-2_29openalex-snapshot
Improved Distance Oracles and Spanners for Vertex-Labeled Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-34611-8_22openalex-snapshot
Fault Tolerant Additive Spanners
inferred← citeshttps://doi.org/10.1007/978-3-642-34862-4_8openalex-snapshot
Multipath Spanners via Fault-Tolerant Spanners
inferred← citeshttps://doi.org/10.1007/978-3-642-35843-2_18openalex-snapshot
Collective Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations and Consequences
inferred← citeshttps://doi.org/10.1007/978-3-642-38123-2_9openalex-snapshot
Simulating Synchrony on Top of Asynchronous Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_51openalex-snapshot
Small Stretch Pairwise Spanners
inferred← citeshttps://doi.org/10.1007/978-3-642-40450-4_66openalex-snapshot
Sparse Fault-Tolerant BFS Trees
inferred← citeshttps://doi.org/10.1007/978-3-662-43951-7_49openalex-snapshot
Bypassing Erdős’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners
inferred← citeshttps://doi.org/10.1007/978-3-662-53426-7_10openalex-snapshot
Distributed Construction of Purely Additive Spanners
inferred← citeshttps://doi.org/10.1007/978-90-481-3662-9_48openalex-snapshot
Faulty Links Optimization for Hypercube Networks via Stored and Forward One-Bit Round Robin Routing Algorithm
inferred← citeshttps://doi.org/10.1007/978-981-15-6876-3_12openalex-snapshot
General Variable Neighborhood Search for the Minimum Stretch Spanning Tree Problem
inferred← citeshttps://doi.org/10.1007/bf02189308openalex-snapshot
On sparse spanners of weighted graphs
inferred← citeshttps://doi.org/10.1007/bf02679457openalex-snapshot
The use of a synchronizer yields the maximum computation rate in distributed networks
inferred← citeshttps://doi.org/10.1007/bfb0020436openalex-snapshot
Low complexity network synchronization
inferred← citeshttps://doi.org/10.1007/bfb0053970openalex-snapshot
On the hardness of approximating spanners
inferred← citeshttps://doi.org/10.1007/pl00009336openalex-snapshot
Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs
inferred← citeshttps://doi.org/10.1007/s00186-024-00850-7openalex-snapshot
Complexity of the multiobjective minimum weight minimum stretch spanner problem
inferred← citeshttps://doi.org/10.1007/s00224-006-1266-2openalex-snapshot
The Hardness of Approximating Spanner Problems
inferred← citeshttps://doi.org/10.1007/s00446-005-0147-2openalex-snapshot
Efficient algorithms for constructing (1+∊,β)-spanners in the distributed and streaming models
inferred← citeshttps://doi.org/10.1007/s00446-017-0306-2openalex-snapshot
Distributed construction of purely additive spanners
inferred← citeshttps://doi.org/10.1007/s00446-018-0326-6openalex-snapshot
Distributed distance computation and routing with small messages
inferred← citeshttps://doi.org/10.1007/s00446-019-00351-5openalex-snapshot
Demand-aware network designs of bounded degree
inferred← citeshttps://doi.org/10.1007/s00446-025-00503-wopenalex-snapshot
Constant-round spanners and shortest paths in congested clique and MPC
inferred← citeshttps://doi.org/10.1007/s00453-001-0021-yopenalex-snapshot
On the Hardness of Approximating Spanners
inferred← citeshttps://doi.org/10.1007/s00453-008-9194-yopenalex-snapshot
Collective Tree Spanners in Graphs with Bounded Parameters
inferred← citeshttps://doi.org/10.1007/s00453-008-9216-9openalex-snapshot
Graph Spanners in the Streaming Model: An Experimental Study
inferred← citeshttps://doi.org/10.1007/s00453-011-9543-0openalex-snapshot
f-Sensitivity Distance Oracles and Routing Schemes
inferred← citeshttps://doi.org/10.1007/s00453-019-00612-6openalex-snapshot
Local Algorithms for Sparse Spanning Graphs
inferred← citeshttps://doi.org/10.1007/s00453-021-00911-xopenalex-snapshot
Parameterized Complexity of Directed Spanner Problems
inferred← citeshttps://doi.org/10.1007/s00453-022-00994-0openalex-snapshot
Light Spanners for High Dimensional Norms via Stochastic Decompositions
inferred← citeshttps://doi.org/10.1007/s00607-018-0621-xopenalex-snapshot
A parallel bio-inspried shortest path algorithm
inferred← citeshttps://doi.org/10.1007/s10255-021-1028-6openalex-snapshot
The Minimum Stretch Spanning Tree Problem for Typical Graphs
inferred← citeshttps://doi.org/10.1007/s10878-024-01197-9openalex-snapshot
Polynomial algorithms for sparse spanners on subcubic graphs
inferred← citeshttps://doi.org/10.1007/s11590-018-1340-0openalex-snapshot
Mixed-integer programming approaches for the tree $$t^*$$ t ∗ -spanner problem
inferred← citeshttps://doi.org/10.1007/s11590-022-01918-1openalex-snapshot
General variable neighborhood search for the minimum stretch spanning tree problem
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90180-5openalex-snapshot
Methods and problems of communication in usual networks
inferred← citeshttps://doi.org/10.1016/0167-8191(95)00022-gopenalex-snapshot
Hyper-ring connection machines
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90164-3openalex-snapshot
Tentative and definite distributed computations: an optimistic approach to network synchronization
inferred← citeshttps://doi.org/10.1016/0743-7315(92)90034-kopenalex-snapshot
A practical hierarchical model of parallel computation I. The model
inferred← citeshttps://doi.org/10.1016/j.amc.2020.125502openalex-snapshot
Optimality computation of the minimum stretch spanning tree problem
inferred← citeshttps://doi.org/10.1016/j.cosrev.2020.100253openalex-snapshot
Graph spanners: A tutorial review
inferred← citeshttps://doi.org/10.1016/j.dam.2017.10.025openalex-snapshot
Tree spanners of bounded degree graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2026.03.028openalex-snapshot
Tree t-spanners for edge adjacency distances
inferred← citeshttps://doi.org/10.1016/j.datak.2007.05.002openalex-snapshot
t-Spanners for metric space searching
inferred← citeshttps://doi.org/10.1016/j.disc.2005.04.004openalex-snapshot
Edge-disjoint spanners in Cartesian products of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2005.12.060openalex-snapshot
Tree-decompositions with bags of small diameter
inferred← citeshttps://doi.org/10.1016/j.disc.2008.04.063openalex-snapshot
Edge-disjoint spanners in tori
inferred← citeshttps://doi.org/10.1016/j.ic.2011.10.007openalex-snapshot
Sparse reliable graph backbones
inferred← citeshttps://doi.org/10.1016/j.ic.2012.10.007openalex-snapshot
Approximation algorithms for spanner problems and Directed Steiner Forest
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.10.021openalex-snapshot
Spanners of bounded degree graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.02.008openalex-snapshot
On approximating tree spanners that are breadth first search trees
inferred← citeshttps://doi.org/10.1016/j.orl.2003.11.011openalex-snapshot
An approximation algorithm for the edge-dilation k-center problem
inferred← citeshttps://doi.org/10.1016/j.paerosci.2022.100823openalex-snapshot
Network-based analysis of fluid flows: Progress and outlook
inferred← citeshttps://doi.org/10.1016/j.swevo.2016.06.005openalex-snapshot
Genetic algorithms to balanced tree structures in graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.11.022openalex-snapshot
Approximating k-spanner problems for k>2
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.03.058openalex-snapshot
Spanners for bounded tree-length graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.019openalex-snapshot
Fast deterministic distributed algorithms for sparse spanners
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.03.037openalex-snapshot
Combinatorial network abstraction by trees and distances
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.04.022openalex-snapshot
Small stretch (α,β) -spanners in the streaming model
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.11.034openalex-snapshot
Approximation of minimum weight spanners for sparse graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.06.007openalex-snapshot
Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.02.036openalex-snapshot
Fault tolerant additive and (μ,α) -spanners
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.06.031openalex-snapshot
NP-hardness and fixed-parameter tractability of the minimum spanner problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.11.017openalex-snapshot
Message lower bounds via efficient network synchronization
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.05.035openalex-snapshot
The sparsest additive spanner via multiple weighted BFS trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113691openalex-snapshot
Improved -hardness results for the minimum t-spanner problem on bounded-degree graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114952openalex-snapshot
Distributed computing in the asynchronous LOCAL model
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115362openalex-snapshot
Minimizing distances between vertices and edges through tree t-spanners
inferred← citeshttps://doi.org/10.1016/s0012-365x(00)00192-8openalex-snapshot
Edge-disjoint spanners of complete bipartite graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(99)00012-6openalex-snapshot
Edge-disjoint spanners of complete graphs and complete digraphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00223-7openalex-snapshot
Independent tree spanners: fault-tolerant spanning trees with constant distance guarantees
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00259-2openalex-snapshot
Spanners and message distribution in networks
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00246-2openalex-snapshot
Sparse Hypercube 3-spanners
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00055-xopenalex-snapshot
Local majorities, coalitions and monopolies in graphs: a review
inferred← citeshttps://doi.org/10.1016/s1570-8667(03)00007-8openalex-snapshot
A PTAS for the sparsest 2-spanner of 4-connected planar triangulations
inferred← citeshttps://doi.org/10.1017/jfm.2015.97openalex-snapshot
Network-theoretic approach to sparsified discrete vortex dynamics
inferred← citeshttps://doi.org/10.1080/00207160701828116openalex-snapshot
Additive tree 2-spanners of permutation graphs
inferred← citeshttps://doi.org/10.1080/00207160802037880openalex-snapshot
A linear time algorithm to construct a tree 4-spanner on trapezoid graphs
inferred← citeshttps://doi.org/10.1109/12.324543openalex-snapshot
Synchronizing hypercube networks in the presence of faults
inferred← citeshttps://doi.org/10.1109/12.506427openalex-snapshot
On bufferless routing of variable length messages in leveled networks
inferred← citeshttps://doi.org/10.1109/71.308532openalex-snapshot
On the performance of synchronized programs in distributed networks with random processing times and transmission delays
inferred← citeshttps://doi.org/10.1109/9.83543openalex-snapshot
Robust tracking control of robots by a linear feedback law
inferred← citeshttps://doi.org/10.1109/cec.2018.8477825openalex-snapshot
Quest for Good Spanners of Hypercubes
inferred← citeshttps://doi.org/10.1109/cec.2019.8790306openalex-snapshot
Extending a Genetic Algorithm for Good Spanners of Hypercubes
inferred← citeshttps://doi.org/10.1109/focs.2006.45openalex-snapshot
Lower Bounds for Additive Spanners, Emulators, and More
inferred← citeshttps://doi.org/10.1109/focs.2012.61openalex-snapshot
Everywhere-Sparse Spanners via Dense Subgraphs
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00079openalex-snapshot
New Additive Spanner Lower Bounds by an Unlayered Obstacle Product
inferred← citeshttps://doi.org/10.1109/fscs.1990.89572openalex-snapshot
Network synchronization with polylogarithmic overhead
inferred← citeshttps://doi.org/10.1109/hicss.1997.667214openalex-snapshot
Edge disjoint graph spanners of complete graphs and complete digraphs
inferred← citeshttps://doi.org/10.1109/icdcs.1994.302420openalex-snapshot
A synchronizer with low memory overhead
inferred← citeshttps://doi.org/10.1109/ipdps.2009.5161041openalex-snapshot
Remote-spanners: What to know beyond neighbors
inferred← citeshttps://doi.org/10.1109/ipps.1996.508059openalex-snapshot
Constructing the spanners of graphs in parallel
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366822openalex-snapshot
Fast algorithms for constructing t-spanners and paths with stretch t
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548477openalex-snapshot
Probabilistic approximation of metric spaces and its algorithmic applications
inferred← citeshttps://doi.org/10.1109/tdsc.2007.1007openalex-snapshot
A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock
inferred← citeshttps://doi.org/10.1109/tencon.1994.369291openalex-snapshot
Hyper-ring connection machines
inferred← citeshttps://doi.org/10.1109/tnet.2017.2684831openalex-snapshot
Distributed Spanner Construction With Physical Interference: Constant Stretch and Linear Sparseness
inferred← citeshttps://doi.org/10.1109/tnet.2017.2688484openalex-snapshot
Localized Algorithms for Yao Graph-Based Spanner Construction in Wireless Networks Under SINR
inferred← citeshttps://doi.org/10.1137/060666202openalex-snapshot
Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs
inferred← citeshttps://doi.org/10.1137/090758039openalex-snapshot
Fault Tolerant Spanners for General Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611972993.4openalex-snapshot
Average size of unstretched Remote-Spanners
inferred← citeshttps://doi.org/10.1137/1.9781611973068.101openalex-snapshot
Transitive-Closure Spanners
inferred← citeshttps://doi.org/10.1137/1.9781611973105.37openalex-snapshot
Fast Constructions of Light-Weight Spanners for General Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch60openalex-snapshot
Error Amplification for Pairwise Spanner Lower Bounds
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch61openalex-snapshot
Better Distance Preservers and Additive Spanners
inferred← citeshttps://doi.org/10.1137/1.9781611974782.41openalex-snapshot
Efficient Algorithms for Constructing Very Sparse Spanners and Emulators
inferred← citeshttps://doi.org/10.1137/1.9781611975994.30openalex-snapshot
Extremal Distances in Directed Graphs: Tight Spanners and Near-Optimal Approximation Algorithms
inferred← citeshttps://doi.org/10.1137/1.9781611976465.174openalex-snapshot
Optimal Vertex Fault-Tolerant Spanners in Polynomial Time
inferred← citeshttps://doi.org/10.1137/1.9781611977073.129openalex-snapshot
Partially Optimal Edge Fault-Tolerant Spanners
inferred← citeshttps://doi.org/10.1137/1.9781611977073.132openalex-snapshot
Near-Optimal Spanners for General Graphs in (Nearly) Linear Time
inferred← citeshttps://doi.org/10.1137/100808186openalex-snapshot
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
inferred← citeshttps://doi.org/10.1137/110845380openalex-snapshot
Fast Information Spreading in Graphs with Large Weak Conductance
inferred← citeshttps://doi.org/10.1137/120901295openalex-snapshot
Balancing Degree, Diameter, and Weight in Euclidean Spanners
inferred← citeshttps://doi.org/10.1137/140953927openalex-snapshot
Small Stretch Pairwise Spanners and Approximate $D$-Preservers
inferred← citeshttps://doi.org/10.1137/14099992xopenalex-snapshot
Rumor Spreading with No Dependence on Conductance
inferred← citeshttps://doi.org/10.1137/17m1151225openalex-snapshot
Refined Vertex Sparsifiers of Planar Graphs
inferred← citeshttps://doi.org/10.1137/18m1210678openalex-snapshot
The Greedy Spanner Is Existentially Optimal
inferred← citeshttps://doi.org/10.1137/19m123662xopenalex-snapshot
New Results on Linear Size Distance Preservers
inferred← citeshttps://doi.org/10.1137/22m1502707openalex-snapshot
Euclidean Steiner Spanners: Light and Sparse
inferred← citeshttps://doi.org/10.1137/23m1589670openalex-snapshot
A Unified Framework of Light Spanners I: Fast (Yet Optimal) Constructions
inferred← citeshttps://doi.org/10.1137/s0097539701393384openalex-snapshot
$(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs
inferred← citeshttps://doi.org/10.1137/s0097539792224474openalex-snapshot
A Graph-Theoretic Game and Its Application to the k -Server Problem
inferred← citeshttps://doi.org/10.1137/s0097539794261295openalex-snapshot
Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
inferred← citeshttps://doi.org/10.1137/s0097539794268753openalex-snapshot
Generating Low-Degree 2-Spanners
inferred← citeshttps://doi.org/10.1137/s0097539798332464openalex-snapshot
Hamming Codes, Hypercube Embeddings, and Fault Tolerance
inferred← citeshttps://doi.org/10.1137/s0895480103431046openalex-snapshot
Sparse Distance Preservers and Additive Spanners
inferred← citeshttps://doi.org/10.1137/s089548010444167xopenalex-snapshot
Collective tree spanners of graphs
inferred← citeshttps://doi.org/10.1142/s0219265905001320openalex-snapshot
(QUASI) SPANNERS FOR MOBILE AD HOC NETWORKS
inferred← citeshttps://doi.org/10.1142/s0219265920500048openalex-snapshot
The Minimum Stretch Spanning Tree Problem for Hamming Graphs and Higher-Dimensional Grids
inferred← citeshttps://doi.org/10.1142/s0219265921500286openalex-snapshot
Minimum Stretch Spanning Tree Problem in Operations on Trees
inferred← citeshttps://doi.org/10.1145/100216.100227openalex-snapshot
The use of a synchronizer yields maximum computation rate in distributed networks
showing the first 200 of 309 · page through all 309
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.