On the public citation graph
Local Computation
0 signed · 212 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.1007/3-540-54099-7_2openalex-snapshot
Memory-efficient self stabilizing protocols for general networks
inferredcites →https://doi.org/10.1007/978-1-4612-5695-3_7openalex-snapshot
Self-Stabilization in Spite of Distributed Control
inferredcites →https://doi.org/10.1007/978-3-540-30186-8_24openalex-snapshot
Distributed Weighted Matching
inferredcites →https://doi.org/10.1007/978-3-540-87779-0_27openalex-snapshot
Leveraging Linial’s Locality Limit
inferredcites →https://doi.org/10.1007/978-3-540-87779-0_6openalex-snapshot
Fast Distributed Approximations in Planar Graphs
inferredcites →https://doi.org/10.1007/978-3-642-05118-0_2openalex-snapshot
Local Algorithms: Self-stabilization on Speed
inferredcites →https://doi.org/10.1007/s00446-003-0091-yopenalex-snapshot
Hundreds of impossibility results for distributed computing
inferredcites →https://doi.org/10.1016/0020-0190(86)90144-4openalex-snapshot
A fast and simple randomized parallel algorithm for maximal matching
inferredcites →https://doi.org/10.1016/0095-8956(81)90062-9openalex-snapshot
Finite common coverings of pairs of regular graphs
inferredcites →https://doi.org/10.1016/0166-218x(94)00058-lopenalex-snapshot
Explicit construction of graphs with an arbitrary large girth and of large size
inferredcites →https://doi.org/10.1016/0196-6774(86)90019-2openalex-snapshot
A fast and simple randomized parallel algorithm for the maximal independent set problem
inferredcites →https://doi.org/10.1016/j.jcss.2005.04.002openalex-snapshot
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
inferredcites →https://doi.org/10.1016/j.tcs.2007.04.040openalex-snapshot
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
inferredcites →https://doi.org/10.1016/j.tcs.2010.10.010openalex-snapshot
Bounds on contention management algorithms
inferredcites →https://doi.org/10.1016/s0019-9958(86)80023-7openalex-snapshot
Deterministic coin tossing with applications to optimal parallel list ranking
inferredcites →https://doi.org/10.1017/s00446-002-0078-0openalex-snapshot
An efficient distributed algorithm for constructing small dominating sets
inferredcites →https://doi.org/10.1090/s0273-0979-1995-00569-0openalex-snapshot
A new series of dense graphs of high girth
inferredcites →https://doi.org/10.1109/focs.2008.81openalex-snapshot
Constant-Time Approximation Algorithms via Local Improvements
inferredcites →https://doi.org/10.1109/sfcs.1988.21938openalex-snapshot
Dynamic networks are as fast as static networks
inferredcites →https://doi.org/10.1109/sfcs.1991.185377openalex-snapshot
Distributed program checking: a paradigm for building self-stabilizing distributed protocols
inferredcites →https://doi.org/10.1109/sfcs.1997.646119openalex-snapshot
Global optimization using local information with applications to flow control
inferredcites →https://doi.org/10.1109/sfcs.2001.959930openalex-snapshot
Sequential and parallel algorithms for mixed packing and covering
inferredcites →https://doi.org/10.1137/0215074openalex-snapshot
A Simple Parallel Algorithm for the Maximal Independent Set Problem
inferredcites →https://doi.org/10.1137/0221015openalex-snapshot
Locality in Distributed Graph Algorithms
inferredcites →https://doi.org/10.1137/1.9780898719772openalex-snapshot
Distributed Computing: A Locality-Sensitive Approach
inferredcites →https://doi.org/10.1137/11085178xopenalex-snapshot
Distributed Verification and Hardness of Distributed Approximation
inferredcites →https://doi.org/10.1137/s0097539700380754openalex-snapshot
Approximating theDomatic Number
inferredcites →https://doi.org/10.1137/s0097539793254571openalex-snapshot
What Can be Computed Locally?
inferredcites →https://doi.org/10.1137/s0097539793260763openalex-snapshot
Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
inferredcites →https://doi.org/10.1137/s0895480199355754openalex-snapshot
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
inferredcites →https://doi.org/10.1145/1011767.1011811openalex-snapshot
What cannot be computed locally!
inferredcites →https://doi.org/10.1145/1109557.1109666openalex-snapshot
The price of being near-sighted
inferredcites →https://doi.org/10.1145/112600.112606openalex-snapshot
On the value of information in distributed decision-making (extended abstract)
inferredcites →https://doi.org/10.1145/1146381.1146387openalex-snapshot
On the complexity of distributed graph coloring
inferredcites →https://doi.org/10.1145/1378533.1378540openalex-snapshot
What can be approximated locally?
inferredcites →https://doi.org/10.1145/1400751.1400758openalex-snapshot
A log-star distributed maximal independent set algorithm for growth-bounded graphs
inferredcites →https://doi.org/10.1145/167088.167127openalex-snapshot
Linear programming without the matrix
inferredcites →https://doi.org/10.1145/225058.225138openalex-snapshot
Improved approximations of packing and covering problems
inferredcites →https://doi.org/10.1145/2499228openalex-snapshot
Towards a complexity theory for local distributed computing
inferredcites →https://doi.org/10.1145/2933057.2933086openalex-snapshot
A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds
inferredcites →https://doi.org/10.1145/3149.214121openalex-snapshot
Impossibility of distributed consensus with one faulty process
inferredcites →https://doi.org/10.1145/361179.361202openalex-snapshot
Self-stabilizing systems in spite of distributed control
inferredcites →https://doi.org/10.1145/872035.872040openalex-snapshot
Constant-time distributed dominating set approximation
inferredcites →https://doi.org/10.1287/moor.20.2.257openalex-snapshot
Fast Approximation Algorithms for Fractional Packing and Covering Problems
inferredcites →https://doi.org/10.2200/s00520ed1v01y201307dct011openalex-snapshot
Distributed Graph Coloring: Fundamentals and Recent Developments
inferredcites →https://doi.org/10.48550/arxiv.0909.2704openalex-snapshot
Memory Consistency Conditions for Self-Assembly Programming
inferredcites →https://doi.org/10.5555/1109557.1109577openalex-snapshot
Combination can be hard: approximability of the unique coverage problem
inferredcites →https://doi.org/10.5555/1280283.1280327openalex-snapshot
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
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-030-01325-7_12openalex-snapshot
Simple and Local Independent Set Approximation
inferred← citeshttps://doi.org/10.1007/978-3-030-01325-7_19openalex-snapshot
Deterministic Distributed Ruling Sets of Line Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-01325-7_21openalex-snapshot
A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in $$O(\log N\log \varDelta /\log ^2\log \varDelta )$$ Rounds
inferred← citeshttps://doi.org/10.1007/978-3-030-24922-9_1openalex-snapshot
A Topological Perspective on Distributed Network Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-35653-8_16openalex-snapshot
Lower Bound on Network Diameter for Distributed Function Computation
inferred← citeshttps://doi.org/10.1007/978-3-030-63924-2_8openalex-snapshot
Relating Network-Diameter and Network-Minimum-Degree for Distributed Function Computation
inferred← citeshttps://doi.org/10.1007/978-3-030-67731-2_13openalex-snapshot
Distributed Independent Sets in Interval and Segment Intersection Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-75242-2_3openalex-snapshot
Distributed Distance-r Covering Problems on Sparse High-Girth Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-79527-6_19openalex-snapshot
Constant Round Distributed Domination on Graph Classes with Bounded Expansion
inferred← citeshttps://doi.org/10.1007/978-3-031-09993-9_9openalex-snapshot
Local Planar Domination Revisited
inferred← citeshttps://doi.org/10.1007/978-3-031-22105-7_45openalex-snapshot
Distributed Dominating Sets in Interval Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-32733-9_25openalex-snapshot
Exact Distributed Sampling
inferred← citeshttps://doi.org/10.1007/978-3-031-37765-5_12openalex-snapshot
Distance-2-Dispersion: Dispersion with Further Constraints
inferred← citeshttps://doi.org/10.1007/978-3-031-60603-8_16openalex-snapshot
Distributed Fractional Local Ratio and Independent Set Approximation
inferred← citeshttps://doi.org/10.1007/978-3-031-74498-3_20openalex-snapshot
Tight Bounds for Constant-Round Domination on Graphs of High Girth and Low Expansion
inferred← citeshttps://doi.org/10.1007/978-3-031-81404-4_8openalex-snapshot
Mobile Agents on Chordal Graphs: Maximum Independent Set and Beyond
inferred← citeshttps://doi.org/10.1007/978-3-031-91736-3_12openalex-snapshot
When MIS and Maximal Matching are Easy in the Congested Clique
inferred← citeshttps://doi.org/10.1007/978-3-031-91736-3_9openalex-snapshot
Approximating Independent Sets in Constant Distributed Rounds
inferred← citeshttps://doi.org/10.1007/978-3-319-72751-6_4openalex-snapshot
Fast Distributed Approximation for Max-Cut
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_37openalex-snapshot
On the Locality of Some NP-Complete Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_39openalex-snapshot
Super-Fast Distributed Algorithms for Metric Facility Location
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_51openalex-snapshot
Efficient Computation of Balanced Structures
inferred← citeshttps://doi.org/10.1007/978-3-662-45174-8_32openalex-snapshot
Distributed Symmetry Breaking in Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-662-53426-7_8openalex-snapshot
Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model
inferred← citeshttps://doi.org/10.1007/s00446-016-0287-6openalex-snapshot
Distributed algorithms for the Lovász local lemma and graph coloring
inferred← citeshttps://doi.org/10.1007/s00446-017-0298-yopenalex-snapshot
Computing large independent sets in a single round
inferred← citeshttps://doi.org/10.1007/s00446-018-0332-8openalex-snapshot
What can be sampled locally?
inferred← citeshttps://doi.org/10.1007/s00446-020-00373-4openalex-snapshot
Fooling views: a new lower bound technique for distributed computations under congestion
inferred← citeshttps://doi.org/10.1007/s00446-020-00376-1openalex-snapshot
Derandomizing local distributed algorithms under bandwidth restrictions
inferred← citeshttps://doi.org/10.1007/s00446-021-00391-wopenalex-snapshot
Optimal distributed covering algorithms
inferred← citeshttps://doi.org/10.1007/s00446-023-00447-zopenalex-snapshot
Near-optimal distributed dominating set in bounded arboricity graphs
inferred← citeshttps://doi.org/10.1007/s00446-023-00453-1openalex-snapshot
Node and edge averaged complexities of local graph problems
inferred← citeshttps://doi.org/10.1007/s00446-025-00477-9openalex-snapshot
Exponential speedup over locality in MPC with optimal memory
inferred← citeshttps://doi.org/10.1007/s42979-019-0002-3openalex-snapshot
Lower-Bound Study for Function Computation in Distributed Networks via Vertex-Eccentricity
inferred← citeshttps://doi.org/10.1007/s42979-020-00219-7openalex-snapshot
Extremal Problem with Network-Diameter and -Minimum-Degree for Distributed Function Computation
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103773openalex-snapshot
Distributed domination on sparse graph classes
inferred← citeshttps://doi.org/10.1016/j.ic.2014.12.018openalex-snapshot
Distributed coloring algorithms for triangle-free graphs
inferred← citeshttps://doi.org/10.1016/j.ic.2024.105238openalex-snapshot
Distributed fractional local ratio and independent set approximation
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.03.003openalex-snapshot
Distributed reconfiguration of maximal independent sets
inferred← citeshttps://doi.org/10.1016/j.jpdc.2019.05.012openalex-snapshot
Optimal deterministic distributed algorithms for maximal independent set in geometric graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.06.044openalex-snapshot
Deterministic local algorithms, unique identifiers, and fractional graph colouring
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.05.025openalex-snapshot
Dynamic networks of finite state machines
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.01.001openalex-snapshot
Distributed distance-r covering problems on sparse high-girth graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.03.001openalex-snapshot
Distributed distance domination in graphs with no K2,t-minor
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114279openalex-snapshot
The energy complexity of diameter and minimum cut computation in bounded-genus networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115490openalex-snapshot
Mobile agents on chordal graphs: Maximum independent set and beyond
inferred← citeshttps://doi.org/10.1080/17445760.2025.2469514openalex-snapshot
Memory optimal distance-2-dispersion with termination
inferred← citeshttps://doi.org/10.1098/rsta.2011.0212openalex-snapshot
Distributed algorithms for sensor networks
inferred← citeshttps://doi.org/10.1109/focs.2016.72openalex-snapshot
An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model
inferred← citeshttps://doi.org/10.1109/focs.2017.23openalex-snapshot
A Time Hierarchy Theorem for the LOCAL Model
inferred← citeshttps://doi.org/10.1109/focs.2017.25openalex-snapshot
Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching
inferred← citeshttps://doi.org/10.1109/focs.2019.00037openalex-snapshot
Lower Bounds for Maximal Matchings and Maximal Independent Sets
inferred← citeshttps://doi.org/10.1109/focs.2019.00097openalex-snapshot
Conditional Hardness Results for Massively Parallel Computation from Distributed Lower Bounds
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00042openalex-snapshot
Distributed Lower Bounds for Ruling Sets
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00089openalex-snapshot
Time-Optimal Sublinear Algorithms for Matching and Vertex Cover
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00049openalex-snapshot
Local Computation of Maximal Independent Set
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00115openalex-snapshot
Rounds vs Communication Tradeoffs for Maximal Independent Sets
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00007openalex-snapshot
Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
inferred← citeshttps://doi.org/10.1137/1.9781611975482.99openalex-snapshot
Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation
inferred← citeshttps://doi.org/10.1137/1.9781611975994.107openalex-snapshot
Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples
inferred← citeshttps://doi.org/10.1137/17m1117537openalex-snapshot
An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model
inferred← citeshttps://doi.org/10.1137/17m1157957openalex-snapshot
A Time Hierarchy Theorem for the LOCAL Model
inferred← citeshttps://doi.org/10.1137/19m1249527openalex-snapshot
Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering
inferred← citeshttps://doi.org/10.1137/22m1536972openalex-snapshot
Rounds vs. Communication Tradeoffs for Maximal Independent Sets
inferred← citeshttps://doi.org/10.1137/24m1689910openalex-snapshot
\({\mathcal{O}}\)\({(\log\,\log\,{{n}})}\) Passes Are Optimal for Semistreaming Maximal Independent Set
inferred← citeshttps://doi.org/10.1142/s0129054124500084openalex-snapshot
Distributed Independent Sets in Interval and Segment Intersection Graphs
inferred← citeshttps://doi.org/10.1145/1993636.1993686openalex-snapshot
Distributed verification and hardness of distributed approximation
inferred← citeshttps://doi.org/10.1145/2484239.2501983openalex-snapshot
Optimal deterministic routing and sorting on the congested clique
inferred← citeshttps://doi.org/10.1145/2611462.2611465openalex-snapshot
Distributed algorithms for the Lovász local lemma and graph coloring
inferred← citeshttps://doi.org/10.1145/2897518.2897533openalex-snapshot
Distributed (∆+1)-coloring in sublogarithmic rounds
inferred← citeshttps://doi.org/10.1145/2933057.2933084openalex-snapshot
A Local Constant Factor MDS Approximation for Bounded Genus Graphs
inferred← citeshttps://doi.org/10.1145/3055399.3055471openalex-snapshot
On the complexity of local distributed graph problems
inferred← citeshttps://doi.org/10.1145/3060294openalex-snapshot
A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds
inferred← citeshttps://doi.org/10.1145/3087801.3087811openalex-snapshot
Triangle Finding and Listing in CONGEST Networks
inferred← citeshttps://doi.org/10.1145/3087801.3087830openalex-snapshot
Distributed MIS via All-to-All Communication
inferred← citeshttps://doi.org/10.1145/3092693openalex-snapshot
A Classification of Locality in Network Research
inferred← citeshttps://doi.org/10.1145/3178120openalex-snapshot
Distributed (Δ +1)-Coloring in Sublogarithmic Rounds
inferred← citeshttps://doi.org/10.1145/3188745.3188860openalex-snapshot
New classes of distributed time complexity
inferred← citeshttps://doi.org/10.1145/3188745.3188964openalex-snapshot
An optimal distributed (Δ+1)-coloring algorithm?
inferred← citeshttps://doi.org/10.1145/3210377.3210383openalex-snapshot
Distributed Domination on Graph Classes of Bounded Expansion
inferred← citeshttps://doi.org/10.1145/3212734.3212760openalex-snapshot
Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs
inferred← citeshttps://doi.org/10.1145/3293611.3331577openalex-snapshot
Optimal Distributed Covering Algorithms
inferred← citeshttps://doi.org/10.1145/3293611.3331597openalex-snapshot
Hardness of Distributed Optimization
inferred← citeshttps://doi.org/10.1145/3293611.3331626openalex-snapshot
Deterministic Distributed Dominating Set Approximation in the CONGEST Model
inferred← citeshttps://doi.org/10.1145/3326170openalex-snapshot
Distributed Dominating Set Approximations beyond Planar Graphs
inferred← citeshttps://doi.org/10.1145/3357713.3384298openalex-snapshot
Polylogarithmic-time deterministic network decomposition and distributed derandomization
inferred← citeshttps://doi.org/10.1145/3382734.3405718openalex-snapshot
Sleeping is Efficient: MIS in O (1)-rounds Node-averaged Awake Complexity
inferred← citeshttps://doi.org/10.1145/3382734.3405745openalex-snapshot
Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants
inferred← citeshttps://doi.org/10.1145/3382734.3405750openalex-snapshot
Distributed Approximation on Power Graphs
inferred← citeshttps://doi.org/10.1145/3409964.3461804openalex-snapshot
Distributed Graph Coloring Made Easy
inferred← citeshttps://doi.org/10.1145/3427361.3427374openalex-snapshot
Using Round Elimination to Understand Locality
inferred← citeshttps://doi.org/10.1145/3461458openalex-snapshot
Lower Bounds for Maximal Matchings and Maximal Independent Sets
inferred← citeshttps://doi.org/10.1145/3465084.3467901openalex-snapshot
Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees
inferred← citeshttps://doi.org/10.1145/3490148.3538566openalex-snapshot
Average Awake Complexity of MIS and Matching
inferred← citeshttps://doi.org/10.1145/3519270.3538419openalex-snapshot
Node and Edge Averaged Complexities of Local Graph Problems
inferred← citeshttps://doi.org/10.1145/3519270.3538437openalex-snapshot
Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs
inferred← citeshttps://doi.org/10.1145/3519270.3538443openalex-snapshot
From Switch Scheduling to Datacenter Scheduling
inferred← citeshttps://doi.org/10.1145/3519935.3520027openalex-snapshot
Distributed ∆-coloring plays hide-and-seek
inferred← citeshttps://doi.org/10.1145/3583668.3594562openalex-snapshot
The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs
inferred← citeshttps://doi.org/10.1145/3583668.3594570openalex-snapshot
(1- ϵ )-Approximate Maximum Weighted Matching in poly(1/ ϵ , log n ) Time in the Distributed and Parallel Settings
inferred← citeshttps://doi.org/10.1145/3583668.3594574openalex-snapshot
Distributed MIS in O(log log n) Awake Complexity
inferred← citeshttps://doi.org/10.1145/3583668.3594587openalex-snapshot
Distributed MIS with Low Energy and Time Complexities
inferred← citeshttps://doi.org/10.1145/3618260.3649763openalex-snapshot
O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set
inferred← citeshttps://doi.org/10.1145/3662158.3662816openalex-snapshot
Brief Announcement: Massively Parallel Ruling Set Made Deterministic
inferred← citeshttps://doi.org/10.1145/3732772.3733531openalex-snapshot
Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors
inferred← citeshttps://doi.org/10.1145/3732772.3733547openalex-snapshot
Nearly-Optimal Distributed Ruling Sets for Trees and high-girth graphs
inferred← citeshttps://doi.org/10.1145/3796701.3815958openalex-snapshot
Meta-Theorems for Cuttable Distributed Problems
inferred← citeshttps://doi.org/10.1145/3798129.3800833openalex-snapshot
Improved Local Computation Algorithms for Greedy Set Cover via Retroactive Updates
inferred← citeshttps://doi.org/10.1145/3816782.3819190openalex-snapshot
Distributed Dominating Set With Optimal Rounds and Message Size in Bounded Arboricity Graphs
inferred← citeshttps://doi.org/10.1145/3816782.3819215openalex-snapshot
Exponential Energy Savings in Local Distributed Graph Algorithms
inferred← citeshttps://doi.org/10.1145/3819817openalex-snapshot
Distributed Δ-Coloring Plays Hide-and-Seek
inferred← citeshttps://doi.org/10.1201/b19567-14openalex-snapshot
High-Dimensional Computational Geometry
inferred← citeshttps://doi.org/10.1587/transinf.2021edp7083openalex-snapshot
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching
inferred← citeshttps://doi.org/10.24963/ijcai.2021/18openalex-snapshot
Improving Multi-agent Coordination by Learning to Estimate Contention
inferred← citeshttps://doi.org/10.3929/ethz-a-006517282openalex-snapshot
Synchronization and symmetry breaking in distributed systems
inferred← citeshttps://doi.org/10.3929/ethz-b-000205784openalex-snapshot
Improved Deterministic Distributed Matching via Rounding
inferred← citeshttps://doi.org/10.3929/ethz-b-000379990openalex-snapshot
Robust Global Localization Using GPS and Aircraft Signals
inferred← citeshttps://doi.org/10.4230/lipics.disc.2018.22openalex-snapshot
A Deterministic Distributed $2$-Approximation for Weighted Vertex Cover in $O(\log n\logΔ/ \log^2\logΔ)$ Rounds
inferred← citeshttps://doi.org/10.4230/lipics.disc.2018.6openalex-snapshot
Distributed Approximate Maximum Matching in the CONGEST Model
inferred← citeshttps://doi.org/10.4230/lipics.disc.2020.37openalex-snapshot
Distributed Maximum Matching Verification in CONGEST
inferred← citeshttps://doi.org/10.4230/lipics.disc.2021.13openalex-snapshot
A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2018.160openalex-snapshot
(Delta+1) Coloring in the Congested Clique Model
inferred← citeshttps://doi.org/10.48550/arxiv.1207.1852openalex-snapshot
Optimal Deterministic Routing and Sorting on the Congested Clique
inferred← citeshttps://doi.org/10.48550/arxiv.1507.04405openalex-snapshot
Thinking Like a Vertex: a Survey of Vertex-Centric Frameworks for Distributed Graph Processing
inferred← citeshttps://doi.org/10.48550/arxiv.1602.02991openalex-snapshot
A local constant factor approximation for the minimum dominating set problem on bounded genus graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1611.02663openalex-snapshot
On the Complexity of Local Distributed Graph Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1702.00142openalex-snapshot
What can be sampled locally?
inferred← citeshttps://doi.org/10.48550/arxiv.1704.02767openalex-snapshot
Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching
inferred← citeshttps://doi.org/10.48550/arxiv.1802.04948openalex-snapshot
Graph2Seq: Scalable Learning Dynamics for Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1807.06701openalex-snapshot
Massively Parallel Symmetry Breaking on Sparse Graphs: MIS and Maximal Matching
inferred← citeshttps://doi.org/10.48550/arxiv.1904.10706openalex-snapshot
Fast Distributed Algorithms for LP-Type Problems of Bounded Dimension
inferred← citeshttps://doi.org/10.48550/arxiv.1905.10284openalex-snapshot
Hardness of Distributed Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1910.02794openalex-snapshot
Distributed Distance-$r$ Dominating Set on Sparse High-Girth Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2002.09610openalex-snapshot
Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond
inferred← citeshttps://doi.org/10.48550/arxiv.2002.12313openalex-snapshot
On Local Computation for Optimization in Multi-Agent Systems
inferred← citeshttps://doi.org/10.48550/arxiv.2006.07449openalex-snapshot
Sleeping is Efficient: MIS in $O(1)$-rounds Node-averaged Awake Complexity
inferred← citeshttps://doi.org/10.48550/arxiv.2012.04883openalex-snapshot
On Distributed Algorithms for Minimum Dominating Set problem, from theory to application
inferred← citeshttps://doi.org/10.48550/arxiv.2102.08076openalex-snapshot
Deterministic CONGEST Algorithm for MDS on Bounded Arboricity Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2103.07027openalex-snapshot
Robust Lower Bounds for Graph Problems in the Blackboard Model of Communication
inferred← citeshttps://doi.org/10.48550/arxiv.2105.13980openalex-snapshot
Coloring Trees in Massively Parallel Computation
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.