咨询与建议

限定检索结果

文献类型

  • 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 订阅
排序:
Error-Free Multi-Valued Consensus with Byzantine Failures  11
Error-Free Multi-Valued Consensus with Byzantine Failures
收藏 引用
30th annual acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)
作者: Liang, Guanfeng Vaidya, Nitin Univ Illinois Dept Elect & Comp Engn Urbana IL 61801 USA
In this paper, we present an efficient deterministic algorithm for consensus in presence of Byzantine failures. Our algorithm achieves consensus on an L-bit value with communication complexity O(nL + n(4)L(0.5) + n(6)... 详细信息
来源: 评论
Breaking the O(n2) Bit Barrier: Scalable Byzantine Agreement with an Adaptive Adversary
Breaking the <i>O</i>(<i>n</i><SUP>2</SUP>) Bit Barrier: Sca...
收藏 引用
29th acm SIGACT-SIGOPS symposium on principles of distributed computing
作者: King, Valerie Saia, Jared Univ Victoria Dept Comp Sci Victoria BC V8W 3P6 Canada Univ New Mexico Dept Comp Sci Albuquerque NM 87131 USA
We describe an algorithm for Byzantine agreement that is scalable in the sense that each processor sends only (O) over tilde(root n) bits, where n is the total number of processors. Our algorithm succeeds with high pr... 详细信息
来源: 评论
A Tight Unconditional Lower Bound on distributed Random Walk Computation  11
A Tight Unconditional Lower Bound on Distributed Random Walk...
收藏 引用
30th annual acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)
作者: Nanongkai, Danupon Das Sarma, Atish Pandurangan, Gopal Univ Vienna A-1010 Vienna Austria
We consider the problem of performing a random walk in a distributed network. Given bandwidth constraints, the goal of the problem is to minimize the number of rounds required to obtain a random walk sample. Das Sarma... 详细信息
来源: 评论
Logical Attestation: An Authorization Architecture for Trustworthy computing  11
Logical Attestation: An Authorization Architecture for Trust...
收藏 引用
23rd acm symposium on Operating Systems principles (SOSP 2011)
作者: Sirer, Emin Guen de Bruijn, Willem Reynolds, Patrick Shieh, Alan Walsh, Kevin Williams, Dan Schneider, Fred B. Cornell Univ Dept Comp Sci Ithaca NY 14853 USA
This paper describes the design and implementation of a new operating system authorization architecture to support trustworthy computing. Called logical attestation, this architecture provides a sound framework for re... 详细信息
来源: 评论
Coordinated Consensus in Dynamic Networks  11
Coordinated Consensus in Dynamic Networks
收藏 引用
30th annual acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)
作者: Kuhn, Fabian Moses, Yoram Oshman, Rotem Univ Lugano Fac Informat CH-6904 Lugano Switzerland
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adversary. The network topology is always c... 详细信息
来源: 评论
Breaking Up is Hard to Do: Security and Functionality in a Commodity Hypervisor  11
Breaking Up is Hard to Do: Security and Functionality in a C...
收藏 引用
23rd acm symposium on Operating Systems principles (SOSP 2011)
作者: Colp, Patrick Nanavati, Mihir Zhu, Jun Aiello, William Coker, George Deegan, Tim Loscocco, Peter Warfield, Andrew Univ British Columbia Dept Comp Sci Vancouver BC V5Z 1M9 Canada
Cloud computing uses virtualization to lease small slices of large-scale datacenter facilities to individual paying customers. These multi-tenant environments, on which numerous large and popular web-based application... 详细信息
来源: 评论
Fast and Compact Self Stabilizing Verification, Computation, and Fault Detection of an MST  11
Fast and Compact Self Stabilizing Verification, Computation,...
收藏 引用
30th annual acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)
作者: Korman, Amos Kutten, Shay Masuzawa, Toshimitsu CNRS Paris France
This paper demonstrates the usefulness of distributed local verification of proofs, as a tool for the design of algorithms. In particular, it introduces a somewhat generalized notion of distributed local proofs, and u... 详细信息
来源: 评论
Secure Network Provenance  11
Secure Network Provenance
收藏 引用
23rd acm symposium on Operating Systems principles (SOSP 2011)
作者: Zhou, Wenchao Fei, Qiong Narayan, Arjun Haeberlen, Andreas Loo, Boon Thau Sherr, Micah Univ Penn Philadelphia PA 19104 USA
This paper introduces secure network provenance (SNP), a novel technique that enables networked systems to explain to their operators why they are in a certain state - e.g., why a suspicious routing table entry is pre... 详细信息
来源: 评论
Thialfi: A Client Notification Service for Internet-Scale Applications  11
Thialfi: A Client Notification Service for Internet-Scale Ap...
收藏 引用
23rd acm symposium on Operating Systems principles (SOSP 2011)
作者: Adya, Atul Cooper, Gregory Myers, Daniel Piatek, Michael Google Inc Mountain View CA 94043 USA
Ensuring the freshness of client data is a fundamental problem for applications that rely on cloud infrastructure to store data and mediate sharing. Thialfi is a notification service developed at Google to simplify th... 详细信息
来源: 评论
distributed Graph Coloring in a Few Rounds  11
Distributed Graph Coloring in a Few Rounds
收藏 引用
30th annual acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)
作者: Kothapalli, Kishore Pemmaraju, Sriram Int Inst Informat Technol Ctr Secur Theory & Algorithm Res Hyderabad 500032 Andhra Pradesh India
This paper considers the question of how many colors a distributed graph coloring algorithm would need to use if it had only k rounds available, for any positive integer k. In our main result, we present an algorithm ... 详细信息
来源: 评论