2924 search results - page 79 / 585 » Lower Bounds in Distributed Computing |
105
click to vote
CIE
2006
Springer
15 years 4 months ago
2006
Springer
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...
114
Voted
ICDCS
2009
IEEE
15 years 9 months ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
115
click to vote
CONCUR
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. A well-known decision procedure for Presburger arithmetic uses deterministic finite-state automata. While the complexity of the decision procedure for Presburger arithme...
100
Voted
PODC
2005
ACM
15 years 6 months ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
123
Voted
ICPR
2010
IEEE
15 years 7 months ago
2010
IEEE
We consider the problem of classification in nonadaptive dimensionality reduction. Specifically, we bound the increase in classification error of Fisher’s Linear Discriminant...