Join Our Newsletter

MST

2006

8 years 10 months ago
2006

We investigate the characterizations of effective randomness in terms of Martin-L

MST

2006

8 years 10 months ago
2006

The sequence selected from a sequence R(0)R(1) . . . by a language L is the subsequence of R that contains exactly the bits R(n + 1) such that the prefix R(0) . . . R(n) is in L. B...

MST

2006

8 years 10 months ago
2006

We consider packet networks and make use of the adversarial queuing theory" model 10 . We are interested in the question of guaranteeing that all packets are actually deliver...

MST

2006

8 years 10 months ago
2006

We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of...

MST

2006

8 years 10 months ago
2006

Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...

MST

2006

8 years 10 months ago
2006

Abstract. Many researchers have had fun searching for and rendering symmetric Venn diagrams, culminating in the recent result of Griggs, Killian, and Savage ("Venn Diagrams an...

MST

2006

8 years 10 months ago
2006

We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...

MST

2006

8 years 10 months ago
2006

MST

2006

8 years 10 months ago
2006

A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...

MST

2006

8 years 10 months ago
2006

In late