- Baier, C., and Kwiatkowska, M. Model checking for a probabilistic branching time logic with fairness. Distributed Computing 11, 3 (Aug. 1998), 125--155. Google ScholarDigital Library
- Bicknell, C. The Net-savvy Navy. Wired News. Dec. 1, 1999.Google Scholar
- Boudette, N.E. Europe's SAP scrambles to stem big glitches. The Wall Street Journal, (Nov. 3, 1999), 25.Google Scholar
- Huberman, B.A. (Ed.) The Ecology of Computation. Elsevier Science Publishers B.V., Amsterdam, 1988. Google ScholarDigital Library
- Langefors, B. Theoretical Analysis of Information Systems. Auerbach, Sweden, 1973.Google Scholar
- Malone, T.W. and Crowston, K. The Interdisciplinary study of coordination. ACM Computing Surveys 26, 1 (Mar. 1994), 87--119. Google ScholarDigital Library
- Pressman, R. Software Engineering: A Practitioner's Approach (2E). McGraw-Hill, New York, 1987, 222--225. Google ScholarDigital Library
- Schneberger, Scott L. Distributed computing environments: effects on software maintenance difficulty. Journal of Systems and Software 37, 2, May 1997, 101--116. Google ScholarDigital Library
Index Terms
- The complexity cross: implications for practice
Recommendations
Kolmogorov Complexity for Possibly Infinite Computations
In this paper we study the Kolmogorov complexity for non-effective computations, that is, either halting or non-halting computations on Turing machines. This complexity function is defined as the length of the shortest input that produce a desired ...
Algorithmic Cross-Complexity and Relative Complexity
DCC '09: Proceedings of the 2009 Data Compression ConferenceInformation content and compression are tightly related concepts that can be addressed by classical and algorithmic information theory. Several entities in the latter have been defined relying upon notions of the former, such as entropy and mutual ...
Comments