咨询与建议

限定检索结果

文献类型

  • 1,301 篇 会议
  • 53 篇 期刊文献
  • 1 册 图书

馆藏范围

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

日期分布

学科分类号

  • 1,071 篇 工学
    • 1,039 篇 计算机科学与技术...
    • 439 篇 软件工程
    • 152 篇 信息与通信工程
    • 149 篇 电气工程
    • 74 篇 控制科学与工程
    • 41 篇 网络空间安全
    • 17 篇 电子科学与技术(可...
    • 7 篇 化学工程与技术
    • 6 篇 农业工程
    • 5 篇 材料科学与工程(可...
    • 5 篇 生物工程
    • 4 篇 机械工程
    • 4 篇 光学工程
    • 4 篇 仪器科学与技术
    • 4 篇 动力工程及工程热...
    • 4 篇 交通运输工程
  • 297 篇 理学
    • 271 篇 数学
    • 68 篇 统计学(可授理学、...
    • 17 篇 物理学
    • 9 篇 系统科学
    • 8 篇 化学
    • 7 篇 生物学
  • 60 篇 管理学
    • 32 篇 图书情报与档案管...
    • 30 篇 管理科学与工程(可...
    • 19 篇 工商管理
  • 18 篇 教育学
    • 18 篇 教育学
  • 10 篇 经济学
    • 10 篇 应用经济学
  • 10 篇 法学
    • 7 篇 社会学
    • 4 篇 法学
  • 6 篇 农学
    • 6 篇 作物学
  • 1 篇 医学

主题

  • 244 篇 distributed comp...
  • 95 篇 distributed algo...
  • 78 篇 distributed comp...
  • 34 篇 distributed algo...
  • 29 篇 consensus
  • 28 篇 distributed syst...
  • 23 篇 approximation al...
  • 23 篇 computer systems...
  • 23 篇 algorithms
  • 23 篇 congest model
  • 22 篇 local model
  • 21 篇 fault tolerance
  • 21 篇 distributed grap...
  • 19 篇 cloud computing
  • 17 篇 message passing
  • 17 篇 shared memory
  • 16 篇 self-stabilizati...
  • 14 篇 graph algorithms
  • 14 篇 fault-tolerance
  • 14 篇 randomized algor...

机构

  • 30 篇 swiss fed inst t...
  • 26 篇 technion haifa
  • 18 篇 univ freiburg fr...
  • 14 篇 mit cambridge ma...
  • 11 篇 univ michigan an...
  • 11 篇 tel aviv univ te...
  • 11 篇 aalto univ espoo
  • 10 篇 carnegie mellon ...
  • 10 篇 technion dept co...
  • 10 篇 natl univ singap...
  • 8 篇 weizmann inst sc...
  • 8 篇 ben gurion univ ...
  • 8 篇 national univers...
  • 7 篇 cispa helmholtz ...
  • 7 篇 ben gurion univ ...
  • 6 篇 technion
  • 6 篇 ecole polytech f...
  • 6 篇 cnrs
  • 5 篇 georgetown univ ...
  • 5 篇 univ toronto on

作者

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

语言

  • 1,328 篇 英文
  • 26 篇 其他
  • 1 篇 中文
检索条件"任意字段=Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing"
1355 条 记 录,以下是171-180 订阅
排序:
On Register Linearizability and Termination  21
On Register Linearizability and Termination
收藏 引用
40th acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)
作者: Hadzilacos, Vassos Hu, Xing Toueg, Sam Univ Toronto Toronto ON Canada
It is well-known that, for deterministic algorithms, linearizable objects can be used as if they were atomic objects. As pointed out by Golab, Higham, and Woelfel, however, a randomized algorithm that works with atomi... 详细信息
来源: 评论
Message Optimality and Message-Time Trade-offs for APSP and Beyond  25
Message Optimality and Message-Time Trade-offs for APSP and ...
收藏 引用
proceedings of the acm symposium on principles of distributed computing
作者: Fabien Dufoulon Shreyas Pai Gopal Pandurangan Sriram Pemmaraju Peter Robinson School of Computing and Communications Lancaster University Lancaster United Kingdom IIT Madras Chennai India Department of Computer Science University of Houston Houston Texas USA University of Iowa Iowa City Iowa USA Augusta University Augusta Georgia USA
Round complexity is an extensively studied metric of distributed algorithms. In contrast, our knowledge of the message complexity of distributed computing problems and its relationship (if any) with round complexity i... 详细信息
来源: 评论
Understanding and Detecting Software Upgrade Failures in distributed Systems  21
Understanding and Detecting Software Upgrade Failures in Dis...
收藏 引用
28th acm symposium on Operating Systems principles (SOSP)
作者: Zhang, Yongle Yang, Junwen Jin, Zhuqi Sethi, Utsav Rodrigues, Kirk Lu, Shan Yuan, Ding Purdue Univ W Lafayette IN 47907 USA Univ Chicago Chicago IL 60637 USA Univ Toronto Toronto ON Canada
Upgrade is one of the most disruptive yet unavoidable maintenance tasks that undermine the availability of distributed systems. Any failure during an upgrade is catastrophic, as it further extends the service disrupti... 详细信息
来源: 评论
distributed (Δ+1)-COLORING VIA ULTRAFAST GRAPH SHATTERING
收藏 引用
SIAM JOURNAL ON computing 2020年 第3期49卷 497-539页
作者: Chang, Yi-Jun Li, Wenzheng Pettie, Seth Swiss Fed Inst Technol Inst Theoret Studies CH-8092 Zurich Switzerland Stanford Univ Comp Sci Dept Stanford CA 94305 USA Univ Michigan EECS Ann Arbor MI 48109 USA
Vertex coloring is one of the classic symmetry breaking problems studied in distributed computing. In this paper we present a new algorithm for (Delta+1)-list coloring in the randomized LOCAL model running in O(Det(d)... 详细信息
来源: 评论
Brief Announcement: Foraging in Particle Systems via Self-Induced Phase Changes  36
Brief Announcement: Foraging in Particle Systems via Self-In...
收藏 引用
36th International symposium on distributed computing, DISC 2022
作者: Oh, Shunhao Randall, Dana Richa, Andréa W. School of Computer Science Georgia Institute of Technology AtlantaGA United States School of Computing and Augmented Intelligence Arizona State University TempeAZ United States
The foraging problem asks how a collective of particles with limited computational, communication and movement capabilities can autonomously compress around a food source and disperse when the food is depleted or shif... 详细信息
来源: 评论
Brief Announcement: New distributed Interactive Proofs for Planarity: A Matter of Left and Right  25
Brief Announcement: New Distributed Interactive Proofs for P...
收藏 引用
proceedings of the acm symposium on principles of distributed computing
作者: Yuval Gil Merav Parter Weizmann Institute of Science Rehovot Israel
We provide new distributed interactive proofs (DIP) for planarity and related graph families. The notion of a distributed interactive proof (DIP) was introduced by Kol, Oshman, and Saxena (PODC 2018). In this setting,... 详细信息
来源: 评论
Brief Announcement: Towards Optimal distributed Delta Coloring  25
Brief Announcement: Towards Optimal Distributed Delta Colori...
收藏 引用
proceedings of the acm symposium on principles of distributed computing
作者: Manuel Jakob Yannic Maus TU Graz Graz Austria
The Δ-vertex coloring problem has become one of the prototypical problems for understanding the complexity of local distributed graph problems on constant-degree graphs. The major open problem is whether the problem ... 详细信息
来源: 评论
Brief Announcement: Revisiting Lower Bounds for Two-Step Consensus  25
Brief Announcement: Revisiting Lower Bounds for Two-Step Con...
收藏 引用
proceedings of the acm symposium on principles of distributed computing
作者: Fedor Ryabinin Alexey Gotsman Pierre Sutra IMDEA Software Institute Madrid Spain Universidad Politécnica de Madrid Madrid Spain Télécom SudParis Palaiseau France Inria Saclay Palaiseau France Institut Polytechnique de Paris Palaiseau France
A seminal result by Lamport shows that at least max{2e + f + 1, 2f + 1} processes are required to implement partially synchronous consensus that tolerates f process failures and can furthermore decide in two message d... 详细信息
来源: 评论
Brief Announcement: Wake Up and Join Me! An Energy-Efficient Algorithm for Maximal Matching in Radio Networks  21
Brief Announcement: Wake Up and Join Me! An Energy-Efficient...
收藏 引用
40th acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)
作者: Dani, Varsha Gupta, Aayush Hayes, Thomas P. Pettie, Seth Ronin Inst Montclair NJ 07043 USA Univ New Mexico Dept Comp Sci Albuquerque NM 87131 USA Univ Michigan Dept EECS Ann Arbor MI 48109 USA
We consider networks of small, autonomous devices that communicate with each other wirelessly. Minimizing energy usage is an important consideration in designing algorithms for such networks, as battery life is a cruc... 详细信息
来源: 评论
Brief Announcement: On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement  21
Brief Announcement: On the Message Complexity of Fault-Toler...
收藏 引用
40th acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)
作者: Kumar, Manish Molla, Anisur Rahaman Indian Stat Inst Kolkata India
This paper investigates on the message complexity of the two fundamental problems, namely, leader election and agreement in the crash-fault synchronous and fully-connected distributed network. We present randomized al... 详细信息
来源: 评论