15 search results - page 1 / 3 » Time and Space Complexity of Reversible Pebbling |
SOFSEM
2001
Springer
13 years 8 months ago
2001
Springer
ICALP
1994
Springer
13 years 8 months ago
1994
Springer
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
ASPDAC
2009
ACM
13 years 11 months ago
2009
ACM
—Reversible logic studies have promising potential on energy lossless circuit design, quantum computation, nanotechnology, etc. Reversible logic features a one-to-one input outpu...
CCCG
2010
13 years 5 months ago
2010
In this paper we consider a natural extension of the socalled reverse facility location problem which was introduced by Cabello et al. [3]. Given a set of n users and a set of m f...
TVLSI
2010
12 years 11 months ago
2010
Hardware debuggers and logic analyzers must be able to record a continuous trace of data. Since the trace data are tremendous, to save space, these traces are often compressed. The...