2612 search results - page 154 / 523 » Switching Graphs and Their Complexity |
85
Voted
ESOP
2001
Springer
15 years 5 months ago
2001
Springer
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
126
Voted
CORR
2010
Springer
14 years 7 months ago
2010
Springer
: In this paper, inspired by the work of Megiddo on the formation of preferences and strategic analysis, we consider an early market model studied in the field of economic theory, ...
146
click to vote
SODA
2012
ACM
13 years 3 months ago
2012
ACM
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
105
Voted
TMC
2008
15 years 21 days ago
2008
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
92
Voted
APPROX
2009
Springer
15 years 7 months ago
2009
Springer
In this paper we consider two basic questions regarding the query complexity of testing graph properties in the adjacency matrix model. The first question refers to the relation ...