yusuke1997/dblp-id-title huggingface dataset:
Ostensive Automatic Schema Mapping for Taxonomy-Based Peer-to-Peer Systems
Towards an Experience-Based Negotiation Agent
Cryptographic Protocols for Secure Second-Price Auctions
Cooperative Information Agents XI, 11th International Workshop, CIA 2007, Delft, The Netherlands, September 19-21, 2007, Proceedings
A Similarity Evaluation Technique for Cooperative Problem Solving with a Group of Agents
Cooperative Information Agents V, 5th International Workshop, CIA 2001, Modena, Italy, September 6-8, 2001, Proceedings
Enabling Integrative Negotiations by Adaptive Software Agents
Evaluation of Distributed and Centralized Agent Location Mechanisms
Content-based Collaborative Information Filtering: Actively Learning to Classify and Recommend Documents
Adaptive Web Search Based on a Colony of Cooperative Distributed Agents
Agent-Supported Planning in Distributed Command and Control Environments
Risk-Bounded Formation of Fuzzy Coalitions Among Service Agents
Cooperative Information Agents II, Learning, Mobility and Electronic Commerce for Information Discovery on the Internet, Second International Workshop, CIA' 98, Paris, France, July 4-7, 1998, Proceedings
A Framework for the Social Description of Resources in Open Environments
Achieving Efficient Cooperation in a Multi-Agent System: the Twin-Base Modeling
Distributed Artificial Intelligence for Distributed Corporate Knowledge Management
A Social Mechanism of Reputation Management in Electronic Communities
An Agent-Based Approach for Helping Users of Hand-Held Devices to Browse Software Catalogs
Applying Agents to Bioinformatics in GeneWeaver
Multilevel Approach to Agent-Based Task Allocation in Transportation
Curious Negotiator
Bilateral Negotiation with Incomplete and Uncertain Information: A Decision-Theoretic Approach Using a Model of the Opponent
Collaboration Analysis in Recommender Systems Using Social Networks
Ontology Negotiation as a Basis for Opportunistic Cooperation between Intelligent Information Agents
Performative Patterns for Designing Verifiable ACLs
An Approach to Agent Communication Based on Organisational Roles
A Mechanism for Temporal Reasoning by Collaborative Agents
Auction-Based Agent Negotiation via Programmable Tuple Spaces
Towards a Delegation Framework for Aerial Robotic Mission Scenarios
A Dynamic Acces Planning Method for Information Mediator
Equilibria Strategies for Selecting Sellers and Satisfying Buyers
Meta-reasoning for Agents' Private Knowledge Detection
A Framework for the Exchange and Installation of Protocols in a Multi-agent System
A Cybernetic Approach to the Modeling of Agent Communities
GraniteNights - A Multi-agent Visit Scheduler Utilising Semantic Web Technology
Adaptive Agent-Based Service Composition for Wireless Terminals
Optimality and Risk in Purchase from Multiple Auctions
Programming Agent Mobility
Agent Communication and Cooperative Information Agents
Inspiration for Future Autonomous Space Systems
Emergence and Stability of Collaborations Among Rational Agents
GETESS - Searching the Web Exploiting German Texts
Opinion-Based Filtering through Trust
Melding Abstractions with Mobile Agents
Cooperative Information Agents X, 10th International Workshop, CIA 2006, Edinburgh, UK, September 11-13, 2006, Proceedings
Data-Security in Heterogeneous Agent Systems
Send Fredo off to Do This, Send Fredo off to Do That
Autonomous Search for Information in an Unknown Environment
Cooperative Information Agents XII, 12th International Workshop, CIA 2008, Prague, Czech Republic, September 10-12, 2008. Proceedings
Threshold Route Optimization Algorithm for Information Retrieving Mobile Agents
Cooperative Information Agents, First International Workshop, CIA' 97, Kiel, Germany, February 26-28, 1997, Proceedings
Multi-agent Systems and Distributed Data Mining
Introducing a Multi-agent, Multi-criteria Methodology for Modeling Electronic Consumer's Behavior: The Case of Internet Radio
Agents in Electronic Commerce: Component Technologies for Automated Negation and Coalition Formation
An Information Notification Model with VPC on KODAMA in an Ubiquitous Computing Environment, and Its Experiment
A Reactive Logical Agent
Decision Trees for Multiple Abstraction Levels of Data
Mobile Information Agents for Cyberspace - State of the Art and Visions
Execution Monitoring in Adaptive Mobile Agents
Specifying Protocols for Knowledge Transfer and Action Restriction in Multiagent Systems
A Distributed Generative CSP Framework for Multi-site Product Configuration
Economic Incentives for Information Agents
High-Performance Agent System for Intrusion Detection in Backbone Networks
Towards Information Agent Interoperability
The Search for Coalition Formation in Costly Environments
Metadatabase Meets Distributed AI
Agent-Based Analysis and Support for Incident Management
Result Sharing Among Agents Using Reactive Rules
Evaluating Dynamic Services in Bioinformatics
A-Globe: Agent Platform with Inaccessibility and Mobility Support
Intelligent Interfaces for Information Agents: Systems, Experiences, Future Challenges
Cooperative Information Agents and Communication
What is Query Rewriting?
Domain-Independent Ontologies for Cooperative Information Agents
Market-Inspired Approach to Collaborative Learning
Extending a Multi-agent System for Genomic Annotation
Towards a Monitoring Framework for Agent-Based Contract Systems
Knowledge Agents on the Web
On Ensuring Lower Bounds of Negotiation Results
Coordinating Patterns of Mobile Information Agents
Agents and OWL-S
Strategies for Querying Information Agents
Formation of Cooperative Behavior among Information Agents in Web Repository Change Monitoring Service
Cooperative Information Agents VII, 7th International Workshop, CIA 2003, Helsinki, Finland, August 27-29, 2003, Proceedings
On the Use of Symbolic Data Analysis to Model Communication Environments
Personalizing Information Retrieval with Multi-agent Systems
A MultiAgent System for Physically Based Rendering Optimization
Approaching Interoperability for Heterogeneous Multiagent Systems Using High Oder Agencies
Database Integration Using Mobile Agents
On the Impact of Agent Communication Languages on the Implementation of Agent Systems
From Local Search to Global Behavior: Ad Hoc Network Example
Semantic Information Brokering: How Can a Multi-agent Approach Help?
Business Ecosystem Modelling: Combining Natural Ecosystems and Multi-Agent Systems
Design and Implementation of Agent Community Based Peer-to-Peer Information Retrieval Method
A Framework of Cooperative Agents with Implicit Support for Ontologies
Resource Management in Agent-Based Distributed Environments
Improving Communication in 3D Virtual Environments by Means of Task Delegation in Agents
Enhancing Mobile Agents with Electronic Commerce Capabilities
Formalizing Retrieval Goal Change by Prioritized Circumscription - Preliminary Report
Interoperability of Distributed and Heterogeneous Systems Based on Software Agent-Oriented Frameworks
The Evolution of Probabilistic Reciprocity in a Multi-agent Environment with Neighborhoods
Wizard of Oz Method for Learning Dialog Agents
Interactive Integration of Information Agents on the Web
Supply Chain Management using Multi-agent System
What Can Agents Do in Industry, and Why? An Overview of Industrially-Oriented R&D at CEC
Performance Analysis Of Multiagent Industrial System
Agent-Supported Information Retrieval for Tracking and Tracing
Modeling Commercial Knowledge to Develop Advanced Agent-Based Marketplaces for E-commerce
Logic Programming for Evolving Agents
Collaborative Load-Balancing in Storage Networks Using Agent Negotiation
Adding Life-Like Synthetic Characters to the Web
Characterising Agents' Behaviours: Selecting Goal Strategies Based on Attributes
Coverage Density as a Dominant Property of Large-Scale Sensor Networks
Acquiring an Optimal Amount of Information for Choosing from Alternatives
Optimal failure detection with low sporadic overhead and communication locality
Randomized consensus in expected O(n log n) individual work
Brief announcement: spoofing prevention method
On the complexity of universal leader election
Brief announcement: the overlay network content distribution problem
Is Cloud Self-organization Feasible?
Search on a Line with Faulty Robots
On FTSS-Solvable Distributed Problems
Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, Ottawa, Ontario, Canada, August 20-23, 1995
A (Truly) Local Broadcast Layer for Unreliable Radio Networks
Brief Announcement: Asynchronous Randomness and Consensus without Trusted Setup
Constructing a Reliable Test&Set Bit (Abstract)
Brief Announcement: Massively Parallel Ruling Set Made Deterministic
Constant-RMR implementations of CAS and other synchronization primitives using read and write operations
Communication-efficient leader election and consensus with limited link synchrony
Towards a theory of transactional contention managers
Integrated resource allocation in heterogeneous SAN data centers
Fair and resilient incentive tree mechanisms
Comparison of Initial Conditions for Distributed Algorithms on Anonymous Networks
A Performance Evaluation of Lock-Free Synchronization Protocols
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010
Even-Cycle Detection in the Randomized and Quantum CONGEST Model
Computing Vector Functions on Anonymous Networks
Brief Announcement: (1+ε)-Approximate Shortest Paths in Dynamic Streams
Composable Computation in Discrete Chemical Reaction Networks
Replicated condition monitoring
The ERA Theorem for Safe Memory Reclamation
Brief announcement: complexity and solution of the send-receive correlation problem
Parallel Arithmetic with Concurrent Writes
Brief Announcement: Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model
Greedy Packet Scheduling on Shortest Paths (Preliminary Version)
A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model
Efficient pipeline configuration in distributed heterogeneous computing environments
Tight Analysis of Asynchronous Rumor Spreading in Dynamic Networks
Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization
A dynamic exchange game
Good-case Latency of Byzantine Broadcast: a Complete Categorization
Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs
An Interval-Based Framework for Clock Rate Synchronization
Dynamically Configurable Distributed Objects
A BGP-based mechanism for lowest-cost routing
Brief Announcement: Data Dissemination in Unified Dynamic Wireless Networks
Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling
Deterministic Objects: Life Beyond Consensus
Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, St. John's, Newfoundland, Canada, July 25-28, 2004
MIS on trees
Distributed deterministic edge coloring using bounded neighborhood independence
Progress Measures and Stack Assertions for Fair Termination
Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph
Specifying and Using a Partitionable Group Communication Service
A certain freedom: thoughts on the CAP theorem
On the Space Complexity of Set Agreement
The power of DCAS: highly-concurrent software transactional memory
A verification technique for self-stabilizing algorithms based on Ljapunov's "Second Method" (brief announcement)
Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion
On the Relevance of Communication Costs of Rollback-Recovery Protocols
Probably Approximately Knowing
How to wait when you are not going to block
The future(s) of shared data structures
Brief Announcement: Towards Scalable YOSO MPC via Packed Secret-Sharing
Fast protocol transition in a distributed environment (brief announcement)
Network formation games with local coalitions
Robust, Distributed References and Acyclic Garbage Collection
Synthesis of Concurrent Systems for an Atomic Read / Atomic Write Model of Computation (Extended Abstract)
Brief announcement: a local approximation algorithm for MDS problem in anonymous planar networks
The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory
Self-stabilizing Balls & Bins in Batches: The Power of Leaky Bins [Extended Abstract]
The forgiving tree: a self-healing distributed data structure
On Characterization of Safety and Liveness Properties in Temporal Logic
General perfectly periodic scheduling
Dynamic atomic storage without consensus
Tutorial: Consistency Choices in Modern Distributed Systems
Compiler Support for Decoupled Virtual Shared Memory Systems
Locating a target with an agent guided by unreliable local advice: how to beat the random walk when you have a clock?
A Logarithmic Depth Counting Network (Abstract)
Vorpal: Vector Clock Ordering For Large Persistent Memory Systems
Space Complexity of Fault-Tolerant Register Emulations
Brief announcement: strong detection of misconfigurations
Time and Space Lower Bounds for Non-Blocking Implementations (Preliminary Version)
Efficient threshold detection in a distributed environment: extended abstract
Parameterized Verification under Release Acquire is PSPACE-complete
Deterministic Abortable Mutual Exclusion with Sublogarithmic Adaptive RMR Complexity
Brief announcement: network-destabilizing attacks
A Structural Induction Theorem for Processes
In-Place Reconstruction of Delta Compressed Files
Towards Type-Based Optimizations in Distributed Applications Using ABS and JAVA 8
Formal Verification of Timed Properties for Randomized Distributed Algorithms
Simple and fast optimistic protocols for fair electronic exchange
Brief announcement: topology knowledge affects probabilistic reliable communication
Derivation of Fault Tolerance Properties of Distributed Algorithms
The price of selfish behavior in bilateral network formation
The effect of power-law degrees on the navigability of small worlds: [extended abstract]
Brief Announcement: Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement
The Synthesis of Communication Protocols
Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model
Reliable broadcast in radio networks: the bounded collision case
Brief Announcement: Distributed Graph Algorithms with Predictions
Brief announcement: exactly electing a unique leader is not harder than computing symmetric functions on anonymous quantum networks
Brief Announcement: On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement
Contention Resolution on Multiple Channels with Collision Detection
Brief announcement: fast scalable Byzantine agreement in the full information model with a nonadaptive adversary
Quantum distributed consensus
The asynchronous bounded-cycle model
Implementing atomic objects in a dynamic environment
Asynchronous Algorand: Reaching Agreement with Near Linear Communication and Constant Expected Time
The Possibility and the Complexity of Achieving Fault-Tolerant Coordination
A Characterization of Networks Supporting Linear Interval Routing
The round complexity of distributed sorting: extended abstract
Brief announcement: threshold load balancing in networks
Using k-Exclusion to Implement Resilient, Scalable Shared Objects (Extended Abstract)
Memory Requirements for Silent Stabilization (Extended Abstract)
Population Stability: Regulating Size in the Presence of an Adversary
Broadcast in radio networks tolerating byzantine adversarial behavior
On a network creation game
Efficient Synchronization on Multiprocessors with Shared Memory
Efficient Solution to the Distributed Mutual Exclusion Problem
A Space-Time Trade-off for Fast Self-Stabilizing Leader Election in Population Protocols
The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks
Contention in Counting Networks
Brief announcement: dynamic group communication
Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability
How To Elect a Leader Faster than a Tournament
Trade-Offs in Implementing Optimal Message Logging Protocols
Brief announcement: virtual stationary automata for mobile networks
Distributed reconfigurtion of metamorphic robot chains
Dynamic Load Sharing Algorithm with a Weighted Load Representation
Bounds on Information Exchange for Byzantine Agreement
Specification faithfulness in networks with rational nodes
Data communications vs. distributed computing (abstract)
Object replication degree customization for high availability
Evaluating the running time of a communication round over the internet
Sketching asynchronous streams over a sliding window
Distributing Computations in Fog Architectures
Graceful degradation via versions: specifications and implementations
From Self-Stabilization to Self-Optimization: Principles of Distributed Network Design
Constraint-based Structuring of Distributed Protocols (Abstract)
Brief announcement: STALK: a self-stabilizing hierarchical tracking service for sensor networks
Concurrent imitation dynamics in congestion games
Time and Message Bounds of Election in Synchronous and Asynchronous Complete Networks
Byzantine Agreement with Predictions
Genuinely Distributed Byzantine Machine Learning
Plenary talk
The weakest failure detectors to solve certain fundamental problems in distributed computing
Fast Distributed Construction of k-Dominating Sets and Applications
Competitive and fair throughput for co-existing networks under adversarial interference
Brief Announcement: Population Protocols Decide Double-exponential Thresholds
Byzantine vector consensus in complete graphs
Non-searchability of random scale-free graphs
The Space Complexity of Consensus from Swap
Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing, Calgary, Alberta, Canada, August 11-13, 1986
Brief announcement: perfectly secure message transmissiontolerating mobile mixed adversary with reduced phase complexity
Brief Announcement: New Distributed Interactive Proofs for Planarity: A Matter of Left and Right
Spreading Rumors Rapidly Despite and Adversary
Plain SINR is Enough!
On the Borowsky-Gafni Simulation Algorithm (Abstract)
Session details: Session 3C: Coloring
Brief announcement: a calculus of policy-based routing systems
Transactional predication: high-performance concurrent sets and maps for STM
Optimal deterministic routing and sorting on the congested clique
The Coalescing-Branching Random Walk on Expanders and the Dual Epidemic Process
Interactive Distributed Proofs
Securing the Internet (Abstract)
Brief announcement: efficient graph algorithms without synchronization
Leslie Lamport's properties and actions
A Polylog Time Wait-Free Construction for Closed Objects
On a Random Walk Problem Arising in Self-Stabilizing Token Management
Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation
Brief announcement: distributed contention resolution in wireless networks
Brief announcement: wait-free implementation of multiple-writers/multiple-readers atomic byzantine data storage systems
Communication Primitives in Cognitive Radio Networks
Atomic Snapshots of Shared Memory
Scheduling Loop-free Network Updates: It's Good to Relax!
DAG-based Consensus with Asymmetric Trust
Time and message-efficient S-based consensus (brief announcement)
Adversarial queuing on the multiple-access channel
Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, Vancouver, British Columbia, Canada, August 10-12, 1987
Lumiere: Making Optimal BFT for Partial Synchrony Practical
A Gossip-Based Dynamic Virtual Machine Consolidation Strategy for Large-Scale Cloud Data Centers
Fail Termination of Communicating Processe
The Elusive Atomic Register Revisited
Lower Bounds for Wait-Free Computation in Message-Passing Systems
Determining Recoverable Consensus Numbers
Dynamic Wavelength Allocation in Optical Networks
Towards robust distributed systems (abstract)
Brief Announcement: Fault-tolerant Broadcast in Anonymous Distributed Systems with Fair Lossy Communication Channels
How to be an Efficient Snoop, or the Probe Complexity of Quorum Systems (Extended Abstract)
From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems
A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) Rounds
Brief announcement: distributed trust management and revocation
Concurrency Control Algorithms for Multiversion Database Systems
Brief Announcement: Space-Optimal Naming in Population Protocols
Can We Break Symmetry with o(m) Communication?
A Semantics for a Logic of Authentication (Extended Abstract)
Sharpness, a tight condition for throughput scalability
A LOCAL View of the Polynomial Hierarchy
Polylog Randomized Wait-Free Consensus
Brief announcement: the price of anonymity: optimal consensus despite asynchrony, crash and anonymity
An optimally robust hybrid mix network
GoEdge: A Scalable and Stateless Local Breakout Method
Replicated Procedure Call
The SkipTrie: low-depth concurrent search without rebalancing
The wakeup problem in synchronous broadcast systems (extended abstract)
Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
Efficient Size Estimation and Impossibility of Termination in Uniform Dense Population Protocols
2021 Edsger W. Dijkstra Prize in Distributed Computing
Brief announcement: RT oblivious erasure correcting
Maximizing quorum availability in multi-clustered systems
On the Parallels between Paxos and Raft, and how to Port Optimizations
Can Distributed Uniformity Testing Be Local?
Distributed Algorithms for Planar Networks I: Planar Embedding
Optimal gossip with direct addressing
Stabilizing Server-Based Storage in Byzantine Asynchronous Message-Passing Systems: Extended abstract
Optimal exploration of small rings
A Direct Lower Bound for k -Set Consensus
Optimal Local Certification on Graphs of Bounded Pathwidth
Fast, Long-Lived Renaming Improved and Simplified (Abstract)
Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model
Interaction-Oriented Programming: An Application Semantics Approach for Engineering Decentralized Applications
Impossibility Results for Distributed Transactional Memory
Deterministic Distributed Dominating Set Approximation in the CONGEST Model
Towards Efficient Verification of Population Protocols
Fast Set Agreement in the Presence of Timing Uncertainty
Lazy-Writer Multivalued Registers (Abstract)
The Protocol for Hierarchical Multicast Routing
Peer counting and sampling in overlay networks: random walk methods
Combining Funnels: A New Twist on an Old Tale..
Self-management of Live Streaming Application in Distributed Cloud Infrastructure
Session details: Session 1D: Graph Algorithms
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, PODC 2024, Nantes, France, June 17-21, 2024
Brief announcement: locally-accessible implementations for distributed shared memory multiprocessors
On the computational power of oblivious robots: forming a series of geometric patterns
Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing
EquiCast: scalable multicast with selfish users
Avoiding The State Explosion Problem in Temporal Logic Model Checking
An Agent-Based Architecture for Buildiang CORBA Distributed Systems
Distributed Construction of Light Networks
Cryptography and competition policy: issues with 'trusted computing'
Method for Distributed Transaction Commit and recovery Using Byzantine Agreement Within Clusters of Processors
Partially Replicated Causally Consistent Shared Memory: Lower Bounds and An Algorithm
Brief Announcement: Minimizing Energy Solves Relative Majority with a Cubic Number of States in Population Protocols
Byzantine Fault Tolerant State Machine Replication in Any Programming Language
Recoverable Mutual Exclusion with Constant Amortized RMR Complexity from Standard Primitives
SuperStabilizing Protocols for Dynamic Distributed Systems (Abstract)
An Eye on the Elephant in the Wild: A Performance Evaluation of Hadoop's Schedulers Under Failures