Linda B. Benbow · Lexington Books · 2010
Linda Benbow examines the organizational culture and various levels of diversity found in an urban United States Postal Service mail processing facility. She shows how employee perceptions of social differences and their interactions with coworkers contributes to their identity and work life within the organization. Painting detailed portraits of race, social class, and gender in a mail processing facility, Benbow looks at ways employees from different backgrounds relate to one another, identifying the issues and occasions that provoke conflict, the ways that participants view one another, and the forces and strategies that mitigate and conciliate conflicts.
Cited by 2
Stella M. Hurtley · Science · 2015
Protein Targeting
The sorting of proteins into appropriate compartments is vital for proper cell function. After its discovery 20 years ago, various potential roles for nascent chain-associated complex (NAC) in the specificity of intracellular protein sorting have been proposed. Until now, no clear phenotypes have been discovered. Gamerdinger et al. explored the role of NAC in protein translocation in Caenorhabditis elegans (see the Perspective by Kramer et al. ). They found that NAC prevents the importation of incorrect cargo, such as mitochondrial proteins, into the endoplasmic reticulum.
Science , this issue p. [201][1]; see also p. [182][2]
[1]: /lookup/doi/10.1126/science.aaa5335
[2]: /lookup/doi/10.1126/science.aab1335
Cited by 0
Blom, P., Huizing, P.C., Monlevad, J.P.R.C. de et al. · Radboud Repository (Radboud University) · 2025
Item does not contain fulltext
Cited by 0
Tsuyoshi Hirashima · Zenodo (CERN European Organization for Nuclear Research) · 2024
No description provided.
Cited by 0Open access
Sreenivasan Ponnambalam, George Banting · Current Biology · 1996
Cited by 13Open access
Encyclopedic Dictionary of Genetics, Genomics and Proteomics · 2004
Cited by 0
Paul Vincent Craven · Apress eBooks · 2015
Binary searches only work on lists that are in order. So how do programs get a list in order? How does a program sort a list of items when the user clicks a column heading or otherwise needs something sorted?
Cited by 0
2016
Cited by 0
William A. Martin · 2008
The bibliography appearing at the end of this article lists 37 sorting algorithms and 100 books and papers on sorting published in the last 20 years. The basic ideas presented here have been abstracted from this body of work, and the best algorithms known are given as examples. As the algorithms are explained,
Cited by 0
2012
Cited by 0
Qun Jin · Series on software engineering and knowledge engineering · 2003
Cited by 0
Giulio Zambon · Apress eBooks · 2016
In the previous chapter, you read about ordered arrays and binary trees. In particular, you have learned how to work with ordered arrays of pointers to insert, delete, and find individual items.
Cited by 0
2019
This chapter describes several different sorting algorithms. Some, such as insertionsort, selectionsort, and bubblesort, are relatively simple but slow. Others, such as heapsort, quicksort, and mergesort, are more complicated but much faster. Still others, such as countingsort and pigeonhole sort, do not use comparisons to sort items, so they can break the O(N log N) barrier and perform amazingly fast under the right circumstances. The chapter categorizes the algorithms by their run-time performance. O(N2) algorithms are relatively slow but fairly simple. In fact, their simplicity sometimes lets them outperform faster but more complicated algorithms for very small arrays. O(N log N) algorithms are much faster than O(N2) algorithms, at least for larger arrays. The chapter explains several ways to sort data. Simply having data sorted often makes it more useful to a user.
Cited by 0
Tobias Nipkow, Christian Sternagel · ACM eBooks · 2025
Cited by 0
Tannishk Sharma · 2015
Almost all computers regularly sort data. Many different sorting algorithms have been proposed. It is known that no sort algorithm based on key comparisons can sort N keys in less than O (N log N) operations and that many perform O(N2) operations in the worst case. This paper is aimed at proposing a new sortie tree data structure, which can be used for the sorting of data. This algorithm that implements a sortie tree data structure is a non-comparative sorting algorithm.
Cited by 0
Bulletin of Miscellaneous Information (Royal Gardens Kew)
Cited by 0
2007
Cited by 0
G TREFRY · Elsevier eBooks · 2010
Cited by 0
Rudge, Alice · The British Museum · 2024
Yaʔ Dunəy sorts through, counts, and bunches the strips of pandanus so as to put them away neatly until tomorrow when it is hoped it will be dry and hot enough to dry them
Cited by 0Open access
Schouten, John · Alexandria (UniSG) (University of St.Gallen) · 1991
Cited by 0