咨询与建议

限定检索结果

文献类型

  • 1,338 篇 会议
  • 54 篇 期刊文献
  • 1 册 图书

馆藏范围

  • 1,393 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 1,075 篇 工学
    • 1,034 篇 计算机科学与技术...
    • 459 篇 软件工程
    • 158 篇 信息与通信工程
    • 146 篇 电气工程
    • 77 篇 控制科学与工程
    • 42 篇 网络空间安全
    • 16 篇 电子科学与技术(可...
    • 8 篇 化学工程与技术
    • 8 篇 农业工程
    • 6 篇 仪器科学与技术
    • 6 篇 建筑学
    • 6 篇 生物工程
    • 5 篇 机械工程
    • 5 篇 生物医学工程(可授...
    • 4 篇 光学工程
    • 4 篇 材料科学与工程(可...
  • 296 篇 理学
    • 269 篇 数学
    • 70 篇 统计学(可授理学、...
    • 17 篇 物理学
    • 9 篇 化学
    • 9 篇 系统科学
    • 8 篇 生物学
    • 6 篇 大气科学
  • 65 篇 管理学
    • 34 篇 图书情报与档案管...
    • 33 篇 管理科学与工程(可...
    • 23 篇 工商管理
  • 15 篇 教育学
    • 15 篇 教育学
  • 13 篇 经济学
    • 13 篇 应用经济学
  • 9 篇 法学
    • 7 篇 社会学
  • 8 篇 农学
    • 8 篇 作物学
  • 1 篇 医学

主题

  • 246 篇 distributed comp...
  • 96 篇 distributed algo...
  • 79 篇 distributed comp...
  • 34 篇 distributed algo...
  • 29 篇 consensus
  • 25 篇 distributed syst...
  • 24 篇 congest model
  • 23 篇 approximation al...
  • 23 篇 computer systems...
  • 23 篇 local model
  • 23 篇 algorithms
  • 21 篇 distributed grap...
  • 20 篇 fault tolerance
  • 19 篇 cloud computing
  • 17 篇 shared memory
  • 16 篇 self-stabilizati...
  • 15 篇 message passing
  • 15 篇 fault-tolerance
  • 14 篇 lower bounds
  • 13 篇 graph algorithms

机构

  • 27 篇 swiss fed inst t...
  • 24 篇 technion haifa
  • 17 篇 mit cambridge ma...
  • 16 篇 univ freiburg fr...
  • 11 篇 tel aviv univ te...
  • 10 篇 univ michigan an...
  • 10 篇 carnegie mellon ...
  • 10 篇 technion dept co...
  • 10 篇 aalto univ espoo
  • 10 篇 natl univ singap...
  • 8 篇 weizmann inst sc...
  • 8 篇 cispa helmholtz ...
  • 8 篇 ben gurion univ ...
  • 8 篇 national univers...
  • 7 篇 ben gurion univ ...
  • 6 篇 ecole polytech f...
  • 6 篇 cnrs
  • 6 篇 univ texas austi...
  • 5 篇 georgetown univ ...
  • 5 篇 aalto university...

作者

  • 24 篇 kuhn fabian
  • 20 篇 ghaffari mohsen
  • 18 篇 suomela jukka
  • 18 篇 censor-hillel ke...
  • 17 篇 raynal michel
  • 17 篇 fraigniaud pierr...
  • 16 篇 elkin michael
  • 15 篇 chang yi-jun
  • 15 篇 wattenhofer roge...
  • 15 篇 pandurangan gopa...
  • 15 篇 brandt sebastian
  • 14 篇 peleg david
  • 14 篇 toueg sam
  • 14 篇 olivetti dennis
  • 14 篇 kutten shay
  • 13 篇 balliu alkida
  • 13 篇 patt-shamir boaz
  • 13 篇 guerraoui rachid
  • 12 篇 rajsbaum sergio
  • 12 篇 maus yannic

语言

  • 1,366 篇 英文
  • 26 篇 其他
  • 1 篇 中文
检索条件"任意字段=Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing"
1393 条 记 录,以下是1311-1320 订阅
排序:
Highly-available distributed services and fault-tolerant distributed garbage collection  86
Highly-available distributed services and fault-tolerant dis...
收藏 引用
5th Annual acm symposium on principles of distributed computing, PODC 1986
作者: Liskov, Barbara Ladin, Rivka Massachusetts Institute of Technology United States
This paper describes two techniques that are only loosely related. The first is a method for constructing a highly available service for use in a distributed system. The service presents its clients with a consistent ... 详细信息
来源: 评论
On the bit complexity of distributed computations in a ring with a leader  86
On the bit complexity of distributed computations in a ring ...
收藏 引用
5th Annual acm symposium on principles of distributed computing, PODC 1986
作者: Mansour, Y. Zaks, S. Department of Computer Science Technion - Israel Institute of Technology Haifa32000 Israel
We study the bit complexity of pattern recognition in a distributed ring with a leader. Each processor gets as input a letter from some alphabet, and these concatenated letters, starting at the leader, form the patter... 详细信息
来源: 评论
A communication-efficient canonical form for fault-tolerant distributed protocols  86
A communication-efficient canonical form for fault-tolerant ...
收藏 引用
5th Annual acm symposium on principles of distributed computing, PODC 1986
作者: Coan, Brian A. Massachusetts Institute of Technology United States
Many fault-tolerant distributed protocols are known. Some of these require a large (exponential) amount of communication. We present a general simulation of any synchronous fault-tolerant consensus protocol by a commu... 详细信息
来源: 评论
Limitations on database availability when networks partition  86
Limitations on database availability when networks partition
收藏 引用
5th Annual acm symposium on principles of distributed computing, PODC 1986
作者: Coan, Brian A. Oki, Brian M. Kolodner, Elliot K. Laboratory for Computer Science Massachusetts Institute of Technology CambridgeMA02139 United States
In designing fault-tolerant distributed database systems, a frequent goal is making the system highly available despite component failure. We examine software approaches to achieving high availability in the presence ... 详细信息
来源: 评论
Conference Record of the Annual acm symposium on principles of Programming Languages
Conference Record of the Annual ACM Symposium on Principles ...
收藏 引用
13th AnnuaJ acm symposium on the principles of Programming Languages, POPL 1986
The proceedings contain 30 papers. The topics discussed include: a maximum flow approach to anomaly isolation in unification-based incremental type inference;code motion of control structures in high-level languages;h...
来源: 评论
Gap theorems for distributed computation  5
Gap theorems for distributed computation
收藏 引用
5th Annual acm symposium on principles of distributed computing, PODC 1986
作者: Moran, Shlomo Warmuth, Manfred K. Department of Computer Science Technion Haifa32000 Israel Department of Computer and Information Sciences University of California Santa CruzCA95064 United States
Consider a ring of n anonymous processors, i.e. the processors have no id's. Each processor receives an input string and the ring is to compute a function of the circular input configuration in the asynchronous bi... 详细信息
来源: 评论
Slowing sequential algorithms for obtaining fast distributed and parallel algorithms: Maximum matchings  86
Slowing sequential algorithms for obtaining fast distributed...
收藏 引用
5th Annual acm symposium on principles of distributed computing, PODC 1986
作者: Schieber, Baruch Moran, Shlomo Department of Computer Science School of Mathematical Sciences Tel Aviv University Tel Aviv69978 Israel IBM J. Watson Research Center Yorktown HeightsNY10598 United States Department of Computer Science Technion Haifa32000 Israel
One of the most studied problems in combinatorial optimization is the maximum matching problem. A new technique for designing algorithms for finding maximum matchings is presented. This technique is based on finding t... 详细信息
来源: 评论
Gap theorems for distributed computing  86
Gap theorems for distributed computing
收藏 引用
proceedings of the fifth annual acm symposium on principles of distributed computing
作者: Shlomo Moran Manfred Warmuth Department of Computer Science the Technion Haifa 32000 Israel and IBM Thomas J. Watson Research Center Yorktown Heights NY Department of Computer and Information Sciences University of California Santa Cruz CA
来源: 评论
proceedings of the Annual acm symposium on principles of distributed computing
Proceedings of the Annual ACM Symposium on Principles of Dis...
收藏 引用
4th Annual acm symposium on principles of distributed computing, PODC 1985
The proceedings contain 27 papers. The topics discussed include: easy impossibility proofs for distributed consensus problems;symmetry and similarity in distributed systems;site optimal termination protocols for a dis...
来源: 评论
Terminating iterative solution of simultaneous equations in distributed-messase passing systems  85
Terminating iterative solution of simultaneous equations in ...
收藏 引用
4th Annual acm symposium on principles of distributed computing, PODC 1985
作者: Szymanski, B. Shi, Y. Prywes, N. Department Of-Computer and Information Science University of Pennsylvania PhiladelphiaPA19104 United States
An efficient algorithm for synchronized termination of iterative solution of simultaneous equations in a distributed message passing system is presented. The algorithm is based on an assumption that distributed proces... 详细信息
来源: 评论