502 search results - page 11 / 101 » Verifying Balanced Trees |
114
Voted
MICRO
2010
IEEE
15 years 13 days ago
2010
IEEE
We propose an architectural design methodology for designing formally verifiable cache coherence protocols, called Fractal Coherence. Properly designed to be fractal in behavior, t...
114
Voted
ISSTA
2000
ACM
15 years 6 months ago
2000
ACM
ions for concise and precise specification of such control, but balance this with visualization support to help users also obtain intuitive insights. The underlying complexhese con...
116
Voted
MOBIDE
2010
ACM
15 years 2 months ago
2010
ACM
We propose a distributed algorithm to construct a balanced communication tree that serves in gathering data from the network nodes to a sink. Our algorithm constructs a near-optim...
171
click to vote
GCB
2007
Springer
15 years 8 months ago
2007
Springer
: There are several models for the evolutionary process forming a species tree. We examine the Birth-and-Death model (BDM), the Proportional-to-Distinguishable Arrangements (PDA) m...
165
click to vote
CPM
2004
Springer
15 years 8 months ago
2004
Springer
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...