咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是91-100 订阅
排序:
Near-Optimal distributed Maximum Flow
Near-Optimal Distributed Maximum Flow
收藏 引用
34th annual acm symposium on principles of distributed computing (PODC)
作者: Ghaffari, Mohsen Karrenbauer, Andreas Kuhn, Fabian Lenzen, Christoph Patt-Shamir, Boaz MIT Cambridge MA 02139 USA MPI Informat D-66123 Saarbrucken Germany Univ Freiburg D-79110 Freiburg Germany Tel Aviv Univ IL-6997801 Tel Aviv Israel
We present a near-optimal distributed algorithm for (1+o(1))-approximation of single-commodity maximum flow in undirected weighted networks that runs in (D + root n).n(o(1)) communication rounds in the CONGEST model. ... 详细信息
来源: 评论
Brief Announcement: Robust and Private distributed Shared Atomic Memory in Message Passing Networks  15
Brief Announcement: Robust and Private Distributed Shared At...
收藏 引用
34th annual acm symposium on principles of distributed computing (PODC)
作者: Dolev, Shlomi Petig, Thomas Schiller, Elad M. Ben Gurion Univ Negev Dept Comp Sci IL-84105 Beer Sheva Israel Chalmers Univ Technol Dept Comp Sci & Engn S-41296 Gothenburg Sweden
We study the problem of privately emulating shared memory in message passing networks. The system includes N servers, and at most e semi-Byzantine servers that can deviate from the algorithm by sending corrupted data.... 详细信息
来源: 评论
Safety-Liveness Exclusion in distributed computing  15
Safety-Liveness Exclusion in Distributed Computing
收藏 引用
34th annual acm symposium on principles of distributed computing (PODC)
作者: Bushkov, Victor Guerraoui, Rachid Ecole Polytech Fed Lausanne IC LPD Lausanne Switzerland
The history of distributed computing is full of trade-offs between safety and liveness. For instance, one of the most celebrated results in the field, namely the impossibility of consensus in an asynchronous system ba... 详细信息
来源: 评论
Randomized Proof-Labeling Schemes  15
Randomized Proof-Labeling Schemes
收藏 引用
34th annual acm symposium on principles of distributed computing (PODC)
作者: Baruch, Mor Fraigniaud, Pierre Patt-Shamir, Boaz Tel Aviv Univ Sch Elect Engn Tel Aviv Israel CNRS Dept Comp Sci Paris France Univ Paris Diderot Paris France
Proof-labeling schemes, introduced by Korman, Kutten and Peleg [PODC 2005], are a mechanism to certify that a network configuration satisfies a given boolean predicate. Such mechanisms find applications in many contex... 详细信息
来源: 评论
Brief Announcement: Fault-tolerant Broadcast in Anonymous distributed Systems with Fair Lossy Communication Channels  15
Brief Announcement: Fault-tolerant Broadcast in Anonymous Di...
收藏 引用
34th annual acm symposium on principles of distributed computing (PODC)
作者: Tang, Jian Larrea, Mikel Arevalo, Sergio Jimenez, Ernesto Tech Univ Madrid Distributed Syst Lab LSD Madrid 28031 Spain Univ Basque Country UPV EHU San Sebastian 20018 Spain Tech Univ Madrid Madrid 28031 Spain Escuela Politec Nacl Quito 170515 Ecuador
Fault-tolerant broadcast is a fundamental service in distributed systems, by which processes can communicate with each other consistently and reliably. It has two main forms: Reliable Broadcast (RB) and Uniform Reliab... 详细信息
来源: 评论
The "Mobile Adversary" Paradigm in distributed Computation and Systems  15
The "Mobile Adversary" Paradigm in Distributed Computation a...
收藏 引用
34th annual acm symposium on principles of distributed computing (PODC)
作者: Yung, Moti Google Inc New York NY 10011 USA Columbia Univ New York NY USA
The notion of mobile adversary, where the opponent can capture parties in a multi-party protocol dynamically, as long as at any given point in time its capturing capability is limited by a bound on number of parties (... 详细信息
来源: 评论
Near-Optimal Scheduling of distributed Algorithms  15
Near-Optimal Scheduling of Distributed Algorithms
收藏 引用
34th annual acm symposium on principles of distributed computing (PODC)
作者: Ghaffari, Mohsen MIT Cambridge MA 02139 USA
This paper studies the question of how to run many distributed algorithms, solving independent problems, together as fast as possible. Suppose that we want to run distributed algorithms A(1);A(2) ...;A(k) in the CONGE... 详细信息
来源: 评论
distributed Convex Thresholding  15
Distributed Convex Thresholding
收藏 引用
34th annual acm symposium on principles of distributed computing (PODC)
作者: Wolff, Ran Yahoo Labs Haifa Israel
Over the last fifteen years, a large group of algorithms emerged which compute various predicates from distributed data with a focus on communication efficiency. These algorithms are often called "communication-e... 详细信息
来源: 评论
distributed Resource Discovery in Sub-Logarithmic Time  15
Distributed Resource Discovery in Sub-Logarithmic Time
收藏 引用
34th annual acm symposium on principles of distributed computing (PODC)
作者: Haeupler, Bernhard Malkhi, Dahlia Carnegie Mellon Univ Sch Comp Sci Pittsburgh PA 15213 USA VMware Res Palo Alto CA 94304 USA
We present a new distributed algorithm for the resource discovery problem introduced by Harchol-Balter, Leighton, and Levin in PODC'99. The resource discovery problem consists of a synchronous network with n machi... 详细信息
来源: 评论
Algebraic Methods in the Congested Clique  15
Algebraic Methods in the Congested Clique
收藏 引用
34th annual acm symposium on principles of distributed computing (PODC)
作者: Censor-Hillel, Keren Kaski, Petteri Korhonen, Janne H. Lenzen, Christoph Paz, Ami Suomela, Jukka Technion Haifa Israel Helsinki Inst Informat Technol Helsinki Finland Aalto Univ Espoo Finland Univ Helsinki Helsinki Finland MPI Informat Saarbrucken Germany
In this work, we use algebraic methods for studying distance computation and subgraph detection tasks in the congested clique model. Specifically, we adapt parallel matrix multiplication implementations to the congest... 详细信息
来源: 评论