yusuke1997/dblp-id-title huggingface dataset:
SuperTrust: a secure and efficient framework for handling trust in super-peer networks
Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver
Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why a Lot of Randomness is Needed?
Self-Stabilizing Snapshot Objects for Asynchronous Failure-Prone Networked Systems
Improved Tradeoffs for Leader Election
Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees
Impossibility of (Repeated) Reliable Broadcast (Abstract)
On fault tolerance and wireless networks
Principles of untrusted storage: a new look at consistency conditions
Lock-Free Algorithms under Stochastic Schedulers
Efficient algorithms for constructing (1+, varepsilon;, beta)-spanners in the distributed and streaming models
Trade-offs between selection complexity and performance when searching the plane without communication
Mutable Check-Points: A New Checkpointing Approach for Mobile Computing Systems
Constructing Two-Writer Atomic Registers
Faster randomized consensus with an oblivious adversary
Reliable end-user communication under a changing packet network protocol
Efficient Evaluation of Causality Relations Between Nonatomic Events
Leader Election in the Presence of Link Failures (Abstract)
Brief Announcement: Investigating the Cost of Anonymity on Dynamic Networks
On Counting the Population Size
Verification of a Distributed Algorithm (Abstract)
Brief announcement: distributed algorithms for throughput performance in wireless networks
Balanced Allocations with the Choice of Noise
Towards a Theory of Randomized Shared Memory Algorithms
Correctness of a gossip based membership protocol
Partisan: Enabling Real-World Protocol Evaluation
Probabilistic Quorum Systems
Dual Failure Resilient BFS Structure
Bringing practical lock-free synchronization to 64-bit applications
A Wait-Free Sorting Algorithm
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebastián, Spain, July 21 - 23, 2015
Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set
Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next
Fast, Scalable Synchronization with Minimal Hardware Support (Extended Abstract)
Brief announcement: concurrent counting is harder than queuing
Brief Announcement: CausalEC: A Causally Consistent Data Storage Algorithm based on Cross-Object Erasure Coding
Choice Coordination with Bounded Failure (a Preliminary Version)
Early-Stopping Terminating Reliable Broadcast Protocol for General Omission Failures (Abstract)
Brief announcement: efficient replication of large data objects
Assigning labels in unknown anonymous networks (extended abstract)
Brief announcement: stretch between nearby peers
Brief Announcement: Distributed Model Checking on Graphs of Bounded Treedepth
Adaptive Algorithms for PASO Systems
Coins, Weights and Contention in Balancing Networks
Session details: Session 2D: Consensus
Proceedings of the 2018 Workshop on Advanced Tools, Programming Languages, and PLatforms for Implementing and Evaluating Algorithms for Distributed systems, ApPLIED@PODC 2018, Egham, United Kingdom, July 27, 2018
Brief announcement: self-monitoring in dynamic wireless networks
Architecture Decisions for Wide Area Applications (Abstract)
Rationality authority for provable rational behavior
Randomized Mutual Exclusion Algorithms Revisited
Byzantine Stable Matching
Brief Announcement: Statement Voting and Liquid Democracy
Efficient Asynchronous Consensus with the Weak Adversary Scheduler
Near-Optimal Scheduling of Distributed Algorithms
Brief Announcement: Amnesiac Flooding: Easy to Break, Difficult to Escape
Ultra-Sparse Near-Additive Emulators
Resiliency of Interactive Distributed Tasks (Extended Abstract)
Locally-Iterative Distributed (Δ+ 1): -Coloring below Szegedy-Vishwanathan Barrier, and Applications to Self-Stabilization and to Restricted-Bandwidth Models
Average-case analysis of greedy packet scheduling (extended astract)
A Massively Parallel Modularity-Maximizing Algorithm with Provable Guarantees
Sharing Memory Robustly in Message-Passing Systems
Lexicographically optimal smoothing for broadband traffic multiplexing
Brief announcement: delay or deliver dilemma in organization networks
Brief Announcement: Computability and Anonymous Storage-Efficient Consensus with an Abstract MAC Layer
Performing work with asynchronous processors: message-delay-sensitive bounds
A Layered Architecture for Erasure-Coded Consistent Distributed Storage
Token Management Schemes and Random Walks Yield Self-Stabilizing Mutual Exclusion
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, PODC 2003, Boston, Massachusetts, USA, July 13-16, 2003
All-to-All Communication with Mobile Edge Adversary: Almost Linearly More Faults, For Free
Sleeping is Efficient: MIS in O (1)-rounds Node-averaged Awake Complexity
Split-ordered lists: lock-free extensible hash tables
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems
Hyaline: Fast and Transparent Lock-Free Memory Reclamation
Brief Announcement: Be Prepared When Network Goes Bad: An Asynchronous View-Change Protocol
Brief Announcement: How Large is your Graph?
Tight Lower and Upper Bounds for Some Distributed Algorithms for a Complete Network of Processors
Asynchronous Shared Channel
Brief Announcement: Deterministic Massively Parallel Algorithms for Ruling Sets
Distributed Computations in Fully-Defective Networks
Object location using path separators
Brief Announcement: On the Limits of Information Spread by Memory-less Agents
Real Time Resource Allocation in Distributed Systems
Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks
Evolution of distributed computing theory: from concurrency to networks and beyond
Brief announcement: towards security and privacy for outsourced data in the multi-party setting
Snap-stabilization in message-passing systems
Knowledge-Oriented Programming (Extended Abstract)
TetraBFT: Reducing Latency of Unauthenticated, Responsive BFT Consensus
Bandwidth constrained placement in a WAN
Two Messages are Almost Optimal for Conveying Information
Upper and Lower Bounds on the Space Complexity of Detectable Objects
Detectable byzantine agreement secure against faulty majorities
An Asynchronou [(n-1)/3]-Resilient Consensus Protocol
DARE to Agree: Byzantine Agreement With Optimal Resilience and Adaptive Communication
What can be decided locally without identifiers?
Atomic Snapshots in O(n log n) Operations (Preliminary Version)
Choosing a random peer
Fast Deflection Routing for Packets and Worms (Extended Summary)
Brief announcement: broadcast in radio networks in the presence of byzantine adversaries
Distributed Pursuit-Evasion: Some Aspects of Privacy and Security in Distributed Computing
Partition approach to failure detectors for k-set agreement
Two-handed emulation: how to build non-blocking implementation of complex data-structures using DCAS
A Decidable Temporal Logic to Reason About Many Processes
Asynchronous Approximate Agreement
Beyond geometry: towards fully realistic wireless models
On the Time-Complexity of Broadcast in Radio Networks: An Exponential Gap Between Determinism and Randomization
A Hierarchy of Temporal Properties
Minimum congestion mapping in a cloud
Improving Efficiency in Near-State and State-Optimal Self-Stabilising Leader Election Population Protocols
Optimal Distance Labeling Schemes for Trees
Maximal independent sets in radio networks
A Design of a Protocol for Detecting an Agent Clone in Mobile Agent Systems and its Correctness Proof
Brief announcement: secret handshakes from CA-oblivious encryption
Implementing the Cloud Software to Data Approach for OpenStack Environments
Dynamic-sized lock-free data structures
A topological characterization of weakness
Scheduling File Transfers in a Distributed Network
Global Flush Communication Primitive for Inter-process Communication
The Slide Mechanism with Applications in Dynamic Networks (Extended Abstract)
Summarizing data using bottom-k sketches
An incentive-compatible multi-armed bandit mechanism
Component Stability in Low-Space Massively Parallel Computation
How fast can a distributed atomic read be?
Gossip-based aggregate computation: computing faster with non address-oblivious schemes
Brief Announcement: Fast and Robust Information Spreading in the Noisy PULL Model
A tight meta-theorem for LOCAL certification of MSO2 properties within bounded treewidth graphs
Process Semantics: Universal Axioms Compositional Rules, and Applications
Distributed maximal matching: greedy is optimal
Competing against Specialists
Multicoordinated Paxos
Fast Isolation of Arbitrary Forwarding Faults
Brief Announcement: Improved, Partially-Tight Multiplicity Queue Lower Bounds
Brief announcement: parameterized model checking of fault-tolerant distributed algorithms by abstraction
Brief Announcement: No Broadcast Abstraction Characterizes k-Set-Agreement in Message-Passing Systems
Brief Announcement: Efficient Recoverable Writable-CAS
Robust architectures for open distributed systems and topological self-stabilization: invited paper
Next generation virtual network architecture for multi-tenant distributed clouds: challenges and emerging techniques
Brief Announcement: A Time and Space Optimal Stable Population Protocol Solving Exact Majority
vMCN: virtual mobile cloud network for realizing scalable, real-time cyber physical systems
The Impact of RDMA on Agreement
Deterministic Distributed DFS via Cycle Separators in Planar Graphs
Optimistic Concurrency Control for Abstract Data Types
Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity
Feedback control for router congestion resolution
Efficient Parallel Algorithms Can Be Made Robust
Faster Computation On Directed Networks of Automata (Extended Abstract)
The Impact on the Performance of Co-running Virtual Machines in a Virtualized Environment
The Randomized Local Computation Complexity of the Lovász Local Lemma
The Load and Availability of Byzantine Quorum Systems
Brief Announcement: A Probabilistic Performance Model and Tuning Framework for Eventually Consistent Distributed Storage Systems
Improved Distributed Delta-Coloring
Fast byzantine agreement
Local Stabilizer (Brief Announcement)
Self-stabilizing token circulation on asynchronous uniform unidirectional rings
Brief Announcement: Persistent Multi-Word Compare-and-Swap
Athena lecture: distributed computing theory for wireless networks and mobile systems
Broadcasting in Noisy Radio Networks
Limitations of Highly-Available Eventually-Consistent Data Stores
On the Distribution of an Assertion
I/O Automata Based Verification of Finite State Distributed Systems: Complexity Issues (Abstract)
Looking for the optimal conditions for solving set agreement
Optimal Multi-Writer Multi-Reader Atomic Register
How to Spread a Rumor: Call Your Neighbors or Take a Walk?
Garbage collection of timestamped data in Stampede
Linearizable State Machine Replication of State-Based CRDTs without Logs
An Approach to Performance Analysis of Timestamp-driven Synchronization Mechanisms
Optimal-stretch name-independent compact routing in doubling metrics
Linear-in-delta lower bounds in the LOCAL model
Brief announcement: waiting in dynamic networks
Structured Derivations of Consensus Algorithms for Failure Detectors
Extracting quorum failure detectors
Dynamic Size Counting in the Population Protocol Model
Mechanism design for policy routing
Brief announcement: queuing or priority queuing? on the design of cache-coherence protocols for distributed transactional memory
Automatic discovery of mutual exclusion algorithms
How fast can a very robust read be?
Overcoming Congestion in Distributed Coloring
A Formally Verifiable Algorithm for Clock Synchronization under a Hybrid Fault Model
Abortable and query-abortable objects and their efficient implementation
Parallel and distributed programming extensions for mainstream languages based on pi-calculus
When is liquid democracy possible?: On the manipulation of variance
User-Guided Provisioning in Federated Clouds for Distributed Calculations
Decision Power of Weak Asynchronous Models of Distributed Computing
Tolerating Linear Number of Faults in Networks of Bounded Degree
Order optimal information spreading using algebraic gossip
Recovery in Distributed Systems Using Asynchronous Message Logging and Checkpointing
The misbelief in delay scheduling
Brief Announcement: Population Protocols for Leader Election and Exact Majority with O (log 2 n ) States and O (log 2 n ) Convergence Time
The inherent complexity of transactional memory and what to do about it
Exponentially Faster Shortest Paths in the Congested Clique
A Faster Distributed Radio Broadcast Primitive: Extended Abstract
Healthcare Sensor Data Management on the Cloud
A Near-Optimal Deterministic Distributed Synchronizer
Stochastic analysis of distributed deadlock scheduling
Brief Announcement: Revisiting Lower Bounds for Two-Step Consensus
Assignment-based partitioning in a condition monitoring system
Correctness of gossip-based membership under message loss
The complexity of robust atomic storage
Efficient Traffic Laws for Mobile Robots - Work in Progress (Avstract)
On Termination of a Flooding Process
Distributed Coloring in Sparse Graphs with Fewer Colors
Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter
Brief announcement: detecting malicious routers
Brief Announcement: The Only Undoable CRDTs are Counters
Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks
Knowledge in Shared Memory Systems (Preliminary Version)
Brief announcement: an asymmetric flat-combining based queue algorithm
Session details: Session 1B: Shared Memory Theory
Towards an Approximation-Aware Computational Workflow Framework for Accelerating Large-Scale Discovery Tasks: Invited paper
Constant Amortized RMR Abortable Mutex for CC and DSM
A Verification Method Based on Homomorphic Model Abstractions (Abstract)
A tight unconditional lower bound on distributed randomwalk computation
Understanding perfect failure detectors
On reliable broadcast in a radio network
P-SLOCAL-Completeness of Maximum Independent Set Approximation
Tight Lower Bounds in the Supported LOCAL Model
Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, Quebec City, Quebec, Canada, August 22-24, 1990
Accountability for distributed systems
Noisy Rumor Spreading and Plurality Consensus
End-to-End Communication in Unreliable Networks
Research Summary: Deterministic, Explainable and Efficient Stream Processing
On the complexity of asynchronous gossip
Understanding and Verifying Distributed Algorithms Using Stratified Decomposition
Brief Announcement: On Polynomial-Time Local Decision
Quantum Communication Advantage for Leader Election and Agreement
Distributed Control for PARIS
Brief announcement: swarming secrets
Brief Announcement: Why Extension-Based Proofs Fail
An Automatic Speedup Theorem for Distributed Problems
A better wake-up in radio networks
A Simple Local-Spin Group Mutual Exclusion Algorithm
Fault-Tolerant Decision Making in Totally Asynchronous Distributed Systems (Preliminary Version)
Correctness criteria for replicated database systems with snapshot isolation replicas
New Models and Algorithms for Future Networks
Proceedings of the Third International Workshop on Reliability, Availability, and Security, WRAS 2010, conjunction with PODC 2010 Zurich, Switzerland, July 29, 2010
Coalescing random walks and voting on graphs
The topology of shared-memory adversaries
Fully Automated Selfish Mining Analysis in Efficient Proof Systems Blockchains
A Dynamic View-Oriented Group Communication Service
Distributed Maximum Flow in Planar Graphs
Hybrid-secure MPC: trading information-theoretic robustness for computational privacy
Random oracles in constantipole: practical asynchronous Byzantine agreement using cryptography (extended abstract)
A Green Scheduling Policy for Cloud Computing
Selective anti-entropy
Want to Gather? No Need to Chatter!
Feasibility and complexity of broadcasting with random transmission failures
Comparing How Atomicity Mechanisms Support Replication
Asynchronous interactive consistency and its relation with error-correcting codes
Optimal Distributed Replacement Paths
Correction: practical implementations of non-blocking synchronization primitives
Reaching Consensus for Asynchronous Distributed Key Generation
Self-Stabilization of Dynamic Systems Assuming only Read/Write Atomicity
Perigee: Efficient Peer-to-Peer Network Design for Blockchains
Universally-Optimal Distributed Exact Min-Cut
From bounded to unbounded concurrency objects and back
A Multi-capacity Queuing Mechanism in Multi-dimensional Resource Scheduling
Brief Announcement: The Weakest Failure Detector for Genuine Atomic Multicast
Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta
On the Coding of Dependencies in Distributed Computations (Abstract)
Memory consistency and process coordination for SPARC v8 multiprocessors (brief announcement)
Conflict on a communication channel
Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved Computation
ACM Symposium on Principles of Distributed Computing, PODC '12, Funchal, Madeira, Portugal, July 16-18, 2012
Brief announcement: decentralized construction of multicast trees embedded into P2P overlay networks based on virtual geometric coordinates
Witness-Based Cryptographic Program Checking and Applications (an Announcement)
The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers
Brief announcement: on L-resilience, hitting sets, and colorless tasks
Brief Announcement: Global certification via perfect hashing
Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, Montreal, Quebec, Canada, August 19-21, 1991
Terminating Iterative Solution of Simultaneous Equations in Distributed Message Passing Systems
On the Potential of FEC Algorithms in Building Fault-Tolerant Distributed Applications to Support High QoS Video Communications
Brief Announcement: Robust and Private Distributed Shared Atomic Memory in Message Passing Networks
Gap Theorems for Distributed Computation
Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, Minaki, Ontario, Canada, August 5-7, 1985
XMP++: An Object-Oriented Solution for Hiding the Complexity of Network Management Protocols
Brief announcement: improved asynchronous group mutual exclusion in token-passing networks
Engineering Distributed Systems that We Can Trust (and Also Run)
Brief Announcement: Rapid Asynchronous Plurality Consensus
Topological Characterization of Consensus under General Message Adversaries
Tight Bounds for the Sequence Transmission Problem
Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms
Brief Announcement: On Using Null Messages in a Byzantine Setting
A Parallel Genetic Algorithm Framework for Cloud Computing Applications
Fault-tolerant implementations of atomic registers by safe registers in networks
Brief announcement: game theoretical approach for energy-delay balancing in distributed duty-cycled MAC protocols of wireless networks
Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks
The amortized complexity of non-blocking binary search trees
The Message Classification Model
Atomic Cross-Chain Swaps
On Register Linearizability and Termination
Modular Construction of Nearly Optimal Byzantine Agreement Protocols
Multiple Communication in Multi-Hop Radio Networks
Optimal scheduling for disconnected cooperation
Brief announcement: on the round complexity of distributed consensus over synchronous networks
Distributed verification of minimum spanning trees
Privatization techniques for software transactional memory
Resilience of General Interactive Tasks
Automatic Identification of Patent Claim Types: Enhancing Efficiency in Patent Analysis
Proceedings of the 5th Workshop on Patent Text Mining and Semantic Technologies (PatentSemTech 2024) co-located with the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 2024), Washington D.C., USA, July 28th, 2024
Binary Patent Classication Methods for Few Annotated Samples
Detecting Multi Word Terms in Patents the same way as Named Entities
A Patent Semantic Representation Using Technical Compound Sentences
Exploring the Impact of Negative Sampling on Patent Citation Recommendation
Employing Active Learning for Training a DL-Model for Citation Identification in Patent Text
Comparing Complex Concepts with Transformers: Matching Patent Claims Against Natural Language Text
Improving Patent Classification using AI-Generated Summaries
Automated Patent Landscaping using Deep Learning
Ensemble Method for Classification in Imbalanced Patent Data
Patent Classification on Search-Optimized Graph-Based Representations
Large Language Model Informed Patent Image Retrieval
Semantic Views - Interactive Hierarchical Exploration for Patent Landscaping
Proceedings of the 4th Workshop on Patent Text Mining and Semantic Technologies (PatentSemTech) 2023 co-located with the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 2023), Taipeh, Taiwan, July 27th, 2023
ClaimCompare: A Data Pipeline for Evaluation of Novelty Destroying Patent Pairs
1st Workshop on Patent Text Mining and Semantic Technologies
Deep Learning Services for Patents
Deep Learning based Pipeline with Multichannel Inputs for Patent Classication
Benchmarking Natural Language Processing Algorithms for Patent Summarization
Text Mining to Measure Novelty and Diffusion of Technological Invent
Proceedings of the 1st Workshop on Patent Text Mining and Semantic Technologies, PatentSemTech@SEMANTiCS 2019, Karlsruhe, Germany, September 12, 2019
Logic Mill - A Knowledge Navigation System
Automatic Generation of Explanatory Text from Flowchart Images in Patents
Multi-Task Classification Model for Multilingual Patents
Explainable Artificial Intelligence for Highlighting and Searching in Patent Text 12-21
Visual Programming for Patent Mining
Semi-Supervised Learning Methods for Patent Classification Using Search-Optimized Graph-Based Representations
Extracting Syntactic Features from a Korean Treebank
Creating a Tree Adjoining Grammar from a Multilayer Treebank
Consistent dendrification: Trees from categories
The use of MCTAG to Process Elliptic Coordination
Motion verbs and semantic features in TAG
Proceedings of the 10th International Workshop on Tree Adjoining Grammar and Related Frameworks, TAG 2010, Yale University, New Haven, CT, USA, June 10-12, 2010
Semantic Interpretation of Unrealized Syntactic Material in LTAG
Context-Free Parsing of a Tree Adjoining Grammar Using Finite-State Machines
A comparison of the XTAG and CLE Grammars for English
Is Syntactic Binding Rational?
'Single Cycle' Languages: Empirical Evidence for TAG-Adjoining
Epsilon-Free Grammars and Lexicalized Grammars that Generate the Class of the Mildly Context-Sensitive Languages
Incremental Natural Language Generation with TAGs in the WIP project
Well-Nested Tree Languages and Attributed Tree Transducers
Proceedings of the 7th International Workshop on Tree Adjoining Grammar and Related Formalisms, TAG+ 2004, Vancouver, Canada, May 20-22, 2004
How to solve some failures of LTAG
SemTAG, the LORIA toolbox for TAG-based Parsing and Generation
Un outil pour calculer des arbres de dépendance à partir d'arbres de dérivation
Verification of Lexicalized Tree Adjoining Grammars
On defining TALs with logical constraints
Can the TAG derivation tree represent a semantic graph? An answer in the light of Meaning-Text Theory
Compositional Semantics of Coordination using Synchronous Tree Adjoining Grammar
TAG Parsing as Model Enumeration
Complexity of Linear Order Computation in Performance Grammar, TAG and HPSG
Recursive Matrix Systems (RMS) and TAG
Non-local Right Node Raising: an Analysis using Delayed Tree-Local MC-TAG
Cross-serial dependencies in Tagalog
Transforming Dependency Structures to LTAG Derivation Trees
Systematic Grammar Development in the XTAG Project