Sciweavers

29908 search results - page 606 / 5982
» On the Complexity of
Sort
View
164
Voted
SPDP
1990
IEEE
15 years 11 months ago
Energy complexity of optical computations
This paper provides lower bounds on the energy consumption and demonstrates an energy-time trade-off in optical computations. All the lower bounds are shown to have the matching u...
Akhilesh Tyagi, John H. Reif
VLDB
1990
ACM
64views Database» more  VLDB 1990»
15 years 11 months ago
Support for Temporal Data by Complex Objects
Wolfgang Käfer, Norbert Ritter, Harald Sch&ou...
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
15 years 11 months ago
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Ofer Biran, Shlomo Moran, Shmuel Zaks