10493 search results - page 307 / 2099 » Dynamic Word Problems |
133
click to vote
TACS
2001
Springer
15 years 11 months ago
2001
Springer
Decidability of non-structural subtype entailment is a long standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize...
155
click to vote
ISCAS
1994
IEEE
15 years 10 months ago
1994
IEEE
In layout design nding e ciently good solutions to the hypergraph bipartitioning problem is of great importance. This paper introduces a new algorithm, the dynamic locking algorit...
164
click to vote
SWAT
1994
Springer
15 years 10 months ago
1994
Springer
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We...
187
click to vote
CSL
2006
Springer
15 years 6 months ago
2006
Springer
Model-checking problems for PDL (propositional dynamic logic) and its extension PDL (which includes the intersection operator on programs) over various classes of infinite state sy...
174
click to vote
SIGMETRICS
2005
ACM
16 years 5 days ago
2005
ACM
- Since many Web applications employ a multi-tier architecture, in this paper, we focus on the problem of analytically modeling the behavior of such applications. We present a mode...