Time-Space trade-offs for some algebraic problems

1983 ◽  
Vol 30 (3) ◽  
pp. 657-667 ◽  
Author(s):  
Joseph Ja'Ja'
Keyword(s):  
Time Space ◽  
Trade Offs

scholarly journals Time-Space Trade-offs in Population Protocols

2017 ◽  
Author(s):  
Dan Alistarh ◽  
James Aspnes ◽  
David Eisenstat ◽  
Rati Gelashvili ◽  
Ronald L. Rivest
Keyword(s):  
Population Protocols ◽  
Time Space ◽  
Trade Offs

scholarly journals Optimal Time-Space Trade-Offs for Sorting

1998 ◽  
Vol 5 (10) ◽  
Author(s):  
Jakob Pagter ◽  
Theis Rauhe
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Fundamental Problem ◽  
Full Range ◽  
Optimal Time ◽  
Sorting Algorithm ◽  
Logarithmic Factor ◽  
Time Space ◽  
Trade Offs ◽  
Space Product

We study the fundamental problem of sorting in a sequential model of computation and in particular consider the time-space trade-off (product of time and space) for this problem.<br />Beame has shown a lower bound of  Omega(n^2) for this product leaving a gap of a logarithmic factor up to the previously best known upper bound of O(n^2 log n) due to Frederickson. Since then, no progress has been made towards tightening this gap.<br />The main contribution of this paper is a comparison based sorting algorithm which closes this gap by meeting the lower bound of Beame. The time-space product O(n^2) upper bound holds for the full range of space bounds between log n and n/log n. Hence in this range our algorithm is optimal for comparison based models as well as for the very powerful general models considered by Beame.

Time-space trade-offs in a pebble game

1978 ◽  
Vol 10 (2) ◽  
pp. 111-115 ◽  
Author(s):  
W. J. Paul ◽  
R. E. Tarjan
Keyword(s):  
Time Space ◽  
Trade Offs ◽  
Pebble Game

Time/Space Trade-Offs for Reversible Computation

1989 ◽  
Vol 18 (4) ◽  
pp. 766-776 ◽  
Author(s):  
Charles H. Bennett
Keyword(s):  
Reversible Computation ◽  
Time Space ◽  
Trade Offs

COMPRESSED PATTERN MATCHING IN JPEG IMAGES

2006 ◽  
Vol 17 (06) ◽  
pp. 1297-1306 ◽  
Author(s):  
SHMUEL T. KLEIN ◽  
DANA SHAPIRA
Keyword(s):  
Pattern Matching ◽  
Auxiliary Data ◽  
Jpeg Images ◽  
Time Space ◽  
Trade Offs

The possibility of applying compressed matching in JPEG encoded images is investigated and the problems raised by the scheme are discussed. A part of the problems can be solved by the use of some auxiliary data which yields various time/space trade-offs. Finally, approaches to deal with extensions such as allowing scaling or rotations are suggested.

Sign in / Sign up

Export Citation Format

Share Document