咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是21-30 订阅
排序:
Universally Optimal Information Dissemination and Shortest Paths in the HYBRID distributed Model  24
Universally Optimal Information Dissemination and Shortest P...
收藏 引用
43rd acm SIGACT-SIGOPS symposium on principles of distributed computing, PODC 2024
作者: Chang, Yi-Jun Hecht, Oren Leitersdorf, Dean Schneider, Philipp National University of Singapore Singapore Technion Israel University of Bern Switzerland
In most modern networks, nodes have access to various modes of communication each with different characteristics. In this work we consider the Hybrid model of distributed computing, introduced recently by Augustine, H... 详细信息
来源: 评论
Brief Announcement: On the Limits of Information Spread by Memory-less Agents  24
Brief Announcement: On the Limits of Information Spread by M...
收藏 引用
43rd acm SIGACT-SIGOPS symposium on principles of distributed computing, PODC 2024
作者: D'Archivio, Niccolò Vacus, Robin Coati Inria d'Université Côte d'Azur Sophia Antipolis France Bocconi Institute for Data Science and Analytics Milan Italy
We address the self-stabilizing bit-dissemination problem, designed to capture the challenges of spreading information and reaching consensus among entities with minimal cognitive and communication capacities. Specifi... 详细信息
来源: 评论
Swiper: a new paradigm for efficient weighted distributed protocols  24
Swiper: a new paradigm for efficient weighted distributed pr...
收藏 引用
43rd acm SIGACT-SIGOPS symposium on principles of distributed computing, PODC 2024
作者: Tonkikh, Andrei Freitas, Luciano Ltci Télécom Paris Institut Polytechnique de Paris Palaiseau France
The majority of fault-tolerant distributed algorithms are designed assuming a nominal corruption model, in which at most a fraction fn of parties can be corrupted by the adversary. However, due to the infamous Sybil a... 详细信息
来源: 评论
System Optimizations for Enabling Training of Extreme Long Sequence Transformer Models  24
System Optimizations for Enabling Training of Extreme Long S...
收藏 引用
43rd acm SIGACT-SIGOPS symposium on principles of distributed computing, PODC 2024
作者: Jacobs, Sam Ade Tanaka, Masahiro Zhang, Chengming Zhang, Minjia Aminadabi, Reza Yazdani Song, Shuaiwen Leon Rajbhandari, Samyam He, Yuxiong Microsoft Inc Redmond United States
Computation in a typical Transformer-based large language model (LLM) can be characterized by batch size, hidden dimension, number of layers, and sequence length. Until now, system works for accelerating LLM training ... 详细信息
来源: 评论
The Computational Power of distributed Shared-Memory Models with Bounded-Size Registers  24
The Computational Power of Distributed Shared-Memory Models ...
收藏 引用
43rd acm SIGACT-SIGOPS symposium on principles of distributed computing, PODC 2024
作者: Delporte-Gallet, Carole Fauconnier, Hugues Fraigniaud, Pierre Rajsbaum, Sergio Travers, Corentin IRIF University Paris Cité CNRS Paris France Irif and Instituto de Matemàticas Unam Mexico City Mexico Lis University Aix-Marseille CNRS Marseille France
The celebrated Asynchronous Computability Theorem of Herlihy and Shavit (Jacm 1999) provided a topological characterization of the tasks that are wait-free solvable by processes communicating through writing and readi... 详细信息
来源: 评论
Even-Cycle Detection in the Randomized and Quantum CONGEST Model  24
Even-Cycle Detection in the Randomized and Quantum CONGEST M...
收藏 引用
43rd acm SIGACT-SIGOPS symposium on principles of distributed computing, PODC 2024
作者: Fraigniaud, Pierre Luce, Maël Magniez, Frederic Todinca, Ioan Université Paris Cité CNRS IRIF Paris France Université d'Orléans INSA-Centre Val de Loire LIFO Orléans France
We show that, for every k ≥ 2, C2k-freeness can be decided in O(n1 - 1/k) rounds in the CONGEST model by a randomized Monte-Carlo distributed algorithm with one-sided error probability 1/3. This matches the best roun... 详细信息
来源: 评论
Brief Announcement: Simpler and More General distributed Coloring Based on Simple List Defective Coloring Algorithms  24
Brief Announcement: Simpler and More General Distributed Col...
收藏 引用
43rd acm SIGACT-SIGOPS symposium on principles of distributed computing, PODC 2024
作者: Fuchs, Marc Kuhn, Fabian University of Freiburg Germany
In this paper, we give list coloring variants of simple iterative defective coloring algorithms. Formally, in a list defective coloring instance, each node v of a graph is given a list Lv of colors and a list of allow... 详细信息
来源: 评论
Visibility Algorithms for Dynamic Dependence Analysis and distributed Coherence  23
Visibility Algorithms for Dynamic Dependence Analysis and Di...
收藏 引用
28th acm SIGPLAN annual symposium on principles and Practice of Parallel Programming, PPoPP 2023
作者: Bauer, Michael Slaughter, Elliott Treichler, Sean Lee, Wonchan Garland, Michael Aiken, Alex NVIDIA United States SLAC National Accelerator Laboratory Stanford University United States
Implicitly parallel programming systems must solve the joint problems of dependence analysis and coherence to ensure apparently-sequential semantics for applications run on distributed memory machines. Solving these p... 详细信息
来源: 评论
Completing the Node-Averaged Complexity Landscape of LCLs on Trees  24
Completing the Node-Averaged Complexity Landscape of LCLs on...
收藏 引用
43rd acm SIGACT-SIGOPS symposium on principles of distributed computing, PODC 2024
作者: Balliu, Alkida Brandt, Sebastian Kuhn, Fabian Olivetti, Dennis Schmid, Gustav Gran Sasso Science Institute L'Aquila Italy Cispa Helmholtz Center for Information Security Saarbrücken Germany University of Freiburg Freiburg Germany
The node-averaged complexity of a problem captures the number of rounds nodes of a graph have to spend on average to solve the problem in the LOCAL model. A challenging line of research with regards to this new comple... 详细信息
来源: 评论
(1-ϵ)-Approximate Maximum Weighted Matching in poly(1/ϵ, log n) Time in the distributed and Parallel Settings  23
(1-ϵ)-Approximate Maximum Weighted Matching in poly(1/ϵ, l...
收藏 引用
42nd acm SIGACT-SIGOPS symposium on principles of distributed computing, PODC 2023
作者: Huang, Shang-En Su, Hsin-Hao Boston College Chestnut HillMA United States
The maximum weighted matching (mwm) problem is one of the most well-studied combinatorial optimization problems in distributed graph algorithms. Despite a long development on the problem, and the recent progress of Fi... 详细信息
来源: 评论