yusuke1997/dblp-id-title huggingface dataset:
Polynomial-Time Computable Backup Tables for Shortest-Path Routing
Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique Model
Non-strict Temporal Exploration
Strongly Terminating Early-Stopping k -Set Agreement in Synchronous Systems with General Omission Failures
Message Lower Bounds via Efficient Network Synchronization
The Value of Information in Selfish Routing
Rank of Graphs: The Size of Acyclic Orientation Cover for Deadlock-Free Packet Routing
On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem
Symmetric Rendezvous with Advice: How to Rendezvous in a Disk
Centralized Communication in Radio Networks with Strong Interference
Vertex Labeling and Routing in Recursive Clique-Trees, a New Family of Small-World Scale-Free Graphs
Essential Traffic Parameters for Shared Memory Switch Performance
Signature-Free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n2) Messages, and Constant Time
Average-Time Complexity of Gossiping in Radio Networks
Broadcast with Energy-Exchanging Mobile Agents Distributed on a Tree
Sparse Additive Spanners for Bounded Tree-Length Graphs
The Broadcast Assignment Problem
Towards Singular Optimality in the Presence of Local Initial Knowledge
Word of Mouth: Rumor Dissemination in Social Networks
Node Labels in Local Decision
Optimal Buffer Management for 2-Frame Throughput Maximization
Improved Distributed Algorithms for Coloring Interval Graphs with Application to Multicoloring Trees
Minimum Feedback Vertex Sets in Shuffle-based Interconnection Networks
Wavelength Routing of Symmetric Communication Requests in Directed Fiber Trees
Optimal Multi-broadcast with Beeps Using Group Testing
Information Spreading by Mobile Particles on a Line
Network Verification via Routing Table Queries
Anonymous Read/Write Memory: Leader Election and De-anonymization
Brief Announcement: Hardness of Approximate Vertex Ranking by Betweenness Centrality in the CONGEST Model
Structural Information and Communication Complexity - 31st International Colloquium, SIROCCO 2024, Vietri sul Mare, Italy, May 27-29, 2024, Proceedings
Best Effort and Priority Queuing Policies for Buffered Crossbar Switches
Avoiding Routing Loops on the Internet
Optimal Packet-Oblivious Stable Routing in Multi-hop Wireless Networks
Partial Gathering of Mobile Agents Without Identifiers or Global Knowledge in Asynchronous Unidirectional Rings
Group Mutual Exclusion in Token Rings
Tight Bounds on the Size of 2-Monopolies
Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission Faults
Structural Information and Communication Complexity - 29th International Colloquium, SIROCCO 2022, Paderborn, Germany, June 27-29, 2022, Proceedings
Efficient Distributed Weighted Matchings on Trees
An Algorithm for Online Facility Leasing
Towards a Theory of Peer-to-Peer Computability
On the Computational Power of Energy-Constrained Mobile Robots: Algorithms and Cross-Model Analysis
Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications
Structural Information and Communication Complexity - 28th International Colloquium, SIROCCO 2021, Wrocław, Poland, June 28 - July 1, 2021, Proceedings
Dimension-Exchange Algorithms for Load Balancing on Trees
Near-Gathering of Energy-Constrained Mobile Agents
Average Long-Lived Memoryless Consensus: The Three-Value Case
Traffic Grooming in a Passive Star WDM Network
Move-Optimal Partial Gathering of Mobile Agents in Asynchronous Trees
An Optimal Rebuilding Strategy for a Decremental Tree Problem
Locating and Repairing Faults in a Network with Mobile Agents
Self-organizing Flows in Social Networks
Gathering of Robots on Anonymous Grids without Multiplicity Detection
Explicit Token-Based Communication for Mobile Entities
On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology
Approximate Minimum Directed Spanning Trees Under Congestion
Minimum Feedback Vertex Set in Pyramid and Mesh of Trees Networks
A powerful heuristic for telephone gossiping
Efficient Condition-Based Consensus
Continuous Aggregation in Dynamic Ad-Hoc Networks
Lockless Blockchain Sharding with Multiversion Control
A Self-Stabilizing Algorithm for Maximal Matching in Link-Register Model
Communication Complexity Lower Bounds in Distributed Message-Passing
How to Choose Friends Strategically
Distributed Binary Labeling Problems in High-Degree Graphs
Multimodal Search on a Line
The Red-Blue Pebble Game on Trees and DAGs with Large Input
Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses
Two Absolute Bounds for Distributed Bit Complexity
An algorithmic definition of interval with applications to routing
Full Access Networks of Small Size
Space Lower Bounds for Graph Exploration via Reduced Automata
Boolean Routing on Cube Networks
Self-stabilizing (k, r)-Clustering in Clock Rate-Limited Systems
A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives
On Location Hiding in Distributed Systems
Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks
On Routing of Wavebands for Gossiping in All-Optical Paths and Cycles
Distributed Coloring of Hypergraphs
Improved Bounds for Optimal Black Hole Search with a Network Map
Lower Bounds for Multi-label Interval Routing
Computing Approximate Nash Equilibria in Network Congestion Games
Improving the Optimal Bounds for Black Hole Search in Rings
Algorithmic Aspects of Resource Management in the Cloud
Leader Election in Abelian Cayley Graphs
On Fractional Dynamic Faults with Threshold
Bisecting de Bruijn and Kautz Graphs
Asynchrony and Collusion in the N-party BAR Transfer Problem
Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs
Optimal Delay for Media-on-Demand with Pre-loading and Pre-buffering
Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges
History Trees and Their Applications
Low-Distortion Clustering in Bounded Growth Graphs
Fault-Tolerant Wavelength Allocations in All-optical Hypercubes
Secure Multi-party Shuffling
A Compact Fault-tolerant, Deadlock-free, Minimal Routing Algorithm for n-Dimensional Wormhole Switching Based Meshes
On the Power of Local Orientations
Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications - (Extended Abstract)
Profit Maximization in Flex-Grid All-Optical Networks
Space-Optimal Rendezvous of Mobile Agents in Asynchronous Trees
Wait-Free Approximate Agreement on Graphs
Communication-Efficient Broadcasting in Complete Networks with Dynamic Faults
Online Admission Control and Embedding of Service Chains
Distributed Tree Comparison with Nodes of Limited Memory
Crash-Tolerant Consensus in Directed Graph Revisited (Extended Abstract)
Performance/Security Tradeoffs for Content-Based Routing Supported by Bloom Filters
Breaking the Linear-Memory Barrier in MPC: Fast MIS on Trees with Strongly Sublinear Memory
The Complexity Gap between Consensus and Safe-Consensus - (Extended Abstract)
Nearly Optimal Local Broadcasting in the SINR Model with Feedback
Changing of the Guards: Strip Cover with Duty Cycling
Improved Periodic Data Retrieval in Asynchronous Rings with a Faulty Host
Phase Transition of the 3-Majority Dynamics with Uniform Communication Noise
Notions of Connectivity in Overlay Networks
Routing with the use of masks
Multi-Source Spanning Tree Problems
The Universe of Symmetry Breaking Tasks
Influence Diffusion in Social Networks under Time Window Constraints
Communication Complexity in Vertex Partition Whiteboard Model
The Complexity of Characterization of Networks Supporting Shortest-Path Interval Routing
An Improved Strategy for Exploring a Grid Polygon
Distance Labeling Schemes for K 4 -Free Bridged Graphs
Social Context Congestion Games
Exploration of the T-Interval-Connected Dynamic Graphs: The Case of the Ring
A Randomized Algorithm for Online Scheduling with Interval Conflicts
Time of Anonymous Rendezvous in Trees: Determinism vs. Randomization
Implicit Routing and Shortest Path Information (Extended Abstract)
Reliable Shared Memory Abstraction on Top of Asynchronous Byzantine Message-Passing Systems
Asynchronous Exploration of an Unknown Anonymous Dangerous Graph with O(1) Pebbles
k-Neighborhood Broadcasting
Worst-case bounds for blind broadcasting in small-degree networks
Trade-off for broadcast protocols
Oblivious Robots Under Sequential Schedulers: Universal Pattern Formation
The Computability of Relaxed Data Structures: Queues and Stacks as Examples
Self-adjusting Grid Networks to Minimize Expected Path Length
Overcoming Probabilistic Faults in Disoriented Linear Search
Clock Synchronization and Estimation in Highly Dynamic Networks: An Information Theoretic Approach
Local Gathering of Mobile Robots in Three Dimensions
Size Bounds for Dynamic Monopolies
Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots
Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor
Degree Realization by Bipartite Multigraphs
Full Reversal Routing as a Linear Dynamical System
Deterministic Leader Election for Stationary Programmable Matter with Common Direction
Exploration of Time-Varying Connected Graphs with Silent Agents
Public vs. Private Randomness in Simultaneous Multi-party Communication Complexity
Fault-Tolerant Compact Routing Based on Reduced Structural Information in Wormhole-Switching Based Networks
Linear Broadcasting and N loglog N Election in Unoriented Hypercubes
Labeled versus Unlabeled Distributed Cayley Networks
A Tight Bound for Online Coloring of Disk Graphs
Labeling Embeddings of Planar Graphs for Face-Adjacency
Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks
A Meta-Theorem for Distributed Certification
Communication Patterns and Input Patterns in Distributed Computing - (Invited Talk)
Self-adjusting Linear Networks with Ladder Demand Graph
Multiparty Equality Function Computation in Networks with Point-to-Point Links
Locally Balanced Allocations Under Strong Byzantine Influence
Pattern Formation by Anonymous Robots Without Chirality
A Characterization of Dynamic Networks Where Consensus Is Solvable
Interval Labeling Scheme for Chordal Rings
Distributed Multiple-Message Broadcast in Wireless Ad-Hoc Networks under the SINR Model
Treasure Hunt with Advice
An optimal distributed 3-edge-connected component algorithm
Optimal Moves for Gossiping Among Mobile Agents
Increasing the Power of the Iterated Immediate Snapshot Model with Failure Detectors
Interval Routing on k -trees
Communication Complexity: From Two-Party to Multiparty
Neighbourhood Information Dissemination in the Star Graph
Structural Information and Communication Complexity, 1st International Colloquium, SIROCCO 1994, Carleton University, Ottawa, Canada, May 18-20, 1994, Proceedings
Equivalence of Structural Knowledges in Distributed Algorithms
Consensus in byzantine asynchronous systems
Measuring the Impact of Adversarial Errors on Packet Scheduling Strategies
Optimal Gossiping in Square Meshes in All-Port Mode and with Short Packets
On Snapshots and Stable Properties Detection in Anonymous Fully Distributed Systems (Extended Abstract)
Election in Fully Anonymous Shared Memory Systems: Tight Space Bounds and Algorithms
Sublinear-Time Collision Detection with a Polynomial Number of States in Population Protocols
Finding Short Right-Hand-on-the-Wall Walks in Graphs
Reaching Agreement Among k out of n Processes
Stand-Up Indulgent Gathering on Rings
On Gossip and Populations
Geometric Routing Without Geometry
Selfish Routing with Oblivious Users
Making Randomized Algorithms Self-stabilizing
Simple Distributed Δ + 1 Coloring in the SINR Model
Good Fibrations and Other Construction Which Preserve Sense of Direction
Structural Information and Communication Complexity - 20th International Colloquium, SIROCCO 2013, Ischia, Italy, July 1-3, 2013, Revised Selected Papers
Characterization of Networks Supporting Shortest-Path Interval Labeling Schemes
On the Existence of Extension-Based Proofs of Impossibility for Set-Agreement
Testing Equality Under the Local Broadcast Model
New operators for computing with associative nets
Reaching Distributed Equilibrium with Limited ID Space
Distributed Fractional Local Ratio and Independent Set Approximation
Scheduling Multipacket Frames with Frame Deadlines
Lower Bounds for Uniform Read-Once Threshold Formulae in the Randomized Decision Tree Model
Fast Radio Broadcasting with Advice
Dynamically Maintaining Shortest Path Trees under Batches of Updates
Construction of low-cost and low-diameter Steiner trees for multipoint groups
Fast Fault-tolerant Broadcasting and Gossiping
Designing Hypergraph Layouts to GMPLS Routing Strategies
An Upper Bound Result for Multi-label Interval Routing on Planar Graphs
Optimal Time Data Gathering in Wireless Networks with Omni-Directional Antennas
Communication Problems for Mobile Agents Exchanging Energy
Wait-Free Gathering Without Chirality
Design of Fault Tolerant Satellite Networks with Priorities via Selectors
Trade-off Between Computational Power and Common Knowledge in Anonymous Rings
Exactly Optimal Deterministic Radio Broadcasting with Collision Detection
How Many Cooks Spoil the Soup?
Treewidth: Structure and Algorithms
What Do We Need to Know to Elect in Networks with Unknown Participants?
A Faster Computation of All the Best Swap Edges of a Tree Spanner
In the Search for Optimal Concurrency
Broadcasting in Small-world Communication Networks
Wireless Evacuation on m Rays with k Searchers
An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract)
Asynchronous Coordination Under Preferences and Constraints
3-D Minimum Energy Broadcasting
Time of Radio Broadcasting
Structural Information and Communication Complexity - 32nd International Colloquium, SIROCCO 2025, Delphi, Greece, June 2-4, 2025, Proceedings
Fooling Pairs in Randomized Communication Complexity
On Finding Minimum Deadly Sets for Directed Networks
An Efficient Self-stabilizing Distance-2 Coloring Algorithm
Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances
Advances in Rate-Based Flow Control
The Price of Anarchy in All-Optical Networks
Leader Election using Any Sense of Direction
On Approximability of the Independent Set Problem for Low Degree Graphs
SIROCCO 9, Proceedings of the 9th International Colloquium on Structural Information and Communication Complexity, Andros, Greece, June 10-12, 2002
A Characterization of t-Resilient Colorless Task Anonymous Solvability
Sub-linear Universal Spatial Gossip Protocols
Message-Efficient Self-stabilizing Transformer Using Snap-Stabilizing Quiescence Detection
What Can Be Computed without Communications?
Highly-Efficient Persistent FIFO Queues
Fragmented Objects: Boosting Concurrency of Shared Large Objects
SIROCCO'96, The 3rd International Colloquium on Structural Information & Communication Complexity, Siena, Italy, June 6-8, 1996
An Optimal Lower Bound for Interval Routing in General Networks
Time-Bounded Influence Diffusion with Incentives
Translation Capabilities of Sense of Direction
Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring
The Buffer Potential of a Network
Reconciling Fault-Tolerant Distributed Algorithms and Real-Time Computing - (Extended Abstract)
Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults
Heuristics Algorithms for Personalized Communication Problems in Point-to-Point Networks
Constant-Space Self-stabilizing Token Distribution in Trees
Convergence with Limited Visibility by Asynchronous Mobile Robots
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
Election and Rendezvous in Fully Anonymous Systems with Sense of Direction
Structural Information and Communication Complexity - 30th International Colloquium, SIROCCO 2023, Alcalá de Henares, Spain, June 6-9, 2023, Proceedings
Competitive FIB Aggregation for Independent Prefixes: Online Ski Rental on the Trie
The Power of Global Knowledge on Self-stabilizing Population Protocols
Token Traversal in Ad Hoc Wireless Networks via Implicit Carrier Sensing
A randomized leader election protocol for ad-hoc networks
Asynchronous Broadcasting with Bivalent Beeps
Asynchronous Mobile Robot Gathering from Symmetric Configurations without Global Multiplicity Detection
Multi-agent Disk Inspection
Deterministic Color-Optimal Self-stabilizing Semi-synchronous Gathering: A Certified Algorithm
Distributed Testing of Distance-k Colorings
The F-Snapshot Problem
Randomized Strategies for Non-additive 3-Slope Ski Rental
On the Complexity of Deciding Sense of Direction
Time Efficient Gossiping in Known Radio Networks
Latency Measures and Lower Bounds for Consensus with Failure Detectors
Some Problems in Distributed Computational Geometry
Near-Optimal Fault Tolerance for Efficient Batch Matrix Multiplication via an Additive Combinatorics Lens
Static Frequency Assignment in Cellular Networks
Wormhole Routing Simulation on a Mesh
Computing Functions on Partially Wireless Networks
SIROCCO 7, Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity, Laquila, Italy, June 20-22, 2000
Better Sooner Rather Than Later
Monotone Dynamos in Tori
The Client-Server 2-Spanner Problem with Applications to Network Design
Fast Algorithms for min independent dominating set
Dynamic Load Balancing with Group Communication
Steiner Problems with Limited Number of Branching Nodes
SIROCCO'99, 6th International Colloquium on Structural Information & Communication Complexity, Lacanau-Ocean, France, 1-3 July, 1999
Balanced Allocations and Global Clock in Population Protocols: An Accurate Analysis
Proof Labeling Schemes for Reachability-Related Problems in Directed Graphs
Dispersion of Mobile Robots on Directed Anonymous Graphs
Path-Fault-Tolerant Approximate Shortest-Path Trees
Optimizing Spread of Influence in Social Networks via Partial Incentives
Termination detection and universal graph reconstruction
Early Deciding Synchronous Renaming in O( logf ) Rounds or Less
NP-Completeness Results for All-Shortest-Path Interval Routing
A Theoretical Model for Routing Complexity
Mutual Visibility for Asynchronous Robots
On the Approximability of the L(h, k)-Labelling Problem on Bipartite Graphs (Extended Abstract)
Superfast Coloring in CONGEST via Efficient Color Sampling
Patrolling by Robots Equipped with Visibility
Computing on Anonymous Networks with Sense of Direction
Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach
Oblivious Rendezvous in Cognitive Radio Networks
Revisiting Randomized Parallel Load Balancing Algorithms
Pointer Chasing with Unlimited Interaction
New Bounds for the Firing Squad Problem on a Ring
Distributed Barrier Coverage with Relocatable Sensors
Congestion and dilation, similarities and differences: A survey
Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs
A Survey on Some Recent Advances in Shared Memory Models
The Cost of Concurrent, Low-Contention Read-Modify-Write
Distributed Data Structures: A Survey
On Space and Time Complexity of Loosely-Stabilizing Leader Election
Two New Applications of Dynamos
Accelerated Information Dissemination on Networks with Local and Global Edges
Exact Bounds for Distributed Graph Colouring
Maximum Distance Separable Codes Based on Circulant Cauchy Matrices
QoS-Competitive Video Buffering
On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion
Online Graph Exploration with Advice
Rapid Almost-Complete Broadcasting in Faulty Networks
Communication Complexity of Wait-Free Computability in Dynamic Networks
An Omega(n2)-Lower Bound for Space-Efficiency of Routing Schemes of Stretch Factor Three
Collaborative Exploration by Energy-Constrained Mobile Robots
Bounds for Frequency Estimation of Packet Streams
Deterministic Meeting of Sniffing Agents in the Plane
Optimal Distributed Algorithms in Unlabelled Tori and Chordal Rings
Optimal Decision Strategies in Byzantine Environments
Self-stabilizing Cuts in Synchronous Networks
Compact-Port Routing Models and Applications to Distance-Hereditary Graphs
Locality of Not-so-Weak Coloring
Lower Bounds on Message Passing Implementations of Multiplicity-Relaxed Queues and Stacks
A Recursive Approach to Multi-robot Exploration of Trees
Periodic Data Retrieval Problem in Rings Containing a Malicious Host
Agreement in Directed Dynamic Networks
Approximation Algorithms for Multi-budgeted Network Design Problems
Labeling Schemes with Queries
Swing Words to Make Circle Formation Quiescent
Brief Announcement: Relaxation for Efficient Asynchronous Queues
Distributed Transactional Contention Management as the Traveling Salesman Problem
Lower bounds for (weak) sense of direction
Traffic Grooming in Star Networks via Matching Techniques
About Informatics, Distributed Computing, and Our Job: A Personal View
Rendezvous of Two Robots with Constant Memory
Distributed Anonymous Mobile Robots
Gap Theorems for Anonymous Rings
Tracking Users in Cellular Networks using Timing Information
Self-stabilizing Hierarchical Construction of Bounded Size Clusters
Bounding Interference in Wireless Ad Hoc Networks with Nodes in Random Position
Space-Time Tradeoffs for Distributed Verification
An Empirical Study of "Lazy" Protocols for Routing Information in Dynamic Networks
Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond
Near-Optimal Scheduling in the Congested Clique
Distributed Algorithms for Fractional Coloring
Short Labels by Traversal and Jumping
Hierarchical Ring Network Design
Randomized Rendezvous of Mobile Agents in Anonymous Unidirectional Ring Networks
Existence of Nash Equilibria in Selfish Routing Problems
Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings
Monitoring of Domain-Related Problems in Distributed Data Streams
Design of Minimal Fault Tolerant On-Board Networks: Practical Constructions
A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs
Gathering Autonomous Mobile Robots
Theoretical research on networks: models and methodology
Collaborative Delivery with Energy-Constrained Mobile Robots
Boolean Routing on Chordal Rings
Structural Information and Communication Complexity - 23rd International Colloquium, SIROCCO 2016, Helsinki, Finland, July 19-21, 2016, Revised Selected Papers
Disjoint Paths in Symmetric Digraphs
Routing Schemes for Hybrid Communication Networks
When MIS and Maximal Matching are Easy in the Congested Clique
Non-negotiating Distributed Computing
On the Power of Threshold-Based Algorithms for Detecting Cycles in the CONGEST Model
Connectivity and Minimum Cut Approximation in the Broadcast Congested Clique
Fixed Points and 2-Cycles of Synchronous Dynamic Coloring Processes on Trees
Towards Network Games with Social Preferences
Self-stabilizing Space Optimal Synchronization Algorithms on Trees
How Long It Takes for an Ordinary Node with an Ordinary ID to Output?
Tighter Bounds on Feedback Vertex Sets in Mesh-Based Networks
Exact communication costs for consensus and leader in a tree
One-Max Constant-Probability Networks: Results and Future Work
Evolutionary Graph Colouring
Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks
Multipath Spanners
Structural Information and Communication Complexity - 25th International Colloquium, SIROCCO 2018, Ma'ale HaHamisha, Israel, June 18-21, 2018, Revised Selected Papers
Evacuating Two Robots from a Disk: A Second Cut
On the graphs of McKay-Miller-Sirán
A Simple Optimistic Skiplist Algorithm
Arbitrary Pattern Formation by Asynchronous Opaque Robots with Lights
Transiently Consistent SDN Updates: Being Greedy is Hard
Sharing the Cost of Multicast Transmissions in Wireless Networks
Cooperative computing with fragmentable and mergeable groups
Resource Burning for Permissionless Systems (Invited Paper)
Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model
The Communication Complexity of Functions with Large Outputs
L(h, 1, 1)-Labeling of Outerplanar Graphs