Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

62

Voted

SOFSEM
2001
Springer

favoriteEmaildiscussreport

78views Theoretical Computer Science» more SOFSEM 2001»

Time and Space Complexity of Reversible Pebbling

15 years 1 months ago

Time and Space Complexity of Reversible Pebbling

Download kedrigern.dcs.fmph.uniba.sk

Richard Královic

Real-time Traffic

SOFSEM 2001 | Theoretical Computer Science |

claim paper

Related Content

» On the Cost of Recomputing Tight Bounds on Pebbling with Faults

» A novel Toffoli network synthesis algorithm for reversible logic

» New variations of the reverse facility location problem

» A ReverseEncodingBased OnChip Bus Tracer for Efficient CircularBuffer Utilization

» Consistent Layout for Thematic Software Maps

» Compaction of passfailbased diagnostic test vectors for combinational and sequential circu...

» An Empirical Evaluation of Possible Variations of Lazy Propagation

» Enumeration of Polyominoes for p4 Tiling

» Fast Monte Carlo Simulation Methods for Biological ReactionDiffusion Systems in Solution a...

Post Info
More Details (n/a)

Added	30 Jul 2010
Updated	30 Jul 2010
Type	Conference
Year	2001
Where	SOFSEM
Authors	Richard Královic

Comments (0)