Sciweavers

Share
MST
2006
92views more  MST 2006»
8 years 10 months ago
Some Results on Effective Randomness
We investigate the characterizations of effective randomness in terms of Martin-L
Wolfgang Merkle, Nenad Mihailovic, Theodore A. Sla...
MST
2006
105views more  MST 2006»
8 years 10 months ago
Selection Functions that Do Not Preserve Normality
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...
Wolfgang Merkle, Jan Reimann
MST
2006
100views more  MST 2006»
8 years 10 months ago
On Delivery Times in Packet Networks under Adversarial Traffic
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...
Adi Rosén, Michael S. Tsirkin
MST
2006
99views more  MST 2006»
8 years 10 months ago
Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem
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...
Tobias Riege, Jörg Rothe
MST
2006
136views more  MST 2006»
8 years 10 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
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...
David R. Karger, Matthias Ruhl
MST
2006
106views more  MST 2006»
8 years 10 months ago
More Fun with Symmetric Venn Diagrams
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...
Frank Ruskey, Mark Weston
MST
2006
129views more  MST 2006»
8 years 10 months ago
Reachability Problems on Regular Ground Tree Rewriting Graphs
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...
Christof Löding
MST
2006
53views more  MST 2006»
8 years 10 months ago
Why Computational Complexity Requires Stricter Martingales
John M. Hitchcock, Jack H. Lutz
MST
2006
149views more  MST 2006»
8 years 10 months ago
Parameterized Intractability of Distinguishing Substring Selection
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...
Jens Gramm, Jiong Guo, Rolf Niedermeier
MST
2006
90views more  MST 2006»
8 years 10 months ago
The Graham-Knowlton Problem Revisited
In late
Navin Goyal, Sachin Lodha, S. Muthukrishnan
books