检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

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 条记录，以下是181-190 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

distributed Maximum Flow in Planar Graphs 25

Distributed Maximum Flow in Planar Graphs

引用

proceedings of the acm symposium on principles of distributed computing

作者： Yaseen Abd-Elhaleem Michal Dory Merav Parter Oren Weimann University of Haifa Haifa Israel Weizmann Institute of Science Rehovot Israel

ISBN: (纸本)9798400718854

The dual of a planar graph G is a planar graph G* that has a vertex for each face of G and an edge for each pair of adjacent faces of G. The profound relationship between a planar graph and its dual has been the algorithmic basis for solving numerous (centralized) classical problems on planar graphs involving distances, flows, and cuts. In the distributed setting however, the only use of planar duality is for finding a recursive decomposition of G [DISC 2017, STOC 2019].In this paper, we initiate the study of distributed algorithms on dual planar graphs. Namely, we extend the distributed algorithmic toolkit (such as recursive decomposition and minor-aggregation) to work on the dual graph G*. These tools can then facilitate various algorithms on G by solving a suitable dual problem on G*.Given a directed planar graph G with positive and negative edge-lengths and hop-diameter D, our key result is an Õ(D2)-round algorithm1 for Single Source Shortest Paths on G*. This algorithm implies an Õ(D2)-round algorithm for Maximum st-Flow in G. Prior to our work, no Õ(poly(D))-round algorithms were known for this problem. When G is undirected, we further obtain a near optimal Õ(D)-round algorithm for computing the weighted girth of G, and a D · no(1)-rounds (1 - ϵ)-approximation algorithm for Maximum st-Flow in G when s and t lie on the same *** main challenges in our work are that G* is not the communication graph (e.g., a vertex of G is mapped to multiple vertices of G*), and that the diameter of G* can be much larger than D (i.e., possibly by a linear factor). We overcome these challenges by carefully defining and maintaining subgraphs of the dual graph G* while applying the recursive decomposition on the primal graph G The main technical difficulty, is that along the recursive decomposition, a face of G gets shattered into (disconnected) components yet we still need to treat it as a dual *** believe that the toolkit developed in this paper for exploiting planar dual

关键词： maximum flow

来源：评论

学校读者我要写书评

暂无评论

LineFS: Efficient SmartNIC Offload of a distributed File System with Pipeline Parallelism 21

LineFS: Efficient SmartNIC Offload of a Distributed File Sys...

引用

28th acm symposium on Operating Systems principles (SOSP)

作者： Kim, Jongyul Jang, Insu Reda, Waleed Im, Jaeseong Canini, Marco Kostic, Dejan Kwon, Youngjin Peter, Simon Witchel, Emmett Korea Adv Inst Sci & Technol Daejeon South Korea Univ Michigan Ann Arbor MI 48109 USA Univ Catholic Louvain KTH Royal Inst Technol Louvain Belgium KAUST Daejeon South Korea KTH Royal Inst Technol Daejeon South Korea Univ Texas Austin Austin TX 78712 USA Katana Graph Austin TX USA

ISBN: (纸本)9781450387095

In multi-tenant systems, the CPU overhead of distributed file systems (DFSes) is increasingly a burden to application performance. CPU and memory interference cause degraded and unstable application and storage performance, in particular for operation latency. Recent client-local DFSes for persistent memory (PM) accelerate this trend. DFS offload to SmartNICs is a promising solution to these problems, but it is challenging to fit the complex demands of a DFS onto simple SmartNIC processors located across PCIe. We present LineFS, a SmartNIC-offloaded, high-performance DFS with support for client-local PM. To fully leverage the SmartNIC architecture, we decompose DFS operations into execution stages that can be offloaded to a parallel datapath execution pipeline on the SmartNIC. LineFS offloads CPU-intensive DFS tasks, like replication, compression, data publication, index and consistency management to a SmartNIC. We implement LineFS on the Mellanox BlueField SmartNIC and compare it to Assise, a state-of-the-art PM DFS. LineFS improves latency in LevelDB up to 80% and through-put in Filebench up to 79%, while providing extended DFS availability during host system failures.

关键词： distributed file system SmartNIC offload

来源：评论

学校读者我要写书评

暂无评论

Time-Optimal Construction of Overlay Networks 21

Time-Optimal Construction of Overlay Networks

引用

40th acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

作者： Goette, Thorsten Hinnenthal, Kristian Scheideler, Christian Werthmann, Julian Paderborn Univ Paderborn Germany

ISBN: (纸本)9781450385480

We show how to construct an overlay network of constant degree and diameter O(log n) in time O(log n) starting from an arbitrary weakly connected graph. We assume a synchronous communication network in which nodes can send messages to nodes they know the identifier of and establish new connections by sending node identifiers. If the initial network's graph is weakly connected and has constant degree, then our algorithm constructs the desired topology with each node sending and receiving only O(log n) messages in each round in time O(log n), w.h.p., which beats the currently best O(log(3/2) n) time algorithm of [Gotte et al., SIROCCO'19]. Since the problem cannot be solved faster than by using pointer jumping for O(log n) rounds (which would even require each node to communicate Omega(n) bits), our algorithm is asymptotically optimal. We achieve this speedup by using short random walks to repeatedly establish random connections between the nodes that quickly reduce the conductance of the graph using an observation of [Kwok and Lau, APPROX' 14]. Additionally, we show how our algorithm can be used to efficiently solve graph problems in hybrid networks [Augustine et al., SODA'20]. Motivated by the idea that nodes possess two different modes of communication, we assume that communication of the initial edges is unrestricted. In contrast, only polylogarithmically many messages can be communicated over edges that have been established throughout an algorithm's execution. For an (undirected) graph G with arbitrary degree, we show how to compute connected components, a spanning tree, and biconnected components in time O (log n), w.h.p. Furthermore, we show how to compute an MIS in time O(log d + log log n), w.h.p., where d is the initial degree of G.

关键词： distributed Protocol Peer-to-Peer Network Randomized Algorithm Expander

来源：评论

学校读者我要写书评

暂无评论

Asynchronous Fault-Tolerant Language Decidability for Runtime Verification of distributed Systems 25

Asynchronous Fault-Tolerant Language Decidability for Runtim...

引用

proceedings of the acm symposium on principles of distributed computing

作者： Armando Castañeda Gilde Valeria Rodríguez Instituto de Matemáticas Universidad Nacional Autónoma de México (UNAM) Mexico City Mexico Universidad Nacional Autónoma de México (UNAM) Mexico City Mexico

ISBN: (纸本)9798400718854

Implementing correct distributed systems is an error-prone task. Runtime Verification (RV) offers a lightweight formal method to improve reliability by monitoring system executions against correctness properties. However, applying RV in distributed settings—where no process has global knowledge—poses fundamental challenges, particularly under full asynchrony and fault tolerance. This paper addresses the distributed Runtime Verification (DRV) problem under such conditions. In our model, each process in a distributed monitor receives a fragment of the input word describing system behavior and must decide whether this word belongs to the language representing the correctness property being verified. Hence, the goal is to decide languages in a distributed fault-tolerant manner. We propose several decidability definitions, study the relations among them, and prove possibility and impossibility results. One of our main results is a characterization of the correctness properties that can be decided asynchronously. Remarkably, it applies to any language decidability definition. Intuitively, the characterization is that only properties with no real-time order constraints can be decided in asynchronous fault-tolerant settings. These results expose the expressive limits of DRV in realistic systems, as several properties of practical interest rely on reasoning about real-time order of events in executions. To overcome these limitations, we introduce a weaker model where the system under inspection is verified indirectly. Under this weaker model we define predictive decidability, a decidability definition that turn some real-time sensitive correctness properties verifiable. Our framework unifies and extends existing DRV theory and sharpens the boundary of runtime monitorability under different assumptions.

关键词： concurrent algorithms

来源：评论

学校读者我要写书评

暂无评论

Sublinear-Time Sampling of Spanning Trees in the Congested Clique 25

Sublinear-Time Sampling of Spanning Trees in the Congested C...

引用

proceedings of the acm symposium on principles of distributed computing

作者： Sriram V. Pemmaraju Sourya Roy Joshua Z. Sobel University of Iowa Iowa City USA

ISBN: (纸本)9798400718854

We present the first sublinear-in-n round algorithm for sampling an approximately uniform spanning tree of an n-vertex graph in the CongestedClique model of distributed computing. In particular, our algorithm requires Õ (n0.657) rounds for sampling a spanning tree within total variation distance 1/nc, for arbitrary constant c > 0, from the uniform distribution. More precisely, our algorithm requires Õ (n1/2+α) rounds, where O (nα) is the running time of matrix multiplication in the CongestedClique model (currently α = 1-2/ω = 0.157, where ω is the sequential matrix multiplication time exponent). We can adapt our algorithm to give exact rather than approximate samples, but with a larger, though still o (n), runtime of Õ(n2/3+α) = O(n0.824).In a remarkable result, Aldous (SIDM 1990) and Broder (FOCS 1989) showed that the first visit edge to each vertex, excluding the start vertex, during a random walk forms a uniformly chosen spanning tree of the underlying graph. The biggest challenge with implementing the Aldous-Broder algorithm in a distributed setting is that it requires a very long random walk, i.e., a walk that covers the graph and might have to be Θ(mn) steps long for an n-vertex, m-edge graph, in the worst case. The most common technique for constructing random walks in "all-to-all" communication models such as CongestedClique and MPC are bottom-up techniques which start with many short walks and repeatedly stitch these together to build longer walks. These techniques fail to efficiently build the long random walk required by the Aldous-Broder algorithm. Our algorithm is a significant departure from known techniques, featuring a top-down walk filling approach paired with Schur complement graphs for walk shortcutting. To make this idea work in the CongestedClique model, we present a novel compressed random walk reconstruction algorithm, based on randomly sampling a weighted perfect *** addition, we show how to take somewhat shorter random walks even mor

关键词： distributed sampling

来源：评论

学校读者我要写书评

暂无评论

Search via Parallel Levy Walks on Z² 21

Search via Parallel Levy Walks on Z2

引用

40th acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

作者： Clementi, Andrea D'Amore, Francesco Giakkoupis, George Natale, Emanuele Univ Roma Tor Vergata Rome Italy Univ Cote dAzur INRIA CNRS I3S Sophia Antipolis France Univ Rennes CNRS INRIA IRISA Rennes France

ISBN: (纸本)9781450385480

Motivated by the Levy foraging hypothesis - the premise that various animal species have adapted to follow Levy walks to optimize their search efficiency - we study the parallel hitting time of Levy walks on the infinite two-dimensional grid. We consider k independent discrete-time Levy walks, with the same exponent alpha is an element of(1, infinity), that start from the same node, and analyze the number of steps until the first walk visits a given target at distance l. We show that for any choice of k and l from a large range, there is a unique optimal exponent alpha(k,l) is an element of(2, 3), for which the hitting time is (O) over tilde (l(2)/k) w.h.p., while modifying the exponent by any constant term epsilon > 0 increases the hitting time by a factor polynomial in l, or the walks fail to hit the target almost surely. Based on that, we propose a surprisingly simple and effective parallel search strategy, for the setting where k and l are unknown: The exponent of each Levy walk is just chosen independently and uniformly at random from the interval (2, 3). This strategy achieves optimal search time (modulo polylogarithmic factors) among all possible algorithms (even centralized ones that know k). Our results should be contrasted with a line of previous work showing that the exponent alpha = 2 is optimal for various search problems. In our setting of k parallel walks, we show that the optimal exponent depends on k and l, and that randomizing the choice of the exponents works simultaneously for all k and l.

关键词： Levy walk parallel Levy walks infinite 2D grid hitting time distributed search Levy foraging hypothesis ANTS problem biological distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Can We Break Symmetry with o(m) Communication? 21

Can We Break Symmetry with o(m) Communication?

引用

40th acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

作者： Pai, Shreyas Pandurangan, Gopal Pemmaraju, Sriram, V Robinson, Peter Univ Iowa Iowa City IA 52242 USA Univ Houston Houston TX USA City Univ Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781450385480

We study the communication cost (or message complexity) of fundamental distributed symmetry breaking problems, namely, coloring and MIS. While significant progress has been made in understanding and improving the running time of such problems, much less is known about the message complexity of these problems. In fact, all known algorithms need at least Omega(m) communication for these problems, where m is the number of edges in the graph. We address the following question in this paper: can we solve problems such as coloring and MIS using sublinear, i.e., o(m) communication, and if so under what conditions? In a classical result, Awerbuch, Goldreich, Peleg, and Vainish [Jacm 1990] showed that fundamental global problems such as broadcast and spanning tree construction require at least Omega(m) messages in the KT-1 CONGEST model (i.e., CONGEST model in which nodes have initial knowledge of the neighbors' ID's) when algorithms are restricted to be comparison-based (i.e., algorithms in which node ID's can only be compared). Thirty five years after this result, King, Kutten, and Thorup [PODC 2015] showed that one can solve the above problems using (O) over tilde (n) messages (n is the number of nodes in the graph) in (O) over tilde (n) rounds in the KT-1 CONGEST model if non-comparison-based algorithms are permitted. An important implication of this result is that one can use the synchronous nature of the KT-1 CONGEST model, using silence to convey information, and solve any graph problem using non-comparison-based algorithms with (O) over tilde (n) messages, but this takes an exponential number of rounds. In the asynchronous model, even this is not possible. In contrast, much less is known about the message complexity of local symmetry breaking problems such as coloring and MIS. Our paper fills this gap by presenting the following results. Lower bounds: In the KT-1 CONGEST model, we show that any comparison-based algorithm, even a randomized Monte-Carlo algorithm with

关键词： distributed Graph Algorithms Congest Model Message Complexity Symmetry Breaking MIS Coloring

来源：评论

学校读者我要写书评

暂无评论

A tight meta-theorem for LOCAL certification of MSO2 properties within bounded treewidth graphs 25

A tight meta-theorem for LOCAL certification of MSO2 propert...

引用

proceedings of the acm symposium on principles of distributed computing

作者： Linda Cook Eun Jung Kim Tomáš Masařík Korteweg-de Vries Institute of Mathematics University of Amsterdam Amsterdam Netherlands School of Computing KAIST and Discrete Mathematics Group Institute for Basic Science (IBS) Daejeon Republic of Korea CNRS Paris France Institute of Informatics Faculty of Mathematics Informatics and Mechanics University of Warsaw Warsaw Poland

ISBN: (纸本)9798400718854

distributed networks are prone to errors so verifying their output is critical. We develop local certification protocols for graph properties in which nodes are given certificates that allow them to check whether the network as a whole satisfies some fixed property while only communicating with their local network. Instead of considering a specific problem and developing a local certification protocol tailor-made for the problem, we aim for generic protocols that can certify any property expressible in a certain logical *** consider Monadic Second Order Logic (MSO2), a powerful framework that can express properties such as non-k-colorability, Hamiltonicity, and H-minor-freeness. Unfortunately, in general, there are MSO2-expressible properties that cannot be certified without huge certificates. For instance, non-3-colorability requires certificates of size Ω(n2/log n) on general n-vertex graphs (Göös, Suomela 2016). Hence, we impose additional structural restrictions on the graph. Inspired by their importance in centralized computing and Robertson-Seymour Graph Minor theory, we consider graphs of bounded *** provide a local certification protocol for certifying any MSO2-expressible property on graphs of bounded treewidth and, consequently, a local certification protocol for certifying bounded treewidth. That is, for each integer k and each MSO2-expressible property Π, we give a local certification protocol to certify that a graph satisfies Π and has treewidth at most k using certificates of size O(log n) (which is asymptotically optimal). Our local certification protocol requires only one-round of distributed communication, hence it is a proof-labeling *** result improves upon the works of Fraigniaud, Montealegre, Rapaport, and Todinca (Algorithmica 2024), Bousquet, Feuilloley, Pierron (PODC 2022), and the very recent work of Baterisna and Chang.

关键词： LOCAL certification

来源：评论

学校读者我要写书评

暂无评论

Diversity, Fairness, and Sustainability in Population Protocols 21

Diversity, Fairness, and Sustainability in Population Protoc...

引用

40th acm SIGACT-SIGOPS symposium on principles of distributed computing (PODC)

作者： Kang, Nan Mallmann-Trenn, Frederik Rivera, Nicolas Kings Coll London London England IMDF Santiago Chile Univ Valparaiso Santiago Chile

ISBN: (纸本)9781450385480

Over the years, population protocols with the goal of reaching consensus have been studied in great depth. However, many systems in the real-world do not result in all agents eventually reaching consensus, but rather in the opposite: they converge to a state of rich diversity. Consider for example task allocation in ants. If eventually all ants perform the same task, then the colony will perish (lack of food, no brood care, etc.). Then, it is vital for the survival of the colony to have a diverse set of tasks and enough ants working on each task. What complicates matters is that ants need to switch tasks periodically to adjust the needs of the colony;e.g., when too many foragers fell victim to other ant colonies. A further difficulty is that not all tasks are equally important and maybe they need to keep certain proportions in the distribution of the task. How can ants keep a healthy and balanced allocation of tasks? To answer this question, we propose a simple population protocol for n agents on a complete graph and an arbitrary initial distribution of k colours (tasks). In this protocol we assume that each colour i has an associated weight (importance or value) w(i) >= 1. By denoting w as the sum of the weights of different colours, we show that the protocol converges in O(w(2)n logn) rounds to a configuration where the number of agents supporting each colour i is concentrated on the fair share w(i)n/w and will stay concentrated for a large number of rounds, w.h.p. Our protocol has many interesting properties: agents do not need to know other colours and weights in the system, and our protocol requires very little memory per agent. Furthermore, the protocol guarantees fairness meaning that over a long period each agent has each colour roughly a number of times proportional to the weight of the colour. Finally, our protocol also fulfils sustainability meaning that no colour ever vanishes. All of these properties still hold when an adversary adds agents or colours.

关键词： distributed Systems Population Protocols Self-organisation Randomised Algorithm

来源：评论

学校读者我要写书评

暂无评论

3-Majority and 2-Choices with Many Opinions 25

3-Majority and 2-Choices with Many Opinions

引用

proceedings of the acm symposium on principles of distributed computing

作者： Nobutaka Shimizu Takeharu Shiraga Institute of Science Tokyo Tokyo Japan Chuo University Tokyo Japan

ISBN: (纸本)9798400718854

We present the first nearly-optimal bounds on the consensus time for the well-known synchronous consensus dynamics, specifically 3-Majority and 2-Choices, for an arbitrary number of opinions. In synchronous consensus dynamics, we consider an n-vertex complete graph with self-loops, where each vertex holds an opinion from {1,..., k}. At each discrete-time round, all vertices update their opinions simultaneously according to a given protocol. The goal is to reach a consensus, where all vertices support the same opinion. In 3-Majority, each vertex chooses three random neighbors with replacement and updates its opinion to match the majority, with ties broken randomly. In 2-Choices, each vertex chooses two random neighbors with replacement. If the selected vertices hold the same opinion, the vertex adopts that opinion. Otherwise, it retains its current opinion for that *** upon a line of work [Becchetti et al., SPAA'14], [Becchetti et al., SODA'16], [Berenbrink et al., PODC'17], [Ghaffari and Lengler, PODC'18], we prove that, for every 2 ≤ k ≤ n, 3-Majority (resp. 2-Choices) reaches consensus within [EQUATION] (resp. [EQUATION] rounds with high probability. Prior to this work, the best known upper bound on the consensus time of 3-Majority was Õ(k) if k ≪ n1/3 and Õ(n2/3) otherwise, and for 2-Choices, the consensus time was known to be Õ(k) for [EQUATION].

关键词： distributed voting

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共136页 << < 15 16 17 18 19 20 21 22 23 24 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：