咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是101-110 订阅
排序:
Fast distributed Almost Stable Matchings  15
Fast Distributed Almost Stable Matchings
收藏 引用
34th annual acm symposium on principles of distributed computing (PODC)
作者: Ostrovsky, Rafail Rosenbaum, Will Univ Calif Los Angeles Dept Comp Sci 4732 Boelter Hall Los Angeles CA 90095 USA Univ Calif Los Angeles Dept Math Los Angeles CA 90095 USA
In their seminal work on the Stable Marriage Problem, Gale and Shapley [4] describe an algorithm which finds a stable matching in O (n(2)) communication rounds. Their algorithm has a natural interpretation as a distri... 详细信息
来源: 评论
Minimal Synchrony for Byzantine Consensus  15
Minimal Synchrony for Byzantine Consensus
收藏 引用
34th annual acm symposium on principles of distributed computing (PODC)
作者: Bouzid, Zohir Mostfaoui, Achour Raynal, Michel Univ Rennes IRISA Rennes France Univ Nantes LINA F-44322 Nantes France Inst Univ France Paris France
Solving the consensus problem requires in one way or another that the underlying system satisfies some synchrony assumption. Considering an asynchronous message-passing system of n processes where (a) up to t bisourc... 详细信息
来源: 评论
computing Weak Consistency in Polynomial Time
Computing Weak Consistency in Polynomial Time
收藏 引用
34th annual acm symposium on principles of distributed computing (PODC)
作者: Golab, Wojciech Li, Xiaozhou (Steve) Lopez-Ortiz, Alejandro Nishimura, Naomi Univ Waterloo Dept Elect & Comp Engn Waterloo ON Canada Google Inc Mountain View CA USA Univ Waterloo Sch Comp Sci Waterloo ON Canada
The k-atomicity property can be used to describe the consistency of data operations in large distributed storage systems. The weak consistency guarantees offered by such systems are seen as a necessary compromise in v... 详细信息
来源: 评论
Construction and Impromptu Repair of an MST in a distributed Network with o(m) Communication  15
Construction and Impromptu Repair of an MST in a Distributed...
收藏 引用
34th annual acm symposium on principles of distributed computing (PODC)
作者: King, Valerie Kutten, Shay Thorup, Mikkel Univ Victoria Comp Sci Victoria BC Canada Technion Fac IE & M IL-32000 Haifa Israel Univ Copenhagen Copenhagen Denmark
In the CONGEST model, a communications network is an undirected graph whose n nodes are processors and whose m edges are the communications links between processors. At any given time step, a message of size O(log n) ... 详细信息
来源: 评论
Deterministic (Δ+1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic and Faulty Networks  15
Deterministic (Δ+1)-Coloring in Sublinear (in Δ) Time in S...
收藏 引用
34th annual acm symposium on principles of distributed computing (PODC)
作者: Barenboim, Leonid Open Univ Israel Dept Math & Comp Sci Raanana Israel
In the distributed message passing model a communication network is represented by an n-vertex graph G = (V, E) of maximum degree Delta. Computation proceeds in discrete synchronous rounds consisting of sending and re... 详细信息
来源: 评论
Terminating distributed Construction of Shapes and Patterns in a Fair Solution of Automata  15
Terminating Distributed Construction of Shapes and Patterns ...
收藏 引用
34th annual acm symposium on principles of distributed computing (PODC)
作者: Michail, Othon Comp Technol Inst & Press Diophantus CTI Patras Greece
In this work, we consider a solution of automata similar to Population Protocols and Network Constructors. The automata, also called nodes, move passively in a well-mixed solution and can cooperate by interacting in p... 详细信息
来源: 评论
Brief Announcement: A Hierarchy of Congested Clique Models, from Broadcast to Unicast  15
Brief Announcement: A Hierarchy of Congested Clique Models, ...
收藏 引用
34th annual acm symposium on principles of distributed computing (PODC)
作者: Becker, Florent Fernandez Anta, Antonio Rapaport, Ivan Reemila, Eric Univ Orleans Orleans France IMDEA Networks Inst Madrid Spain Univ Chile DIM CMM UMI CNRS 2807 Santiago Chile Univ Lyon GATE LSE UMR CNRS 5824 St Etienne France
The CONGEST model is a synchronous, message-passing model of distributed computation in which each node can send (possibly different) messages of O(log n) bits along each of its incident communication links in each ro... 详细信息
来源: 评论
Stabilizing Server-Based Storage in Byzantine Asynchronous Message-Passing Systems [Extended Abstract]  15
Stabilizing Server-Based Storage in Byzantine Asynchronous M...
收藏 引用
34th annual acm symposium on principles of distributed computing (PODC)
作者: Bonomi, Silvia Dolev, Shlomi Potop-Butucaru, Maria Raynal, Michel Univ Roma La Sapienza DIAG Rome Italy Ben Gurion Univ Negev Dept Comp Sci Beer Sheva Israel Univ P&M Curie LIP6 Paris France Univ Rennes IRISA Inst Univ France Rennes France
A stabilizing Byzantine single-writer single-reader (SWSR) regular register, which stabilizes after the first invoked write operation, is first presented. Then, new/old ordering inversions are eliminated by the use of... 详细信息
来源: 评论
distributed (Δ+1)-COLORING IN LINEAR (IN Δ) TIME
收藏 引用
SIAM JOURNAL ON computing 2014年 第1期43卷 72-95页
作者: Barenboim, Leonid Elkin, Michael Kuhn, Fabian Ben Gurion Univ Negev Dept Comp Sci IL-84105 Beer Sheva Israel Univ Freiburg Dept Comp Sci D-79110 Freiburg Germany
The distributed (Delta + 1)-coloring problem is one of the most fundamental and well-studied problems in distributed algorithms. Starting with the work of Cole and Vishkin in 1986, a long line of gradually improving a... 详细信息
来源: 评论
PODC 2014 - proceedings of the 2014 acm symposium on principles of distributed computing
PODC 2014 - Proceedings of the 2014 ACM Symposium on Princip...
收藏 引用
2014 acm symposium on principles of distributed computing, PODC 2014
The proceedings contain 51 papers. The topics discussed include: asynchronous MPC with a strict honest majority using non-equivocation;distributing the setup in universally composable multi-party computation;the futur...
来源: 评论