咨询与建议

限定检索结果

文献类型

  • 740 篇 会议
  • 41 篇 期刊文献

馆藏范围

  • 781 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 607 篇 工学
    • 593 篇 计算机科学与技术...
    • 344 篇 软件工程
    • 93 篇 信息与通信工程
    • 67 篇 控制科学与工程
    • 64 篇 电气工程
    • 40 篇 网络空间安全
    • 12 篇 电子科学与技术(可...
    • 4 篇 机械工程
    • 4 篇 仪器科学与技术
    • 4 篇 化学工程与技术
    • 3 篇 光学工程
    • 3 篇 材料科学与工程(可...
    • 3 篇 农业工程
    • 2 篇 建筑学
    • 2 篇 生物医学工程(可授...
    • 2 篇 生物工程
  • 234 篇 理学
    • 218 篇 数学
    • 61 篇 统计学(可授理学、...
    • 12 篇 物理学
    • 6 篇 系统科学
    • 4 篇 化学
    • 3 篇 大气科学
    • 3 篇 生物学
  • 48 篇 管理学
    • 28 篇 管理科学与工程(可...
    • 22 篇 图书情报与档案管...
    • 18 篇 工商管理
  • 10 篇 经济学
    • 10 篇 应用经济学
  • 4 篇 法学
    • 3 篇 社会学
    • 1 篇 法学
  • 3 篇 农学
    • 3 篇 作物学
  • 1 篇 医学

主题

  • 224 篇 distributed comp...
  • 35 篇 distributed algo...
  • 26 篇 distributed comp...
  • 25 篇 computer systems...
  • 17 篇 algorithms
  • 15 篇 consensus
  • 15 篇 distributed syst...
  • 14 篇 fault tolerance
  • 12 篇 distributed algo...
  • 11 篇 computer network...
  • 10 篇 message passing
  • 10 篇 approximation al...
  • 9 篇 self-stabilizati...
  • 9 篇 shared memory
  • 8 篇 cloud computing
  • 8 篇 randomized algor...
  • 6 篇 parallel algorit...
  • 6 篇 computation theo...
  • 6 篇 coloring
  • 6 篇 sensor networks

机构

  • 7 篇 ben gurion univ ...
  • 5 篇 technion
  • 5 篇 department of co...
  • 4 篇 technion haifa
  • 4 篇 college of compu...
  • 4 篇 department of co...
  • 4 篇 eth comp engn & ...
  • 4 篇 yale univ dept c...
  • 3 篇 univ of californ...
  • 3 篇 univ of toronto ...
  • 3 篇 computer enginee...
  • 3 篇 cispa helmholtz ...
  • 3 篇 yale university
  • 3 篇 university of fr...
  • 3 篇 technion israel ...
  • 3 篇 hebrew univ jeru...
  • 3 篇 mit cambridge ma...
  • 3 篇 irisa rennes
  • 3 篇 eth zurich
  • 3 篇 cnrs university ...

作者

  • 13 篇 kuhn fabian
  • 13 篇 awerbuch baruch
  • 13 篇 raynal michel
  • 12 篇 peleg david
  • 12 篇 kutten shay
  • 11 篇 toueg sam
  • 11 篇 patt-shamir boaz
  • 11 篇 wattenhofer roge...
  • 10 篇 guerraoui rachid
  • 10 篇 gafni eli
  • 10 篇 dolev danny
  • 9 篇 elkin michael
  • 9 篇 rajsbaum sergio
  • 9 篇 attiya hagit
  • 8 篇 khandekar rohit
  • 8 篇 pandurangan gopa...
  • 8 篇 aspnes james
  • 8 篇 fraigniaud pierr...
  • 7 篇 korman amos
  • 7 篇 herlihy maurice

语言

  • 774 篇 英文
  • 6 篇 其他
  • 1 篇 中文
检索条件"任意字段=Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing"
781 条 记 录,以下是171-180 订阅
排序:
Brief Announcement: Locality-Based Aggregate Computation in Wireless Sensor Networks
Brief Announcement: Locality-Based Aggregate Computation in ...
收藏 引用
28th annual acm symposium on principles of distributed computing
作者: Chen, Jen-Yeu Pandurangan, Gopal Hu, Jianghai Natl Dong Haw Univ Hualien 974 Taiwan
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages and O(n(3/2)/log(1/2)n) one-hop wireless... 详细信息
来源: 评论
distributed ALGORITHM FOR DEADLOCK DETECTION AND RESOLUTION.
DISTRIBUTED ALGORITHM FOR DEADLOCK DETECTION AND RESOLUTION.
收藏 引用
proceedings of the third annual acm symposium on principles of distributed computing.
作者: Mitchell, Don P. Merritt, Michael J. AT&T Bell Lab Murray Hill NJ USA AT&T Bell Lab Murray Hill NJ USA
This paper presents two distributed algorithms for detecting and resolving deadlocks. By insuring that only one of the deadlock processes will detect it, the problem of resolving the deadlock is simplified. That proce... 详细信息
来源: 评论
Unifying self-stabilization and fault-tolerance  93
Unifying self-stabilization and fault-tolerance
收藏 引用
proceedings of the 12th annual acm symposium on principles of distributed computing
作者: Gopal, Ajei S. Perry, Kenneth J. I.B.M. T.J. Watson Research Cent Yorktown Heights NY United States
In this paper we combine two previously disparate aspects of reliable distributed computing - self-stabilization, i.e., tolerance of systemic failures, and fault-tolerance, i.e., tolerance of process failures. We defi... 详细信息
来源: 评论
Optimal space distributed move-to-front lists  91
Optimal space distributed move-to-front lists
收藏 引用
10th annual acm symposium on principles of distributed computing, PODC 1991
作者: Saks, Michael Zaharoglou, Fotios Department of Computer Science and Engineering University of California San Diego United States
A distributed move-to-front list is a data object that abstracts a temporal ordering on a set of processes in a distributed system. We present a lower bound and a matching upper bound of ®(log2n) bits on the spac...
来源: 评论
Crash failures vs. crash + link failures  96
Crash failures vs. crash + link failures
收藏 引用
proceedings of the 1996 15th annual acm symposium on principles of distributed computing
作者: Basu, Anindya Charron-Bost, Bernadette Toueg, Sam Cornell Univ Ithaca NY United States
The problem of tolerating crash/or link failures has been extensively studied. These studies focused on a single link, and how to mask failures of that link. In contrast, this paper studies lossy links in the context ... 详细信息
来源: 评论
Polylog randomized wait-free consensus  96
Polylog randomized wait-free consensus
收藏 引用
proceedings of the 1996 15th annual acm symposium on principles of distributed computing
作者: Chandra, Tushar Deepak I.B.M. Thomas J. Watson Research Cent Hawthorne NY United States
I present the first randomized wait-free implementation of consensus from multiple writer multiple reader register in which each process takes polylog (O(log2n)) expected steps. To achieve this result, I assume a non-... 详细信息
来源: 评论
Simple algorithmically reasoned characterization of wait-free computations
Simple algorithmically reasoned characterization of wait-fre...
收藏 引用
proceedings of the 1997 16th annual acm symposium on principles of distributed computing
作者: Borowsky, Elizabeth Gafni, Eli Univ of California Los Angeles Los Angeles United States
This paper introduces two new novel tools for the study of distributed computing and shows their utility by using them to exhibit a simple derivation of the Herlihy and Shavit characterization of wait-free shared-memo... 详细信息
来源: 评论
Bounds on the shared memory requirements for long-lived & adaptive objects
Bounds on the shared memory requirements for long-lived & ad...
收藏 引用
19th annual acm symposium on principles of distributed computing
作者: Afek, Yehuda Boxer, Pazi Touitou, Dan Tel-Aviv Univ Herzliya Israel
In a previous study, Burns and Lynch proved that at least n multi-writer-multi-reader (MWMR) registers are necessary in any mutual exclusion algorithm that uses only MWMR registers. The present work extends the techni... 详细信息
来源: 评论
Dynamic hashing + quorum = efficient location management for mobile computing systems  97
Dynamic hashing + quorum = efficient location management for...
收藏 引用
proceedings of the 1997 16th annual acm symposium on principles of distributed computing
作者: Prakash, Ravi Singhal, Mukesh Univ of Rochester Rochester NY United States
A new location management strategy that employs dynamic hashing and quorums is presented. Location information of a mobile host is replicated at a subset of location servers. New location can be added to the system as... 详细信息
来源: 评论
A Lattice-Theoretic Characterization of Safety and Liveness  03
A Lattice-Theoretic Characterization of Safety and Liveness
收藏 引用
twenty-Second annual acm symposium on principles of distributed computing, PODC 2003
作者: Manolios, Panagiotis Trefler, Richard Georgia Institute of Technology College of Computing CERCS Lab 801 Atlantic Drive Atlanta GA 30332 United States University of Waterloo School of Computer Science 200 University Avenue West Waterloo Ont. N2L 3G1 Canada
The distinction between safety and liveness properties is due to Lamport who gave the following informal characterization. Safety properties assert that nothing bad ever happens while liveness properties assert that s... 详细信息
来源: 评论