yusuke1997/dblp-id-title huggingface dataset:
Range Augmentation Problems in Static Ad-Hoc Wireless Networks
Tight Bounds for Scattered Black Hole Search in a Ring
Universal Systems of Oblivious Mobile Robots
Gathering with Minimum Delay in Tree Sensor Networks
Emulating Networks by Bus Networks: Application to Trees and Hypermeshes
Competitive Online Routing in Geometric Graphs
Distributed Highly Available Search Trees
Comparison-Based Interactive Collaborative Filtering
Network Abstractions for Characterizing Communication Requirements in Asynchronous Distributed Systems
Distributed Computation and Incremental Maintainance of 3-Edge-Connected Components
Improved Lower Bounds for Shoreline Search
Perfect Token Distribution on Trees
SINR Maps: Properties and Applications
Structural Information and Communication Complexity - 18th International Colloquium, SIROCCO 2011, Gdansk, Poland, June 26-29, 2011. Proceedings
Byzantine Gathering in Networks
Proxy Assignments for Filling Gaps in Wireless Ad-Hoc Lattice Computers
Homonyms with Forgeable Identifiers
Positional Encoding by Robots with Non-rigid Movements
Structural Information and Communication Complexity, 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedings
A Distributed Algorithm for Finding Hamiltonian Cycles in Random Graphs in O(\log n) Time
Randomized OBDD-Based Graph Algorithms
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs
Priority Evacuation from a Disk Using Mobile Robots - (Extended Abstract)
Random Walks, Interacting Particles, Dynamic Networks: Randomness Can Be Helpful
Cycle Covering
Visiting Infinitely Often the Unit Interval While Minimizing the Idle Time of High Priority Segments
Approximate Proof-Labeling Schemes
Finding Spanning Forests by Broadcasting
Distributed Graph Problems Through an Automata-Theoretic Lens
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem
Distributed Counting Along Lossy Paths Without Feedback
Why Robots Need Maps
Fast Periodic Graph Exploration with Constant Memory
On the Bit Complexity of Iterated Memory
Duality in Chain ATM Virtual Path Layouts
On Efficient Gossiping in Radio Networks
Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally
Structural Information and Communication Complexity - 26th International Colloquium, SIROCCO 2019, L'Aquila, Italy, July 1-4, 2019, Proceedings
Embedding Tori in Partitioned Optical Passive Star Networks
Structural Information and Communication Complexity - 21st International Colloquium, SIROCCO 2014, Takayama, Japan, July 23-25, 2014. Proceedings
On Advice Complexity of the k-server Problem under Sparse Metrics
Distributed site partitioning
Coalescing Walks on Rotor-Router Systems
New Bounds on the Size of the Minimum Feedback Vertex Set in Meshes and Butterflies
Biased Clocks: A Novel Approach to Improve the Ability To Perform Predicate Detection with O(1) Clocks
The Energy Complexity of Diameter and Minimum Cut Computation in Bounded-Genus Networks
Fault-Tolerant Distance Labeling for Planar Graphs
Threshold-Based Network Structural Dynamics
Local Algorithms for Autonomous Robot Systems
Self-stabilizing Graph Exploration by a Single Agent
Self-stabilization with path algebra
Optimal Adaptive Fault Diagnosis for Simple Multiprocessor Systems
Sharpness: A Tight Condition for Scalability
Communications in Unknown Networks: Preserving the Secret of Topology
Brief Announcement: A Sheaf-Theoretic Characterization of Tasks in Distributed Systems
Optimal Deterministic Ring Exploration with Oblivious Asynchronous Robots
Universal Coating by 3D Hybrid Programmable Matter
Convergence of Mobile Robots with Uniformly-Inaccurate Sensors
The 1.5-loop network and the mixed 1.5-loop network
Structural Information and Communication Complexity, 14th International Colloquium, SIROCCO 2007, Castiglioncello, Italy, June 5-8, 2007, Proceedings
A Visibility vs. Memory Trade-Off for Stand-Up Indulgent Gathering on Lines
SIROCCO 8, Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity, Vall de Núria, Girona-Barcelona, Catalonia, Spain, 27-29 June, 2001
Augmented Ring Networks
On permutation communications in all-optical rings
Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry?
Mobile Robots with Uncertain Visibility Sensors
Local Broadcasting with Arbitrary Transmission Power in the SINR Model
An Approximation Algorithm for Path Computation and Function Placement in SDNs
Routing in Carrier-Based Mobile Networks
The Epigenetic Consensus Problem
Randomized Lower Bound for Distributed Spanning-Tree Verification
Algorithmic Support for Video-on-Demand based on the Delayed-multicast Protocol
Explicit and Tight Bounds of the Convergence Time of Average-Based Population Protocols
A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation - (Extended Abstract)
The Fault Tolerant Capacitated k-Center Problem
Graph Exploration by Energy-Sharing Mobile Agents
About the local detection of termination of local computations in graphs
On the Compactness of Bounded Degree Graphs for Shortest Path Interval Routing
Biangular Circle Formation by Asynchronous Mobile Robots
New Protocols for Asymmetric Communication Channels
Stateless Information Dissemination Algorithms
Linear Search by a Pair of Distinct-Speed Robots
Gathering Synchronous Robots in Graphs: From General Properties to Dense and Symmetric Topologies
The Do-All Problem with Byzantine Processor Failures
Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Agents
Cops and Robbers on Dynamic Graphs: Offline and Online Case
Computing Frequent Elements Using Gossip
On the Performance of a Retransmission-Based Synchronizer
Broadcasting in Ad Hoc Multiple Access Channels
Connected Surveillance Game
Oblivious Routing on d-Dimensional Meshes
Asynchronous Deterministic Rendezvous in Bounded Terrains
t-Resilient Immediate Snapshot Is Impossible
SIROCCO'98, 5th International Colloquium on Structural Information & Communication Complexity, Amalfi, Italy, June 22-24, 1998
Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs
Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs
Global Versus Local Computations: Fast Computing with Identifiers
Thirty Years of SIROCCO A Data and Graph Mining Comparative Analysis of Its Temporal Evolution
Spanning Trees with Few Branch Vertices in Graphs of Bounded Neighborhood Diversity
Local Mending
Local Planar Domination Revisited
Recent Results on Fault-Tolerant Consensus in Message-Passing Networks
Dynamic Networks of Finite State Machines
Cellular Networks: Where Are the Mobile Users?
Lower bounds for hot-potato permutation routing on trees
Spanners of Underlying Graphs of Iterated Line Digraphs
On Knowledge and Communication Complexity in Distributed Systems
Time-optimal gossip in noncombining 3-D tori
On Bidimensional Congestion Games
Classifying Anonymous Networks: When Can Two Networks Compute the Same Vector-Valued Functions?
On Distributed Computation of the Minimum Triangle Edge Transversal
Orientation of Distributed Networks: Graph- and Group- Theoretic Modelling
Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems
A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots
Discovery of Network Properties with All-Shortest-Paths Queries
Extremal bounds for probabilistic polling in graphs
The Cover Times of Random Walks on Hypergraphs
Network Synchronization and Localization Based on Stolen Signals
Approximate Multicommodity Flow for WDM Networks Design
Algorithms for Extracting Timeliness Graphs
Instability of Networks with Quasi-Static Link Capacities
Modelling Links in Inclined LEO Satellite Networks
Brief Announcement: Fast Approximate Counting and Leader Election in Populations
A Characterization of Classes of GraphsRecognizable by Local Computations with Initial Knowledge
Killing Nodes as a Countermeasure to Virus Expansion
Edge Fault-Diameter of Cartesian Product of Graphs
Learning Hierarchically-Structured Concepts II: Overlapping Concepts, and Networks with Feedback
On Fast and Robust Information Spreading in the Vertex-Congest Model
Constant Round Distributed Domination on Graph Classes with Bounded Expansion
Distributed Distance Sensitivity Oracles
Exploration of Constantly Connected Dynamic Graphs Based on Cactuses
Strong Orientations of Planar Graphs with Bounded Stretch Factor
Set Agreement Power Is Not a Precise Characterization for Oblivious Deterministic Anonymous Objects
Approximation of the Degree-Constrained Minimum Spanning Hierarchies
Distributed Approximation Algorithm for Resource Clustering
Support + Belief = Decision Trust
On the Complexity of Path Layouts in Bounded Degree ATM Networks A Case Study for Butterfly Networks
Regular Register: An Implementation in a Churn Prone Environment
Structural Information and Communication Complexity, 16th International Colloquium, SIROCCO 2009, Piran, Slovenia, May 25-27, 2009, Revised Selected Papers
Exact Bandwith of Parallel-Processor Networks
Secluded Path via Shortest Path
Exploration of Convex Terrains by a Deterministic Automaton with Pebbles
Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory
On Designing Truthful Mechanisms for Online Scheduling
Zooming in on Network-on-Chip Architectures
Approximating the Size of a Radio Network in Beeping Model
Topological Constraints for Sense of Direction
A Generic Framework for Computing Parameters of Sequence-Based Dynamic Graphs
Ordered Coloring Grids and Related Graphs
Time-Energy Tradeoffs for Evacuation by Two Robots in the Wireless Model
On the Feasibility of Gathering by Autonomous Mobile Robots
Approximate Top-k Queries in Sensor Networks
Asymmetric Communication Protocols via Hotlink Assignments
Adapting to Point Contention with Long-Lived Safe Agreement
Multi-winner Election Control via Social Influence
Lower Bounds for Shortest Path Interval Routing
Location Oblivious Distributed Unit Disk Graph Coloring
A uniform randomized election in trees
A Monte Carlo Algorithm for Election
Interval Routing in Some Planar Quadrangulations
Weighted Packet Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation
Optimal Gathering of Oblivious Robots in Anonymous Graphs
On the Power of Local Information in Scheduling in Synchronous Networks
Whom to Befriend to Influence People
Discovering Network Topology in the Presence of Byzantine Faults
Approximate Equilibria and Ball Fusion
Leader Election in SINR Model with Arbitrary Power Control
Boolean Routing on Cayley Networks
Distributed Pattern Formation in a Ring
Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings
Recovering the Long-Range Links in Augmented Graphs
Reputation, Trust and Recommendation Systems in Peer-to-Peer Systems
Optimal Conclusive Sets for Comparator Networks
FnF-BFT: A BFT Protocol with Provable Performance Under Attack
Structural Information and Communication Complexity, 13th International Colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006, Proceedings
Distributed Weighted Stable Marriage Problem
Getting Close without Touching
Invited Talk: Symmetry and Computability in Anonymous Networks
Maximum Interference of Random Sensors on a Line
Computing Replacement Paths in the CONGEST Model
Some Results on the Space Requirement of Interval Routing
Parallel Search with No Coordination
Divide & Scale: Formalization and Roadmap to Robust Sharding
Compact Routing Methods: A Survey
Stability of P2P Networks Under Greedy Peering
Searching with Uncertainty
The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism
Random Walks on Randomly Evolving Graphs
Parallel Real-Time Complexity A Strong Infinite Hierarchy
Structural Information and Communication Complexity, 15th International Colloquium, SIROCCO 2008, Villars-sur-Ollon, Switzerland, June 17-20, 2008, Proceedings
Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs
Partial is Full
Some Upper Bounds on Expected Agreement Time of a Probabilistic Local Majority Polling Game
SIROCCO'97, 4th International Colloquium on Structural Information & Communication Complexity, Monte Verita, Ascona, Switzerland, July 24-26, 1997
Optimal broadcast on parallel locality models
A Strongly-Stabilizing Protocol for Spanning Tree Construction Against a Mobile Byzantine Fault
Mixed Fault Tolerance in Server Assignment: Combining Reinforcement and Backup
Simple and Local Independent Set Approximation
Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs
Stability of Networks in Stretchable Graphs
k-Center Clustering in Distributed Models
On Distributed Merlin-Arthur Decision Protocols
Bandwidth Allocation Algorithms on Tree-Shaped All-Optical Networks with Wavelength Converters
Broadcasting in all-output-port cube-connected cycles with distance-insensitive routing
Online Service with Delay on a Line
Collecting Coupons is Faster with Friends
Lessons from the Congested Clique Applied to MapReduce
Structural Information and Communication Complexity - 24th International Colloquium, SIROCCO 2017, Porquerolles, France, June 19-22, 2017, Revised Selected Papers
On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings
Compatibility of Convergence Algorithms for Autonomous Mobile Robots (Extended Abstract)
Black Hole Search in Directed Graphs
Faster Construction of Overlay Networks
How to Meet in Anonymous Network
The Range Assignment Problem in Static Ad-Hoc Networks on Metric Spaces
Reconstructing Visibility Graphs with Simple Robots
Threshold Counters with Increments and Decrements
Foremost Non-stop Journey Arrival in Linear Time
Distributed Chasing of Network Intruders
Traffic Grooming on the Path
Distributed Interactive Proofs for the Recognition of Some Geometric Intersection Graph Classes
Awake Complexity of Distributed Minimum Spanning Tree
Medium Access Control for Adversarial Channels with Jamming
Determining the Conditional Diagnosability of k -Ary n -Cubes Under the MM* Model
Probabilistic Connectivity Threshold for Directional Antenna Widths - (Extended Abstract)
Mobile Agent Rendezvous: A Survey
Characterization results of all shortest paths interval routing schemes
Power and Limitations of Optical Reconfigurable Arrays
Upper Bounds and Algorithms for Parallel Knock-Out Numbers
Efficient Broadcasting Protocols on the de Bruijn and Similar Networks
Brief Announcement: Perfect Matching with Few Link Activations
Multi-agent Online Graph Exploration on Cycles and Tadpole Graphs
Mobile Entities Computing: Models and Problems
Bounds for the On-line Multicast Problem in Directed Graphs
From Renaming to Set Agreement
Majority Voting, Coalitions and Monopolies in Graphs
Black Virus Decontamination of Synchronous Ring Networks by Initially Scattered Mobile Agents
In Search of the Lost Tree - Hardness and Relaxation of Spanning Trees in Temporal Graphs
Synchronous Concurrent Broadcasts for Intermittent Channels with Bounded Capacities
A Protocol for Randomized Anonymous Two-process Wait-free Test-and-Set with Finite-state Verification
Long-Lived Rambo: Trading Knowledge for Communication
An Alternative View on Sense of Direction (Position paper)
Asynchronous Byzantine Consensus with Trusted Monotonic Counters
Distributed Community Detection in Dynamic Graphs - (Extended Abstract)
Approximating Independent Sets in Constant Distributed Rounds
Mobile Agents Rendezvous When Tokens Fail
Distributed Detection of Clusters of Arbitrary Size
Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks
Distributed Half-Integral Matching and Beyond
Gathering in Dynamic Rings
Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-Offs
Maintaining Consistent Transactional States without a Global Clock
On the Strongest Message Adversary for Consensus in Directed Dynamic Networks
An Improved Algorithm for Adaptive Condition-Based Consensus
Fast Deterministic Distributed Algorithms for Sparse Spanners
Online Drone Scheduling for Last-Mile Delivery
Time Optimal Gathering in Sensor Networks
Characterization of Networks Supporting Multi-dimensional Linear Interval Routing Schemes
Short Labeling Schemes for Topology Recognition in Wireless Tree Networks
Improved Approximation for Orienting Mixed Graphs
Zero-Memory Graph Exploration with Unknown Inports
A Nonmonotone Analysis with the Primal-Dual Approach: Online Routing of Virtual Circuits with Unknown Durations
Distributed Exploration of an Unknown Graph
On Sense of Direction and Mobile Agents
Rumor Spreading with Bounded In-Degree
Asynchronous Broadcast in Radio Networks
Strong Connectivity of Sensor Networks with Double Antennae
Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games
Distributed Algorithms for Partitioning a Swarm of Autonomous Mobile Robots
On Semi-perfect 1-Factorizations
Network Creation Games with Local Information and Edge Swaps
Thy Neighbor's Interval is Greener: A Proposal for Exploiting Interval Routing Schemes (Position paper)
Space Lower Bounds for Low-Stretch Greedy Embeddings
Guarding a Polygon Without Losing Touch
How Many Ants Does It Take to Find the Food?
Wireless Network Stability in the SINR Model
Fast Distributed Algorithms Via Primal-Dual (Extended Abstract)
Virtual Path Layout for Some Bounded Degree Networks
Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings
Loosely-Stabilizing Leader Election in Population Protocol Model
Setting Port Numbers for Fast Graph Exploration
SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, June 18-20, 2003, Umeå Sweden
The Beachcombers' Problem: Walking and Searching with Mobile Robots
Communication Properties of Cycle Prefix Digraphs
Efficient fault location with small risk
Robot Convergence via Center-of-Gravity Algorithms
A New Self-stabilizing Maximal Matching Algorithm
Optimal Memory Requirement for Self-stabilizing Token Circulation
Pattern Formation by Mobile Robots with Limited Visibility
Approximation Algorithm for Hotlink Assignment in the Greedy Model
Explorable Families of Graphs
An Analysis of Avalanche Consensus
No-Hole L(p, 0) Labelling of Cycles, Grids and Hypercubes
Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity
A Routing Algorithm for Networks Based on Distance-Hereditary Topologies
Better Expanders and Superconcentrators by Kolmogorov Complexity
On the Smallest Grain of Salt to Get a Unique Identity
A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery
On the Impact of Local Taxes in a Set Cover Game
Event Extent Estimation
The Power of Small Coalitions in Graphs
A General Lower Bound for Collaborative Tree Exploration
Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents
Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots
More Efficient Periodic Traversal in Anonymous Undirected Graphs
Packet Forwarding with Swaps
Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs
Sensor Networks: Distributed Algorithms Reloaded - or Revolutions?
ANTS on a Plane
On Liveness of Dynamic Storage
Irreversible Dynamos in Butterflies
The compactness of adaptive routing tables
A Topological Perspective on Distributed Network Algorithms
Triangulations and Chrodal Rings
Snpa-Stabilizing PIF Algorithm in Trees
Trade-Offs for Add Gossiping
Distributed Evacuation in Graphs with Multiple Exits
Asynchronous Rendezvous with Different Maps
Equal-Area Locus-Based Convex Polygon Decomposition
F-Chord: Improved Uniform Routing on Chord: (Extended Abstract)
Distance- k Information in Self-stabilizing Algorithms
Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs
Self-stabilizing depth-first token circulation in arbitrary rooted networks
Bankrupting DoS Attackers
On the Existence of Consensus Converging Organized Groups in Large Social Networks
On Immunity and Catastrophic Indices of Graphs
Distributed Coloring Depending on the Chromatic Number or the Neighborhood Growth
Maintaining Balanced Trees for Structured Distributed Streaming Systems
Formalizing Compute-Aggregate Problems in Cloud Computing
Minimizing the Number of ADMs in SONET Rings with Maximum Throughput
Mutual Visibility in Hypercube-Like Graphs
Systolic Gossip in Complete Trees
Cops & Robber on Periodic Temporal Graphs: Characterization and Improved Bounds
Gathering of Six Robots on Anonymous Symmetric Rings
Concurrent Use of Write-Once Memory
On time versus size for monotone dynamic monopolies in regular topologies
An Optimal Algorithm for Broadcasting Multiple Messages in Trees
Structural Information and Communication Complexity - 19th International Colloquium, SIROCCO 2012, Reykjavik, Iceland, June 30-July 2, 2012, Revised Selected Papers
Efficient Wait-Free Linearizable Implementations of Approximate Bounded Counters Using Read-Write Registers
Network Creation Games with Traceroute-Based Strategies
A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(\log N\log \varDelta /\log ^2\log \varDelta ) Rounds
Systolic Acyclic Orientations for Deadlock Prevention
GMA: A Pareto Optimal Distributed Resource-Allocation Algorithm
Non-Additive Two-Option Ski Rental
Path Layout on Tree Networks: Bounds in Different Label Switching Models
All You Need are Random Walks: Fast and Simple Distributed Conductance Testing
On Private Computation in Incomplete Networks
Optimal Oblivious Routing On D-Dimensional Meshes
A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition
Deterministic Distributed Ruling Sets of Line Graphs
Optimal Scheduling for Distributed Cooperation Without Communication
Phase Transition of a Non-linear Opinion Dynamics with Noisy Interactions - (Extended Abstract)
Convergence and Concentration Results for packets Routing Networks
Boundary Sketching with Asymptotically Optimal Distance and Rotation
Space-Efficient Uniform Deployment of Mobile Agents in Asynchronous Unidirectional Rings
Development of the Concept of Intelligent Add-On over Project Planning Instruments
Adaptive Algorithms for Quantization Error Normalization of Digital Encoder-Based Tachometers
Sensor Array Signal Processing Using SSA
Optimising Wastewater Treatment Through Laboratory-Guided Process Automation
Distributed Systems Log Protection from Cyberattacks by Verkle Trees
Recommendation Methods for Information Technology Support of Lifelong Learning Situations
Modelling of Hydrodynamics of Meat Raw Materials When Crushing It in Meat Cutting Machines
Ontological Modeling in Humanities
Application of Geoinformation Systems in Urban Environmental Management Projects
Neural Network System for Selection of Table Tennis Equipment with Elements of Crypto Protection
Research of the Problems of Building an E-Demography System in the Innovative Environment of Science and Education
Comprehensive Assessment of Failures and Risks of the Information System "Driver-Vehicle-Environment"
Simulation Model of Business Processes as a Tool for Ensuring the Information Environment of Transport Enterprises
Information Technology for Education, Science, and Technics - Proceedings of ITEST 2022, Cherkasy, Ukraine, 23-25 June 2022
Implementation of Artificial Intelligence in an Online Platform for Solving and Checking the Solutions of Physical Problems
Console Application Development for Articles' Highlights Generation Based on Artificial Intelligence Designed Using Autonomous Large Language Model
Combined Method of Solving Time Management Tasks and Its Implementation in the Decision Support System
Criteria for the Use of Information Technology in Assessing the Quality of Critical Infrastructure by Safety Indexes
Formation of an Effective Model of the Knowledge Base Through Metallographic Images of Laser Welding Microstructures in the Conditions of Small-Series Production
Information Technology for Education, Science, and Technics - Proceedings of ITEST 2024, Volume 2, Cherkasy, Ukraine, 23-24 May 2024