Space–Time Trade-offs for Stack-Based Algorithms
نویسندگان
چکیده
منابع مشابه
Consistency Check Algorithms for Multi-Dimensional Preference Trade-Offs
Skyline Queries have recently received a lot of attention due to their intuitive query capabilities. Following the concept of Pareto optimality all ‘best’ database objects are returned to the user. However, this often results in unmanageable large result set sizes hampering the success of this innovative paradigm. As an effective remedy for this problem, trade-offs provide a natural concept for...
متن کاملStack-based sorting algorithms
The emergence of stacks as a hardware device in stack machines implies the recognition of the importance of using stacks in different computer applications and the need to make use of them in others. This paper uses stacks to solve the sorting problem. Two stack-based sorting algorithms are introduced. The first is based upon sorting by the insertion technique, whereas the second is based upon ...
متن کاملTrade-offs
23. Stent, G.S. (1972). Prematurity and uniqueness in scientific discovery. Sci. Am. 227, 84–93. 24. Mirsky, A.E., and Pollister, A.W. (1946). Chromosin, a desoyribose nucleoprotein complex of the cell nucleus. J. Gen. Physiol. 30, 117–148. 25. Boivin, A. (1947). Directed mutation in colon bacilli, by an inducing principle of desoxyribonucleic nature: Its meaning for the general biochemistry of...
متن کاملPrivacy trade-offs in web-based services
Recent developments in networking and storage technology have led to the dissemination of information over many different sources such as personal computers or corporate and public databases. As these information sources are often distributed and heterogeneous, effective tools for data collection and integration have been developed in parallel. These tools are employed e.g. in library search ca...
متن کاملTrade-Offs for Add Gossiping
In the gossiping problem, each node of a network starts with a unique piece of information and must acquire the information of all the other nodes. This is done using two-way communications between pairs of nodes. In this paper, we consider gossiping in n-node networks with n odd, where we use a linear cost model, in which the cost of communication is proportional to the amount of information t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2014
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-014-9893-5