Sciweavers

167 search results - page 14 / 34
» A New Lower Bound for A(17, 6, 6)
Sort
View
SPAA
1993
ACM
14 years 1 days ago
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
Thomas H. Cormen, Leonard F. Wisniewski
TAMC
2009
Springer
14 years 2 months ago
Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments
We consider the feedback vertex set and feedback arc set problems in bipartite tournaments. We improve on recent results by giving a 2-approximation algorithm for the feedback vert...
Anke van Zuylen
ISPD
2006
ACM
71views Hardware» more  ISPD 2006»
14 years 1 months ago
Satisfying whitespace requirements in top-down placement
In this invited note we outline several algorithms and features appearing in Capo 10, free open-source software for congestion-driven standard cell placement, mixed-size placement...
Jarrod A. Roy, David A. Papa, Aaron N. Ng, Igor L....
IJOCI
2010
163views more  IJOCI 2010»
13 years 5 months ago
An Experimental Performance Comparison for Indexing Mobile Objects on the Plane
We present a time-efficient approach to index objects moving on the plane to efficiently answer range queries about their future positions. Each object is moving with non small ve...
Spyros Sioutas, George Papaloukopoulos, Kostas Tsi...
EUROCRYPT
2001
Springer
14 years 13 days ago
On Perfect and Adaptive Security in Exposure-Resilient Cryptography
Abstract. We consider the question of adaptive security for two related cryptographic primitives: all-or-nothing transforms and exposureresilient functions. Both are concerned with...
Yevgeniy Dodis, Amit Sahai, Adam Smith