scientific article; zbMATH DE number 1979286
From MaRDI portal
zbMath1019.68556MaRDI QIDQ4425703
Publication date: 11 September 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2523/25230213.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A new approach to on-demand loop-free routing in ad hoc networks, Geometric ad-hoc routing, Operation-valency and the cost of coordination, Peer-to-peer systems for prefix search, Routing networks for distributed hash tables, An asynchronous protocol for distributed computation of RSA inverses and its applications, Efficient revocation and threshold pairing based cryptosystems, Constructing fair-exchange protocols for E-commerce via distributed computation of RSA signatures, Distributed consensus in the presence of sectional faults, Efficient player-optimal protocols for strong and differential consensus, tight bounds for k-set agreement with limited-scope failure detectors, Proactive secure message transmission in asynchronous networks, Algorithms for dynamic multicast key distribution trees, A work-optimal deterministic algorithm for the asynchronous certified write-all problem, Performing work with asynchronous processors, Fair group mutual exclusion, Efficient and practical constructions of LL/SC variables, Adaptive and efficient abortable mutual exclusion, Automatic discovery of mutual exclusion algorithms, On implementing omega with weak reliability and synchrony assumptions, A lattice-theoretic characterization of safety and liveness, Scaling properties of the Internet graph, On a network creation game, Adapting to a reliable network path, Adaptive AIMD congestion control, Compact roundtrip routing with topology-independent node names, Constant-time distributed dominating set approximation, Scalable and dynamic quorum systems, Oblivious signature-based envelope, Scalable public-key tracing and revoking, Broadcasting in undirected ad hoc radio networks, Efficient reliable communication over partially authenticated networks, Asynchronous resource discovery, Distributed error confinement, Split-ordered lists
