When Agents are Powerful: Black Hole Search with Verification in Time-Varying Graphs
Fuente:
arXiv
Guardado en:
| Autores principales: | Kaur, Tanvir, Saxena, Ashish |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Balanced Dispersion on Time-Varying Dynamic Graphs
por: Saxena, Ashish, et al.
Publicado: (2024)
por: Saxena, Ashish, et al.
Publicado: (2024)
Black Hole Search in Dynamic Graphs
por: Kaur, Tanvir, et al.
Publicado: (2024)
por: Kaur, Tanvir, et al.
Publicado: (2024)
Black Hole Search: Dynamics, Distribution, and Emergence
por: Kaur, Tanvir, et al.
Publicado: (2026)
por: Kaur, Tanvir, et al.
Publicado: (2026)
Exploration on Highly Dynamic Graphs
por: Saxena, Ashish, et al.
Publicado: (2026)
por: Saxena, Ashish, et al.
Publicado: (2026)
Path Connected Dynamic Graphs with a Study of Dispersion and Exploration
por: Saxena, Ashish, et al.
Publicado: (2025)
por: Saxena, Ashish, et al.
Publicado: (2025)
Semi-Synchronous Exploration in Dynamic Graphs
por: Saxena, Ashish, et al.
Publicado: (2026)
por: Saxena, Ashish, et al.
Publicado: (2026)
Efficient D-2-D via Leader Election: Arbitrary Initial Configuration and No Global Knowledge
por: Kaur, Tanvir, et al.
Publicado: (2024)
por: Kaur, Tanvir, et al.
Publicado: (2024)
Black Hole Search by Scattered Agents in Dynamic Rings
por: Di Luna, Giuseppe Antonio, et al.
Publicado: (2024)
por: Di Luna, Giuseppe Antonio, et al.
Publicado: (2024)
Black Hole Search in Dynamic Tori
por: Bhattacharya, Adri, et al.
Publicado: (2024)
por: Bhattacharya, Adri, et al.
Publicado: (2024)
Proof-Carrying Fair Ordering: Asymmetric Verification for BFT via Incremental Graphs
por: Ren, Pengkun, et al.
Publicado: (2025)
por: Ren, Pengkun, et al.
Publicado: (2025)
Tight Bounds on Window Size and Time for Single-Agent Graph Exploration under T-Interval Connectivity
por: Sudo, Yuichi, et al.
Publicado: (2026)
por: Sudo, Yuichi, et al.
Publicado: (2026)
NAVIS: Concurrent Search and Update with Low Position-Seeking Overhead in On-SSD Graph-Based Vector Search
por: Song, Jaeyong, et al.
Publicado: (2026)
por: Song, Jaeyong, et al.
Publicado: (2026)
A Self-Healing and Fault-Tolerant Cloud-based Digital Twin Processing Management Model
por: Saxena, Deepika, et al.
Publicado: (2025)
por: Saxena, Deepika, et al.
Publicado: (2025)
Multi-Factor Trust-Driven Secure Communication Model for Cloud-Based Digital Twins
por: Saxena, Deepika, et al.
Publicado: (2026)
por: Saxena, Deepika, et al.
Publicado: (2026)
Speedup of Distributed Algorithms for Power Graphs in the CONGEST Model
por: Barenboim, Leonid, et al.
Publicado: (2023)
por: Barenboim, Leonid, et al.
Publicado: (2023)
Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors
por: Takahashi, Shota, et al.
Publicado: (2025)
por: Takahashi, Shota, et al.
Publicado: (2025)
Monotone Decontamination of Arbitrary Dynamic Graphs with Mobile Agents
por: Bar, Rajashree, et al.
Publicado: (2025)
por: Bar, Rajashree, et al.
Publicado: (2025)
Self-stabilizing Graph Exploration by a Single Agent
por: Sudo, Yuichi, et al.
Publicado: (2020)
por: Sudo, Yuichi, et al.
Publicado: (2020)
Error-resilient Distributed Local Verification
por: Garncarek, Paweł, et al.
Publicado: (2026)
por: Garncarek, Paweł, et al.
Publicado: (2026)
Model Input Verification of Large Scale Simulations
por: Neykova, Rumyana, et al.
Publicado: (2024)
por: Neykova, Rumyana, et al.
Publicado: (2024)
TACO: A Toolsuite for the Verification of Threshold Automata
por: Eichler, Paul, et al.
Publicado: (2026)
por: Eichler, Paul, et al.
Publicado: (2026)
Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss
por: Luo, Jingjia, et al.
Publicado: (2025)
por: Luo, Jingjia, et al.
Publicado: (2025)
PathWeaver: A High-Throughput Multi-GPU System for Graph-Based Approximate Nearest Neighbor Search
por: Kim, Sukjin, et al.
Publicado: (2025)
por: Kim, Sukjin, et al.
Publicado: (2025)
Perpetual Exploration of a Ring in Presence of Byzantine Black Hole
por: Goswami, Pritam, et al.
Publicado: (2024)
por: Goswami, Pritam, et al.
Publicado: (2024)
Formal Modeling and Verification of the Algorand Consensus Protocol in CADP
por: Esposito, Andrea, et al.
Publicado: (2025)
por: Esposito, Andrea, et al.
Publicado: (2025)
Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability
por: Castañeda, Armando, et al.
Publicado: (2023)
por: Castañeda, Armando, et al.
Publicado: (2023)
Compositional Design, Implementation, and Verification of Swarms (Technical Report)
por: Furbach, Florian, et al.
Publicado: (2026)
por: Furbach, Florian, et al.
Publicado: (2026)
Optimal Checkpoint Interval with Availability as an Objective Function
por: Saxena, Nirmal Raj, et al.
Publicado: (2024)
por: Saxena, Nirmal Raj, et al.
Publicado: (2024)
Towards Efficient Verification of Parallel Applications with Mc SimGrid
por: Laurent, Matthieu, et al.
Publicado: (2025)
por: Laurent, Matthieu, et al.
Publicado: (2025)
Towards Formal Verification of Federated Learning Orchestration Protocols on Satellites
por: Popovic, Miroslav, et al.
Publicado: (2024)
por: Popovic, Miroslav, et al.
Publicado: (2024)
Asynchronous Fault-Tolerant Language Decidability for Runtime Verification of Distributed Systems
por: Castañeda, Armando, et al.
Publicado: (2025)
por: Castañeda, Armando, et al.
Publicado: (2025)
SwarmSearch: Decentralized Search Engine with Self-Funding Economy
por: Gregoriadis, Marcel, et al.
Publicado: (2025)
por: Gregoriadis, Marcel, et al.
Publicado: (2025)
Parameterized Verification of Round-based Distributed Algorithms via Extended Threshold Automata
por: Baumeister, Tom, et al.
Publicado: (2024)
por: Baumeister, Tom, et al.
Publicado: (2024)
Electricity Consumption of Ethereum and Filecoin: Advances in Models and Estimates
por: Pankovska, Elitsa, et al.
Publicado: (2024)
por: Pankovska, Elitsa, et al.
Publicado: (2024)
Formal Verification of a Generic Algorithm for TDM Communication Over Inter Satellite Links
por: Popovic, Miroslav, et al.
Publicado: (2025)
por: Popovic, Miroslav, et al.
Publicado: (2025)
Almost Time-Optimal Loosely-Stabilizing Leader Election on Arbitrary Graphs Without Identifiers in Population Protocols
por: Kanaya, Haruki, et al.
Publicado: (2024)
por: Kanaya, Haruki, et al.
Publicado: (2024)
Scalable Graph Indexing using GPUs for Approximate Nearest Neighbor Search
por: Li, Zhonggen, et al.
Publicado: (2025)
por: Li, Zhonggen, et al.
Publicado: (2025)
PowerTrip: Exploiting Federated Heterogeneous Datacenter Power for Distributed ML Training
por: Mehboob, Talha, et al.
Publicado: (2025)
por: Mehboob, Talha, et al.
Publicado: (2025)
Power Aware Container Placement in Cloud Computing with Affinity and Cubic Power Model
por: Sarkar, Suvarthi, et al.
Publicado: (2024)
por: Sarkar, Suvarthi, et al.
Publicado: (2024)
EcoShift: Performance-Aware Power Management for Power-Constrained Heterogeneous Systems
por: Zheng, Zhong, et al.
Publicado: (2026)
por: Zheng, Zhong, et al.
Publicado: (2026)
Ejemplares similares
-
Balanced Dispersion on Time-Varying Dynamic Graphs
por: Saxena, Ashish, et al.
Publicado: (2024) -
Black Hole Search in Dynamic Graphs
por: Kaur, Tanvir, et al.
Publicado: (2024) -
Black Hole Search: Dynamics, Distribution, and Emergence
por: Kaur, Tanvir, et al.
Publicado: (2026) -
Exploration on Highly Dynamic Graphs
por: Saxena, Ashish, et al.
Publicado: (2026) -
Path Connected Dynamic Graphs with a Study of Dispersion and Exploration
por: Saxena, Ashish, et al.
Publicado: (2025)