Cover Image

Mathematical Foundations for Peer-to-Peer Lattice Computation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Gorinevski, Danil
Format:	Preprint
Published:	2026
Subjects:	Distributed, Parallel, and Cluster Computing Data Structures and Algorithms Combinatorics Probability 68M14 (Primary) 68Q25, 60K35, 49Q22, 05C80 (Secondary) D.2.4; C.2.4; F.2.2; F.1.2; G.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Amnesiac Flooding: Easy to break, hard to escape
by: Austin, Henry, et al.
Published: (2025)

Two-Robot Computational Landscape: A Complete Characterization of Model Power in Minimal Mobile Robot Systems
by: Kitamura, Naoki, et al.
Published: (2025)

Verifying In-Network Computing Systems for Design Risks
by: Bai, Tianyu, et al.
Published: (2026)

Light Cone Consistency: Toward a Unified Theory of Consistency in Message-Passing Systems
by: Landers, Rob, et al.
Published: (2026)

Stabilizing Consensus is Impossible in Lossy Iterated Immediate Snapshot Models
by: Felber, Stephan, et al.
Published: (2024)

Gathering Semi-Synchronously Scheduled Two-State Robots
by: Otaka, Kohei, et al.
Published: (2024)

The Impact of Partial Computations on the Red-Blue Pebble Game
by: Papp, Pál András, et al.
Published: (2025)

Optimal non-adaptive algorithm for edge estimation
by: Bishnu, Arijit, et al.
Published: (2025)

Towards Single Exponential Time for Temporal and Spatial Reasoning: A Study via Redundancy and Dynamic Programming
by: Lagerkvist, Victor, et al.
Published: (2026)

Exploration of $k$-edge-deficient temporal graphs in linear time
by: Lahtin, Ivan, et al.
Published: (2026)

Logarithmic Weisfeiler--Leman and Treewidth
by: Levet, Michael, et al.
Published: (2023)

Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler--Leman
by: Levet, Michael, et al.
Published: (2023)

How quickly can you pack short paths? Engineering a search-tree algorithm for disjoint s-t paths of bounded length
by: Huber, Michael Kiran
Published: (2024)

TreeWidzard: An Engine for Width-Based Dynamic Programming and Automated Theorem Proving
by: Oliveria, Mateus de Oliveira, et al.
Published: (2026)

Competitive Query Minimization for Stable Matching with One-Sided Uncertainty
by: Bampis, Evripidis, et al.
Published: (2024)

On the Average-Case Performance of Greedy for Maximum Coverage
by: Balkanski, Eric, et al.
Published: (2026)

Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
by: Golovach, Petr A., et al.
Published: (2022)

O(1) Insertion for Random Walk d-ary Cuckoo Hashing up to the Load Threshold
by: Bell, Tolson, et al.
Published: (2024)

Safe Low Bandwidth SPV: A Formal Treatment of Simplified Payment Verification Protocols and Security Bounds
by: Wright, Craig S
Published: (2025)

Heaven & Hell II: Scale Laws and Robustness in One-Step Heaven-Hell Consensus
by: Aghanya, Nnamdi Daniel, et al.
Published: (2025)

Extending Exact Integrality Gap Computations for the Metric TSP
by: Cook, William, et al.
Published: (2026)

Interval Graphs are Reconstructible
by: Heinrich, Irene, et al.
Published: (2025)

On (In)approximability of MaxMin Independent Set Reconfiguration
by: Hoang, Hung P., et al.
Published: (2026)

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs
by: Casteigts, Arnaud, et al.
Published: (2023)

Simple, strict, proper, happy: A study of reachability in temporal graphs
by: Casteigts, Arnaud, et al.
Published: (2022)

Bandwidth Efficient Livestreaming in Mobile Wireless Networks: A Peer-to-Peer ACIDE Solution
by: Negulescu, Andrei, et al.
Published: (2023)

Polynomial Prenexing of QBFs with Non-Monotone Boolean Operators
by: Saffidine, Abdallah, et al.
Published: (2025)

Heaven & Hell: One-Step Hub Consensus
by: Aghanya, Nnamdi Daniel
Published: (2025)

Overlapping Biclustering
by: Bentert, Matthias, et al.
Published: (2025)

Simple minimally unsatisfiable subsets of 2-CNFs
by: Kullmann, Oliver, et al.
Published: (2026)

Pioplat: A Scalable, Low-Cost Framework for Latency Reduction in Ethereum Blockchain
by: Wang, Ke, et al.
Published: (2024)

The Compute ICE-AGE: Invariant Compute Envelope under Addressable Graph Evolution
by: Martin II, R. Jay
Published: (2026)

ABox Abduction for Inconsistent Knowledge Bases under Repair Semantics
by: Haak, Anselm, et al.
Published: (2026)

Boolean Matrix Multiplication for Highly Clustered Data on the Congested Clique
by: Lingas, Andrzej
Published: (2024)

CAFS: A Cache-Aware Frequency Sort for Low-Cardinality Integer Data on x86-64
by: Shlyk, Vasiliy S.
Published: (2026)

Steiner Tree Parameterized by Multiway Cut and Even Less
by: Jansen, Bart M. P., et al.
Published: (2024)

Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs
by: Böhnlein, Toni, et al.
Published: (2024)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
by: Heimann, Sophia, et al.
Published: (2026)

Pliability and Approximating Max-CSPs
by: Romero, Miguel, et al.
Published: (2019)

Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique
by: Chen, Yijia, et al.
Published: (2023)