[HTML][HTML] Cellular iron uptake, trafficking and metabolism: Key molecules and mechanisms and their roles in disease
Iron is a crucial transition metal for virtually all life. Two major destinations of iron within
mammalian cells are the cytosolic iron-storage protein, ferritin, and mitochondria. In mitochondria…
mammalian cells are the cytosolic iron-storage protein, ferritin, and mitochondria. In mitochondria…
Coordination chemistry of chelating resins and ion exchangers
… Sahni , Jan Reedijk … S. Rajgopal, JC Kuriacose …
[HTML][HTML] Spontaneous pneumomediastinum: time for consensus
S Sahni, S Verma, J Grullon, A Esquire… - … American Journal of …, 2013 - ncbi.nlm.nih.gov
… However, the presence of Hamman’s crunch, a crunching or bubbling sound over the
mediastinum synchronous with the heart beat (Hamman’s sign)[1,2,3] was only observed in 18%[4,…
mediastinum synchronous with the heart beat (Hamman’s sign)[1,2,3] was only observed in 18%[4,…
P-complete approximation problems
S Sahni, T Gonzalez - Journal of the ACM (JACM), 1976 - dl.acm.org
… (vii) Multicommodity network flows: We are given a transportation network [191 with source
s~ and sink s2. The arcs of the network are labeled corresponding to the commodities that …
s~ and sink s2. The arcs of the network are labeled corresponding to the commodities that …
[PDF][PDF] Fundamentals of data structures
E Horowitz, S Sahni - 1982 - ir.juit.ac.in
… For a name beginning with, say, S, we would avoid having to look at names beginning with
other letters. So because of this new structure, a very different algorithm is possible. Other …
other letters. So because of this new structure, a very different algorithm is possible. Other …
Algorithms for scheduling independent tasks
SK Sahni - Journal of the ACM (JACM), 1976 - dl.acm.org
… is a schedule, then the profit associated with the schedule S' = S1S~, where $1 consists of
all the jobs in S whose processing is completed by their deadlines and $2 the remaining jobs, …
all the jobs in S whose processing is completed by their deadlines and $2 the remaining jobs, …
Open shop scheduling to minimize finish time
T Gonzalez, S Sahni - Journal of the ACM (JACM), 1976 - dl.acm.org
… Job 1, ts processed continuously on processor j from s~, to .fir The tuples m the schedule …
the individual processor schedule has at most one tuple (i, s,,f) for each job i to be scheduled…
the individual processor schedule has at most one tuple (i, s,,f) for each job i to be scheduled…
Computationally related problems
S Sahni - SIAM Journal on computing, 1974 - SIAM
We look at several problems from areas such as network flows, game theory, artificial
intelligence, graph theory, integer programming and nonlinear programming and show that they …
intelligence, graph theory, integer programming and nonlinear programming and show that they …
Computing partitions with applications to the knapsack problem
E Horowitz, S Sahni - Journal of the ACM (JACM), 1974 - dl.acm.org
… S is a collection of elements 1 si denoted by S = {s~}. Definition 2. A set S is a multiset whose
elements satisfy si ~ s… Had we ordered the s~'s in decreasing order then we wo~dd not …
elements satisfy si ~ s… Had we ordered the s~'s in decreasing order then we wo~dd not …
[BOOK][B] Computer algorithms C++: C++ and pseudocode versions
E Horowitz, S Sahni, S Rajasekaran - 1997 - books.google.com
… The space requirement S(P) of any algorithm P may therefore be written as S(P) = c + Sp(instance
characteristics), where c is a constant. When analyzing the space complexity of a …
characteristics), where c is a constant. When analyzing the space complexity of a …