Sciweavers

1068 search results - page 57 / 214
» On Space Bounded Server Algorithms
Sort
View
SPAA
2006
ACM
14 years 1 months ago
On space-stretch trade-offs: upper bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
ICSE
2010
IEEE-ACM
13 years 9 months ago
SMT-based bounded model checking for multi-threaded software in embedded systems
The transition from single-core to multi-core processors has made multi-threaded software an important subject over the last years in computer-aided verification. Model checkers ...
Lucas Cordeiro
APPROX
2011
Springer
234views Algorithms» more  APPROX 2011»
12 years 7 months ago
Streaming Algorithms with One-Sided Estimation
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
Joshua Brody, David P. Woodruff
ICCAD
1995
IEEE
90views Hardware» more  ICCAD 1995»
13 years 11 months ago
An optimal algorithm for area minimization of slicing floorplans
The traditional algorithm of Stockmeyer for area minimization of slicing oorplans has time (and space) complexity O(n2 ) in the worst case, or O(nlogn) for balanced slicing. For ...
Weiping Shi
STOC
2003
ACM
102views Algorithms» more  STOC 2003»
14 years 8 months ago
On metric ramsey-type phenomena
The main question studied in this article may be viewed as a nonlinear analogue of Dvoretzky's theorem in Banach space theory or as part of Ramsey theory in combinatorics. Gi...
Yair Bartal, Nathan Linial, Manor Mendel, Assaf Na...