Sciweavers

42230 search results - page 386 / 8446
» Algorithms and Complexity Results for
Sort
View
IPL
2008
86views more  IPL 2008»
15 years 6 months ago
A more efficient algorithm for perfect sorting by reversals
We describe a new algorithm for the problem of perfect sorting a signed permutation by reversals. The worst-case time complexity of this algorithm is parameterized by the maximum p...
Sèverine Bérard, Cedric Chauve, Chri...
CORR
2010
Springer
115views Education» more  CORR 2010»
15 years 1 months ago
A strong direct product theorem for two-way public coin communication complexity
We show a direct product result for two-way public coin communication complexity of all relations in terms of a new complexity measure that we define. Our new measure is a general...
Rahul Jain
ALGORITHMICA
2008
121views more  ALGORITHMICA 2008»
15 years 7 months ago
Space Efficient Algorithms for Ordered Tree Comparison
In this paper we present techniques to significantly improve the space complexity of several ordered tree comparison algorithms without sacrificing the corresponding time complexit...
Lusheng Wang, Kaizhong Zhang
COCO
2006
Springer
65views Algorithms» more  COCO 2006»
15 years 10 months ago
An Isomorphism between Subexponential and Parameterized Complexity Theory
We establish a close connection between (sub)exponential time complexity and parameterized complexity by proving that the so-called miniaturization mapping is a reduction preservi...
Yijia Chen, Martin Grohe
SODA
2004
ACM
160views Algorithms» more  SODA 2004»
15 years 8 months ago
Complexities for generalized models of self-assembly
In this paper, we extend Rothemund and Winfree's examination of the tile complexity of tile self-assembly [6]. They provided a lower bound of ( log N log log N ) on the tile ...
Gagan Aggarwal, Michael H. Goldwasser, Ming-Yang K...